{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:D4AH7UI67WSZ24KLX44HK4RLFX","short_pith_number":"pith:D4AH7UI6","schema_version":"1.0","canonical_sha256":"1f007fd11efda59d714bbf3875722b2dd325927ecd857d03f53aa0111bbfbd51","source":{"kind":"arxiv","id":"1903.03428","version":2},"attestation_state":"computed","paper":{"title":"A note on the normal largest gap between prime factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"G\\'erald Tenenbaum","submitted_at":"2019-02-27T14:20:53Z","abstract_excerpt":"Let $\\{p_j(n)\\}_{j=1}^{\\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. We provide details for the proof of a statement of Erd\\H{o}s implying that, for any function $\\xi(n)$ tending to infinity with $n$, we have $$f(n):=\\max_{1\\leqslant j<\\omega(n)}\\log \\Big({\\log p_{j+1}(n)\\over \\log p_j(n)}\\Big)=\\log_3n+O(\\xi(n))$$ for almost all integers $n$."},"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":"1903.03428","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-02-27T14:20:53Z","cross_cats_sorted":[],"title_canon_sha256":"8d0d935f7427a8687767eba91023ce9bbe339bfa49bef026d418af1d21945b21","abstract_canon_sha256":"36dc675b204870fffec0c156cc6308a3658346d310845a8bfa3fc4c864c81904"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:25.458130Z","signature_b64":"izyovqcUuD4WIKsPiUuIzbMHcJWjKtFw77j5eqsQjJ60rOQdWQ57nM9dwQagWdBg0ITLpUX9fKSx5SiZcE4pDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f007fd11efda59d714bbf3875722b2dd325927ecd857d03f53aa0111bbfbd51","last_reissued_at":"2026-05-17T23:47:25.457473Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:25.457473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on the normal largest gap between prime factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"G\\'erald Tenenbaum","submitted_at":"2019-02-27T14:20:53Z","abstract_excerpt":"Let $\\{p_j(n)\\}_{j=1}^{\\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. We provide details for the proof of a statement of Erd\\H{o}s implying that, for any function $\\xi(n)$ tending to infinity with $n$, we have $$f(n):=\\max_{1\\leqslant j<\\omega(n)}\\log \\Big({\\log p_{j+1}(n)\\over \\log p_j(n)}\\Big)=\\log_3n+O(\\xi(n))$$ for almost all integers $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03428","kind":"arxiv","version":2},"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":"1903.03428","created_at":"2026-05-17T23:47:25.457572+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.03428v2","created_at":"2026-05-17T23:47:25.457572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03428","created_at":"2026-05-17T23:47:25.457572+00:00"},{"alias_kind":"pith_short_12","alias_value":"D4AH7UI67WSZ","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"D4AH7UI67WSZ24KL","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"D4AH7UI6","created_at":"2026-05-18T12:33:15.570797+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/D4AH7UI67WSZ24KLX44HK4RLFX","json":"https://pith.science/pith/D4AH7UI67WSZ24KLX44HK4RLFX.json","graph_json":"https://pith.science/api/pith-number/D4AH7UI67WSZ24KLX44HK4RLFX/graph.json","events_json":"https://pith.science/api/pith-number/D4AH7UI67WSZ24KLX44HK4RLFX/events.json","paper":"https://pith.science/paper/D4AH7UI6"},"agent_actions":{"view_html":"https://pith.science/pith/D4AH7UI67WSZ24KLX44HK4RLFX","download_json":"https://pith.science/pith/D4AH7UI67WSZ24KLX44HK4RLFX.json","view_paper":"https://pith.science/paper/D4AH7UI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.03428&json=true","fetch_graph":"https://pith.science/api/pith-number/D4AH7UI67WSZ24KLX44HK4RLFX/graph.json","fetch_events":"https://pith.science/api/pith-number/D4AH7UI67WSZ24KLX44HK4RLFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D4AH7UI67WSZ24KLX44HK4RLFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D4AH7UI67WSZ24KLX44HK4RLFX/action/storage_attestation","attest_author":"https://pith.science/pith/D4AH7UI67WSZ24KLX44HK4RLFX/action/author_attestation","sign_citation":"https://pith.science/pith/D4AH7UI67WSZ24KLX44HK4RLFX/action/citation_signature","submit_replication":"https://pith.science/pith/D4AH7UI67WSZ24KLX44HK4RLFX/action/replication_record"}},"created_at":"2026-05-17T23:47:25.457572+00:00","updated_at":"2026-05-17T23:47:25.457572+00:00"}