{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WMPWVGQ3HVZDSZPMTC5IR46TLE","short_pith_number":"pith:WMPWVGQ3","canonical_record":{"source":{"id":"1212.1666","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-07T17:51:17Z","cross_cats_sorted":[],"title_canon_sha256":"2db424e6bb3dddf76e2081b89b387a1ff0525d6dfb9c5e78ebb0593be7772bde","abstract_canon_sha256":"188909366e462534e4cf138a9f60b6109de3f3309cc4b8e090db85ab2b80fe6d"},"schema_version":"1.0"},"canonical_sha256":"b31f6a9a1b3d723965ec98ba88f3d3590d7e3aff12cc0c0f4cf6d176bd028c76","source":{"kind":"arxiv","id":"1212.1666","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1666","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1666v2","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1666","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"pith_short_12","alias_value":"WMPWVGQ3HVZD","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WMPWVGQ3HVZDSZPM","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WMPWVGQ3","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WMPWVGQ3HVZDSZPMTC5IR46TLE","target":"record","payload":{"canonical_record":{"source":{"id":"1212.1666","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-07T17:51:17Z","cross_cats_sorted":[],"title_canon_sha256":"2db424e6bb3dddf76e2081b89b387a1ff0525d6dfb9c5e78ebb0593be7772bde","abstract_canon_sha256":"188909366e462534e4cf138a9f60b6109de3f3309cc4b8e090db85ab2b80fe6d"},"schema_version":"1.0"},"canonical_sha256":"b31f6a9a1b3d723965ec98ba88f3d3590d7e3aff12cc0c0f4cf6d176bd028c76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:35.694555Z","signature_b64":"ju0yC3P/ogjPbZIfSASwwVp1TD83EBs4L8P3P8V6bY77myTLiySmpFfEmPlj2G+oa+4pdAJlxqj6nvlWKxd3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b31f6a9a1b3d723965ec98ba88f3d3590d7e3aff12cc0c0f4cf6d176bd028c76","last_reissued_at":"2026-05-18T02:23:35.693906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:35.693906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.1666","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:23:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dQj+QlecFst01dD29keetpECy25wzgISHbTcUWHGF0D8bQ4ruZdXXl4fhzbuhIu7gLQEcouhoMggPjQEWDfbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T06:49:50.026994Z"},"content_sha256":"f4d16efcf91e0a000fd4e2ada87addf412ce006e49f422a56dd891cd5c51f7cb","schema_version":"1.0","event_id":"sha256:f4d16efcf91e0a000fd4e2ada87addf412ce006e49f422a56dd891cd5c51f7cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WMPWVGQ3HVZDSZPMTC5IR46TLE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Developments in the theory of randomized shortest paths with a comparison of graph node distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Ilkka Kivim\\\"aki, Marco Saerens, Masashi Shimbo","submitted_at":"2012-12-07T17:51:17Z","abstract_excerpt":"There have lately been several suggestions for parametrized distances on a graph that generalize the shortest path distance and the commute time or resistance distance. The need for developing such distances has risen from the observation that the above-mentioned common distances in many situations fail to take into account the global structure of the graph. In this article, we develop the theory of one family of graph node distances, known as the randomized shortest path dissimilarity, which has its foundation in statistical physics. We show that the randomized shortest path dissimilarity can"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1666","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:23:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VrQ14+77P2HgqXSR5yIKEBsBdKt6HSplDpjK6TVcEZgRvN7jZ6LJZMov2ecUGAcxMzPpB/9bPGUn4PxVB75UAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T06:49:50.027348Z"},"content_sha256":"afdaf4a5ba30a7bc5bb2ef51321ff971b93606b911d4e0958e9317a3973b16e9","schema_version":"1.0","event_id":"sha256:afdaf4a5ba30a7bc5bb2ef51321ff971b93606b911d4e0958e9317a3973b16e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WMPWVGQ3HVZDSZPMTC5IR46TLE/bundle.json","state_url":"https://pith.science/pith/WMPWVGQ3HVZDSZPMTC5IR46TLE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WMPWVGQ3HVZDSZPMTC5IR46TLE/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-27T06:49:50Z","links":{"resolver":"https://pith.science/pith/WMPWVGQ3HVZDSZPMTC5IR46TLE","bundle":"https://pith.science/pith/WMPWVGQ3HVZDSZPMTC5IR46TLE/bundle.json","state":"https://pith.science/pith/WMPWVGQ3HVZDSZPMTC5IR46TLE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WMPWVGQ3HVZDSZPMTC5IR46TLE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WMPWVGQ3HVZDSZPMTC5IR46TLE","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":"188909366e462534e4cf138a9f60b6109de3f3309cc4b8e090db85ab2b80fe6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-07T17:51:17Z","title_canon_sha256":"2db424e6bb3dddf76e2081b89b387a1ff0525d6dfb9c5e78ebb0593be7772bde"},"schema_version":"1.0","source":{"id":"1212.1666","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1666","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1666v2","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1666","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"pith_short_12","alias_value":"WMPWVGQ3HVZD","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WMPWVGQ3HVZDSZPM","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WMPWVGQ3","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:afdaf4a5ba30a7bc5bb2ef51321ff971b93606b911d4e0958e9317a3973b16e9","target":"graph","created_at":"2026-05-18T02:23:35Z","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":"There have lately been several suggestions for parametrized distances on a graph that generalize the shortest path distance and the commute time or resistance distance. The need for developing such distances has risen from the observation that the above-mentioned common distances in many situations fail to take into account the global structure of the graph. In this article, we develop the theory of one family of graph node distances, known as the randomized shortest path dissimilarity, which has its foundation in statistical physics. We show that the randomized shortest path dissimilarity can","authors_text":"Ilkka Kivim\\\"aki, Marco Saerens, Masashi Shimbo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-07T17:51:17Z","title":"Developments in the theory of randomized shortest paths with a comparison of graph node distances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1666","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:f4d16efcf91e0a000fd4e2ada87addf412ce006e49f422a56dd891cd5c51f7cb","target":"record","created_at":"2026-05-18T02:23:35Z","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":"188909366e462534e4cf138a9f60b6109de3f3309cc4b8e090db85ab2b80fe6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-07T17:51:17Z","title_canon_sha256":"2db424e6bb3dddf76e2081b89b387a1ff0525d6dfb9c5e78ebb0593be7772bde"},"schema_version":"1.0","source":{"id":"1212.1666","kind":"arxiv","version":2}},"canonical_sha256":"b31f6a9a1b3d723965ec98ba88f3d3590d7e3aff12cc0c0f4cf6d176bd028c76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b31f6a9a1b3d723965ec98ba88f3d3590d7e3aff12cc0c0f4cf6d176bd028c76","first_computed_at":"2026-05-18T02:23:35.693906Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:35.693906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ju0yC3P/ogjPbZIfSASwwVp1TD83EBs4L8P3P8V6bY77myTLiySmpFfEmPlj2G+oa+4pdAJlxqj6nvlWKxd3Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:35.694555Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.1666","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4d16efcf91e0a000fd4e2ada87addf412ce006e49f422a56dd891cd5c51f7cb","sha256:afdaf4a5ba30a7bc5bb2ef51321ff971b93606b911d4e0958e9317a3973b16e9"],"state_sha256":"8dd817590917e4c32f9a9bf5a487c49dcafde1000905ff12fe1a1c6d395d29ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fw7RgFT0X8ChqRAJGHhZ412U5bG7zPipg8BJDlQ6sUQikZj8bDGe7oysi0xZ/+JQlSxj9GAP32Sb/UCjj+i9DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T06:49:50.029373Z","bundle_sha256":"b0d208a2bccdf6e0604ebad9a8ae3d49f7c9627e72b7dbf8d1a06e43dc1df1a5"}}