{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:R3BHCVNWFFSJWR4IOSMXLAOEL4","short_pith_number":"pith:R3BHCVNW","canonical_record":{"source":{"id":"2605.08256","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-05-07T20:41:46Z","cross_cats_sorted":[],"title_canon_sha256":"c6ac11d844b403c2e10ecb1c2261c9101da73c842e76f43e73bcba80bea0fb23","abstract_canon_sha256":"641880a4a7dd8741e8a3951676a245f339c9ea9d1ab3e24989a943161ea71d9f"},"schema_version":"1.0"},"canonical_sha256":"8ec27155b629649b478874997581c45f3e69ca3bd4c4a3f1c60efbd7d371b817","source":{"kind":"arxiv","id":"2605.08256","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.08256","created_at":"2026-05-28T01:04:08Z"},{"alias_kind":"arxiv_version","alias_value":"2605.08256v2","created_at":"2026-05-28T01:04:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.08256","created_at":"2026-05-28T01:04:08Z"},{"alias_kind":"pith_short_12","alias_value":"R3BHCVNWFFSJ","created_at":"2026-05-28T01:04:08Z"},{"alias_kind":"pith_short_16","alias_value":"R3BHCVNWFFSJWR4I","created_at":"2026-05-28T01:04:08Z"},{"alias_kind":"pith_short_8","alias_value":"R3BHCVNW","created_at":"2026-05-28T01:04:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:R3BHCVNWFFSJWR4IOSMXLAOEL4","target":"record","payload":{"canonical_record":{"source":{"id":"2605.08256","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-05-07T20:41:46Z","cross_cats_sorted":[],"title_canon_sha256":"c6ac11d844b403c2e10ecb1c2261c9101da73c842e76f43e73bcba80bea0fb23","abstract_canon_sha256":"641880a4a7dd8741e8a3951676a245f339c9ea9d1ab3e24989a943161ea71d9f"},"schema_version":"1.0"},"canonical_sha256":"8ec27155b629649b478874997581c45f3e69ca3bd4c4a3f1c60efbd7d371b817","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:08.636987Z","signature_b64":"g9qf1Q/9fN1wGClOTHY0tJyzFb/YDxBffwkriugP30g1U4iJRuq0G1IeI55bE9c7p96Pv2I0pZmH6Qqx816nAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ec27155b629649b478874997581c45f3e69ca3bd4c4a3f1c60efbd7d371b817","last_reissued_at":"2026-05-28T01:04:08.636144Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:08.636144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.08256","source_version":2,"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-05-28T01:04:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e0O9wJpoZi0iZ9WAq8fjTWAXlrMvydHm6FYVg2jifMNSNlFGaLfa/1+ZE7f/J3/+XXExAcuDssjLPWqEU9omBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T15:16:49.809897Z"},"content_sha256":"db36c41cf77ac011c0d456a703f918cd0bfb9338a073df8cd5bfe91130376664","schema_version":"1.0","event_id":"sha256:db36c41cf77ac011c0d456a703f918cd0bfb9338a073df8cd5bfe91130376664"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:R3BHCVNWFFSJWR4IOSMXLAOEL4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Frequency Ordered Ratio Families Arising from the Factorization of $p_{m-1}+1$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Frequencies of ratios from factoring p_{m-1}+1 for m in A223881 follow an asymptotic ordering predicted by primes in arithmetic progressions.","cross_cats":[],"primary_cat":"math.NT","authors_text":"Alexander R Povolotsky","submitted_at":"2026-05-07T20:41:46Z","abstract_excerpt":"We investigate a ratio sequence derived from the factorization of $p_{m-1} + 1$, where $p_n$ denotes the $n$th prime. For each $m \\geq 3$, write $p_{m-1} + 1 = L_m R_m$ with $L_m$ the largest prime factor. Restricting to those $m$ for which $L_m > m$ (equivalently, $m \\in \\text{A223881}$), we obtain a multiset of values $R_m$. Since $p_{m-1}+1$ is even and $L_m > 3$ is odd, all values of $R_m$ are strictly even. Sorting the distinct $R_m$ by decreasing frequency yields a new sequence beginning $2, 6, 4, 8, 10, 12, 14, 16 \\dots$. This article explains how this construction arises naturally from"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We propose a heuristic asymptotic model explaining the observed frequency ordering via classical results on primes in arithmetic progressions and support the model with numerical log-log analysis.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the observed frequencies of the ratio families R_m are asymptotically governed by the distribution of primes in arithmetic progressions in a manner that can be captured by a heuristic model without post-hoc parameter tuning to the specific data set.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Frequency-ordering the smaller factors R_m in p_{m-1}+1 factorizations for m where the largest factor exceeds m produces a new sequence explained by a heuristic model using the distribution of primes in arithmetic progressions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Frequencies of ratios from factoring p_{m-1}+1 for m in A223881 follow an asymptotic ordering predicted by primes in arithmetic progressions.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"d0cf63113ea4e52749a3cee69b5ad55a41b7aac2535308bcc20cc91ce7825759"},"source":{"id":"2605.08256","kind":"arxiv","version":2},"verdict":{"id":"0e0550cd-f2ad-411f-a3dc-a8ff87b9aba5","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-12T01:35:55.043285Z","strongest_claim":"We propose a heuristic asymptotic model explaining the observed frequency ordering via classical results on primes in arithmetic progressions and support the model with numerical log-log analysis.","one_line_summary":"Frequency-ordering the smaller factors R_m in p_{m-1}+1 factorizations for m where the largest factor exceeds m produces a new sequence explained by a heuristic model using the distribution of primes in arithmetic progressions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the observed frequencies of the ratio families R_m are asymptotically governed by the distribution of primes in arithmetic progressions in a manner that can be captured by a heuristic model without post-hoc parameter tuning to the specific data set.","pith_extraction_headline":"Frequencies of ratios from factoring p_{m-1}+1 for m in A223881 follow an asymptotic ordering predicted by primes in arithmetic progressions."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.08256/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T11:42:03.517307Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-20T06:39:39.324483Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T17:31:19.321630Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T12:14:15.477231Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"e239a683cc9beb2a6f6d923dfb0a2411661631e8f01d12d601310447d019ef1d"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"e67fae401968cdf379e180097f805caacc434f12bf8f2f5ebed08a874ddd63a3"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"0e0550cd-f2ad-411f-a3dc-a8ff87b9aba5"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-28T01:04:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Us2LQn2VRx6K3b99pNfJZqkZb4zqQTTSg6kzPp8gb59lF4XGv2/6aJDvI981D8SU6yoFMBRmq3FUVIIIu20tCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T15:16:49.810412Z"},"content_sha256":"5ae5fa5094b904ea8b5b2b445227d31dcd179afb638eeee2e9391f73250d0868","schema_version":"1.0","event_id":"sha256:5ae5fa5094b904ea8b5b2b445227d31dcd179afb638eeee2e9391f73250d0868"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R3BHCVNWFFSJWR4IOSMXLAOEL4/bundle.json","state_url":"https://pith.science/pith/R3BHCVNWFFSJWR4IOSMXLAOEL4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R3BHCVNWFFSJWR4IOSMXLAOEL4/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-06-10T15:16:49Z","links":{"resolver":"https://pith.science/pith/R3BHCVNWFFSJWR4IOSMXLAOEL4","bundle":"https://pith.science/pith/R3BHCVNWFFSJWR4IOSMXLAOEL4/bundle.json","state":"https://pith.science/pith/R3BHCVNWFFSJWR4IOSMXLAOEL4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R3BHCVNWFFSJWR4IOSMXLAOEL4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:R3BHCVNWFFSJWR4IOSMXLAOEL4","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":"641880a4a7dd8741e8a3951676a245f339c9ea9d1ab3e24989a943161ea71d9f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-05-07T20:41:46Z","title_canon_sha256":"c6ac11d844b403c2e10ecb1c2261c9101da73c842e76f43e73bcba80bea0fb23"},"schema_version":"1.0","source":{"id":"2605.08256","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.08256","created_at":"2026-05-28T01:04:08Z"},{"alias_kind":"arxiv_version","alias_value":"2605.08256v2","created_at":"2026-05-28T01:04:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.08256","created_at":"2026-05-28T01:04:08Z"},{"alias_kind":"pith_short_12","alias_value":"R3BHCVNWFFSJ","created_at":"2026-05-28T01:04:08Z"},{"alias_kind":"pith_short_16","alias_value":"R3BHCVNWFFSJWR4I","created_at":"2026-05-28T01:04:08Z"},{"alias_kind":"pith_short_8","alias_value":"R3BHCVNW","created_at":"2026-05-28T01:04:08Z"}],"graph_snapshots":[{"event_id":"sha256:5ae5fa5094b904ea8b5b2b445227d31dcd179afb638eeee2e9391f73250d0868","target":"graph","created_at":"2026-05-28T01:04:08Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We propose a heuristic asymptotic model explaining the observed frequency ordering via classical results on primes in arithmetic progressions and support the model with numerical log-log analysis."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the observed frequencies of the ratio families R_m are asymptotically governed by the distribution of primes in arithmetic progressions in a manner that can be captured by a heuristic model without post-hoc parameter tuning to the specific data set."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Frequency-ordering the smaller factors R_m in p_{m-1}+1 factorizations for m where the largest factor exceeds m produces a new sequence explained by a heuristic model using the distribution of primes in arithmetic progressions."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Frequencies of ratios from factoring p_{m-1}+1 for m in A223881 follow an asymptotic ordering predicted by primes in arithmetic progressions."}],"snapshot_sha256":"d0cf63113ea4e52749a3cee69b5ad55a41b7aac2535308bcc20cc91ce7825759"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"e67fae401968cdf379e180097f805caacc434f12bf8f2f5ebed08a874ddd63a3"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T11:42:03.517307Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T06:39:39.324483Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T17:31:19.321630Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T12:14:15.477231Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.08256/integrity.json","findings":[],"snapshot_sha256":"e239a683cc9beb2a6f6d923dfb0a2411661631e8f01d12d601310447d019ef1d","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate a ratio sequence derived from the factorization of $p_{m-1} + 1$, where $p_n$ denotes the $n$th prime. For each $m \\geq 3$, write $p_{m-1} + 1 = L_m R_m$ with $L_m$ the largest prime factor. Restricting to those $m$ for which $L_m > m$ (equivalently, $m \\in \\text{A223881}$), we obtain a multiset of values $R_m$. Since $p_{m-1}+1$ is even and $L_m > 3$ is odd, all values of $R_m$ are strictly even. Sorting the distinct $R_m$ by decreasing frequency yields a new sequence beginning $2, 6, 4, 8, 10, 12, 14, 16 \\dots$. This article explains how this construction arises naturally from","authors_text":"Alexander R Povolotsky","cross_cats":[],"headline":"Frequencies of ratios from factoring p_{m-1}+1 for m in A223881 follow an asymptotic ordering predicted by primes in arithmetic progressions.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-05-07T20:41:46Z","title":"Frequency Ordered Ratio Families Arising from the Factorization of $p_{m-1}+1$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.08256","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-12T01:35:55.043285Z","id":"0e0550cd-f2ad-411f-a3dc-a8ff87b9aba5","model_set":{"reader":"grok-4.3"},"one_line_summary":"Frequency-ordering the smaller factors R_m in p_{m-1}+1 factorizations for m where the largest factor exceeds m produces a new sequence explained by a heuristic model using the distribution of primes in arithmetic progressions.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Frequencies of ratios from factoring p_{m-1}+1 for m in A223881 follow an asymptotic ordering predicted by primes in arithmetic progressions.","strongest_claim":"We propose a heuristic asymptotic model explaining the observed frequency ordering via classical results on primes in arithmetic progressions and support the model with numerical log-log analysis.","weakest_assumption":"That the observed frequencies of the ratio families R_m are asymptotically governed by the distribution of primes in arithmetic progressions in a manner that can be captured by a heuristic model without post-hoc parameter tuning to the specific data set."}},"verdict_id":"0e0550cd-f2ad-411f-a3dc-a8ff87b9aba5"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:db36c41cf77ac011c0d456a703f918cd0bfb9338a073df8cd5bfe91130376664","target":"record","created_at":"2026-05-28T01:04:08Z","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":"641880a4a7dd8741e8a3951676a245f339c9ea9d1ab3e24989a943161ea71d9f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-05-07T20:41:46Z","title_canon_sha256":"c6ac11d844b403c2e10ecb1c2261c9101da73c842e76f43e73bcba80bea0fb23"},"schema_version":"1.0","source":{"id":"2605.08256","kind":"arxiv","version":2}},"canonical_sha256":"8ec27155b629649b478874997581c45f3e69ca3bd4c4a3f1c60efbd7d371b817","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ec27155b629649b478874997581c45f3e69ca3bd4c4a3f1c60efbd7d371b817","first_computed_at":"2026-05-28T01:04:08.636144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T01:04:08.636144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g9qf1Q/9fN1wGClOTHY0tJyzFb/YDxBffwkriugP30g1U4iJRuq0G1IeI55bE9c7p96Pv2I0pZmH6Qqx816nAQ==","signature_status":"signed_v1","signed_at":"2026-05-28T01:04:08.636987Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.08256","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db36c41cf77ac011c0d456a703f918cd0bfb9338a073df8cd5bfe91130376664","sha256:5ae5fa5094b904ea8b5b2b445227d31dcd179afb638eeee2e9391f73250d0868"],"state_sha256":"30f8dc9d0ceb0cbcdb6ef79ab4698456b3643d48b94158ed45fe5a47fb3fa855"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K5eDkHSHSMrEDFJgy5BANojjjTe41vu9yz5ijBp8kAAJNBPtFrszFD63D4MZ1udRAinxZdTmw+76pfkohLHmAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T15:16:49.812688Z","bundle_sha256":"f2c81367bf8996bba65024a10343a6a4864bfad762f2dd71d2f55bd4dcb223c3"}}