An event access assurance case for mathematics

An event access assurance case for mathematics

Definitions and mathematical statement

Shared notation.

Standard number systems are $\mathbb N,\mathbb Z,\mathbb Q,\mathbb R,\mathbb C$. Specialized notation and index ranges follow the cited source and the definitions below.

An accessible event allows intended participants to use its venues, materials, schedules, and communication channels. Participation barriers can concern mobility, caregiving, travel, finances, identity-related needs, or connectivity. Organizer resources can document arrangements, responsibilities, and processes for obtaining accommodations.

Record scope and qualifications.

The catalogue title is retained as metadata. Named certificates, contracts, bounds or frameworks in that title are not asserted as results of the original source extract. The source registry labels formal reconstruction unrecoverable. The supplied agenda is shown literally, including its unfinished participant list; no formal optimization problem or universal accessibility standard is inserted.

Catalogue screening limitation: The supplied source audit marks the record unrecoverable: No word is inserted after the comma: the missing category is unrecoverable from the sources checked. The verified named groups are parent participants, trans participants, participants from the Global South, and non-US participants. Disability and universal design, caregiving beyond parenting, language, time zones, religion and culture, cost, digital access, health, and safety are treated below as a present-day expansion needed to answer the clear general question, not as reconstruction of the missing text.

The source snapshot labels this record partially solved; this is catalogue metadata rather than independent verification of a mathematical result or the current completion of a project. The source text below is rendered literally where necessary; damaged formulas and composite extracts are not silently repaired into a new mathematical claim. The supplied catalogue marks this record as unrecoverable. Its extract and terminology are documented, but a complete original problem has not been reconstructed.

Statement recorded in the supplied source.

Improving Conference Organization/Resources for Organizers

What might it look like to make our events (conferences, workshops, etc.) accessible to all participants? How can we make it accessible to parent participants, trans participants, participants from the Global South, non-US participants, ? Can we make a "best practices" document for anyone interested in organizing an equitable event in math? [S2]

Source status.

The supplied catalogue labels this source record partially solved; that metadata was checked against the supplied snapshot on 2026-10-11. The label is preserved for provenance and is not an independent verification of present open status or mathematical correctness.

Short English statement

Preserve the proposal for more accessible mathematical events and resources for organizers.

Sources

• S1 Ulam AI and the UnsolvedMath Contributors, UnsolvedMath: A Curated Collection of Open Mathematics Problems, record 20002200 (AIM-INFRASTRUCTURE-0100). Catalogue curation and metadata: CC BY 4.0. The source extract is retained; definitions, English summaries and qualifications are editorial additions. https://huggingface.co/datasets/ulamai/UnsolvedMath.
• S2 AIM Workshop Problem Lists, source linked by catalogue record AIM-INFRASTRUCTURE-0100. http://aimpl.org/gemscombin/7/.

Preparation and review.

The original source and UnsolvedMath contributors retain attribution for the source extract. Codex (GPT-6; exact serving revision not exposed) assisted with definitions, English summaries, scope notes and formatting. No new human mathematical authorship or independently verified solution is asserted. Permanent source ID 20002200 and code AIM-INFRASTRUCTURE-0100 checked against the complete supplied registry and current repository. Distinct upstream records, including repeated questions and broad or damaged extracts, are retained for complete coverage of the source CS category. A repeated record is not a new independent conjecture. Complete mathematical-equivalence and current-literature review has not been performed. Preparation and final review follow contribution prompts C and D, with source gaps disclosed. Structural and rendering checks do not establish a new theorem or open status.

Research attempt

Literature, source context and scope

The complete catalogue body above retains the original agenda, source status, and historical preparation. The AIMPL problem page could not be retrieved. The supplied complete source transcription was read, and the accessible primary AIM workshop announcement was checked for context. The announcement is not a substitute for verification of the inaccessible problem page. The catalogue's earlier proposed frameworks and research summaries are context, not established solutions credited to this attempt. The following is an explicitly limited investigation of one route; it neither substitutes a formalized toy model for the entire source agenda nor claims empirical or deployed-software results. Elementary auxiliary facts are not new original-target progress.

Testing a feature-count measure of event accessibility

The source asks about many participants and many barriers. We isolate a limited journey model: a participant can attend if a directed graph of usable steps contains a path from start $s$ to successful participation $t$. A step is usable or blocked for this modeled participant. These binary labels are stipulated, not inferred from a person's identity, and do not represent all dimensions of inclusion. An explicit finite test explores usable out-neighbors from $s$ until no new vertex is found. Every visited vertex has a usable path by induction on discovery, and every usable path endpoint is eventually visited by induction on path length. Thus $t$ is visited exactly when a usable journey exists. This checks paths for specified personas and conditions; it cannot certify accessibility for all real participants unless those conditions are complete and accurate.

Verification and remaining gaps

A 100-edge chain with edge 50 blocked has 99 usable steps and no complete path, as a traversal verified. The attempted inference from a high checklist percentage to universal event access fails. No actual event audit, participant consultation, organizer resource document, or coverage of the source's unfinished list of participant needs was completed. The original broad agenda remains intact.

References and source attribution

Primary source: http://aimpl.org/gemscombin/7/. Attempted primary AIMPL page retrieval; failed with timeout or gateway error. The supplied full source transcription was read; the inaccessible live page was not independently inspected.

https://aimath.org/pastworkshops/gemscombin.html. Read the primary March 2023 workshop announcement and its community inclusion agenda.

All retrievals were checked on 11 October 2026. Original contributor and catalogue attribution remains in the preserved Sources section. The elementary arguments below are self-contained; their exposition is not a claim of first discovery.

Integration review.

Codex (GPT-6; exact serving revision not exposed) reviewed the written arguments and expanded layout and source-reference wrappers. Repository metadata and the production web renderer were checked using Python 3.13 and JavaScript with MathJax 3.2.2. This model-assisted review is not independent human proof verification; no PDF compilation or formal proof checking is asserted.

Completion Estimate

COMPLETION: 0% No substantiated new progress toward the entire original target is claimed. The worked results and failed route are delimited above; a known result, illustrative model, or auxiliary obstruction is not counted as original-target completion.

Final status and attribution

Attempt status: unresolved. This describes this research attempt, not a new ruling on the source catalogue's status or on external literature claims. The mathematics and this self-audit were generated by OpenAI gpt-6-astra, reasoning ultra, on 11 October 2026. Codex (GPT-6; exact serving revision not exposed) orchestrated the batch and contributed formatting/repository review. No human mathematical authorship, independent human proof checking, or formal verification is claimed. The historical preparation paragraphs in the reproduced catalogue body concern that body only.

Contribution prompt A was applied to the complete definition and supplied source record, followed by the adversarial checks of prompt B. Local reproduction files are batch013/checks.py, computations.json, and the per-ID audit JSON. They were not public links at preparation time. Numerical checks are finite and do not prove unrestricted results. No LaTeX engine was found locally; compilation was not performed by this research agent.