{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:N732Z3JMP2MQVGVVRH6LK5WBMV","short_pith_number":"pith:N732Z3JM","canonical_record":{"source":{"id":"2606.08216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-06-06T15:10:08Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"d36ae5d43297e452c0e055a7b81b5dd0b9ba36096f2b0bc3e7e3c92fb8a10f35","abstract_canon_sha256":"294360b8f3d7a5c293beb2ccaedde6a3687a30f0feab732ec71407f0e83128f1"},"schema_version":"1.0"},"canonical_sha256":"6ff7aced2c7e990a9ab589fcb576c165452218d26c11cf286a2a692a6f129bcb","source":{"kind":"arxiv","id":"2606.08216","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.08216","created_at":"2026-06-09T01:05:30Z"},{"alias_kind":"arxiv_version","alias_value":"2606.08216v1","created_at":"2026-06-09T01:05:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08216","created_at":"2026-06-09T01:05:30Z"},{"alias_kind":"pith_short_12","alias_value":"N732Z3JMP2MQ","created_at":"2026-06-09T01:05:30Z"},{"alias_kind":"pith_short_16","alias_value":"N732Z3JMP2MQVGVV","created_at":"2026-06-09T01:05:30Z"},{"alias_kind":"pith_short_8","alias_value":"N732Z3JM","created_at":"2026-06-09T01:05:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:N732Z3JMP2MQVGVVRH6LK5WBMV","target":"record","payload":{"canonical_record":{"source":{"id":"2606.08216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-06-06T15:10:08Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"d36ae5d43297e452c0e055a7b81b5dd0b9ba36096f2b0bc3e7e3c92fb8a10f35","abstract_canon_sha256":"294360b8f3d7a5c293beb2ccaedde6a3687a30f0feab732ec71407f0e83128f1"},"schema_version":"1.0"},"canonical_sha256":"6ff7aced2c7e990a9ab589fcb576c165452218d26c11cf286a2a692a6f129bcb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:30.327193Z","signature_b64":"uX9O59ZbG6CZ6WrDNZMqih1xpofotlKF5jvGCTleB2k9z1luEl+W6YI2MskdDpRIrb9gofbm1UWL/NB+c2+vCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ff7aced2c7e990a9ab589fcb576c165452218d26c11cf286a2a692a6f129bcb","last_reissued_at":"2026-06-09T01:05:30.326748Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:30.326748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.08216","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-06-09T01:05:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G9HpFzH4G9Lkhies8I+DSFxTzuQtrVtO9tKsaTpdIsqnCBDuXdE0bU0cZJjNVUseQ7Q+/sqQGZ7GSX4JeM2XDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T22:19:19.081351Z"},"content_sha256":"2cacc8c439d5363900909fbd56aab7f618c37815f96a92610e914878b59669e9","schema_version":"1.0","event_id":"sha256:2cacc8c439d5363900909fbd56aab7f618c37815f96a92610e914878b59669e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:N732Z3JMP2MQVGVVRH6LK5WBMV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Erd\\H{o}s Problem 684 at Density One: Small-prime Parts of Binomial Coefficients and Gaussian Fluctuations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.NT","authors_text":"Eric Li (Trinity College, United Kingdom), University of Cambridge","submitted_at":"2026-06-06T15:10:08Z","abstract_excerpt":"For $0\\leq k\\leq n$, let $u(n,k)$ be the largest divisor of $\\binom nk$ whose prime factors are at most $k$. Erd\\H{o}s Problem #684 concerns the special threshold $u(n,k)>n^2$ and asks how early this small-prime part can be forced to become large. We prove the density-one analogue for every fixed power threshold. If $f_c(n)$ is the least $k$ for which $u(n,k)>n^c$, then, for each fixed $c>0$, \\[ f_c(n)=\\left(\\frac{c}{1-\\gamma}+o(1)\\right)\\log n \\] for almost all positive integers $n$. In particular, \\[ f_2(n)=\\left(\\frac{2}{1-\\gamma}+o(1)\\right)\\log n =(4.730544237\\ldots+o(1))\\log n \\] for the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08216","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.08216/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-09T01:05:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xHY2bYW3xF623HnKrFkNNP/WPs+jF7dYoOlUPF3xUvc8y7o5lFeZWme9zaciQT1O2BEA5N7z0jiN8nIt/1aqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T22:19:19.081726Z"},"content_sha256":"0b34a1e91ee52a2b68e6514863a3630ea00a96c6db3f9899536ec689c9b39e7a","schema_version":"1.0","event_id":"sha256:0b34a1e91ee52a2b68e6514863a3630ea00a96c6db3f9899536ec689c9b39e7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N732Z3JMP2MQVGVVRH6LK5WBMV/bundle.json","state_url":"https://pith.science/pith/N732Z3JMP2MQVGVVRH6LK5WBMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N732Z3JMP2MQVGVVRH6LK5WBMV/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-29T22:19:19Z","links":{"resolver":"https://pith.science/pith/N732Z3JMP2MQVGVVRH6LK5WBMV","bundle":"https://pith.science/pith/N732Z3JMP2MQVGVVRH6LK5WBMV/bundle.json","state":"https://pith.science/pith/N732Z3JMP2MQVGVVRH6LK5WBMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N732Z3JMP2MQVGVVRH6LK5WBMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:N732Z3JMP2MQVGVVRH6LK5WBMV","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":"294360b8f3d7a5c293beb2ccaedde6a3687a30f0feab732ec71407f0e83128f1","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-06-06T15:10:08Z","title_canon_sha256":"d36ae5d43297e452c0e055a7b81b5dd0b9ba36096f2b0bc3e7e3c92fb8a10f35"},"schema_version":"1.0","source":{"id":"2606.08216","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.08216","created_at":"2026-06-09T01:05:30Z"},{"alias_kind":"arxiv_version","alias_value":"2606.08216v1","created_at":"2026-06-09T01:05:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08216","created_at":"2026-06-09T01:05:30Z"},{"alias_kind":"pith_short_12","alias_value":"N732Z3JMP2MQ","created_at":"2026-06-09T01:05:30Z"},{"alias_kind":"pith_short_16","alias_value":"N732Z3JMP2MQVGVV","created_at":"2026-06-09T01:05:30Z"},{"alias_kind":"pith_short_8","alias_value":"N732Z3JM","created_at":"2026-06-09T01:05:30Z"}],"graph_snapshots":[{"event_id":"sha256:0b34a1e91ee52a2b68e6514863a3630ea00a96c6db3f9899536ec689c9b39e7a","target":"graph","created_at":"2026-06-09T01:05:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.08216/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For $0\\leq k\\leq n$, let $u(n,k)$ be the largest divisor of $\\binom nk$ whose prime factors are at most $k$. Erd\\H{o}s Problem #684 concerns the special threshold $u(n,k)>n^2$ and asks how early this small-prime part can be forced to become large. We prove the density-one analogue for every fixed power threshold. If $f_c(n)$ is the least $k$ for which $u(n,k)>n^c$, then, for each fixed $c>0$, \\[ f_c(n)=\\left(\\frac{c}{1-\\gamma}+o(1)\\right)\\log n \\] for almost all positive integers $n$. In particular, \\[ f_2(n)=\\left(\\frac{2}{1-\\gamma}+o(1)\\right)\\log n =(4.730544237\\ldots+o(1))\\log n \\] for the","authors_text":"Eric Li (Trinity College, United Kingdom), University of Cambridge","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-06-06T15:10:08Z","title":"Erd\\H{o}s Problem 684 at Density One: Small-prime Parts of Binomial Coefficients and Gaussian Fluctuations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08216","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:2cacc8c439d5363900909fbd56aab7f618c37815f96a92610e914878b59669e9","target":"record","created_at":"2026-06-09T01:05:30Z","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":"294360b8f3d7a5c293beb2ccaedde6a3687a30f0feab732ec71407f0e83128f1","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-06-06T15:10:08Z","title_canon_sha256":"d36ae5d43297e452c0e055a7b81b5dd0b9ba36096f2b0bc3e7e3c92fb8a10f35"},"schema_version":"1.0","source":{"id":"2606.08216","kind":"arxiv","version":1}},"canonical_sha256":"6ff7aced2c7e990a9ab589fcb576c165452218d26c11cf286a2a692a6f129bcb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ff7aced2c7e990a9ab589fcb576c165452218d26c11cf286a2a692a6f129bcb","first_computed_at":"2026-06-09T01:05:30.326748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:05:30.326748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uX9O59ZbG6CZ6WrDNZMqih1xpofotlKF5jvGCTleB2k9z1luEl+W6YI2MskdDpRIrb9gofbm1UWL/NB+c2+vCQ==","signature_status":"signed_v1","signed_at":"2026-06-09T01:05:30.327193Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.08216","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2cacc8c439d5363900909fbd56aab7f618c37815f96a92610e914878b59669e9","sha256:0b34a1e91ee52a2b68e6514863a3630ea00a96c6db3f9899536ec689c9b39e7a"],"state_sha256":"b02c2232e7e4ea6db206f1e65f310aee8c2c95878d90da5071538c5463a671c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BnFu1huYAP3GjCXEPprDk5Ovh0QAQvZ6txce4UpsRGBfCFXPuiO64mvQj+bkipFhvZRWqJH+ktN7pqdGcmw7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T22:19:19.083786Z","bundle_sha256":"73154d7da782c9af0a59ebed1fb75bad0274f332d3c74bd3d6b901f767c6a162"}}