{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:C2QMNBNFRE7Q2A4LKRAEMW57BG","short_pith_number":"pith:C2QMNBNF","canonical_record":{"source":{"id":"1310.2277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-10-08T20:46:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"881bdc403b758ccb198356b8bbf6a773c2a65c4632b5050bf000847af4a595ab","abstract_canon_sha256":"cfc5db2caa9ba33872abe7bc136e572b6b6a8761d035b2a09395089473aa7cf4"},"schema_version":"1.0"},"canonical_sha256":"16a0c685a5893f0d038b5440465bbf098d3a0714f349a7d7a2daff3634e66889","source":{"kind":"arxiv","id":"1310.2277","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2277","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2277v1","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2277","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"C2QMNBNFRE7Q","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C2QMNBNFRE7Q2A4L","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C2QMNBNF","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:C2QMNBNFRE7Q2A4LKRAEMW57BG","target":"record","payload":{"canonical_record":{"source":{"id":"1310.2277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-10-08T20:46:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"881bdc403b758ccb198356b8bbf6a773c2a65c4632b5050bf000847af4a595ab","abstract_canon_sha256":"cfc5db2caa9ba33872abe7bc136e572b6b6a8761d035b2a09395089473aa7cf4"},"schema_version":"1.0"},"canonical_sha256":"16a0c685a5893f0d038b5440465bbf098d3a0714f349a7d7a2daff3634e66889","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:57.438236Z","signature_b64":"bOsOMcXnJGn08L/8KHJuu23dp2PFSEwdXJWKieFJwkUJDviX01Ly35sjWP9NiKd81pBxX3lyLKYx+VGCBeCcBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16a0c685a5893f0d038b5440465bbf098d3a0714f349a7d7a2daff3634e66889","last_reissued_at":"2026-05-18T03:10:57.437394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:57.437394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.2277","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-18T03:10:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gSWiSA+j+kaAVvXBBuiP4JZo3P7DofDtDYUplWeSjtEaEAJlIT6OCiLLw7RfQmNezwzycDW8SFt7gmFNbfZ9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:25:39.157564Z"},"content_sha256":"f01a69ac2a9a82b5deccbd91fd19af1b74263bb5073d76ed1d48b0f96d9463b1","schema_version":"1.0","event_id":"sha256:f01a69ac2a9a82b5deccbd91fd19af1b74263bb5073d76ed1d48b0f96d9463b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:C2QMNBNFRE7Q2A4LKRAEMW57BG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On sets of integers which contain no three terms in geometric progression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Nathan McNew","submitted_at":"2013-10-08T20:46:29Z","abstract_excerpt":"The problem of looking for subsets of the natural numbers which contain no 3-term arithmetic progressions has a rich history. Roth's theorem famously shows that any such subset cannot have positive upper density. In contrast, Rankin in 1960 suggested looking at subsets without three-term geometric progressions, and constructed such a subset with density about 0.719. More recently, several authors have found upper bounds for the upper density of such sets. We significantly improve upon these bounds, and demonstrate a method of constructing sets with a greater upper density than Rankin's set. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2277","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-18T03:10:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uYNlLpovF/7iYVVg0P3DZKueVm+8GPjHrf1OTsfqFmp+HMZjUx0u2hSnMTDqsx1XV4+L6NUwDyGealTwNGmxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:25:39.158131Z"},"content_sha256":"1802929f9b1d0dad3ec56f75c17d01497f2073a0f78e2c0c425cbd571abdbd23","schema_version":"1.0","event_id":"sha256:1802929f9b1d0dad3ec56f75c17d01497f2073a0f78e2c0c425cbd571abdbd23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C2QMNBNFRE7Q2A4LKRAEMW57BG/bundle.json","state_url":"https://pith.science/pith/C2QMNBNFRE7Q2A4LKRAEMW57BG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C2QMNBNFRE7Q2A4LKRAEMW57BG/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-02T17:25:39Z","links":{"resolver":"https://pith.science/pith/C2QMNBNFRE7Q2A4LKRAEMW57BG","bundle":"https://pith.science/pith/C2QMNBNFRE7Q2A4LKRAEMW57BG/bundle.json","state":"https://pith.science/pith/C2QMNBNFRE7Q2A4LKRAEMW57BG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C2QMNBNFRE7Q2A4LKRAEMW57BG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:C2QMNBNFRE7Q2A4LKRAEMW57BG","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":"cfc5db2caa9ba33872abe7bc136e572b6b6a8761d035b2a09395089473aa7cf4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-10-08T20:46:29Z","title_canon_sha256":"881bdc403b758ccb198356b8bbf6a773c2a65c4632b5050bf000847af4a595ab"},"schema_version":"1.0","source":{"id":"1310.2277","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2277","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2277v1","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2277","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"C2QMNBNFRE7Q","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C2QMNBNFRE7Q2A4L","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C2QMNBNF","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:1802929f9b1d0dad3ec56f75c17d01497f2073a0f78e2c0c425cbd571abdbd23","target":"graph","created_at":"2026-05-18T03:10:57Z","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":"The problem of looking for subsets of the natural numbers which contain no 3-term arithmetic progressions has a rich history. Roth's theorem famously shows that any such subset cannot have positive upper density. In contrast, Rankin in 1960 suggested looking at subsets without three-term geometric progressions, and constructed such a subset with density about 0.719. More recently, several authors have found upper bounds for the upper density of such sets. We significantly improve upon these bounds, and demonstrate a method of constructing sets with a greater upper density than Rankin's set. Th","authors_text":"Nathan McNew","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-10-08T20:46:29Z","title":"On sets of integers which contain no three terms in geometric progression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2277","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:f01a69ac2a9a82b5deccbd91fd19af1b74263bb5073d76ed1d48b0f96d9463b1","target":"record","created_at":"2026-05-18T03:10:57Z","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":"cfc5db2caa9ba33872abe7bc136e572b6b6a8761d035b2a09395089473aa7cf4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-10-08T20:46:29Z","title_canon_sha256":"881bdc403b758ccb198356b8bbf6a773c2a65c4632b5050bf000847af4a595ab"},"schema_version":"1.0","source":{"id":"1310.2277","kind":"arxiv","version":1}},"canonical_sha256":"16a0c685a5893f0d038b5440465bbf098d3a0714f349a7d7a2daff3634e66889","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16a0c685a5893f0d038b5440465bbf098d3a0714f349a7d7a2daff3634e66889","first_computed_at":"2026-05-18T03:10:57.437394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:57.437394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bOsOMcXnJGn08L/8KHJuu23dp2PFSEwdXJWKieFJwkUJDviX01Ly35sjWP9NiKd81pBxX3lyLKYx+VGCBeCcBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:57.438236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2277","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f01a69ac2a9a82b5deccbd91fd19af1b74263bb5073d76ed1d48b0f96d9463b1","sha256:1802929f9b1d0dad3ec56f75c17d01497f2073a0f78e2c0c425cbd571abdbd23"],"state_sha256":"5cca50b393f3cde751c336404909a267338374083e73191112a8ccb236aaf7a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4cmPFgktcK8IvmVU8ra2kpqruk5vA/eRqgsK2ztj80FMFamspUmTB7mAlZBKzI2ZW7HmFyUot1pcOtBo3aLzAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:25:39.161130Z","bundle_sha256":"07c539893ff5469c2b1dd6b749d79fe120993370bdc853657b4765957c151a1f"}}