{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6O42BJ5BGXWARL3ZAF6WXIBCC5","short_pith_number":"pith:6O42BJ5B","schema_version":"1.0","canonical_sha256":"f3b9a0a7a135ec08af79017d6ba022176f711200bbc25af18300a4547dcf9f4f","source":{"kind":"arxiv","id":"2606.24139","version":1},"attestation_state":"computed","paper":{"title":"Arithmetic Progression-Free Subset-Sum Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Samuel Korsky","submitted_at":"2026-06-23T04:46:44Z","abstract_excerpt":"For a finite set $A$ of positive integers, let $H(A)$ be its set of subset sums, including the empty sum, and let $g_k(n)$ be the least $N$ for which some $n$-element set $A\\subseteq[N]$ has $H(A)$ free of nonconstant $k$-term arithmetic progressions. The problem of determining $g_k(n)$ was posed by Erd\\H{o}s and S\\'ark\\H{o}zy. In the three-term case, we prove a lower bound equal to the exact bandwidth of the ternary grid. If $T_m=[x^m](1+x+x^2)^m$ is the central trinomial coefficient, then \\[ g_3(n)\\ge \\frac{T_n-1}{2}+\\sum_{j=0}^{n-1}T_j\n  =\\left(\\frac{\\sqrt{3}}{2\\sqrt{\\pi}}+o(1)\\right)\\frac{"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.24139","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T04:46:44Z","cross_cats_sorted":[],"title_canon_sha256":"18825b37df3143c5db37976d3c1e21adc66886c507b43dda7872708fabb388e9","abstract_canon_sha256":"a6542a2aed6fc2f21b832c275e27d7466cb460dc1936d18e8cf4e2865bfc3004"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:14:42.065892Z","signature_b64":"7uqLj2XSn63D+wFkSOUQN1dsM789maeCQKfLSHJENMaKfayUQ4T5W215uG5AE9HwsaoNjDJ8nWTzrzueHkxuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3b9a0a7a135ec08af79017d6ba022176f711200bbc25af18300a4547dcf9f4f","last_reissued_at":"2026-06-24T01:14:42.065512Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:14:42.065512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Arithmetic Progression-Free Subset-Sum Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Samuel Korsky","submitted_at":"2026-06-23T04:46:44Z","abstract_excerpt":"For a finite set $A$ of positive integers, let $H(A)$ be its set of subset sums, including the empty sum, and let $g_k(n)$ be the least $N$ for which some $n$-element set $A\\subseteq[N]$ has $H(A)$ free of nonconstant $k$-term arithmetic progressions. The problem of determining $g_k(n)$ was posed by Erd\\H{o}s and S\\'ark\\H{o}zy. In the three-term case, we prove a lower bound equal to the exact bandwidth of the ternary grid. If $T_m=[x^m](1+x+x^2)^m$ is the central trinomial coefficient, then \\[ g_3(n)\\ge \\frac{T_n-1}{2}+\\sum_{j=0}^{n-1}T_j\n  =\\left(\\frac{\\sqrt{3}}{2\\sqrt{\\pi}}+o(1)\\right)\\frac{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24139","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.24139/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.24139","created_at":"2026-06-24T01:14:42.065574+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.24139v1","created_at":"2026-06-24T01:14:42.065574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24139","created_at":"2026-06-24T01:14:42.065574+00:00"},{"alias_kind":"pith_short_12","alias_value":"6O42BJ5BGXWA","created_at":"2026-06-24T01:14:42.065574+00:00"},{"alias_kind":"pith_short_16","alias_value":"6O42BJ5BGXWARL3Z","created_at":"2026-06-24T01:14:42.065574+00:00"},{"alias_kind":"pith_short_8","alias_value":"6O42BJ5B","created_at":"2026-06-24T01:14:42.065574+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6O42BJ5BGXWARL3ZAF6WXIBCC5","json":"https://pith.science/pith/6O42BJ5BGXWARL3ZAF6WXIBCC5.json","graph_json":"https://pith.science/api/pith-number/6O42BJ5BGXWARL3ZAF6WXIBCC5/graph.json","events_json":"https://pith.science/api/pith-number/6O42BJ5BGXWARL3ZAF6WXIBCC5/events.json","paper":"https://pith.science/paper/6O42BJ5B"},"agent_actions":{"view_html":"https://pith.science/pith/6O42BJ5BGXWARL3ZAF6WXIBCC5","download_json":"https://pith.science/pith/6O42BJ5BGXWARL3ZAF6WXIBCC5.json","view_paper":"https://pith.science/paper/6O42BJ5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.24139&json=true","fetch_graph":"https://pith.science/api/pith-number/6O42BJ5BGXWARL3ZAF6WXIBCC5/graph.json","fetch_events":"https://pith.science/api/pith-number/6O42BJ5BGXWARL3ZAF6WXIBCC5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6O42BJ5BGXWARL3ZAF6WXIBCC5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6O42BJ5BGXWARL3ZAF6WXIBCC5/action/storage_attestation","attest_author":"https://pith.science/pith/6O42BJ5BGXWARL3ZAF6WXIBCC5/action/author_attestation","sign_citation":"https://pith.science/pith/6O42BJ5BGXWARL3ZAF6WXIBCC5/action/citation_signature","submit_replication":"https://pith.science/pith/6O42BJ5BGXWARL3ZAF6WXIBCC5/action/replication_record"}},"created_at":"2026-06-24T01:14:42.065574+00:00","updated_at":"2026-06-24T01:14:42.065574+00:00"}