{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:75I6IJZHO2POL4UK4V3I3AG4UF","short_pith_number":"pith:75I6IJZH","canonical_record":{"source":{"id":"2308.07579","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2023-08-15T05:34:46Z","cross_cats_sorted":[],"title_canon_sha256":"80f6e1f5e6c8b57a34ce229f6a7eec7f3405440f24e619872c90f070bab530c8","abstract_canon_sha256":"47041ce68133911f1b3302ae3a2b3c40052198fa0c64f4aa26608a8038d97c41"},"schema_version":"1.0"},"canonical_sha256":"ff51e42727769ee5f28ae5768d80dca153a8246b73a6c5ae7bd114da8a1f669e","source":{"kind":"arxiv","id":"2308.07579","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.07579","created_at":"2026-07-05T06:41:27Z"},{"alias_kind":"arxiv_version","alias_value":"2308.07579v1","created_at":"2026-07-05T06:41:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07579","created_at":"2026-07-05T06:41:27Z"},{"alias_kind":"pith_short_12","alias_value":"75I6IJZHO2PO","created_at":"2026-07-05T06:41:27Z"},{"alias_kind":"pith_short_16","alias_value":"75I6IJZHO2POL4UK","created_at":"2026-07-05T06:41:27Z"},{"alias_kind":"pith_short_8","alias_value":"75I6IJZH","created_at":"2026-07-05T06:41:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:75I6IJZHO2POL4UK4V3I3AG4UF","target":"record","payload":{"canonical_record":{"source":{"id":"2308.07579","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2023-08-15T05:34:46Z","cross_cats_sorted":[],"title_canon_sha256":"80f6e1f5e6c8b57a34ce229f6a7eec7f3405440f24e619872c90f070bab530c8","abstract_canon_sha256":"47041ce68133911f1b3302ae3a2b3c40052198fa0c64f4aa26608a8038d97c41"},"schema_version":"1.0"},"canonical_sha256":"ff51e42727769ee5f28ae5768d80dca153a8246b73a6c5ae7bd114da8a1f669e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:41:27.741928Z","signature_b64":"vaehIz2VqhgDISWc8+uHogorGIgcPuT5eouG4u+GTf9cBYppA+TSB8OP3ZUDvoDmPeEeMMY4VZZgaRtukVaXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff51e42727769ee5f28ae5768d80dca153a8246b73a6c5ae7bd114da8a1f669e","last_reissued_at":"2026-07-05T06:41:27.741489Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:41:27.741489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.07579","source_version":1,"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-05T06:41:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fn0tU7GLEyW3fqDkngvB+H3FmKZ3HWMIkGvE8/Szb/dFyeIFev6LpP3gc9LOZ/UN84ESYMqTHO4IOJd9ipbuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T03:26:56.712281Z"},"content_sha256":"4cab09afd25973699e8067482dde0e23b71faa2d0bc218e8c1ee59470b855594","schema_version":"1.0","event_id":"sha256:4cab09afd25973699e8067482dde0e23b71faa2d0bc218e8c1ee59470b855594"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:75I6IJZHO2POL4UK4V3I3AG4UF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connectivity of Markoff mod-p graphs and maximal divisors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Daniel Martin, Elena Fuchs, Jillian Eddy, Matthew Litman, Nico Tripeny","submitted_at":"2023-08-15T05:34:46Z","abstract_excerpt":"Markoff mod-$p$ graphs are conjectured to be connected for all primes $p$. In this paper, we use results of Chen and Bourgain, Gamburd, and Sarnak to confirm the conjecture for all $p > 3.448\\cdot10^{392}$. We also provide a method that quickly verifies connectivity for many primes below this bound. In our study of Markoff mod-$p$ graphs we introduce the notion of \\emph{maximal divisors} of a number. We prove sharp asymptotic and explicit upper bounds on the number of maximal divisors, which ultimately improves the Markoff graph $p$-bound by roughly 140 orders of magnitude as compared with an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07579","kind":"arxiv","version":1},"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/2308.07579/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-05T06:41:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HMz8akbIoBKJt4c0nXBI31ph9wjZ0gwrkrfitAiHjVPIJlaxm2KK2suN47ZF3RFuf9h0jwM34ev2lSIe4+M5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T03:26:56.713091Z"},"content_sha256":"02e62e227b4034cab937eaae4d728a95108cbff11ec105363e7339ab09c66329","schema_version":"1.0","event_id":"sha256:02e62e227b4034cab937eaae4d728a95108cbff11ec105363e7339ab09c66329"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/75I6IJZHO2POL4UK4V3I3AG4UF/bundle.json","state_url":"https://pith.science/pith/75I6IJZHO2POL4UK4V3I3AG4UF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/75I6IJZHO2POL4UK4V3I3AG4UF/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-14T03:26:56Z","links":{"resolver":"https://pith.science/pith/75I6IJZHO2POL4UK4V3I3AG4UF","bundle":"https://pith.science/pith/75I6IJZHO2POL4UK4V3I3AG4UF/bundle.json","state":"https://pith.science/pith/75I6IJZHO2POL4UK4V3I3AG4UF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/75I6IJZHO2POL4UK4V3I3AG4UF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:75I6IJZHO2POL4UK4V3I3AG4UF","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":"47041ce68133911f1b3302ae3a2b3c40052198fa0c64f4aa26608a8038d97c41","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2023-08-15T05:34:46Z","title_canon_sha256":"80f6e1f5e6c8b57a34ce229f6a7eec7f3405440f24e619872c90f070bab530c8"},"schema_version":"1.0","source":{"id":"2308.07579","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.07579","created_at":"2026-07-05T06:41:27Z"},{"alias_kind":"arxiv_version","alias_value":"2308.07579v1","created_at":"2026-07-05T06:41:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07579","created_at":"2026-07-05T06:41:27Z"},{"alias_kind":"pith_short_12","alias_value":"75I6IJZHO2PO","created_at":"2026-07-05T06:41:27Z"},{"alias_kind":"pith_short_16","alias_value":"75I6IJZHO2POL4UK","created_at":"2026-07-05T06:41:27Z"},{"alias_kind":"pith_short_8","alias_value":"75I6IJZH","created_at":"2026-07-05T06:41:27Z"}],"graph_snapshots":[{"event_id":"sha256:02e62e227b4034cab937eaae4d728a95108cbff11ec105363e7339ab09c66329","target":"graph","created_at":"2026-07-05T06:41:27Z","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/2308.07579/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Markoff mod-$p$ graphs are conjectured to be connected for all primes $p$. In this paper, we use results of Chen and Bourgain, Gamburd, and Sarnak to confirm the conjecture for all $p > 3.448\\cdot10^{392}$. We also provide a method that quickly verifies connectivity for many primes below this bound. In our study of Markoff mod-$p$ graphs we introduce the notion of \\emph{maximal divisors} of a number. We prove sharp asymptotic and explicit upper bounds on the number of maximal divisors, which ultimately improves the Markoff graph $p$-bound by roughly 140 orders of magnitude as compared with an ","authors_text":"Daniel Martin, Elena Fuchs, Jillian Eddy, Matthew Litman, Nico Tripeny","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2023-08-15T05:34:46Z","title":"Connectivity of Markoff mod-p graphs and maximal divisors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07579","kind":"arxiv","version":1},"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:4cab09afd25973699e8067482dde0e23b71faa2d0bc218e8c1ee59470b855594","target":"record","created_at":"2026-07-05T06:41:27Z","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":"47041ce68133911f1b3302ae3a2b3c40052198fa0c64f4aa26608a8038d97c41","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2023-08-15T05:34:46Z","title_canon_sha256":"80f6e1f5e6c8b57a34ce229f6a7eec7f3405440f24e619872c90f070bab530c8"},"schema_version":"1.0","source":{"id":"2308.07579","kind":"arxiv","version":1}},"canonical_sha256":"ff51e42727769ee5f28ae5768d80dca153a8246b73a6c5ae7bd114da8a1f669e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff51e42727769ee5f28ae5768d80dca153a8246b73a6c5ae7bd114da8a1f669e","first_computed_at":"2026-07-05T06:41:27.741489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:41:27.741489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vaehIz2VqhgDISWc8+uHogorGIgcPuT5eouG4u+GTf9cBYppA+TSB8OP3ZUDvoDmPeEeMMY4VZZgaRtukVaXAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:41:27.741928Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.07579","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4cab09afd25973699e8067482dde0e23b71faa2d0bc218e8c1ee59470b855594","sha256:02e62e227b4034cab937eaae4d728a95108cbff11ec105363e7339ab09c66329"],"state_sha256":"71048a586e74bdb3f3512adc08e26a91ec49b16c16c99f2cefb77950f011a0d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f5A8I7c1jg2Wwwy5ToUe7GOEzcweCQe42G5N3sIVi11t0rMSmIDEqz+f31Lai2M4jDvcWXFrLzT2S+5kScaTBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T03:26:56.720150Z","bundle_sha256":"ca50ec2f88f853da3174389d13e4d5ba4979d98d2c1d28e75b72701e34ad34cc"}}