Dual Sequential Fat-Shattering and Tight Threshold Extraction
Two open problems about extracting order from trees in real-valued functions. A quantitative function analogue of Hodges's tree-to-order extraction yields an at most double-exponential bound on dual sequential fat-shattering dimension, resolving the first. A new proof of Daskalakis-Golowich tight-threshold extraction, avoiding multicolored Ramsey numbers, resolves the second, which concerned repairing the bound in a result claimed by Jung, Kim and Tewari.
- Result
- Proved
- Status
- Resolved
- AI contribution
- AI co-developed
- Method
- Argument
- Field
- Model theory and learning theory
- Posed by
- Constantinos Daskalakis, Noah Golowich; Jung, Kim and Tewari
- Year posed
- —
- Years open
- —
- Solved
- 2026-07-23
- Model
- ChatGPT
- Vendor
- OpenAI
- Collaborators
- Gabriel Conant, Caroline Terry
- Verification
- Unreviewed
- Publication
- Preprint
- Significance
- 10 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What the AI did
The acknowledgements separate human and AI credit explicitly and attribute specific steps. Proposition 3.4 was provided by ChatGPT on direct request. The authors' original Theorem 1.11 gave only a uniform analogue with a weaker bound; asked whether the bound could be improved, the model proposed the two-parameter inductive scheme that gives the current one, and it identified that the uniformity hypotheses were an artifact of an imprecise formulation, letting the authors drop them. For Theorem 1.14 the authors handed over their draft with a description of the obstacles and asked for a proof; the model generated an argument following their induction scheme and two-case structure. The authors checked and thoroughly rewrote everything.
Verification
arXiv preprint; not yet peer-reviewed.
Source
arXiv:2607.21761 - Encoding orders and trees in real-valued functions