{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:DCVPY4FJDIVWXHJLB6TXPK5VQQ","short_pith_number":"pith:DCVPY4FJ","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"},"canonical_sha256":"18aafc70a91a2b6b9d2b0fa777abb58414d07f2676e4484c5363b68b51e87a8a","source":{"kind":"arxiv","id":"1003.1266","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.1266","created_at":"2026-05-18T02:24:38Z"},{"alias_kind":"arxiv_version","alias_value":"1003.1266v2","created_at":"2026-05-18T02:24:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.1266","created_at":"2026-05-18T02:24:38Z"},{"alias_kind":"pith_short_12","alias_value":"DCVPY4FJDIVW","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DCVPY4FJDIVWXHJL","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DCVPY4FJ","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:DCVPY4FJDIVWXHJLB6TXPK5VQQ","target":"record","payload":{"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"},"canonical_sha256":"18aafc70a91a2b6b9d2b0fa777abb58414d07f2676e4484c5363b68b51e87a8a","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"},"source_kind":"arxiv","source_id":"1003.1266","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:24:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bDFdeMYnVm8e89Yz9acp0ccH3zHDkwfiBkW5f49k3oDiwP4W0fe738v2iOSbZjsnT2Hm38LkPT3co953vltdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:09:49.200479Z"},"content_sha256":"d7955a519466ea6fce1ca3233790794e0ae0d90549c4fd1763435792a9e63e19","schema_version":"1.0","event_id":"sha256:d7955a519466ea6fce1ca3233790794e0ae0d90549c4fd1763435792a9e63e19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:DCVPY4FJDIVWXHJLB6TXPK5VQQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:24:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PSSw3Tw74QvCI3MrFFTgc7c1J6aTtxNYD/XJjd1Ul50gjP86M2YK1eXb7Q9kFZUXG7j/aXvHXCdppkRwCPHGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:09:49.201144Z"},"content_sha256":"89fdc1e22ba71820e45c049c5728cd28d096bec9d0df4da4d0caa0f69edbf1c3","schema_version":"1.0","event_id":"sha256:89fdc1e22ba71820e45c049c5728cd28d096bec9d0df4da4d0caa0f69edbf1c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCVPY4FJDIVWXHJLB6TXPK5VQQ/bundle.json","state_url":"https://pith.science/pith/DCVPY4FJDIVWXHJLB6TXPK5VQQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCVPY4FJDIVWXHJLB6TXPK5VQQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T22:09:49Z","links":{"resolver":"https://pith.science/pith/DCVPY4FJDIVWXHJLB6TXPK5VQQ","bundle":"https://pith.science/pith/DCVPY4FJDIVWXHJLB6TXPK5VQQ/bundle.json","state":"https://pith.science/pith/DCVPY4FJDIVWXHJLB6TXPK5VQQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCVPY4FJDIVWXHJLB6TXPK5VQQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:DCVPY4FJDIVWXHJLB6TXPK5VQQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aae2b8f8aae824b3d2d9d064ecb3464daa4994ab45057b8215c9adaacd048e64","cross_cats_sorted":["cs.LG","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-03-05T13:54:11Z","title_canon_sha256":"76e6b5d012b31d74595e6b8b5c0ca033c28660c7a39e7e5d89583ee70b97a8ca"},"schema_version":"1.0","source":{"id":"1003.1266","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.1266","created_at":"2026-05-18T02:24:38Z"},{"alias_kind":"arxiv_version","alias_value":"1003.1266v2","created_at":"2026-05-18T02:24:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.1266","created_at":"2026-05-18T02:24:38Z"},{"alias_kind":"pith_short_12","alias_value":"DCVPY4FJDIVW","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DCVPY4FJDIVWXHJL","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DCVPY4FJ","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:89fdc1e22ba71820e45c049c5728cd28d096bec9d0df4da4d0caa0f69edbf1c3","target":"graph","created_at":"2026-05-18T02:24:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Agnes Radl, Matthias Hein, Ulrike von Luxburg","cross_cats":["cs.LG","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-03-05T13:54:11Z","title":"Hitting and commute times in large graphs are often misleading"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.1266","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d7955a519466ea6fce1ca3233790794e0ae0d90549c4fd1763435792a9e63e19","target":"record","created_at":"2026-05-18T02:24:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"aae2b8f8aae824b3d2d9d064ecb3464daa4994ab45057b8215c9adaacd048e64","cross_cats_sorted":["cs.LG","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-03-05T13:54:11Z","title_canon_sha256":"76e6b5d012b31d74595e6b8b5c0ca033c28660c7a39e7e5d89583ee70b97a8ca"},"schema_version":"1.0","source":{"id":"1003.1266","kind":"arxiv","version":2}},"canonical_sha256":"18aafc70a91a2b6b9d2b0fa777abb58414d07f2676e4484c5363b68b51e87a8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18aafc70a91a2b6b9d2b0fa777abb58414d07f2676e4484c5363b68b51e87a8a","first_computed_at":"2026-05-18T02:24:38.236044Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:38.236044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9izpL9yVwjTXwOhVg77kt2nnEyoNY/2omN389gcPUvMUCqW8/iGN+Gs1/YsCcoQScI7Kxh8sJvdA+aw4HMvJAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:38.236755Z","signed_message":"canonical_sha256_bytes"},"source_id":"1003.1266","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7955a519466ea6fce1ca3233790794e0ae0d90549c4fd1763435792a9e63e19","sha256:89fdc1e22ba71820e45c049c5728cd28d096bec9d0df4da4d0caa0f69edbf1c3"],"state_sha256":"6f3738d0d29f68e0e680f29feb2d25c09236c7aefe5a6c82c459d2aca000ce62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b+vh9pi40VhVwhmEPqdESgOP4Xg2dTpDygvL6vgN+yofhlTZ3olVFKiUnmhIao7U8/lT/9UrtNsV+w2+NIa7CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T22:09:49.204722Z","bundle_sha256":"e0ff9dd2461bdade92207d7610e74b91b5270721962dffe5cb0e5381913cd504"}}