{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TI7TKBK7RJ7XX5GNOM3CHQRACV","short_pith_number":"pith:TI7TKBK7","schema_version":"1.0","canonical_sha256":"9a3f35055f8a7f7bf4cd733623c2201558a8c618f86d934653f302d5f549e760","source":{"kind":"arxiv","id":"1607.01557","version":4},"attestation_state":"computed","paper":{"title":"Squarefree smooth numbers and Euclidean prime generators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andrew R. Booker, Carl Pomerance","submitted_at":"2016-07-06T11:00:56Z","abstract_excerpt":"We show that for each prime p > 7, every residue mod p can be represented by a squarefree number with largest prime factor at most p. We give two applications to recursive prime generators akin to the one Euclid used to prove the infinitude of primes."},"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":"1607.01557","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-07-06T11:00:56Z","cross_cats_sorted":[],"title_canon_sha256":"f408c99ef15285848efb1a4200e2e4e1c465c8beba714598d4dc17a7c5e72b94","abstract_canon_sha256":"5363d96d491c8d8d2d2200672228134476cf30ecff380a0f9306a76ad62b9880"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:49.300580Z","signature_b64":"mX4PGAW+ewssXEIb7r38CRgCKZiwDPNm5fbCkxl6MWqbu1i/Zt3MRsBuh+4OpYPFJqMeogT3KP040eGL7jmmDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a3f35055f8a7f7bf4cd733623c2201558a8c618f86d934653f302d5f549e760","last_reissued_at":"2026-05-18T00:46:49.299905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:49.299905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Squarefree smooth numbers and Euclidean prime generators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andrew R. Booker, Carl Pomerance","submitted_at":"2016-07-06T11:00:56Z","abstract_excerpt":"We show that for each prime p > 7, every residue mod p can be represented by a squarefree number with largest prime factor at most p. We give two applications to recursive prime generators akin to the one Euclid used to prove the infinitude of primes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01557","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.01557","created_at":"2026-05-18T00:46:49.300019+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.01557v4","created_at":"2026-05-18T00:46:49.300019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01557","created_at":"2026-05-18T00:46:49.300019+00:00"},{"alias_kind":"pith_short_12","alias_value":"TI7TKBK7RJ7X","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TI7TKBK7RJ7XX5GN","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TI7TKBK7","created_at":"2026-05-18T12:30:44.179134+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/TI7TKBK7RJ7XX5GNOM3CHQRACV","json":"https://pith.science/pith/TI7TKBK7RJ7XX5GNOM3CHQRACV.json","graph_json":"https://pith.science/api/pith-number/TI7TKBK7RJ7XX5GNOM3CHQRACV/graph.json","events_json":"https://pith.science/api/pith-number/TI7TKBK7RJ7XX5GNOM3CHQRACV/events.json","paper":"https://pith.science/paper/TI7TKBK7"},"agent_actions":{"view_html":"https://pith.science/pith/TI7TKBK7RJ7XX5GNOM3CHQRACV","download_json":"https://pith.science/pith/TI7TKBK7RJ7XX5GNOM3CHQRACV.json","view_paper":"https://pith.science/paper/TI7TKBK7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.01557&json=true","fetch_graph":"https://pith.science/api/pith-number/TI7TKBK7RJ7XX5GNOM3CHQRACV/graph.json","fetch_events":"https://pith.science/api/pith-number/TI7TKBK7RJ7XX5GNOM3CHQRACV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TI7TKBK7RJ7XX5GNOM3CHQRACV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TI7TKBK7RJ7XX5GNOM3CHQRACV/action/storage_attestation","attest_author":"https://pith.science/pith/TI7TKBK7RJ7XX5GNOM3CHQRACV/action/author_attestation","sign_citation":"https://pith.science/pith/TI7TKBK7RJ7XX5GNOM3CHQRACV/action/citation_signature","submit_replication":"https://pith.science/pith/TI7TKBK7RJ7XX5GNOM3CHQRACV/action/replication_record"}},"created_at":"2026-05-18T00:46:49.300019+00:00","updated_at":"2026-05-18T00:46:49.300019+00:00"}