{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VVM7RROTQ2WKNBWTDGL7Z3SVRJ","short_pith_number":"pith:VVM7RROT","schema_version":"1.0","canonical_sha256":"ad59f8c5d386aca686d31997fcee558a76e00baa6cc21d297e48cf9d12424b5b","source":{"kind":"arxiv","id":"1908.09644","version":5},"attestation_state":"computed","paper":{"title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"cs.DM","authors_text":"Enzhi Li, Zhengyi Le","submitted_at":"2019-08-20T21:19:04Z","abstract_excerpt":"Researchers have designed many algorithms to measure the distances between graph nodes, such as average hitting times of random walks, cosine distances from DeepWalk, personalized PageRank, etc. Successful although these algorithms are, still they are either underperforming or too time-consuming to be applicable to huge graphs that we encounter daily in this big data era. To address these issues, here we propose a faster algorithm based on an improved version of random walks that can beat DeepWalk results with more than ten times acceleration. The reason for this significant acceleration is 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":"1908.09644","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-08-20T21:19:04Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"1721b0a51243049460d74bff3a6e2e2fd5312c44bfb049d2b85e059ee52127b1","abstract_canon_sha256":"42c007ab5239f4b23639d0b655131bd26948684a39aad85c0d6f92d5e09e580f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:55:27.715341Z","signature_b64":"2RXEiVazZVErGLCplySwXasAVFldGUhOBwyzeR3dEghN/OD7e1F6Asz2GRFP5/Ww78lC+zePeeGAFQHGPs7bBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad59f8c5d386aca686d31997fcee558a76e00baa6cc21d297e48cf9d12424b5b","last_reissued_at":"2026-07-05T01:55:27.714951Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:55:27.714951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"cs.DM","authors_text":"Enzhi Li, Zhengyi Le","submitted_at":"2019-08-20T21:19:04Z","abstract_excerpt":"Researchers have designed many algorithms to measure the distances between graph nodes, such as average hitting times of random walks, cosine distances from DeepWalk, personalized PageRank, etc. Successful although these algorithms are, still they are either underperforming or too time-consuming to be applicable to huge graphs that we encounter daily in this big data era. To address these issues, here we propose a faster algorithm based on an improved version of random walks that can beat DeepWalk results with more than ten times acceleration. The reason for this significant acceleration is th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09644","kind":"arxiv","version":5},"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/1908.09644/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":"1908.09644","created_at":"2026-07-05T01:55:27.715002+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.09644v5","created_at":"2026-07-05T01:55:27.715002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09644","created_at":"2026-07-05T01:55:27.715002+00:00"},{"alias_kind":"pith_short_12","alias_value":"VVM7RROTQ2WK","created_at":"2026-07-05T01:55:27.715002+00:00"},{"alias_kind":"pith_short_16","alias_value":"VVM7RROTQ2WKNBWT","created_at":"2026-07-05T01:55:27.715002+00:00"},{"alias_kind":"pith_short_8","alias_value":"VVM7RROT","created_at":"2026-07-05T01:55:27.715002+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/VVM7RROTQ2WKNBWTDGL7Z3SVRJ","json":"https://pith.science/pith/VVM7RROTQ2WKNBWTDGL7Z3SVRJ.json","graph_json":"https://pith.science/api/pith-number/VVM7RROTQ2WKNBWTDGL7Z3SVRJ/graph.json","events_json":"https://pith.science/api/pith-number/VVM7RROTQ2WKNBWTDGL7Z3SVRJ/events.json","paper":"https://pith.science/paper/VVM7RROT"},"agent_actions":{"view_html":"https://pith.science/pith/VVM7RROTQ2WKNBWTDGL7Z3SVRJ","download_json":"https://pith.science/pith/VVM7RROTQ2WKNBWTDGL7Z3SVRJ.json","view_paper":"https://pith.science/paper/VVM7RROT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.09644&json=true","fetch_graph":"https://pith.science/api/pith-number/VVM7RROTQ2WKNBWTDGL7Z3SVRJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VVM7RROTQ2WKNBWTDGL7Z3SVRJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VVM7RROTQ2WKNBWTDGL7Z3SVRJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VVM7RROTQ2WKNBWTDGL7Z3SVRJ/action/storage_attestation","attest_author":"https://pith.science/pith/VVM7RROTQ2WKNBWTDGL7Z3SVRJ/action/author_attestation","sign_citation":"https://pith.science/pith/VVM7RROTQ2WKNBWTDGL7Z3SVRJ/action/citation_signature","submit_replication":"https://pith.science/pith/VVM7RROTQ2WKNBWTDGL7Z3SVRJ/action/replication_record"}},"created_at":"2026-07-05T01:55:27.715002+00:00","updated_at":"2026-07-05T01:55:27.715002+00:00"}