{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2DKEDZSJCMF7CNPFOKIAFOMPRC","short_pith_number":"pith:2DKEDZSJ","schema_version":"1.0","canonical_sha256":"d0d441e649130bf135e5729002b98f88883ba24ac4518c3369dec5a9a61429e1","source":{"kind":"arxiv","id":"1803.03087","version":1},"attestation_state":"computed","paper":{"title":"Non-Backtracking Centrality Based Random Walk on Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Yuan Lin, Zhongzhi Zhang","submitted_at":"2018-03-08T13:52:24Z","abstract_excerpt":"Random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and sampling. For many real applications, their actual effect and convenience depend on the properties (e.g. stationary distribution and hitting time) of random walks, with biased random walks often outperforming traditional unbiased random walks (TURW). In this paper, we present a new class of biased random walks, non-backtracking centrality based random walks (NBCRW) on a network, where the walker prefers to jump to neighbors"},"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":"1803.03087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-03-08T13:52:24Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"e646807e1fd1f02a05b86219c8ced8233ceb3e21122ebe0837f1b65c0146d5f0","abstract_canon_sha256":"86eab6a5c30c2e591d3562b962915f5e237ef1abd8a63af3ca1a98a5efcf1cab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:44.511491Z","signature_b64":"jS2qwB3WBkXPd+IzxoP1rMN54C+RDGdGcA6WG/DgAEI6sm4n5RpuY7WEK8ntZ42+GYyR+lZKY1sVvvkpLFe9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0d441e649130bf135e5729002b98f88883ba24ac4518c3369dec5a9a61429e1","last_reissued_at":"2026-05-18T00:21:44.510856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:44.510856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Backtracking Centrality Based Random Walk on Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Yuan Lin, Zhongzhi Zhang","submitted_at":"2018-03-08T13:52:24Z","abstract_excerpt":"Random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and sampling. For many real applications, their actual effect and convenience depend on the properties (e.g. stationary distribution and hitting time) of random walks, with biased random walks often outperforming traditional unbiased random walks (TURW). In this paper, we present a new class of biased random walks, non-backtracking centrality based random walks (NBCRW) on a network, where the walker prefers to jump to neighbors"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03087","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":"1803.03087","created_at":"2026-05-18T00:21:44.510938+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03087v1","created_at":"2026-05-18T00:21:44.510938+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03087","created_at":"2026-05-18T00:21:44.510938+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DKEDZSJCMF7","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DKEDZSJCMF7CNPF","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DKEDZSJ","created_at":"2026-05-18T12:31:59.375834+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/2DKEDZSJCMF7CNPFOKIAFOMPRC","json":"https://pith.science/pith/2DKEDZSJCMF7CNPFOKIAFOMPRC.json","graph_json":"https://pith.science/api/pith-number/2DKEDZSJCMF7CNPFOKIAFOMPRC/graph.json","events_json":"https://pith.science/api/pith-number/2DKEDZSJCMF7CNPFOKIAFOMPRC/events.json","paper":"https://pith.science/paper/2DKEDZSJ"},"agent_actions":{"view_html":"https://pith.science/pith/2DKEDZSJCMF7CNPFOKIAFOMPRC","download_json":"https://pith.science/pith/2DKEDZSJCMF7CNPFOKIAFOMPRC.json","view_paper":"https://pith.science/paper/2DKEDZSJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03087&json=true","fetch_graph":"https://pith.science/api/pith-number/2DKEDZSJCMF7CNPFOKIAFOMPRC/graph.json","fetch_events":"https://pith.science/api/pith-number/2DKEDZSJCMF7CNPFOKIAFOMPRC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DKEDZSJCMF7CNPFOKIAFOMPRC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DKEDZSJCMF7CNPFOKIAFOMPRC/action/storage_attestation","attest_author":"https://pith.science/pith/2DKEDZSJCMF7CNPFOKIAFOMPRC/action/author_attestation","sign_citation":"https://pith.science/pith/2DKEDZSJCMF7CNPFOKIAFOMPRC/action/citation_signature","submit_replication":"https://pith.science/pith/2DKEDZSJCMF7CNPFOKIAFOMPRC/action/replication_record"}},"created_at":"2026-05-18T00:21:44.510938+00:00","updated_at":"2026-05-18T00:21:44.510938+00:00"}