{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6O42BJ5BGXWARL3ZAF6WXIBCC5","short_pith_number":"pith:6O42BJ5B","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"},"canonical_sha256":"f3b9a0a7a135ec08af79017d6ba022176f711200bbc25af18300a4547dcf9f4f","source":{"kind":"arxiv","id":"2606.24139","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24139","created_at":"2026-06-24T01:14:42Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24139v1","created_at":"2026-06-24T01:14:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24139","created_at":"2026-06-24T01:14:42Z"},{"alias_kind":"pith_short_12","alias_value":"6O42BJ5BGXWA","created_at":"2026-06-24T01:14:42Z"},{"alias_kind":"pith_short_16","alias_value":"6O42BJ5BGXWARL3Z","created_at":"2026-06-24T01:14:42Z"},{"alias_kind":"pith_short_8","alias_value":"6O42BJ5B","created_at":"2026-06-24T01:14:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6O42BJ5BGXWARL3ZAF6WXIBCC5","target":"record","payload":{"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"},"canonical_sha256":"f3b9a0a7a135ec08af79017d6ba022176f711200bbc25af18300a4547dcf9f4f","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"},"source_kind":"arxiv","source_id":"2606.24139","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-24T01:14:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KhRHMPFCp2jYpffc1Lx9oUdXBUZw9niHeq6E9etxlmdhFoZ9T2hGIQU5qVON8StvKeV23Tp9RX7bxz5BRhW0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T10:11:42.752431Z"},"content_sha256":"b2bd7ebf14d2bddf60fa8cf454749ff24422583f202e82c0330c3cc8f5ad2706","schema_version":"1.0","event_id":"sha256:b2bd7ebf14d2bddf60fa8cf454749ff24422583f202e82c0330c3cc8f5ad2706"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6O42BJ5BGXWARL3ZAF6WXIBCC5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-24T01:14:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vTkcf9fVmD2bqaegktA8jcxBXArqQZsF7RMUA242NmL83IWJ07WWz8aXyXz2vgDZ6UgO8NNKp8jZCb3NfTl7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T10:11:42.752804Z"},"content_sha256":"46507f6c9846ee7d471dd877e83b947620617379062547da1ce6ff9f9ae0d2c7","schema_version":"1.0","event_id":"sha256:46507f6c9846ee7d471dd877e83b947620617379062547da1ce6ff9f9ae0d2c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6O42BJ5BGXWARL3ZAF6WXIBCC5/bundle.json","state_url":"https://pith.science/pith/6O42BJ5BGXWARL3ZAF6WXIBCC5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6O42BJ5BGXWARL3ZAF6WXIBCC5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-03T10:11:42Z","links":{"resolver":"https://pith.science/pith/6O42BJ5BGXWARL3ZAF6WXIBCC5","bundle":"https://pith.science/pith/6O42BJ5BGXWARL3ZAF6WXIBCC5/bundle.json","state":"https://pith.science/pith/6O42BJ5BGXWARL3ZAF6WXIBCC5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6O42BJ5BGXWARL3ZAF6WXIBCC5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6O42BJ5BGXWARL3ZAF6WXIBCC5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a6542a2aed6fc2f21b832c275e27d7466cb460dc1936d18e8cf4e2865bfc3004","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T04:46:44Z","title_canon_sha256":"18825b37df3143c5db37976d3c1e21adc66886c507b43dda7872708fabb388e9"},"schema_version":"1.0","source":{"id":"2606.24139","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24139","created_at":"2026-06-24T01:14:42Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24139v1","created_at":"2026-06-24T01:14:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24139","created_at":"2026-06-24T01:14:42Z"},{"alias_kind":"pith_short_12","alias_value":"6O42BJ5BGXWA","created_at":"2026-06-24T01:14:42Z"},{"alias_kind":"pith_short_16","alias_value":"6O42BJ5BGXWARL3Z","created_at":"2026-06-24T01:14:42Z"},{"alias_kind":"pith_short_8","alias_value":"6O42BJ5B","created_at":"2026-06-24T01:14:42Z"}],"graph_snapshots":[{"event_id":"sha256:46507f6c9846ee7d471dd877e83b947620617379062547da1ce6ff9f9ae0d2c7","target":"graph","created_at":"2026-06-24T01:14:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.24139/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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{","authors_text":"Samuel Korsky","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T04:46:44Z","title":"Arithmetic Progression-Free Subset-Sum Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24139","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b2bd7ebf14d2bddf60fa8cf454749ff24422583f202e82c0330c3cc8f5ad2706","target":"record","created_at":"2026-06-24T01:14:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a6542a2aed6fc2f21b832c275e27d7466cb460dc1936d18e8cf4e2865bfc3004","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T04:46:44Z","title_canon_sha256":"18825b37df3143c5db37976d3c1e21adc66886c507b43dda7872708fabb388e9"},"schema_version":"1.0","source":{"id":"2606.24139","kind":"arxiv","version":1}},"canonical_sha256":"f3b9a0a7a135ec08af79017d6ba022176f711200bbc25af18300a4547dcf9f4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3b9a0a7a135ec08af79017d6ba022176f711200bbc25af18300a4547dcf9f4f","first_computed_at":"2026-06-24T01:14:42.065512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T01:14:42.065512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7uqLj2XSn63D+wFkSOUQN1dsM789maeCQKfLSHJENMaKfayUQ4T5W215uG5AE9HwsaoNjDJ8nWTzrzueHkxuBQ==","signature_status":"signed_v1","signed_at":"2026-06-24T01:14:42.065892Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.24139","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2bd7ebf14d2bddf60fa8cf454749ff24422583f202e82c0330c3cc8f5ad2706","sha256:46507f6c9846ee7d471dd877e83b947620617379062547da1ce6ff9f9ae0d2c7"],"state_sha256":"76932d462430c9a5fd542cc6c0e1b91741e6ed8e6e530b310103dc8d49ef1913"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gBW528NExVhe5VizhnZLYHbzeJ+l7Purnk8bmD2aAksUXjtmHNt1bxWxG1/RneafLn5Sp99xdtxoy8j5ws4ZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T10:11:42.754763Z","bundle_sha256":"6a70a7bb49741defadb68f58e5f48ed0fce1c1e6015c259cb176fdaa36a257ba"}}