{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:NTU7KBGI5GCQAVGD247ABZEPHA","short_pith_number":"pith:NTU7KBGI","schema_version":"1.0","canonical_sha256":"6ce9f504c8e9850054c3d73e00e48f383adf967a24b30b98088ccdeee0ad5225","source":{"kind":"arxiv","id":"0904.0473","version":4},"attestation_state":"computed","paper":{"title":"Prime chains and Pratt trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.NT","authors_text":"Florian Luca, Kevin Ford, Sergei V. Konyagin","submitted_at":"2009-04-02T21:46:53Z","abstract_excerpt":"We study the distribution of prime chains, which are sequences p_1,...,p_k of primes for which p_{j+1}\\equiv 1\\pmod{p_j} for each j. We give estimates for the number of chains with p_k\\le x (k variable), and the number of chains with p_1=p and p_k \\le px. The majority of the paper concerns the distribution of H(p), the length of the longest chain with p_k=p, which is also the height of the Pratt tree for p. We show H(p)\\ge c\\log\\log p and H(p)\\le (\\log p)^{1-c'} for almost all p, with c,c' explicit positive constants. We can take, for any \\epsilon>0, c=e-\\epsilon assuming the Elliott-Halbersta"},"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":"0904.0473","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2009-04-02T21:46:53Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"4e19c563f49c95b1bfd5f88963e8d924d2e2638c183259aa4e0e5e8f532a680f","abstract_canon_sha256":"13e512503900397c303fb369c4709587577cf35add7b3cae8b87ecb9809cba0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:37.369635Z","signature_b64":"0iuSVfuUWFQc3Lt9g2dS0SsA7+78e/KNy4AAAVApijThEkMQ4mc1t71nKZtZlTiYfIiWI+koCshgiHemZISpCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ce9f504c8e9850054c3d73e00e48f383adf967a24b30b98088ccdeee0ad5225","last_reissued_at":"2026-05-18T04:34:37.369147Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:37.369147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prime chains and Pratt trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.NT","authors_text":"Florian Luca, Kevin Ford, Sergei V. Konyagin","submitted_at":"2009-04-02T21:46:53Z","abstract_excerpt":"We study the distribution of prime chains, which are sequences p_1,...,p_k of primes for which p_{j+1}\\equiv 1\\pmod{p_j} for each j. We give estimates for the number of chains with p_k\\le x (k variable), and the number of chains with p_1=p and p_k \\le px. The majority of the paper concerns the distribution of H(p), the length of the longest chain with p_k=p, which is also the height of the Pratt tree for p. We show H(p)\\ge c\\log\\log p and H(p)\\le (\\log p)^{1-c'} for almost all p, with c,c' explicit positive constants. We can take, for any \\epsilon>0, c=e-\\epsilon assuming the Elliott-Halbersta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.0473","kind":"arxiv","version":4},"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":"0904.0473","created_at":"2026-05-18T04:34:37.369225+00:00"},{"alias_kind":"arxiv_version","alias_value":"0904.0473v4","created_at":"2026-05-18T04:34:37.369225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.0473","created_at":"2026-05-18T04:34:37.369225+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTU7KBGI5GCQ","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTU7KBGI5GCQAVGD","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTU7KBGI","created_at":"2026-05-18T12:26:00.592388+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.20475","citing_title":"Bounded-box reductions in the Subbarao-Warren problem for unitary perfect numbers","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NTU7KBGI5GCQAVGD247ABZEPHA","json":"https://pith.science/pith/NTU7KBGI5GCQAVGD247ABZEPHA.json","graph_json":"https://pith.science/api/pith-number/NTU7KBGI5GCQAVGD247ABZEPHA/graph.json","events_json":"https://pith.science/api/pith-number/NTU7KBGI5GCQAVGD247ABZEPHA/events.json","paper":"https://pith.science/paper/NTU7KBGI"},"agent_actions":{"view_html":"https://pith.science/pith/NTU7KBGI5GCQAVGD247ABZEPHA","download_json":"https://pith.science/pith/NTU7KBGI5GCQAVGD247ABZEPHA.json","view_paper":"https://pith.science/paper/NTU7KBGI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0904.0473&json=true","fetch_graph":"https://pith.science/api/pith-number/NTU7KBGI5GCQAVGD247ABZEPHA/graph.json","fetch_events":"https://pith.science/api/pith-number/NTU7KBGI5GCQAVGD247ABZEPHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTU7KBGI5GCQAVGD247ABZEPHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTU7KBGI5GCQAVGD247ABZEPHA/action/storage_attestation","attest_author":"https://pith.science/pith/NTU7KBGI5GCQAVGD247ABZEPHA/action/author_attestation","sign_citation":"https://pith.science/pith/NTU7KBGI5GCQAVGD247ABZEPHA/action/citation_signature","submit_replication":"https://pith.science/pith/NTU7KBGI5GCQAVGD247ABZEPHA/action/replication_record"}},"created_at":"2026-05-18T04:34:37.369225+00:00","updated_at":"2026-05-18T04:34:37.369225+00:00"}