{"paper":{"title":"Forbidden subset sums in a linear range: an inverse theorem and the Erd\\H{o}s-Graham irregularity problem","arxiv_id":"2611.17205","primary_cat":"math.CO","submitted_at":"2026-11-12T18:05:45+00:00","version_compiled":"v1"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v1","sentences":[{"i":0,"p":0.95,"id":"s0","own":false,"role":"background","text":"For $c>0$ let $f_c(n)$ be the largest size of a set $A\\subseteq\\{1,\\dots,\\lfloor cn\\rfloor\\}$ such that $n$ is not a sum of distinct elements of $A$.","hedge":{"p":0.77,"label":"asserted"},"own_p":0.18,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.49,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.95,"limitation":0.0,"future_work":0.0,"contribution":0.05,"interpretation":0.0}},{"i":1,"p":0.93,"id":"s1","own":false,"role":"background","text":"Erd\\H{o}s and Graham asked whether $f_c(n)$ depends on $n$ in an irregular way (Erd\\H{o}s Problem \\#361).","hedge":{"p":0.46,"label":"asserted"},"own_p":0.03,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.28,"role_probabilities":{"gap":0.07,"method":0.0,"result":0.0,"background":0.93,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":2,"p":0.98,"id":"s2","own":true,"role":"result","text":"We prove that $f_c(n)=\\lfloor cn\\rfloor-\\lceil n/2\\rceil$ for $c\\ge 1$, while for $0<c<1$ the ratio $f_c(n)/n$ has $\\limsup$ equal to $c/2$, attained along odd $n$, and, along the integers $n$ whose least non-divisor equals a prime power $q$, tends to \\[ \\max\\Bigl\\{\\frac cq,\\; c-\\frac12+\\frac{1-c}{q}\\Bigr\\} \\qquad\\text{whenever } 2^{q-2}\\min\\{c,1-c\\}\\le 1 .","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.88,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.98,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.02,"interpretation":0.0}},{"i":3,"p":0.67,"id":"s3","own":true,"role":"interpretation","text":"\\] Consequently $f_c(n)/n$ converges if and only if $c\\ge1$; for $0<c<1$ it has at least two limit points, and arbitrarily many as $c\\to0^+$ or $c\\to1^-$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.91,"main_claim_p":0.27,"quantitative":true,"quantitative_p":0.77,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.33,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.67}},{"i":4,"p":1.0,"id":"s4","own":true,"role":"result","text":"For $c=1/2$ the set of limit points is exactly $\\{1/6,1/4\\}$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.89,"main_claim_p":0.07,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.0,"result":1.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":5,"p":0.42,"id":"s5","own":true,"role":"contribution","text":"The upper bounds follow from an inverse theorem of independent interest: if $s\\ge1$, $q$ is the least positive integer not dividing $s$, and $\\varepsilon>0$, then every $A\\subseteq\\{1,\\dots,E\\}$ with $|A|\\ge E/q+\\varepsilon T$ has a subset summing to $sT$, uniformly for all sufficiently large $T$ and all $E\\le sT/2^{q-2}$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.84,"main_claim_p":0.12,"quantitative":true,"quantitative_p":0.95,"role_probabilities":{"gap":0.0,"method":0.29,"result":0.29,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.42,"interpretation":0.0}},{"i":6,"p":0.56,"id":"s6","own":false,"role":"interpretation","text":"For $s=2$, this extends Alon's theorem on subsets of $\\{1,\\dots,N\\}$ with no subset sum equal to $2N$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.41,"main_claim_p":0.03,"quantitative":true,"quantitative_p":0.72,"role_probabilities":{"gap":0.0,"method":0.01,"result":0.13,"background":0.16,"limitation":0.0,"future_work":0.0,"contribution":0.14,"interpretation":0.56}},{"i":7,"p":0.52,"id":"s7","own":true,"role":"contribution","text":"The results for $c\\ge1$ and the $\\limsup$, as well as the limits and the inverse theorem for $q\\in\\{2,3\\}$, have been formalized and machine-checked in the Lean~4 proof assistant.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.84,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.22,"role_probabilities":{"gap":0.0,"method":0.43,"result":0.04,"background":0.01,"limitation":0.0,"future_work":0.0,"contribution":0.52,"interpretation":0.0}}]},"compiled":{"main_claim":{"p":0.8,"text":"We prove that $f_c(n)=\\lfloor cn\\rfloor-\\lceil n/2\\rceil$ for $c\\ge 1$, while for $0<c<1$ the ratio $f_c(n)/n$ has $\\limsup$ equal to $c/2$, attained along odd $n$, and, along the integers $n$ whose least non-divisor equals a prime power $q$, tends to \\[ \\max\\Bigl\\{\\frac cq,\\; c-\\frac12+\\frac{1-c}{q}\\Bigr\\} \\qquad\\text{whenever } 2^{q-2}\\min\\{c,1-c\\}\\le 1 .","location":"abstract s2","hedge_strength":{"p":1.0,"label":"asserted"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":7006,"cost_usd_reported":0.0},"compiled_at":"2026-11-14","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.07,"states_limitation":0.32,"human_participants":0.01,"controlled_comparison":0.02,"randomized_assignment":0.01,"states_quantitative_result":0.98,"compares_with_prior_results":0.89,"mentions_code_or_data_availability":0.24},"evidential_basis":{"p":1.0,"value":"proof or derivation","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":1.0,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.0}},"contribution_type":{"p":1.0,"value":"theoretical result","probabilities":{"review":0.0,"method_or_tool":0.0,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":1.0,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.99,"text":"We prove that $f_c(n)=\\lfloor cn\\rfloor-\\lceil n/2\\rceil$ for $c\\ge 1$, while for $0<c<1$ the ratio $f_c(n)/n$ has $\\limsup$ equal to $c/2$, attained along odd $n$, and, along the integers $n$ whose least non-divisor equals a prime power $q$, tends to \\[ \\max\\Bigl\\{\\frac cq,\\; c-\\frac12+\\frac{1-c}{q}\\Bigr\\} \\qquad\\text{whenever } 2^{q-2}\\min\\{c,1-c\\}\\le 1 .","location":"abstract s2"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v1"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":8,"sentences_in_abstract":8},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448,"review_comments_judged":{"judged_by":["gpt-5.6-luna","grok-4.7"],"judged_against":"Pith's own text copy of each paper: text extracted from the PDF, the first 90,000 characters","measured_on":"2026-10-04","accurate":113,"decided":149,"sampled_reviews":200,"split_by_lane":false,"by_lane":"https://pith.science/accuracy#by-lane"}}}