{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:G5NXEVDLHMN6FC4L2ROPNJKLMS","short_pith_number":"pith:G5NXEVDL","schema_version":"1.0","canonical_sha256":"375b72546b3b1be28b8bd45cf6a54b648c4cedd5493d927d0c840bf60a9bcbae","source":{"kind":"arxiv","id":"1908.09420","version":3},"attestation_state":"computed","paper":{"title":"On the third largest prime divisor of an odd perfect number","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Joshua Zelinsky, Pieter Vyncke, Sean Bibby","submitted_at":"2019-08-26T00:52:57Z","abstract_excerpt":"Let $N$ be an odd perfect number and let $a$ be its third largest prime divisor, $b$ be the second largest prime divisor, and $c$ be its largest prime divisor. We discuss steps towards obtaining a non-trivial upper bound on $a$, as well as the closely related problem of improving bounds $bc$, and $abc$. In particular, we prove two results. First we prove a new general bound on any prime divisor of an odd perfect number and obtain as a corollary of that bound that $$a < 2N^{\\frac{1}{6}}.$$ Second, we show that $$abc < (2N)^{\\frac{3}{5}}.$$ We also show how in certain circumstances these bounds "},"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":"1908.09420","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2019-08-26T00:52:57Z","cross_cats_sorted":[],"title_canon_sha256":"d11202534ae46e8998bc181b418cf8957c2cb61370f8dd55d0a3312ccc0d7e31","abstract_canon_sha256":"9bf53ec5cef1a54e924e964fc8d6fe9764d9c833fd71b675f0b43affba6f6592"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:52:37.599097Z","signature_b64":"LG2SkT+kv7kYqG9CU4W/5QnlTPxXEhr51oF5ja74g+8dOZV2w7J89VBN0EqoAuJEXoe+eO4Sj3MKmdLLKGXaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"375b72546b3b1be28b8bd45cf6a54b648c4cedd5493d927d0c840bf60a9bcbae","last_reissued_at":"2026-07-05T02:52:37.598614Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:52:37.598614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the third largest prime divisor of an odd perfect number","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Joshua Zelinsky, Pieter Vyncke, Sean Bibby","submitted_at":"2019-08-26T00:52:57Z","abstract_excerpt":"Let $N$ be an odd perfect number and let $a$ be its third largest prime divisor, $b$ be the second largest prime divisor, and $c$ be its largest prime divisor. We discuss steps towards obtaining a non-trivial upper bound on $a$, as well as the closely related problem of improving bounds $bc$, and $abc$. In particular, we prove two results. First we prove a new general bound on any prime divisor of an odd perfect number and obtain as a corollary of that bound that $$a < 2N^{\\frac{1}{6}}.$$ Second, we show that $$abc < (2N)^{\\frac{3}{5}}.$$ We also show how in certain circumstances these bounds "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09420","kind":"arxiv","version":3},"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/1908.09420/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.09420","created_at":"2026-07-05T02:52:37.598704+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.09420v3","created_at":"2026-07-05T02:52:37.598704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09420","created_at":"2026-07-05T02:52:37.598704+00:00"},{"alias_kind":"pith_short_12","alias_value":"G5NXEVDLHMN6","created_at":"2026-07-05T02:52:37.598704+00:00"},{"alias_kind":"pith_short_16","alias_value":"G5NXEVDLHMN6FC4L","created_at":"2026-07-05T02:52:37.598704+00:00"},{"alias_kind":"pith_short_8","alias_value":"G5NXEVDL","created_at":"2026-07-05T02:52:37.598704+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/G5NXEVDLHMN6FC4L2ROPNJKLMS","json":"https://pith.science/pith/G5NXEVDLHMN6FC4L2ROPNJKLMS.json","graph_json":"https://pith.science/api/pith-number/G5NXEVDLHMN6FC4L2ROPNJKLMS/graph.json","events_json":"https://pith.science/api/pith-number/G5NXEVDLHMN6FC4L2ROPNJKLMS/events.json","paper":"https://pith.science/paper/G5NXEVDL"},"agent_actions":{"view_html":"https://pith.science/pith/G5NXEVDLHMN6FC4L2ROPNJKLMS","download_json":"https://pith.science/pith/G5NXEVDLHMN6FC4L2ROPNJKLMS.json","view_paper":"https://pith.science/paper/G5NXEVDL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.09420&json=true","fetch_graph":"https://pith.science/api/pith-number/G5NXEVDLHMN6FC4L2ROPNJKLMS/graph.json","fetch_events":"https://pith.science/api/pith-number/G5NXEVDLHMN6FC4L2ROPNJKLMS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G5NXEVDLHMN6FC4L2ROPNJKLMS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G5NXEVDLHMN6FC4L2ROPNJKLMS/action/storage_attestation","attest_author":"https://pith.science/pith/G5NXEVDLHMN6FC4L2ROPNJKLMS/action/author_attestation","sign_citation":"https://pith.science/pith/G5NXEVDLHMN6FC4L2ROPNJKLMS/action/citation_signature","submit_replication":"https://pith.science/pith/G5NXEVDLHMN6FC4L2ROPNJKLMS/action/replication_record"}},"created_at":"2026-07-05T02:52:37.598704+00:00","updated_at":"2026-07-05T02:52:37.598704+00:00"}