{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JKTLFNNEX5Z3S7DRYHLSQCOUJG","short_pith_number":"pith:JKTLFNNE","canonical_record":{"source":{"id":"1605.03172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-10T19:53:26Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"8770640eea5e4f5d85d6c16a1d111f1f1533254b51caa859900282305e9ce484","abstract_canon_sha256":"fea8be0322247c87eb624548754eaf695001de1c0ba840520e0b02ff942e61b9"},"schema_version":"1.0"},"canonical_sha256":"4aa6b2b5a4bf73b97c71c1d72809d449a2b83cbfb04ac2c3f9d7fbaa0f71d71b","source":{"kind":"arxiv","id":"1605.03172","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03172","created_at":"2026-05-18T01:15:07Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03172v1","created_at":"2026-05-18T01:15:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03172","created_at":"2026-05-18T01:15:07Z"},{"alias_kind":"pith_short_12","alias_value":"JKTLFNNEX5Z3","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JKTLFNNEX5Z3S7DR","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JKTLFNNE","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JKTLFNNEX5Z3S7DRYHLSQCOUJG","target":"record","payload":{"canonical_record":{"source":{"id":"1605.03172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-10T19:53:26Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"8770640eea5e4f5d85d6c16a1d111f1f1533254b51caa859900282305e9ce484","abstract_canon_sha256":"fea8be0322247c87eb624548754eaf695001de1c0ba840520e0b02ff942e61b9"},"schema_version":"1.0"},"canonical_sha256":"4aa6b2b5a4bf73b97c71c1d72809d449a2b83cbfb04ac2c3f9d7fbaa0f71d71b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:07.341267Z","signature_b64":"d+kBYsrv/Yl6HXL3J6RIkLADdmXvzY0DltBHlRxZYr7m9nxqxKM+WhdXKg8MfkKsHsPh4C1ImHf3fEcdeyQkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4aa6b2b5a4bf73b97c71c1d72809d449a2b83cbfb04ac2c3f9d7fbaa0f71d71b","last_reissued_at":"2026-05-18T01:15:07.340497Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:07.340497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.03172","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-05-18T01:15:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ay+b9AnFKjRujqb6576OrzS8gQrqxiQe8WtCRYSVaKYxR1ARf8/sZYFGtxyBHhLbvBklD9wipqdTwQGclEHtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:52:28.288823Z"},"content_sha256":"12e558adcb4cd25917406f81e80e60662f2b383376f2ea93f6b9fa8874d804b5","schema_version":"1.0","event_id":"sha256:12e558adcb4cd25917406f81e80e60662f2b383376f2ea93f6b9fa8874d804b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JKTLFNNEX5Z3S7DRYHLSQCOUJG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The number of subsets of integers with no $k$-term arithmetic progression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Hong Liu, J\\'ozsef Balogh, Maryam Sharifzadeh","submitted_at":"2016-05-10T19:53:26Z","abstract_excerpt":"Addressing a question of Cameron and Erd\\Ho s, we show that, for infinitely many values of $n$, the number of subsets of $\\{1,2,\\ldots, n\\}$ that do not contain a $k$-term arithmetic progression is at most $2^{O(r_k(n))}$, where $r_k(n)$ is the maximum cardinality of a subset of $\\{1,2,\\ldots, n\\}$ without a $k$-term arithmetic progression. This bound is optimal up to a constant factor in the exponent. For all values of $n$, we prove a weaker bound, which is nevertheless sufficient to transfer the current best upper bound on $r_k(n)$ to the sparse random setting. To achieve these bounds, we es"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03172","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":""},"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-05-18T01:15:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2wVlxsY2XOWgefdMCW6nzAr6lh+vCDzJy37nKAc9Baxpb9BOgeFSyGmH0MbJP3C69PwOaqbN8oyatZmRm83bCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:52:28.289178Z"},"content_sha256":"96e73e8701dca18cd5d64524ff9dbae304501a564036b5d119ac438586a799d5","schema_version":"1.0","event_id":"sha256:96e73e8701dca18cd5d64524ff9dbae304501a564036b5d119ac438586a799d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JKTLFNNEX5Z3S7DRYHLSQCOUJG/bundle.json","state_url":"https://pith.science/pith/JKTLFNNEX5Z3S7DRYHLSQCOUJG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JKTLFNNEX5Z3S7DRYHLSQCOUJG/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-05-29T17:52:28Z","links":{"resolver":"https://pith.science/pith/JKTLFNNEX5Z3S7DRYHLSQCOUJG","bundle":"https://pith.science/pith/JKTLFNNEX5Z3S7DRYHLSQCOUJG/bundle.json","state":"https://pith.science/pith/JKTLFNNEX5Z3S7DRYHLSQCOUJG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JKTLFNNEX5Z3S7DRYHLSQCOUJG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JKTLFNNEX5Z3S7DRYHLSQCOUJG","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":"fea8be0322247c87eb624548754eaf695001de1c0ba840520e0b02ff942e61b9","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-10T19:53:26Z","title_canon_sha256":"8770640eea5e4f5d85d6c16a1d111f1f1533254b51caa859900282305e9ce484"},"schema_version":"1.0","source":{"id":"1605.03172","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03172","created_at":"2026-05-18T01:15:07Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03172v1","created_at":"2026-05-18T01:15:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03172","created_at":"2026-05-18T01:15:07Z"},{"alias_kind":"pith_short_12","alias_value":"JKTLFNNEX5Z3","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JKTLFNNEX5Z3S7DR","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JKTLFNNE","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:96e73e8701dca18cd5d64524ff9dbae304501a564036b5d119ac438586a799d5","target":"graph","created_at":"2026-05-18T01:15:07Z","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"},"paper":{"abstract_excerpt":"Addressing a question of Cameron and Erd\\Ho s, we show that, for infinitely many values of $n$, the number of subsets of $\\{1,2,\\ldots, n\\}$ that do not contain a $k$-term arithmetic progression is at most $2^{O(r_k(n))}$, where $r_k(n)$ is the maximum cardinality of a subset of $\\{1,2,\\ldots, n\\}$ without a $k$-term arithmetic progression. This bound is optimal up to a constant factor in the exponent. For all values of $n$, we prove a weaker bound, which is nevertheless sufficient to transfer the current best upper bound on $r_k(n)$ to the sparse random setting. To achieve these bounds, we es","authors_text":"Hong Liu, J\\'ozsef Balogh, Maryam Sharifzadeh","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-10T19:53:26Z","title":"The number of subsets of integers with no $k$-term arithmetic progression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03172","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:12e558adcb4cd25917406f81e80e60662f2b383376f2ea93f6b9fa8874d804b5","target":"record","created_at":"2026-05-18T01:15:07Z","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":"fea8be0322247c87eb624548754eaf695001de1c0ba840520e0b02ff942e61b9","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-10T19:53:26Z","title_canon_sha256":"8770640eea5e4f5d85d6c16a1d111f1f1533254b51caa859900282305e9ce484"},"schema_version":"1.0","source":{"id":"1605.03172","kind":"arxiv","version":1}},"canonical_sha256":"4aa6b2b5a4bf73b97c71c1d72809d449a2b83cbfb04ac2c3f9d7fbaa0f71d71b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4aa6b2b5a4bf73b97c71c1d72809d449a2b83cbfb04ac2c3f9d7fbaa0f71d71b","first_computed_at":"2026-05-18T01:15:07.340497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:07.340497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d+kBYsrv/Yl6HXL3J6RIkLADdmXvzY0DltBHlRxZYr7m9nxqxKM+WhdXKg8MfkKsHsPh4C1ImHf3fEcdeyQkCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:07.341267Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03172","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12e558adcb4cd25917406f81e80e60662f2b383376f2ea93f6b9fa8874d804b5","sha256:96e73e8701dca18cd5d64524ff9dbae304501a564036b5d119ac438586a799d5"],"state_sha256":"377532169ea2956e4ad7ab5c9f9d67606046eacd6beaf4b02c807d94024c1716"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b6b2jmt2/Mh3kwowINzxE2KgABI5dUi6fUwD/EwSH5unHJo/TZpR5OERxOTExvtypFFfbzBZUigMHa7vh73sAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:52:28.291266Z","bundle_sha256":"fc976db479da17ced101ff1d3ac3fb7327879d9088313d620a1f5ddc7f679e0f"}}