{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ULDJ5D7FFG6GZBQEHGNR5WNE2R","short_pith_number":"pith:ULDJ5D7F","canonical_record":{"source":{"id":"1810.13063","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2018-10-31T01:39:30Z","cross_cats_sorted":[],"title_canon_sha256":"eacd5fe6e6105ca7d8bbdcdea53936674eba832e580fc1cc07a625c2f1fa7233","abstract_canon_sha256":"8bf085ba299862f6ec7cb988df004caec8f5df4c47785972572085f51caf42e7"},"schema_version":"1.0"},"canonical_sha256":"a2c69e8fe529bc6c8604399b1ed9a4d47766c81f78b77e02e7bff247f50cd6ce","source":{"kind":"arxiv","id":"1810.13063","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13063","created_at":"2026-07-05T00:13:12Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13063v3","created_at":"2026-07-05T00:13:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13063","created_at":"2026-07-05T00:13:12Z"},{"alias_kind":"pith_short_12","alias_value":"ULDJ5D7FFG6G","created_at":"2026-07-05T00:13:12Z"},{"alias_kind":"pith_short_16","alias_value":"ULDJ5D7FFG6GZBQE","created_at":"2026-07-05T00:13:12Z"},{"alias_kind":"pith_short_8","alias_value":"ULDJ5D7F","created_at":"2026-07-05T00:13:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ULDJ5D7FFG6GZBQEHGNR5WNE2R","target":"record","payload":{"canonical_record":{"source":{"id":"1810.13063","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2018-10-31T01:39:30Z","cross_cats_sorted":[],"title_canon_sha256":"eacd5fe6e6105ca7d8bbdcdea53936674eba832e580fc1cc07a625c2f1fa7233","abstract_canon_sha256":"8bf085ba299862f6ec7cb988df004caec8f5df4c47785972572085f51caf42e7"},"schema_version":"1.0"},"canonical_sha256":"a2c69e8fe529bc6c8604399b1ed9a4d47766c81f78b77e02e7bff247f50cd6ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:13:12.653038Z","signature_b64":"Sy05/cXRjTWlaVGvXoiUmFDm+EDMvQQ23ajvv//5tGBNTVkCGhvgPGsgJxIY51hCzeOZS58dzPncAiQXO6C8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2c69e8fe529bc6c8604399b1ed9a4d47766c81f78b77e02e7bff247f50cd6ce","last_reissued_at":"2026-07-05T00:13:12.652588Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:13:12.652588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.13063","source_version":3,"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-05T00:13:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VPUolW7fHnXkynDlsL47byL7RZ6Upk8P1QJwX64ANR4P4+ba5tm0Xt+PxfRY1YzJ6DeSa4ZWfJ86ZPmPdHt0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T07:58:06.123327Z"},"content_sha256":"7278fd0b510adbd72f1903807ac22587ce8fa1d431a3343c5d0e239447fcfd61","schema_version":"1.0","event_id":"sha256:7278fd0b510adbd72f1903807ac22587ce8fa1d431a3343c5d0e239447fcfd61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ULDJ5D7FFG6GZBQEHGNR5WNE2R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of total prime factors of an odd perfect number","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Joshua Zelinsky","submitted_at":"2018-10-31T01:39:30Z","abstract_excerpt":"Let $N$ be an odd perfect number. Let $\\omega(N)$ be the number of distinct prime factors of $N$ and let $\\Omega(N)$ be the total number of prime factors of $N$. We prove that if $(3,N)=1$, then $ \\frac{302}{113}\\omega - \\frac{286}{113} \\leq \\Omega. $\n  If $3|N$, then $\\frac{66}{25}\\omega-5\\leq\\Omega.$ This is an improvement on similar prior results by the author which was an improvement of a result of Ochem and Rao. We also establish new lower bounds on $\\omega(N)$ in terms of the smallest prime factor of $N$ and establish new lower bounds on $N$ in terms of its smallest prime factor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13063","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/1810.13063/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-05T00:13:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CdAdXDYGwUcjrj7/VzhIuwM+F9MhYlIAnrX6inHhw+KE3WvEHGSttqFCh22VcgU9Nf3Xn90Fd4urVs609oczBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T07:58:06.123921Z"},"content_sha256":"8b033e6dec914232e5eb6152fbd31b3cace09d286a6363696082fad0f6d2ca89","schema_version":"1.0","event_id":"sha256:8b033e6dec914232e5eb6152fbd31b3cace09d286a6363696082fad0f6d2ca89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULDJ5D7FFG6GZBQEHGNR5WNE2R/bundle.json","state_url":"https://pith.science/pith/ULDJ5D7FFG6GZBQEHGNR5WNE2R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULDJ5D7FFG6GZBQEHGNR5WNE2R/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-17T07:58:06Z","links":{"resolver":"https://pith.science/pith/ULDJ5D7FFG6GZBQEHGNR5WNE2R","bundle":"https://pith.science/pith/ULDJ5D7FFG6GZBQEHGNR5WNE2R/bundle.json","state":"https://pith.science/pith/ULDJ5D7FFG6GZBQEHGNR5WNE2R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULDJ5D7FFG6GZBQEHGNR5WNE2R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ULDJ5D7FFG6GZBQEHGNR5WNE2R","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":"8bf085ba299862f6ec7cb988df004caec8f5df4c47785972572085f51caf42e7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2018-10-31T01:39:30Z","title_canon_sha256":"eacd5fe6e6105ca7d8bbdcdea53936674eba832e580fc1cc07a625c2f1fa7233"},"schema_version":"1.0","source":{"id":"1810.13063","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13063","created_at":"2026-07-05T00:13:12Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13063v3","created_at":"2026-07-05T00:13:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13063","created_at":"2026-07-05T00:13:12Z"},{"alias_kind":"pith_short_12","alias_value":"ULDJ5D7FFG6G","created_at":"2026-07-05T00:13:12Z"},{"alias_kind":"pith_short_16","alias_value":"ULDJ5D7FFG6GZBQE","created_at":"2026-07-05T00:13:12Z"},{"alias_kind":"pith_short_8","alias_value":"ULDJ5D7F","created_at":"2026-07-05T00:13:12Z"}],"graph_snapshots":[{"event_id":"sha256:8b033e6dec914232e5eb6152fbd31b3cace09d286a6363696082fad0f6d2ca89","target":"graph","created_at":"2026-07-05T00:13:12Z","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/1810.13063/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $N$ be an odd perfect number. Let $\\omega(N)$ be the number of distinct prime factors of $N$ and let $\\Omega(N)$ be the total number of prime factors of $N$. We prove that if $(3,N)=1$, then $ \\frac{302}{113}\\omega - \\frac{286}{113} \\leq \\Omega. $\n  If $3|N$, then $\\frac{66}{25}\\omega-5\\leq\\Omega.$ This is an improvement on similar prior results by the author which was an improvement of a result of Ochem and Rao. We also establish new lower bounds on $\\omega(N)$ in terms of the smallest prime factor of $N$ and establish new lower bounds on $N$ in terms of its smallest prime factor.","authors_text":"Joshua Zelinsky","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2018-10-31T01:39:30Z","title":"On the number of total prime factors of an odd perfect number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13063","kind":"arxiv","version":3},"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:7278fd0b510adbd72f1903807ac22587ce8fa1d431a3343c5d0e239447fcfd61","target":"record","created_at":"2026-07-05T00:13:12Z","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":"8bf085ba299862f6ec7cb988df004caec8f5df4c47785972572085f51caf42e7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2018-10-31T01:39:30Z","title_canon_sha256":"eacd5fe6e6105ca7d8bbdcdea53936674eba832e580fc1cc07a625c2f1fa7233"},"schema_version":"1.0","source":{"id":"1810.13063","kind":"arxiv","version":3}},"canonical_sha256":"a2c69e8fe529bc6c8604399b1ed9a4d47766c81f78b77e02e7bff247f50cd6ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2c69e8fe529bc6c8604399b1ed9a4d47766c81f78b77e02e7bff247f50cd6ce","first_computed_at":"2026-07-05T00:13:12.652588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:13:12.652588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sy05/cXRjTWlaVGvXoiUmFDm+EDMvQQ23ajvv//5tGBNTVkCGhvgPGsgJxIY51hCzeOZS58dzPncAiQXO6C8Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:13:12.653038Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.13063","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7278fd0b510adbd72f1903807ac22587ce8fa1d431a3343c5d0e239447fcfd61","sha256:8b033e6dec914232e5eb6152fbd31b3cace09d286a6363696082fad0f6d2ca89"],"state_sha256":"ed9f0ba3c40168fc29d733689bda2d625e69859ed05d2b76985da9163485a1c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SZu4MbmX/BteJqFBwZdOVLd4ZFmKhDRnRj2YNkDuWvS+3GsC5jSRc/xqYRCPvL+KVuUHPkdJXE2PPZa2UJTPAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T07:58:06.129659Z","bundle_sha256":"825bf75e45e41e028f5221c817d58ca7ca78164ef49e48c939f6c8896d7f2920"}}