{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FCBWWRTO5WO3ZMCLJQL3LHUQ56","short_pith_number":"pith:FCBWWRTO","schema_version":"1.0","canonical_sha256":"28836b466eed9dbcb04b4c17b59e90efa5d5b9c3f18f8e0efc55b1fcf3060ae0","source":{"kind":"arxiv","id":"1603.05553","version":1},"attestation_state":"computed","paper":{"title":"Non-backtracking random walks and a weighted Ihara's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mark Kempton","submitted_at":"2016-03-17T16:07:31Z","abstract_excerpt":"We study the mixing rate of non-backtracking random walks on graphs by looking at non-backtracking walks as walks on the directed edges of a graph. A result known as Ihara's Theorem relates the adjacency matrix of a graph to a matrix related to non-backtracking walks on the directed edges. We prove a weighted version of Ihara's Theorem which relates the transition probability matrix of a non-backtracking walk to the transition matrix for the usual random walk. This allows us to determine the spectrum of the transition probability matrix of a non-backtracking random walk in the case of regular "},"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":"1603.05553","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-17T16:07:31Z","cross_cats_sorted":[],"title_canon_sha256":"65542abd6d85643e7cc205cdd0ca47d136c0f559d594c6646a814cde4bba69cb","abstract_canon_sha256":"1d586f3a0397647a7694303e5aaf5f4c6b86c2ea304a4c7a5b3211a5a37cd133"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:56.097375Z","signature_b64":"weQSAyb00WNRhHFfIR8rH6tmk2abxcUW/YnoACQFqJsKUe5B/eUKru6H8eZrpOBdfwsHsA45DvkZNGrzOfiTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28836b466eed9dbcb04b4c17b59e90efa5d5b9c3f18f8e0efc55b1fcf3060ae0","last_reissued_at":"2026-05-18T01:18:56.096834Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:56.096834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-backtracking random walks and a weighted Ihara's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mark Kempton","submitted_at":"2016-03-17T16:07:31Z","abstract_excerpt":"We study the mixing rate of non-backtracking random walks on graphs by looking at non-backtracking walks as walks on the directed edges of a graph. A result known as Ihara's Theorem relates the adjacency matrix of a graph to a matrix related to non-backtracking walks on the directed edges. We prove a weighted version of Ihara's Theorem which relates the transition probability matrix of a non-backtracking walk to the transition matrix for the usual random walk. This allows us to determine the spectrum of the transition probability matrix of a non-backtracking random walk in the case of regular "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05553","kind":"arxiv","version":1},"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":"1603.05553","created_at":"2026-05-18T01:18:56.096905+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05553v1","created_at":"2026-05-18T01:18:56.096905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05553","created_at":"2026-05-18T01:18:56.096905+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCBWWRTO5WO3","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCBWWRTO5WO3ZMCL","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCBWWRTO","created_at":"2026-05-18T12:30:15.759754+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/FCBWWRTO5WO3ZMCLJQL3LHUQ56","json":"https://pith.science/pith/FCBWWRTO5WO3ZMCLJQL3LHUQ56.json","graph_json":"https://pith.science/api/pith-number/FCBWWRTO5WO3ZMCLJQL3LHUQ56/graph.json","events_json":"https://pith.science/api/pith-number/FCBWWRTO5WO3ZMCLJQL3LHUQ56/events.json","paper":"https://pith.science/paper/FCBWWRTO"},"agent_actions":{"view_html":"https://pith.science/pith/FCBWWRTO5WO3ZMCLJQL3LHUQ56","download_json":"https://pith.science/pith/FCBWWRTO5WO3ZMCLJQL3LHUQ56.json","view_paper":"https://pith.science/paper/FCBWWRTO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05553&json=true","fetch_graph":"https://pith.science/api/pith-number/FCBWWRTO5WO3ZMCLJQL3LHUQ56/graph.json","fetch_events":"https://pith.science/api/pith-number/FCBWWRTO5WO3ZMCLJQL3LHUQ56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCBWWRTO5WO3ZMCLJQL3LHUQ56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCBWWRTO5WO3ZMCLJQL3LHUQ56/action/storage_attestation","attest_author":"https://pith.science/pith/FCBWWRTO5WO3ZMCLJQL3LHUQ56/action/author_attestation","sign_citation":"https://pith.science/pith/FCBWWRTO5WO3ZMCLJQL3LHUQ56/action/citation_signature","submit_replication":"https://pith.science/pith/FCBWWRTO5WO3ZMCLJQL3LHUQ56/action/replication_record"}},"created_at":"2026-05-18T01:18:56.096905+00:00","updated_at":"2026-05-18T01:18:56.096905+00:00"}