{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VKTJV65EWBHB4OWV4NXADGA3M5","short_pith_number":"pith:VKTJV65E","canonical_record":{"source":{"id":"2601.03622","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math-ph","submitted_at":"2026-01-07T06:04:57Z","cross_cats_sorted":["math.MP"],"title_canon_sha256":"045bfce070dbc5e3f312c56b0c86db730c00597511c7fb44ad85f6438a5fbfa4","abstract_canon_sha256":"ea191e2e890381ae058bc44b036633d9f1d3d6d4b297c392f64609278efd7015"},"schema_version":"1.0"},"canonical_sha256":"aaa69afba4b04e1e3ad5e36e01981b677060f0df4eaad293b97bbed0b5043ded","source":{"kind":"arxiv","id":"2601.03622","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.03622","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"arxiv_version","alias_value":"2601.03622v2","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.03622","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"pith_short_12","alias_value":"VKTJV65EWBHB","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"VKTJV65EWBHB4OWV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"VKTJV65E","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VKTJV65EWBHB4OWV4NXADGA3M5","target":"record","payload":{"canonical_record":{"source":{"id":"2601.03622","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math-ph","submitted_at":"2026-01-07T06:04:57Z","cross_cats_sorted":["math.MP"],"title_canon_sha256":"045bfce070dbc5e3f312c56b0c86db730c00597511c7fb44ad85f6438a5fbfa4","abstract_canon_sha256":"ea191e2e890381ae058bc44b036633d9f1d3d6d4b297c392f64609278efd7015"},"schema_version":"1.0"},"canonical_sha256":"aaa69afba4b04e1e3ad5e36e01981b677060f0df4eaad293b97bbed0b5043ded","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:00.305607Z","signature_b64":"EJ4WgSpQGq9SthyVPDFq4EG/qxahZk9ysMG+E57YCD+Q6L1DRXB1l7y3nCDW1ZKcFDBmXUEof9Zmh6J8phriBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aaa69afba4b04e1e3ad5e36e01981b677060f0df4eaad293b97bbed0b5043ded","last_reissued_at":"2026-05-17T23:39:00.304888Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:00.304888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2601.03622","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-17T23:39:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1nUiRYOTZ6oZ6WWziNIY79TCeD+mnfZ0bJ80amtZOZvTOwBVSKWc6X3mj9QE3QTZ75kSv5/a3NCKBC0b+n6vDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:16:07.814774Z"},"content_sha256":"54d2a6ea7673cf181ddab04a651fb684990e0db1a9175bad3bec46b5220266ee","schema_version":"1.0","event_id":"sha256:54d2a6ea7673cf181ddab04a651fb684990e0db1a9175bad3bec46b5220266ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VKTJV65EWBHB4OWV4NXADGA3M5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Entropic Collapse and Extreme First-Passage Times in Discrete Ballistic Transport","license":"http://creativecommons.org/licenses/by/4.0/","headline":"On hierarchical networks, minimum arrival times of many walkers follow a discrete distribution with a strict lower bound set by the graph, rather than any classical extreme-value law.","cross_cats":["math.MP"],"primary_cat":"math-ph","authors_text":"Bhargav R. Karamched","submitted_at":"2026-01-07T06:04:57Z","abstract_excerpt":"We investigate the extreme first-passage statistics of $N$ non-interacting random walkers on discrete, hierarchical networks. {By distinguishing between transport limited by escape from localized initial states (injection-limited) and transport limited by the extended network (bulk-limited), we identify a class of extreme value statistics that arises in geometries dominated by source traps (e.g., the Comet graph).} In this regime, the distribution of the minimum arrival time does not converge to any of the classical generalized extreme value distributions. Instead, it follows a discrete distri"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"the distribution of the minimum arrival time does not converge to any of the classical generalized extreme value distributions. Instead, it follows a discrete distribution with a strict lower time bound determined by the properties of the hierarchical network.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The networks are discrete and hierarchical, walkers are non-interacting, and the transport regime can be cleanly classified as injection-limited versus bulk-limited so that the lower bound and entropic collapse apply as stated.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"In injection-limited hierarchical networks, minimum first-passage times of non-interacting walkers follow a discrete distribution with strict lower bound, destroyed by entropic collapse in bulk-limited geometries like the Bethe lattice.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"On hierarchical networks, minimum arrival times of many walkers follow a discrete distribution with a strict lower bound set by the graph, rather than any classical extreme-value law.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"2a44aff990abf3e156b43207f5d071167e42d652f22102982bf4c3841914dd68"},"source":{"id":"2601.03622","kind":"arxiv","version":2},"verdict":{"id":"094deab7-5604-46d7-b11d-ebd15865eabd","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T17:11:44.634131Z","strongest_claim":"the distribution of the minimum arrival time does not converge to any of the classical generalized extreme value distributions. Instead, it follows a discrete distribution with a strict lower time bound determined by the properties of the hierarchical network.","one_line_summary":"In injection-limited hierarchical networks, minimum first-passage times of non-interacting walkers follow a discrete distribution with strict lower bound, destroyed by entropic collapse in bulk-limited geometries like the Bethe lattice.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The networks are discrete and hierarchical, walkers are non-interacting, and the transport regime can be cleanly classified as injection-limited versus bulk-limited so that the lower bound and entropic collapse apply as stated.","pith_extraction_headline":"On hierarchical networks, minimum arrival times of many walkers follow a discrete distribution with a strict lower bound set by the graph, rather than any classical extreme-value law."},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"51a6e80ec9748d61b841ebd066aaa46090af17827992a49ae928a63c411883b3"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"094deab7-5604-46d7-b11d-ebd15865eabd"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sc9DlR7V1IBI9EOa1NnhgTNPGD1yiMx05E0Lov91VOKEgKdfkteOozYjeS+rJ+Dxa+THF1ODumA2Cg88LB1lDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:16:07.815743Z"},"content_sha256":"4aaf1d7ecae051d7349e6d6553f9ffd2b952944b2bba1039010d4a9722f3461f","schema_version":"1.0","event_id":"sha256:4aaf1d7ecae051d7349e6d6553f9ffd2b952944b2bba1039010d4a9722f3461f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VKTJV65EWBHB4OWV4NXADGA3M5/bundle.json","state_url":"https://pith.science/pith/VKTJV65EWBHB4OWV4NXADGA3M5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VKTJV65EWBHB4OWV4NXADGA3M5/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-05-27T14:16:07Z","links":{"resolver":"https://pith.science/pith/VKTJV65EWBHB4OWV4NXADGA3M5","bundle":"https://pith.science/pith/VKTJV65EWBHB4OWV4NXADGA3M5/bundle.json","state":"https://pith.science/pith/VKTJV65EWBHB4OWV4NXADGA3M5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VKTJV65EWBHB4OWV4NXADGA3M5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VKTJV65EWBHB4OWV4NXADGA3M5","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":"ea191e2e890381ae058bc44b036633d9f1d3d6d4b297c392f64609278efd7015","cross_cats_sorted":["math.MP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math-ph","submitted_at":"2026-01-07T06:04:57Z","title_canon_sha256":"045bfce070dbc5e3f312c56b0c86db730c00597511c7fb44ad85f6438a5fbfa4"},"schema_version":"1.0","source":{"id":"2601.03622","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.03622","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"arxiv_version","alias_value":"2601.03622v2","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.03622","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"pith_short_12","alias_value":"VKTJV65EWBHB","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"VKTJV65EWBHB4OWV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"VKTJV65E","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:4aaf1d7ecae051d7349e6d6553f9ffd2b952944b2bba1039010d4a9722f3461f","target":"graph","created_at":"2026-05-17T23:39:00Z","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":"the distribution of the minimum arrival time does not converge to any of the classical generalized extreme value distributions. Instead, it follows a discrete distribution with a strict lower time bound determined by the properties of the hierarchical network."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The networks are discrete and hierarchical, walkers are non-interacting, and the transport regime can be cleanly classified as injection-limited versus bulk-limited so that the lower bound and entropic collapse apply as stated."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"In injection-limited hierarchical networks, minimum first-passage times of non-interacting walkers follow a discrete distribution with strict lower bound, destroyed by entropic collapse in bulk-limited geometries like the Bethe lattice."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"On hierarchical networks, minimum arrival times of many walkers follow a discrete distribution with a strict lower bound set by the graph, rather than any classical extreme-value law."}],"snapshot_sha256":"2a44aff990abf3e156b43207f5d071167e42d652f22102982bf4c3841914dd68"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"51a6e80ec9748d61b841ebd066aaa46090af17827992a49ae928a63c411883b3"},"paper":{"abstract_excerpt":"We investigate the extreme first-passage statistics of $N$ non-interacting random walkers on discrete, hierarchical networks. {By distinguishing between transport limited by escape from localized initial states (injection-limited) and transport limited by the extended network (bulk-limited), we identify a class of extreme value statistics that arises in geometries dominated by source traps (e.g., the Comet graph).} In this regime, the distribution of the minimum arrival time does not converge to any of the classical generalized extreme value distributions. Instead, it follows a discrete distri","authors_text":"Bhargav R. Karamched","cross_cats":["math.MP"],"headline":"On hierarchical networks, minimum arrival times of many walkers follow a discrete distribution with a strict lower bound set by the graph, rather than any classical extreme-value law.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math-ph","submitted_at":"2026-01-07T06:04:57Z","title":"Entropic Collapse and Extreme First-Passage Times in Discrete Ballistic Transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.03622","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-16T17:11:44.634131Z","id":"094deab7-5604-46d7-b11d-ebd15865eabd","model_set":{"reader":"grok-4.3"},"one_line_summary":"In injection-limited hierarchical networks, minimum first-passage times of non-interacting walkers follow a discrete distribution with strict lower bound, destroyed by entropic collapse in bulk-limited geometries like the Bethe lattice.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"On hierarchical networks, minimum arrival times of many walkers follow a discrete distribution with a strict lower bound set by the graph, rather than any classical extreme-value law.","strongest_claim":"the distribution of the minimum arrival time does not converge to any of the classical generalized extreme value distributions. Instead, it follows a discrete distribution with a strict lower time bound determined by the properties of the hierarchical network.","weakest_assumption":"The networks are discrete and hierarchical, walkers are non-interacting, and the transport regime can be cleanly classified as injection-limited versus bulk-limited so that the lower bound and entropic collapse apply as stated."}},"verdict_id":"094deab7-5604-46d7-b11d-ebd15865eabd"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:54d2a6ea7673cf181ddab04a651fb684990e0db1a9175bad3bec46b5220266ee","target":"record","created_at":"2026-05-17T23:39:00Z","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":"ea191e2e890381ae058bc44b036633d9f1d3d6d4b297c392f64609278efd7015","cross_cats_sorted":["math.MP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math-ph","submitted_at":"2026-01-07T06:04:57Z","title_canon_sha256":"045bfce070dbc5e3f312c56b0c86db730c00597511c7fb44ad85f6438a5fbfa4"},"schema_version":"1.0","source":{"id":"2601.03622","kind":"arxiv","version":2}},"canonical_sha256":"aaa69afba4b04e1e3ad5e36e01981b677060f0df4eaad293b97bbed0b5043ded","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aaa69afba4b04e1e3ad5e36e01981b677060f0df4eaad293b97bbed0b5043ded","first_computed_at":"2026-05-17T23:39:00.304888Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:00.304888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EJ4WgSpQGq9SthyVPDFq4EG/qxahZk9ysMG+E57YCD+Q6L1DRXB1l7y3nCDW1ZKcFDBmXUEof9Zmh6J8phriBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:00.305607Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.03622","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54d2a6ea7673cf181ddab04a651fb684990e0db1a9175bad3bec46b5220266ee","sha256:4aaf1d7ecae051d7349e6d6553f9ffd2b952944b2bba1039010d4a9722f3461f"],"state_sha256":"2e5653c0e74368b42e9712855a2633f9d6599f23888ee7a0fff3f7e6968ebb0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZgIFKgFvcdMI+k87kwmVcVQdnzvu2ib1EjXmF0Q9NRawZyV70+u+nH/ELC+g0krrmw1VV4uXjXo9wG72pQGOAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:16:07.819143Z","bundle_sha256":"7458d8a852a2300fc0a2e79afd9bac75cbc92b6fccc24e9fdd45ffa1f1890507"}}