{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RWGTDMFTLL647QFGBUMMQT7GOV","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":"5f0cda8198d830c9a67cbd43d8ab57c470b012c76cec31f51db160de2933566d","cross_cats_sorted":["math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-08-12T17:43:02Z","title_canon_sha256":"34e6a0d13e30cfa0c000771374c56c0ae94f1bd504c1efe15fc54ecb4356c596"},"schema_version":"1.0","source":{"id":"1608.03857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03857","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03857v1","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03857","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"pith_short_12","alias_value":"RWGTDMFTLL64","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RWGTDMFTLL647QFG","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RWGTDMFT","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:e422bd9c345c837864731f3e7a69c9571839f1eedcb8cbbe365d47ed314cfef5","target":"graph","created_at":"2026-05-18T01:09:11Z","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":"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,","authors_text":"B\\'ela Bollob\\'as, Paul Balister, Robert Morris","cross_cats":["math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-08-12T17:43:02Z","title":"The sharp threshold for making squares"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03857","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:e91da03046c4d60bdfea361d07872cc1a2e97b05a5aae5aa4bf0c9e865e1bf74","target":"record","created_at":"2026-05-18T01:09:11Z","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":"5f0cda8198d830c9a67cbd43d8ab57c470b012c76cec31f51db160de2933566d","cross_cats_sorted":["math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-08-12T17:43:02Z","title_canon_sha256":"34e6a0d13e30cfa0c000771374c56c0ae94f1bd504c1efe15fc54ecb4356c596"},"schema_version":"1.0","source":{"id":"1608.03857","kind":"arxiv","version":1}},"canonical_sha256":"8d8d31b0b35afdcfc0a60d18c84fe67564fc9ddea3a3aa8eb8257ccf79e7b8fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d8d31b0b35afdcfc0a60d18c84fe67564fc9ddea3a3aa8eb8257ccf79e7b8fd","first_computed_at":"2026-05-18T01:09:11.167202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:11.167202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RqfyoJ3j1bwxotjgltJxjRSKt69dWALN3sZ77xMdYFVQEY9X2Q86tlDOa3kHuCM29oBVBcdIzrPo46+AkXLWBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:11.167792Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e91da03046c4d60bdfea361d07872cc1a2e97b05a5aae5aa4bf0c9e865e1bf74","sha256:e422bd9c345c837864731f3e7a69c9571839f1eedcb8cbbe365d47ed314cfef5"],"state_sha256":"e1bff6c69feacae07d1283c165dbf1d2e6843fdefbb91a9c5a033ed55a5721d9"}