{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KG3XXCT7IO2V4QY6DAUPUDU4LS","short_pith_number":"pith:KG3XXCT7","schema_version":"1.0","canonical_sha256":"51b77b8a7f43b55e431e1828fa0e9c5caf6922029aef7e4b78104c3abb0fed19","source":{"kind":"arxiv","id":"1412.5883","version":2},"attestation_state":"computed","paper":{"title":"Hitting and Trapping Times on Branched Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Davide Cassi, Elena Agliari, Fabio Sartori, Luca Cattivelli","submitted_at":"2014-12-18T15:08:27Z","abstract_excerpt":"In this work we consider a simple random walk embedded in a generic branched structure and we find a close-form formula to calculate the hitting time $H\\left(i,f\\right)$ between two arbitrary nodes $i$ and $j$. We then use this formula to obtain the set of hitting times $\\left\\{ H\\left(i,f\\right)\\right\\} $ for combs and their expectation values, namely the mean-first passage time $\\left( \\mbox{MFPT}_{f} \\right)$, where the average is performed over the initial node while the final node $f$ is given, and the global mean-first passage time $\\left( \\mbox{GMFPT} \\right)$, where the average is perf"},"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":"1412.5883","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2014-12-18T15:08:27Z","cross_cats_sorted":[],"title_canon_sha256":"50531ac48df994d74ab7cd4258e71c13c6cc9c86ed8f43aef31ea2345ba95b06","abstract_canon_sha256":"773e284705c6c4bb2faba63768bb43cff475f70db81667579f82d05dc2bc8e20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:33.137096Z","signature_b64":"hZamZk3MI/TuuxDVNZCIzz9gHW1iK4Cv4EeW5LaIQ0k3aKtiEXl8P6jlclgE72B9kRFU0i7h2jFHcu7f60NxAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51b77b8a7f43b55e431e1828fa0e9c5caf6922029aef7e4b78104c3abb0fed19","last_reissued_at":"2026-05-18T01:55:33.136633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:33.136633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hitting and Trapping Times on Branched Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Davide Cassi, Elena Agliari, Fabio Sartori, Luca Cattivelli","submitted_at":"2014-12-18T15:08:27Z","abstract_excerpt":"In this work we consider a simple random walk embedded in a generic branched structure and we find a close-form formula to calculate the hitting time $H\\left(i,f\\right)$ between two arbitrary nodes $i$ and $j$. We then use this formula to obtain the set of hitting times $\\left\\{ H\\left(i,f\\right)\\right\\} $ for combs and their expectation values, namely the mean-first passage time $\\left( \\mbox{MFPT}_{f} \\right)$, where the average is performed over the initial node while the final node $f$ is given, and the global mean-first passage time $\\left( \\mbox{GMFPT} \\right)$, where the average is perf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5883","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1412.5883","created_at":"2026-05-18T01:55:33.136700+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.5883v2","created_at":"2026-05-18T01:55:33.136700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5883","created_at":"2026-05-18T01:55:33.136700+00:00"},{"alias_kind":"pith_short_12","alias_value":"KG3XXCT7IO2V","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KG3XXCT7IO2V4QY6","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KG3XXCT7","created_at":"2026-05-18T12:28:35.611951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KG3XXCT7IO2V4QY6DAUPUDU4LS","json":"https://pith.science/pith/KG3XXCT7IO2V4QY6DAUPUDU4LS.json","graph_json":"https://pith.science/api/pith-number/KG3XXCT7IO2V4QY6DAUPUDU4LS/graph.json","events_json":"https://pith.science/api/pith-number/KG3XXCT7IO2V4QY6DAUPUDU4LS/events.json","paper":"https://pith.science/paper/KG3XXCT7"},"agent_actions":{"view_html":"https://pith.science/pith/KG3XXCT7IO2V4QY6DAUPUDU4LS","download_json":"https://pith.science/pith/KG3XXCT7IO2V4QY6DAUPUDU4LS.json","view_paper":"https://pith.science/paper/KG3XXCT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.5883&json=true","fetch_graph":"https://pith.science/api/pith-number/KG3XXCT7IO2V4QY6DAUPUDU4LS/graph.json","fetch_events":"https://pith.science/api/pith-number/KG3XXCT7IO2V4QY6DAUPUDU4LS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KG3XXCT7IO2V4QY6DAUPUDU4LS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KG3XXCT7IO2V4QY6DAUPUDU4LS/action/storage_attestation","attest_author":"https://pith.science/pith/KG3XXCT7IO2V4QY6DAUPUDU4LS/action/author_attestation","sign_citation":"https://pith.science/pith/KG3XXCT7IO2V4QY6DAUPUDU4LS/action/citation_signature","submit_replication":"https://pith.science/pith/KG3XXCT7IO2V4QY6DAUPUDU4LS/action/replication_record"}},"created_at":"2026-05-18T01:55:33.136700+00:00","updated_at":"2026-05-18T01:55:33.136700+00:00"}