{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RWGTDMFTLL647QFGBUMMQT7GOV","short_pith_number":"pith:RWGTDMFT","schema_version":"1.0","canonical_sha256":"8d8d31b0b35afdcfc0a60d18c84fe67564fc9ddea3a3aa8eb8257ccf79e7b8fd","source":{"kind":"arxiv","id":"1608.03857","version":1},"attestation_state":"computed","paper":{"title":"The sharp threshold for making squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"math.NT","authors_text":"B\\'ela Bollob\\'as, Paul Balister, Robert Morris","submitted_at":"2016-08-12T17:43:02Z","abstract_excerpt":"Consider a random sequence of $N$ integers, each chosen uniformly and independently from the set $\\{1,\\dots,x\\}$. Motivated by applications to factorisation algorithms such as Dixon's algorithm, the quadratic sieve, and the number field sieve, Pomerance in 1994 posed the following problem: how large should $N$ be so that, with high probability, this sequence contains a subsequence, the product of whose elements is a perfect square? Pomerance determined asymptotically the logarithm of the threshold for this event, and conjectured that it in fact exhibits a sharp threshold in $N$. More recently,"},"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":"1608.03857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-08-12T17:43:02Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"34e6a0d13e30cfa0c000771374c56c0ae94f1bd504c1efe15fc54ecb4356c596","abstract_canon_sha256":"5f0cda8198d830c9a67cbd43d8ab57c470b012c76cec31f51db160de2933566d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:11.167792Z","signature_b64":"RqfyoJ3j1bwxotjgltJxjRSKt69dWALN3sZ77xMdYFVQEY9X2Q86tlDOa3kHuCM29oBVBcdIzrPo46+AkXLWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d8d31b0b35afdcfc0a60d18c84fe67564fc9ddea3a3aa8eb8257ccf79e7b8fd","last_reissued_at":"2026-05-18T01:09:11.167202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:11.167202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The sharp threshold for making squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"math.NT","authors_text":"B\\'ela Bollob\\'as, Paul Balister, Robert Morris","submitted_at":"2016-08-12T17:43:02Z","abstract_excerpt":"Consider a random sequence of $N$ integers, each chosen uniformly and independently from the set $\\{1,\\dots,x\\}$. Motivated by applications to factorisation algorithms such as Dixon's algorithm, the quadratic sieve, and the number field sieve, Pomerance in 1994 posed the following problem: how large should $N$ be so that, with high probability, this sequence contains a subsequence, the product of whose elements is a perfect square? Pomerance determined asymptotically the logarithm of the threshold for this event, and conjectured that it in fact exhibits a sharp threshold in $N$. More recently,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03857","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.03857","created_at":"2026-05-18T01:09:11.167292+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03857v1","created_at":"2026-05-18T01:09:11.167292+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03857","created_at":"2026-05-18T01:09:11.167292+00:00"},{"alias_kind":"pith_short_12","alias_value":"RWGTDMFTLL64","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RWGTDMFTLL647QFG","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RWGTDMFT","created_at":"2026-05-18T12:30:41.710351+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/RWGTDMFTLL647QFGBUMMQT7GOV","json":"https://pith.science/pith/RWGTDMFTLL647QFGBUMMQT7GOV.json","graph_json":"https://pith.science/api/pith-number/RWGTDMFTLL647QFGBUMMQT7GOV/graph.json","events_json":"https://pith.science/api/pith-number/RWGTDMFTLL647QFGBUMMQT7GOV/events.json","paper":"https://pith.science/paper/RWGTDMFT"},"agent_actions":{"view_html":"https://pith.science/pith/RWGTDMFTLL647QFGBUMMQT7GOV","download_json":"https://pith.science/pith/RWGTDMFTLL647QFGBUMMQT7GOV.json","view_paper":"https://pith.science/paper/RWGTDMFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03857&json=true","fetch_graph":"https://pith.science/api/pith-number/RWGTDMFTLL647QFGBUMMQT7GOV/graph.json","fetch_events":"https://pith.science/api/pith-number/RWGTDMFTLL647QFGBUMMQT7GOV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RWGTDMFTLL647QFGBUMMQT7GOV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RWGTDMFTLL647QFGBUMMQT7GOV/action/storage_attestation","attest_author":"https://pith.science/pith/RWGTDMFTLL647QFGBUMMQT7GOV/action/author_attestation","sign_citation":"https://pith.science/pith/RWGTDMFTLL647QFGBUMMQT7GOV/action/citation_signature","submit_replication":"https://pith.science/pith/RWGTDMFTLL647QFGBUMMQT7GOV/action/replication_record"}},"created_at":"2026-05-18T01:09:11.167292+00:00","updated_at":"2026-05-18T01:09:11.167292+00:00"}