{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7ZURP62VOTM36KO6PFWOULFX42","short_pith_number":"pith:7ZURP62V","schema_version":"1.0","canonical_sha256":"fe6917fb5574d9bf29de796cea2cb7e6b7686b71d3b73fcd18183e8616a73713","source":{"kind":"arxiv","id":"2601.16086","version":2},"attestation_state":"computed","paper":{"title":"Random Walks Across Dimensions: Exploring Simplicial Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["nlin.AO","physics.soc-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Diego Febbe, Duccio Fanelli, Timoteo Carletti","submitted_at":"2026-01-22T16:33:24Z","abstract_excerpt":"We introduce a novel operator to describe a random walk process on a simplicial complex. Walkers are allowed to wonder across simplices of various dimensions, bridging nodes to edges, and edges to triangles, via a nested organization that hierarchically extends to higher structures of arbitrary large, but finite, dimension. The asymptotic distribution of the walkers provides a natural ranking to gauge the relative importance of higher order simplices. Optimal search strategies in presence of stochastic teleportation are addressed and the peculiar interplay of noise with higher order structures"},"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":"2601.16086","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2026-01-22T16:33:24Z","cross_cats_sorted":["nlin.AO","physics.soc-ph"],"title_canon_sha256":"788c56b68794292acd41a4f01a7cf2a178c446fbdcb160804b8e984609c31566","abstract_canon_sha256":"18effe077b609eb7607ae68c554e31d356434ee8b68d507ccc7da30895014e74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T02:04:57.598567Z","signature_b64":"sHqTqurMHI9FqdSpTgYtdnLhmOkK3RWA3HaP7p9tyBKF8cRLTjRuSV5teV0voH27rRcHY4DT+fpR9YYILc9HCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe6917fb5574d9bf29de796cea2cb7e6b7686b71d3b73fcd18183e8616a73713","last_reissued_at":"2026-05-21T02:04:57.597828Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T02:04:57.597828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Walks Across Dimensions: Exploring Simplicial Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["nlin.AO","physics.soc-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Diego Febbe, Duccio Fanelli, Timoteo Carletti","submitted_at":"2026-01-22T16:33:24Z","abstract_excerpt":"We introduce a novel operator to describe a random walk process on a simplicial complex. Walkers are allowed to wonder across simplices of various dimensions, bridging nodes to edges, and edges to triangles, via a nested organization that hierarchically extends to higher structures of arbitrary large, but finite, dimension. The asymptotic distribution of the walkers provides a natural ranking to gauge the relative importance of higher order simplices. Optimal search strategies in presence of stochastic teleportation are addressed and the peculiar interplay of noise with higher order structures"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.16086","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.16086/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":"2601.16086","created_at":"2026-05-21T02:04:57.597954+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.16086v2","created_at":"2026-05-21T02:04:57.597954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.16086","created_at":"2026-05-21T02:04:57.597954+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZURP62VOTM3","created_at":"2026-05-21T02:04:57.597954+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZURP62VOTM36KO6","created_at":"2026-05-21T02:04:57.597954+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZURP62V","created_at":"2026-05-21T02:04:57.597954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2601.16086","citing_title":"Random Walks Across Dimensions: Exploring Simplicial Complexes","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17004","citing_title":"Model of Simplicial Complexes with dimension-wise preferential attachment","ref_index":49,"is_internal_anchor":true},{"citing_arxiv_id":"2601.22235","citing_title":"Smart Walkers in Discrete Space","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7ZURP62VOTM36KO6PFWOULFX42","json":"https://pith.science/pith/7ZURP62VOTM36KO6PFWOULFX42.json","graph_json":"https://pith.science/api/pith-number/7ZURP62VOTM36KO6PFWOULFX42/graph.json","events_json":"https://pith.science/api/pith-number/7ZURP62VOTM36KO6PFWOULFX42/events.json","paper":"https://pith.science/paper/7ZURP62V"},"agent_actions":{"view_html":"https://pith.science/pith/7ZURP62VOTM36KO6PFWOULFX42","download_json":"https://pith.science/pith/7ZURP62VOTM36KO6PFWOULFX42.json","view_paper":"https://pith.science/paper/7ZURP62V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.16086&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZURP62VOTM36KO6PFWOULFX42/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZURP62VOTM36KO6PFWOULFX42/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZURP62VOTM36KO6PFWOULFX42/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZURP62VOTM36KO6PFWOULFX42/action/storage_attestation","attest_author":"https://pith.science/pith/7ZURP62VOTM36KO6PFWOULFX42/action/author_attestation","sign_citation":"https://pith.science/pith/7ZURP62VOTM36KO6PFWOULFX42/action/citation_signature","submit_replication":"https://pith.science/pith/7ZURP62VOTM36KO6PFWOULFX42/action/replication_record"}},"created_at":"2026-05-21T02:04:57.597954+00:00","updated_at":"2026-05-21T02:04:57.597954+00:00"}