{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OQ6MWABD6PYJ66ERSCWJ6ASTU2","short_pith_number":"pith:OQ6MWABD","canonical_record":{"source":{"id":"1806.03232","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-07T14:42:09Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"8b0aeea15ca7e9a1ee1bcedd62ee2ebc161acc891feb59282ca6aeb58815a017","abstract_canon_sha256":"08b1ea19e28833bd14c65c8e42c8d6e916b264fcced2d628c5ba99582e254708"},"schema_version":"1.0"},"canonical_sha256":"743ccb0023f3f09f789190ac9f0253a697eaee1215e293b038f66575ddc0e0c9","source":{"kind":"arxiv","id":"1806.03232","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03232","created_at":"2026-05-17T23:47:52Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03232v2","created_at":"2026-05-17T23:47:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03232","created_at":"2026-05-17T23:47:52Z"},{"alias_kind":"pith_short_12","alias_value":"OQ6MWABD6PYJ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OQ6MWABD6PYJ66ER","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OQ6MWABD","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OQ6MWABD6PYJ66ERSCWJ6ASTU2","target":"record","payload":{"canonical_record":{"source":{"id":"1806.03232","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-07T14:42:09Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"8b0aeea15ca7e9a1ee1bcedd62ee2ebc161acc891feb59282ca6aeb58815a017","abstract_canon_sha256":"08b1ea19e28833bd14c65c8e42c8d6e916b264fcced2d628c5ba99582e254708"},"schema_version":"1.0"},"canonical_sha256":"743ccb0023f3f09f789190ac9f0253a697eaee1215e293b038f66575ddc0e0c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:52.833157Z","signature_b64":"EqbIH9T3CnkkvatC0BPC7URqrU6R+NgovDdDjJTBmVpfmOYNw4YGV8l241uTH9pbKieVQJ+qt8R10DR/R2gRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"743ccb0023f3f09f789190ac9f0253a697eaee1215e293b038f66575ddc0e0c9","last_reissued_at":"2026-05-17T23:47:52.832645Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:52.832645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.03232","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-17T23:47:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HVB4bjR+4JuUhj9lCIEdls/nqIc/j+3yOxzUosFqYcrrMHAngRLQ1qUF0jg6B1WfA15fgltnVjLRtE5hxvAkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T06:07:16.320279Z"},"content_sha256":"93cf302c47aa5d8dfdc33767b7f65800b4cefc90dec1bbd43b78f30b5774fcb4","schema_version":"1.0","event_id":"sha256:93cf302c47aa5d8dfdc33767b7f65800b4cefc90dec1bbd43b78f30b5774fcb4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OQ6MWABD6PYJ66ERSCWJ6ASTU2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized Optimal Transport on a Graph: framework and new distance measures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Guillaume Guex, Ilkka Kivim\\\"aki, Marco Saerens","submitted_at":"2018-06-07T14:42:09Z","abstract_excerpt":"The recently developed bag-of-paths (BoP) framework consists in setting a Gibbs-Boltzmann distribution on all feasible paths of a graph. This probability distribution favors short paths over long ones, with a free parameter (the temperature $T$) controlling the entropic level of the distribution. This formalism enables the computation of new distances or dissimilarities, interpolating between the shortest-path and the resistance distance, which have been shown to perform well in clustering and classification tasks. In this work, the bag-of-paths formalism is extended by adding two independent "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03232","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-17T23:47:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5K120BE36nvL4BpT+7M02gQaVuAR/iasySMVoappVjAw5aW8Q0zNA3RSFgarljalqCy+oxjfbpM11oreadadCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T06:07:16.320644Z"},"content_sha256":"bc49f139be8260984a506964cbc14bb71174ed232f3d2848dbedced5dc1f5699","schema_version":"1.0","event_id":"sha256:bc49f139be8260984a506964cbc14bb71174ed232f3d2848dbedced5dc1f5699"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OQ6MWABD6PYJ66ERSCWJ6ASTU2/bundle.json","state_url":"https://pith.science/pith/OQ6MWABD6PYJ66ERSCWJ6ASTU2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OQ6MWABD6PYJ66ERSCWJ6ASTU2/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:07:16Z","links":{"resolver":"https://pith.science/pith/OQ6MWABD6PYJ66ERSCWJ6ASTU2","bundle":"https://pith.science/pith/OQ6MWABD6PYJ66ERSCWJ6ASTU2/bundle.json","state":"https://pith.science/pith/OQ6MWABD6PYJ66ERSCWJ6ASTU2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OQ6MWABD6PYJ66ERSCWJ6ASTU2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OQ6MWABD6PYJ66ERSCWJ6ASTU2","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":"08b1ea19e28833bd14c65c8e42c8d6e916b264fcced2d628c5ba99582e254708","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-07T14:42:09Z","title_canon_sha256":"8b0aeea15ca7e9a1ee1bcedd62ee2ebc161acc891feb59282ca6aeb58815a017"},"schema_version":"1.0","source":{"id":"1806.03232","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03232","created_at":"2026-05-17T23:47:52Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03232v2","created_at":"2026-05-17T23:47:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03232","created_at":"2026-05-17T23:47:52Z"},{"alias_kind":"pith_short_12","alias_value":"OQ6MWABD6PYJ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OQ6MWABD6PYJ66ER","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OQ6MWABD","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:bc49f139be8260984a506964cbc14bb71174ed232f3d2848dbedced5dc1f5699","target":"graph","created_at":"2026-05-17T23:47:52Z","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":"The recently developed bag-of-paths (BoP) framework consists in setting a Gibbs-Boltzmann distribution on all feasible paths of a graph. This probability distribution favors short paths over long ones, with a free parameter (the temperature $T$) controlling the entropic level of the distribution. This formalism enables the computation of new distances or dissimilarities, interpolating between the shortest-path and the resistance distance, which have been shown to perform well in clustering and classification tasks. In this work, the bag-of-paths formalism is extended by adding two independent ","authors_text":"Guillaume Guex, Ilkka Kivim\\\"aki, Marco Saerens","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-07T14:42:09Z","title":"Randomized Optimal Transport on a Graph: framework and new distance measures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03232","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:93cf302c47aa5d8dfdc33767b7f65800b4cefc90dec1bbd43b78f30b5774fcb4","target":"record","created_at":"2026-05-17T23:47:52Z","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":"08b1ea19e28833bd14c65c8e42c8d6e916b264fcced2d628c5ba99582e254708","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-07T14:42:09Z","title_canon_sha256":"8b0aeea15ca7e9a1ee1bcedd62ee2ebc161acc891feb59282ca6aeb58815a017"},"schema_version":"1.0","source":{"id":"1806.03232","kind":"arxiv","version":2}},"canonical_sha256":"743ccb0023f3f09f789190ac9f0253a697eaee1215e293b038f66575ddc0e0c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"743ccb0023f3f09f789190ac9f0253a697eaee1215e293b038f66575ddc0e0c9","first_computed_at":"2026-05-17T23:47:52.832645Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:52.832645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EqbIH9T3CnkkvatC0BPC7URqrU6R+NgovDdDjJTBmVpfmOYNw4YGV8l241uTH9pbKieVQJ+qt8R10DR/R2gRDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:52.833157Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03232","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93cf302c47aa5d8dfdc33767b7f65800b4cefc90dec1bbd43b78f30b5774fcb4","sha256:bc49f139be8260984a506964cbc14bb71174ed232f3d2848dbedced5dc1f5699"],"state_sha256":"cd74b89b8f78f169843089541f05c7aa42183e5586ecea1b7f0bdf77be435f4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zPK4HCgo5deeddRZvvMJ7BVMP7d0ashjBUq8bnhrQI1ThXEciA+l89Tic/L2HbEx8hNFw/SLC6Heu9Pvy069Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T06:07:16.322526Z","bundle_sha256":"ba6cf8d1491640cf76c9865f351263b883a2c035dab70782d9d69eddd8f75d02"}}