{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VKTJV65EWBHB4OWV4NXADGA3M5","short_pith_number":"pith:VKTJV65E","schema_version":"1.0","canonical_sha256":"aaa69afba4b04e1e3ad5e36e01981b677060f0df4eaad293b97bbed0b5043ded","source":{"kind":"arxiv","id":"2601.03622","version":2},"attestation_state":"computed","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"},"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":true},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2601.03622","created_at":"2026-05-17T23:39:00.304991+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.03622v2","created_at":"2026-05-17T23:39:00.304991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.03622","created_at":"2026-05-17T23:39:00.304991+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKTJV65EWBHB","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKTJV65EWBHB4OWV","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKTJV65E","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.10004","citing_title":"Universality and ambiguity in extremes of anomalous diffusion","ref_index":44,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VKTJV65EWBHB4OWV4NXADGA3M5","json":"https://pith.science/pith/VKTJV65EWBHB4OWV4NXADGA3M5.json","graph_json":"https://pith.science/api/pith-number/VKTJV65EWBHB4OWV4NXADGA3M5/graph.json","events_json":"https://pith.science/api/pith-number/VKTJV65EWBHB4OWV4NXADGA3M5/events.json","paper":"https://pith.science/paper/VKTJV65E"},"agent_actions":{"view_html":"https://pith.science/pith/VKTJV65EWBHB4OWV4NXADGA3M5","download_json":"https://pith.science/pith/VKTJV65EWBHB4OWV4NXADGA3M5.json","view_paper":"https://pith.science/paper/VKTJV65E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.03622&json=true","fetch_graph":"https://pith.science/api/pith-number/VKTJV65EWBHB4OWV4NXADGA3M5/graph.json","fetch_events":"https://pith.science/api/pith-number/VKTJV65EWBHB4OWV4NXADGA3M5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKTJV65EWBHB4OWV4NXADGA3M5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKTJV65EWBHB4OWV4NXADGA3M5/action/storage_attestation","attest_author":"https://pith.science/pith/VKTJV65EWBHB4OWV4NXADGA3M5/action/author_attestation","sign_citation":"https://pith.science/pith/VKTJV65EWBHB4OWV4NXADGA3M5/action/citation_signature","submit_replication":"https://pith.science/pith/VKTJV65EWBHB4OWV4NXADGA3M5/action/replication_record"}},"created_at":"2026-05-17T23:39:00.304991+00:00","updated_at":"2026-05-17T23:39:00.304991+00:00"}