{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2HQHS3V3FYSKQCVJP6CJBIECY4","short_pith_number":"pith:2HQHS3V3","schema_version":"1.0","canonical_sha256":"d1e0796ebb2e24a80aa97f8490a082c726c912bce00f9b62056a10a1a3358ec1","source":{"kind":"arxiv","id":"2602.18265","version":3},"attestation_state":"computed","paper":{"title":"Emergence of generic first-passage time distributions for large Markovian networks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["physics.bio-ph","q-bio.MN"],"primary_cat":"cond-mat.stat-mech","authors_text":"Julian B. Voits, Ulrich S. Schwarz (Heidelberg University)","submitted_at":"2026-02-20T14:49:42Z","abstract_excerpt":"First-passage times are often the most relevant aspect of a complex Markovian network because they signify when information processing has resulted in a definite decision. Previous studies have shown that for kinetic proofreading networks in the limit of large network size the first-passage time distribution converges either to a delta or to an exponential distribution. Remarkably, these two forms correspond to the two extreme distributions of minimal and maximal entropy for a fixed mean, respectively. Here we build on the connection between first-passage times and graph theory to show that th"},"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":false},"canonical_record":{"source":{"id":"2602.18265","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2026-02-20T14:49:42Z","cross_cats_sorted":["physics.bio-ph","q-bio.MN"],"title_canon_sha256":"9f8984f8bdf630f0c7ba7af3a50cddfb9dfa881d3cff60ee2abbe2ff2a26f910","abstract_canon_sha256":"e8d1cc5e76aafd73f5b2f7aeeb8b1db4daf44b46de9c949097bf2144f7b3b475"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T02:21:31.718296Z","signature_b64":"yXVW6F8LONU8ZiXEroBHHr+X464RZDTD6+LTDZs5OYOYHh6nzj27guXb5ke827PylXkhQJLPmlAukyjPbg2zDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1e0796ebb2e24a80aa97f8490a082c726c912bce00f9b62056a10a1a3358ec1","last_reissued_at":"2026-07-21T02:21:31.717378Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T02:21:31.717378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Emergence of generic first-passage time distributions for large Markovian networks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["physics.bio-ph","q-bio.MN"],"primary_cat":"cond-mat.stat-mech","authors_text":"Julian B. Voits, Ulrich S. Schwarz (Heidelberg University)","submitted_at":"2026-02-20T14:49:42Z","abstract_excerpt":"First-passage times are often the most relevant aspect of a complex Markovian network because they signify when information processing has resulted in a definite decision. Previous studies have shown that for kinetic proofreading networks in the limit of large network size the first-passage time distribution converges either to a delta or to an exponential distribution. Remarkably, these two forms correspond to the two extreme distributions of minimal and maximal entropy for a fixed mean, respectively. Here we build on the connection between first-passage times and graph theory to show that th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.18265","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/2602.18265/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2602.18265","created_at":"2026-07-21T02:21:31.717811+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.18265v3","created_at":"2026-07-21T02:21:31.717811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.18265","created_at":"2026-07-21T02:21:31.717811+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HQHS3V3FYSK","created_at":"2026-07-21T02:21:31.717811+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HQHS3V3FYSKQCVJ","created_at":"2026-07-21T02:21:31.717811+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HQHS3V3","created_at":"2026-07-21T02:21:31.717811+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.17082","citing_title":"Spectral Purification in Reversible Markov Chains: Hidden Parameters, Observable Equivalence, and Finite-Time Rigidity","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17082","citing_title":"Spectral Purification in Reversible Markov Chains: Hidden Parameters, Observable Equivalence, and Finite-Time Rigidity","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2605.00135","citing_title":"Graph theoretic derivation of mutual linearity for transient probabilities and hitting time distributions in Markov networks","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2HQHS3V3FYSKQCVJP6CJBIECY4","json":"https://pith.science/pith/2HQHS3V3FYSKQCVJP6CJBIECY4.json","graph_json":"https://pith.science/api/pith-number/2HQHS3V3FYSKQCVJP6CJBIECY4/graph.json","events_json":"https://pith.science/api/pith-number/2HQHS3V3FYSKQCVJP6CJBIECY4/events.json","paper":"https://pith.science/paper/2HQHS3V3"},"agent_actions":{"view_html":"https://pith.science/pith/2HQHS3V3FYSKQCVJP6CJBIECY4","download_json":"https://pith.science/pith/2HQHS3V3FYSKQCVJP6CJBIECY4.json","view_paper":"https://pith.science/paper/2HQHS3V3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.18265&json=true","fetch_graph":"https://pith.science/api/pith-number/2HQHS3V3FYSKQCVJP6CJBIECY4/graph.json","fetch_events":"https://pith.science/api/pith-number/2HQHS3V3FYSKQCVJP6CJBIECY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HQHS3V3FYSKQCVJP6CJBIECY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HQHS3V3FYSKQCVJP6CJBIECY4/action/storage_attestation","attest_author":"https://pith.science/pith/2HQHS3V3FYSKQCVJP6CJBIECY4/action/author_attestation","sign_citation":"https://pith.science/pith/2HQHS3V3FYSKQCVJP6CJBIECY4/action/citation_signature","submit_replication":"https://pith.science/pith/2HQHS3V3FYSKQCVJP6CJBIECY4/action/replication_record"}},"created_at":"2026-07-21T02:21:31.717811+00:00","updated_at":"2026-07-21T02:21:31.717811+00:00"}