{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:SAKEMWYVBPP4L5I4FAVQ5R56FT","short_pith_number":"pith:SAKEMWYV","canonical_record":{"source":{"id":"2508.06463","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-08-08T17:12:24Z","cross_cats_sorted":[],"title_canon_sha256":"a02198568170025b18e961adf66f2ad8b6de6e57833611a498dbca3921ce9ff6","abstract_canon_sha256":"c9e641b57db260f49f97cb11b73b96aab0d30d0618a2b2de9cd6fd15bbd919e9"},"schema_version":"1.0"},"canonical_sha256":"9014465b150bdfc5f51c282b0ec7be2cf5c9e9039b10c1ff50a0f59fd6666a38","source":{"kind":"arxiv","id":"2508.06463","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.06463","created_at":"2026-07-05T11:50:56Z"},{"alias_kind":"arxiv_version","alias_value":"2508.06463v1","created_at":"2026-07-05T11:50:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.06463","created_at":"2026-07-05T11:50:56Z"},{"alias_kind":"pith_short_12","alias_value":"SAKEMWYVBPP4","created_at":"2026-07-05T11:50:56Z"},{"alias_kind":"pith_short_16","alias_value":"SAKEMWYVBPP4L5I4","created_at":"2026-07-05T11:50:56Z"},{"alias_kind":"pith_short_8","alias_value":"SAKEMWYV","created_at":"2026-07-05T11:50:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:SAKEMWYVBPP4L5I4FAVQ5R56FT","target":"record","payload":{"canonical_record":{"source":{"id":"2508.06463","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-08-08T17:12:24Z","cross_cats_sorted":[],"title_canon_sha256":"a02198568170025b18e961adf66f2ad8b6de6e57833611a498dbca3921ce9ff6","abstract_canon_sha256":"c9e641b57db260f49f97cb11b73b96aab0d30d0618a2b2de9cd6fd15bbd919e9"},"schema_version":"1.0"},"canonical_sha256":"9014465b150bdfc5f51c282b0ec7be2cf5c9e9039b10c1ff50a0f59fd6666a38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:56.782535Z","signature_b64":"hYJarwBSOPZ1T6DyeQ2VYg0UpLIfpIHyjEp5pcLPY8vgjQH9wR6BDZrsKJGxVqPxHb4Rip3M8rPJnm94773OBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9014465b150bdfc5f51c282b0ec7be2cf5c9e9039b10c1ff50a0f59fd6666a38","last_reissued_at":"2026-07-05T11:50:56.782066Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:56.782066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.06463","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-07-05T11:50:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HaF+Oo/JDlQhNNS15I02zbxg97NKWsE6G3rW5qoH2MtYW7XHixS/XQ/v9lMy+Njk/fBTta4xVdNFvSAUoI0fAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T13:28:39.231243Z"},"content_sha256":"91e2c7dff386e5e084cd286ea577fc43a0cae734b4e1b103a82617482698b2b4","schema_version":"1.0","event_id":"sha256:91e2c7dff386e5e084cd286ea577fc43a0cae734b4e1b103a82617482698b2b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:SAKEMWYVBPP4L5I4FAVQ5R56FT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rough numbers between consecutive primes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Ayla Gafni, Terence Tao","submitted_at":"2025-08-08T17:12:24Z","abstract_excerpt":"Using a sieve-theoretic argument, we show that almost all gaps $(p_n, p_{n+1})$ between consecutive primes $p_n, p_{n+1}$ contain a natural number $m$ whose least prime factor $p(m)$ is at least the length $p_{n+1} - p_n$ of the gap, confirming a prediction of Erd\\H{o}s. In fact the number $N(X)$ of exceptional gaps with $p_n \\in [X,2X]$ is shown to be at most $O(X/\\log^2 X)$. Assuming a form of the Hardy--Littlewood prime tuples conjecture, we establish a more precise asymptotic $N(X) \\sim c X / \\log^2 X$ for an explicit constant $c>0$, which we believe to be between $2.7$ and $2.8$. To obtai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.06463","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/2508.06463/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-07-05T11:50:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vx49safdj3nC6DTSQfvmWC5PYlXxWy7SHPtxoMIJwutqJbG3Ku2SCXGvFVDauyp3/AxbFvjXxPJS2YjWd+AoBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T13:28:39.231935Z"},"content_sha256":"75470e112130eef39f3102cd456d8777d4f20d40643aaf94bf5dcf7408ca9d8e","schema_version":"1.0","event_id":"sha256:75470e112130eef39f3102cd456d8777d4f20d40643aaf94bf5dcf7408ca9d8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SAKEMWYVBPP4L5I4FAVQ5R56FT/bundle.json","state_url":"https://pith.science/pith/SAKEMWYVBPP4L5I4FAVQ5R56FT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SAKEMWYVBPP4L5I4FAVQ5R56FT/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-08-11T13:28:39Z","links":{"resolver":"https://pith.science/pith/SAKEMWYVBPP4L5I4FAVQ5R56FT","bundle":"https://pith.science/pith/SAKEMWYVBPP4L5I4FAVQ5R56FT/bundle.json","state":"https://pith.science/pith/SAKEMWYVBPP4L5I4FAVQ5R56FT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SAKEMWYVBPP4L5I4FAVQ5R56FT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:SAKEMWYVBPP4L5I4FAVQ5R56FT","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":"c9e641b57db260f49f97cb11b73b96aab0d30d0618a2b2de9cd6fd15bbd919e9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-08-08T17:12:24Z","title_canon_sha256":"a02198568170025b18e961adf66f2ad8b6de6e57833611a498dbca3921ce9ff6"},"schema_version":"1.0","source":{"id":"2508.06463","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.06463","created_at":"2026-07-05T11:50:56Z"},{"alias_kind":"arxiv_version","alias_value":"2508.06463v1","created_at":"2026-07-05T11:50:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.06463","created_at":"2026-07-05T11:50:56Z"},{"alias_kind":"pith_short_12","alias_value":"SAKEMWYVBPP4","created_at":"2026-07-05T11:50:56Z"},{"alias_kind":"pith_short_16","alias_value":"SAKEMWYVBPP4L5I4","created_at":"2026-07-05T11:50:56Z"},{"alias_kind":"pith_short_8","alias_value":"SAKEMWYV","created_at":"2026-07-05T11:50:56Z"}],"graph_snapshots":[{"event_id":"sha256:75470e112130eef39f3102cd456d8777d4f20d40643aaf94bf5dcf7408ca9d8e","target":"graph","created_at":"2026-07-05T11:50:56Z","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/2508.06463/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Using a sieve-theoretic argument, we show that almost all gaps $(p_n, p_{n+1})$ between consecutive primes $p_n, p_{n+1}$ contain a natural number $m$ whose least prime factor $p(m)$ is at least the length $p_{n+1} - p_n$ of the gap, confirming a prediction of Erd\\H{o}s. In fact the number $N(X)$ of exceptional gaps with $p_n \\in [X,2X]$ is shown to be at most $O(X/\\log^2 X)$. Assuming a form of the Hardy--Littlewood prime tuples conjecture, we establish a more precise asymptotic $N(X) \\sim c X / \\log^2 X$ for an explicit constant $c>0$, which we believe to be between $2.7$ and $2.8$. To obtai","authors_text":"Ayla Gafni, Terence Tao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-08-08T17:12:24Z","title":"Rough numbers between consecutive primes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.06463","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:91e2c7dff386e5e084cd286ea577fc43a0cae734b4e1b103a82617482698b2b4","target":"record","created_at":"2026-07-05T11:50:56Z","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":"c9e641b57db260f49f97cb11b73b96aab0d30d0618a2b2de9cd6fd15bbd919e9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-08-08T17:12:24Z","title_canon_sha256":"a02198568170025b18e961adf66f2ad8b6de6e57833611a498dbca3921ce9ff6"},"schema_version":"1.0","source":{"id":"2508.06463","kind":"arxiv","version":1}},"canonical_sha256":"9014465b150bdfc5f51c282b0ec7be2cf5c9e9039b10c1ff50a0f59fd6666a38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9014465b150bdfc5f51c282b0ec7be2cf5c9e9039b10c1ff50a0f59fd6666a38","first_computed_at":"2026-07-05T11:50:56.782066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:50:56.782066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hYJarwBSOPZ1T6DyeQ2VYg0UpLIfpIHyjEp5pcLPY8vgjQH9wR6BDZrsKJGxVqPxHb4Rip3M8rPJnm94773OBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:50:56.782535Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.06463","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91e2c7dff386e5e084cd286ea577fc43a0cae734b4e1b103a82617482698b2b4","sha256:75470e112130eef39f3102cd456d8777d4f20d40643aaf94bf5dcf7408ca9d8e"],"state_sha256":"49c358909e7bd2f344e5b058801d373eb98a45e75fc856c80136eeb6c72bbdc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kouy/1X9oYUwp3MPswlZAMQAFOxNH+uBZnDE/EJAJqdHyqqqdLw8xtXftUfheqMt0RyX9Le+otRgBXfd5PNyDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T13:28:39.236876Z","bundle_sha256":"c104f4b003de3681898488170ac5005fca72cf5470f7355fb62619bc0ecb7e59"}}