{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5SYNEIJ2YENBGBKAVN7SNIHU3B","short_pith_number":"pith:5SYNEIJ2","canonical_record":{"source":{"id":"2603.27045","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-03-27T23:21:02Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"949a3fe3f9c03c0ab5fd495f29de62470a62b1b7ab5c4b4b68e46778cedfe265","abstract_canon_sha256":"e4b74dd0ec7c86751ce5b53ef054bc493bab41e8640218c8ca739e1e0b9ed611"},"schema_version":"1.0"},"canonical_sha256":"ecb0d2213ac11a130540ab7f26a0f4d84e0c65f960183722c194167f1219d2b3","source":{"kind":"arxiv","id":"2603.27045","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.27045","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"arxiv_version","alias_value":"2603.27045v3","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.27045","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"pith_short_12","alias_value":"5SYNEIJ2YENB","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"pith_short_16","alias_value":"5SYNEIJ2YENBGBKA","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"pith_short_8","alias_value":"5SYNEIJ2","created_at":"2026-05-20T00:00:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5SYNEIJ2YENBGBKAVN7SNIHU3B","target":"record","payload":{"canonical_record":{"source":{"id":"2603.27045","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-03-27T23:21:02Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"949a3fe3f9c03c0ab5fd495f29de62470a62b1b7ab5c4b4b68e46778cedfe265","abstract_canon_sha256":"e4b74dd0ec7c86751ce5b53ef054bc493bab41e8640218c8ca739e1e0b9ed611"},"schema_version":"1.0"},"canonical_sha256":"ecb0d2213ac11a130540ab7f26a0f4d84e0c65f960183722c194167f1219d2b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:37.169253Z","signature_b64":"a9IqjYwZ6DrZFgBMjKxA6EOfArZnQ9muq0Z0skEi0KQ/BKMsUM0kDj17PkitKGz3hzWjAbv9dH7wxWnY3kBmAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecb0d2213ac11a130540ab7f26a0f4d84e0c65f960183722c194167f1219d2b3","last_reissued_at":"2026-05-20T00:00:37.168570Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:37.168570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2603.27045","source_version":3,"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-05-20T00:00:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ByBD1IkXRPhnbRpexyxPDl2J4liYrh8nyEMJuvjqykOUZBwfKGo9MxNSC1PZgB4hgSx4Fx1pAo96jnyZjTGHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:04:52.619982Z"},"content_sha256":"c0f88d15e8ab416ecfb95a7fbf7cf6ae95d208d6809c9f297e10f2611abfb770","schema_version":"1.0","event_id":"sha256:c0f88d15e8ab416ecfb95a7fbf7cf6ae95d208d6809c9f297e10f2611abfb770"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5SYNEIJ2YENBGBKAVN7SNIHU3B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Bounds for 3-Progressions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A subset of {1 to N} without nontrivial 3-term arithmetic progressions has size at most exp(-c log(N)^{1/6} log log(N)^{-1}) N.","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Rushil Raghavan","submitted_at":"2026-03-27T23:21:02Z","abstract_excerpt":"We prove that if $A\\subset \\{1,\\dots,N\\}$ has no nontrivial three-term arithmetic progressions, then $|A|\\leq \\exp(-c\\log(N)^{1/6}\\log\\log(N)^{-1})N$ for some absolute constant $c>0$. To obtain this bound, we use an iterated variant of the sifting argument of Kelley and Meka, as well as an improved bootstrapping argument for Croot-Sisask almost-periodicity due to Bloom and Sisask."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"If A subset of {1,...,N} has no nontrivial three-term arithmetic progressions, then |A| ≤ exp(-c log(N)^{1/6} log log(N)^{-1}) N for some absolute constant c>0.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The iterated sifting argument of Kelley and Meka combined with the improved bootstrapping argument for Croot-Sisask almost-periodicity due to Bloom and Sisask can be carried out without introducing errors that invalidate the final bound.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Any 3-AP-free subset A of [N] has |A| at most N times exp(-c (log N)^{1/6} / log log N) for an absolute constant c > 0.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A subset of {1 to N} without nontrivial 3-term arithmetic progressions has size at most exp(-c log(N)^{1/6} log log(N)^{-1}) N.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"645908f55571c803d75453afddd92ed63e1ee992e6666c1afe74b4b6528d16e1"},"source":{"id":"2603.27045","kind":"arxiv","version":3},"verdict":{"id":"f44956e0-f3c0-4332-8911-13b2b1a4c9ff","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T17:06:29.163459Z","strongest_claim":"If A subset of {1,...,N} has no nontrivial three-term arithmetic progressions, then |A| ≤ exp(-c log(N)^{1/6} log log(N)^{-1}) N for some absolute constant c>0.","one_line_summary":"Any 3-AP-free subset A of [N] has |A| at most N times exp(-c (log N)^{1/6} / log log N) for an absolute constant c > 0.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The iterated sifting argument of Kelley and Meka combined with the improved bootstrapping argument for Croot-Sisask almost-periodicity due to Bloom and Sisask can be carried out without introducing errors that invalidate the final bound.","pith_extraction_headline":"A subset of {1 to N} without nontrivial 3-term arithmetic progressions has size at most exp(-c log(N)^{1/6} log log(N)^{-1}) N."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.27045/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":"f44956e0-f3c0-4332-8911-13b2b1a4c9ff"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:00:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dJLBdz6I42pdXfr2+p+zvRyvy43ZopYkhwPSBmiQb+kWy+x8V4vA3kQweNU1ZinNtDmeuaZUAWdRG8swSOH5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:04:52.620530Z"},"content_sha256":"1620f12ba532dc52a8528f5987618a122479388a1de323fa1bbf148f9acac3b4","schema_version":"1.0","event_id":"sha256:1620f12ba532dc52a8528f5987618a122479388a1de323fa1bbf148f9acac3b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SYNEIJ2YENBGBKAVN7SNIHU3B/bundle.json","state_url":"https://pith.science/pith/5SYNEIJ2YENBGBKAVN7SNIHU3B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SYNEIJ2YENBGBKAVN7SNIHU3B/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-06-01T16:04:52Z","links":{"resolver":"https://pith.science/pith/5SYNEIJ2YENBGBKAVN7SNIHU3B","bundle":"https://pith.science/pith/5SYNEIJ2YENBGBKAVN7SNIHU3B/bundle.json","state":"https://pith.science/pith/5SYNEIJ2YENBGBKAVN7SNIHU3B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SYNEIJ2YENBGBKAVN7SNIHU3B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5SYNEIJ2YENBGBKAVN7SNIHU3B","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":"e4b74dd0ec7c86751ce5b53ef054bc493bab41e8640218c8ca739e1e0b9ed611","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-03-27T23:21:02Z","title_canon_sha256":"949a3fe3f9c03c0ab5fd495f29de62470a62b1b7ab5c4b4b68e46778cedfe265"},"schema_version":"1.0","source":{"id":"2603.27045","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.27045","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"arxiv_version","alias_value":"2603.27045v3","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.27045","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"pith_short_12","alias_value":"5SYNEIJ2YENB","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"pith_short_16","alias_value":"5SYNEIJ2YENBGBKA","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"pith_short_8","alias_value":"5SYNEIJ2","created_at":"2026-05-20T00:00:37Z"}],"graph_snapshots":[{"event_id":"sha256:1620f12ba532dc52a8528f5987618a122479388a1de323fa1bbf148f9acac3b4","target":"graph","created_at":"2026-05-20T00:00:37Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"If A subset of {1,...,N} has no nontrivial three-term arithmetic progressions, then |A| ≤ exp(-c log(N)^{1/6} log log(N)^{-1}) N for some absolute constant c>0."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The iterated sifting argument of Kelley and Meka combined with the improved bootstrapping argument for Croot-Sisask almost-periodicity due to Bloom and Sisask can be carried out without introducing errors that invalidate the final bound."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Any 3-AP-free subset A of [N] has |A| at most N times exp(-c (log N)^{1/6} / log log N) for an absolute constant c > 0."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A subset of {1 to N} without nontrivial 3-term arithmetic progressions has size at most exp(-c log(N)^{1/6} log log(N)^{-1}) N."}],"snapshot_sha256":"645908f55571c803d75453afddd92ed63e1ee992e6666c1afe74b4b6528d16e1"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.27045/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that if $A\\subset \\{1,\\dots,N\\}$ has no nontrivial three-term arithmetic progressions, then $|A|\\leq \\exp(-c\\log(N)^{1/6}\\log\\log(N)^{-1})N$ for some absolute constant $c>0$. To obtain this bound, we use an iterated variant of the sifting argument of Kelley and Meka, as well as an improved bootstrapping argument for Croot-Sisask almost-periodicity due to Bloom and Sisask.","authors_text":"Rushil Raghavan","cross_cats":["math.CO"],"headline":"A subset of {1 to N} without nontrivial 3-term arithmetic progressions has size at most exp(-c log(N)^{1/6} log log(N)^{-1}) N.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-03-27T23:21:02Z","title":"Improved Bounds for 3-Progressions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.27045","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-19T17:06:29.163459Z","id":"f44956e0-f3c0-4332-8911-13b2b1a4c9ff","model_set":{"reader":"grok-4.3"},"one_line_summary":"Any 3-AP-free subset A of [N] has |A| at most N times exp(-c (log N)^{1/6} / log log N) for an absolute constant c > 0.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A subset of {1 to N} without nontrivial 3-term arithmetic progressions has size at most exp(-c log(N)^{1/6} log log(N)^{-1}) N.","strongest_claim":"If A subset of {1,...,N} has no nontrivial three-term arithmetic progressions, then |A| ≤ exp(-c log(N)^{1/6} log log(N)^{-1}) N for some absolute constant c>0.","weakest_assumption":"The iterated sifting argument of Kelley and Meka combined with the improved bootstrapping argument for Croot-Sisask almost-periodicity due to Bloom and Sisask can be carried out without introducing errors that invalidate the final bound."}},"verdict_id":"f44956e0-f3c0-4332-8911-13b2b1a4c9ff"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c0f88d15e8ab416ecfb95a7fbf7cf6ae95d208d6809c9f297e10f2611abfb770","target":"record","created_at":"2026-05-20T00:00:37Z","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":"e4b74dd0ec7c86751ce5b53ef054bc493bab41e8640218c8ca739e1e0b9ed611","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-03-27T23:21:02Z","title_canon_sha256":"949a3fe3f9c03c0ab5fd495f29de62470a62b1b7ab5c4b4b68e46778cedfe265"},"schema_version":"1.0","source":{"id":"2603.27045","kind":"arxiv","version":3}},"canonical_sha256":"ecb0d2213ac11a130540ab7f26a0f4d84e0c65f960183722c194167f1219d2b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecb0d2213ac11a130540ab7f26a0f4d84e0c65f960183722c194167f1219d2b3","first_computed_at":"2026-05-20T00:00:37.168570Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:37.168570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a9IqjYwZ6DrZFgBMjKxA6EOfArZnQ9muq0Z0skEi0KQ/BKMsUM0kDj17PkitKGz3hzWjAbv9dH7wxWnY3kBmAQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:37.169253Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.27045","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0f88d15e8ab416ecfb95a7fbf7cf6ae95d208d6809c9f297e10f2611abfb770","sha256:1620f12ba532dc52a8528f5987618a122479388a1de323fa1bbf148f9acac3b4"],"state_sha256":"664f7dc8ec6060b7a55398a50d7e90e4e994a6bc6d51d68e83528f308f8d033c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CGTWBZMS5Om4YW2TTfSJ4Bjq7/CBlSF+/Y1e0/RUIyI3xKcma2dJdkWj77Mni+U/Hd+Zmss3jg5pTPX05EO3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:04:52.623064Z","bundle_sha256":"2cbf90856e53ac74870ac35ef5fa5e2198564c4c5cfdd65f3ac87d371a8d0f83"}}