{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:DCVPY4FJDIVWXHJLB6TXPK5VQQ","short_pith_number":"pith:DCVPY4FJ","schema_version":"1.0","canonical_sha256":"18aafc70a91a2b6b9d2b0fa777abb58414d07f2676e4484c5363b68b51e87a8a","source":{"kind":"arxiv","id":"1003.1266","version":2},"attestation_state":"computed","paper":{"title":"Hitting and commute times in large graphs are often misleading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.PR"],"primary_cat":"cs.DS","authors_text":"Agnes Radl, Matthias Hein, Ulrike von Luxburg","submitted_at":"2010-03-05T13:54:11Z","abstract_excerpt":"Next to the shortest path distance, the second most popular distance function between vertices in a graph is the commute distance (resistance distance). For two vertices u and v, the hitting time H_{uv} is the expected time it takes a random walk to travel from u to v. The commute time is its symmetrized version C_{uv} = H_{uv} + H_{vu}. In our paper we study the behavior of hitting times and commute distances when the number n of vertices in the graph is very large. We prove that as n converges to infinty, hitting times and commute distances converge to expressions that do not take into accou"},"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":"1003.1266","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-03-05T13:54:11Z","cross_cats_sorted":["cs.LG","math.PR"],"title_canon_sha256":"76e6b5d012b31d74595e6b8b5c0ca033c28660c7a39e7e5d89583ee70b97a8ca","abstract_canon_sha256":"aae2b8f8aae824b3d2d9d064ecb3464daa4994ab45057b8215c9adaacd048e64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:38.236755Z","signature_b64":"9izpL9yVwjTXwOhVg77kt2nnEyoNY/2omN389gcPUvMUCqW8/iGN+Gs1/YsCcoQScI7Kxh8sJvdA+aw4HMvJAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18aafc70a91a2b6b9d2b0fa777abb58414d07f2676e4484c5363b68b51e87a8a","last_reissued_at":"2026-05-18T02:24:38.236044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:38.236044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hitting and commute times in large graphs are often misleading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.PR"],"primary_cat":"cs.DS","authors_text":"Agnes Radl, Matthias Hein, Ulrike von Luxburg","submitted_at":"2010-03-05T13:54:11Z","abstract_excerpt":"Next to the shortest path distance, the second most popular distance function between vertices in a graph is the commute distance (resistance distance). For two vertices u and v, the hitting time H_{uv} is the expected time it takes a random walk to travel from u to v. The commute time is its symmetrized version C_{uv} = H_{uv} + H_{vu}. In our paper we study the behavior of hitting times and commute distances when the number n of vertices in the graph is very large. We prove that as n converges to infinty, hitting times and commute distances converge to expressions that do not take into accou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.1266","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":"1003.1266","created_at":"2026-05-18T02:24:38.236151+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.1266v2","created_at":"2026-05-18T02:24:38.236151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.1266","created_at":"2026-05-18T02:24:38.236151+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCVPY4FJDIVW","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCVPY4FJDIVWXHJL","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCVPY4FJ","created_at":"2026-05-18T12:26:06.534383+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/DCVPY4FJDIVWXHJLB6TXPK5VQQ","json":"https://pith.science/pith/DCVPY4FJDIVWXHJLB6TXPK5VQQ.json","graph_json":"https://pith.science/api/pith-number/DCVPY4FJDIVWXHJLB6TXPK5VQQ/graph.json","events_json":"https://pith.science/api/pith-number/DCVPY4FJDIVWXHJLB6TXPK5VQQ/events.json","paper":"https://pith.science/paper/DCVPY4FJ"},"agent_actions":{"view_html":"https://pith.science/pith/DCVPY4FJDIVWXHJLB6TXPK5VQQ","download_json":"https://pith.science/pith/DCVPY4FJDIVWXHJLB6TXPK5VQQ.json","view_paper":"https://pith.science/paper/DCVPY4FJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.1266&json=true","fetch_graph":"https://pith.science/api/pith-number/DCVPY4FJDIVWXHJLB6TXPK5VQQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DCVPY4FJDIVWXHJLB6TXPK5VQQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCVPY4FJDIVWXHJLB6TXPK5VQQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCVPY4FJDIVWXHJLB6TXPK5VQQ/action/storage_attestation","attest_author":"https://pith.science/pith/DCVPY4FJDIVWXHJLB6TXPK5VQQ/action/author_attestation","sign_citation":"https://pith.science/pith/DCVPY4FJDIVWXHJLB6TXPK5VQQ/action/citation_signature","submit_replication":"https://pith.science/pith/DCVPY4FJDIVWXHJLB6TXPK5VQQ/action/replication_record"}},"created_at":"2026-05-18T02:24:38.236151+00:00","updated_at":"2026-05-18T02:24:38.236151+00:00"}