{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UORHRGVSYEDJVAN3VP7U36DDWH","short_pith_number":"pith:UORHRGVS","canonical_record":{"source":{"id":"1805.07416","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-18T19:45:05Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4e32cd51e0a3fb2bff565a52d0c85c302861fd7b2079c71884690675eedfdd9a","abstract_canon_sha256":"3940c7c3c225e519d4c0e86a2a7074647247d2dd398311ef337bad662b441488"},"schema_version":"1.0"},"canonical_sha256":"a3a2789ab2c1069a81bbabff4df863b1e01ba8f8917cfb13f51c2b85fed70e3b","source":{"kind":"arxiv","id":"1805.07416","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07416","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07416v2","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07416","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"pith_short_12","alias_value":"UORHRGVSYEDJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UORHRGVSYEDJVAN3","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UORHRGVS","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UORHRGVSYEDJVAN3VP7U36DDWH","target":"record","payload":{"canonical_record":{"source":{"id":"1805.07416","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-18T19:45:05Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4e32cd51e0a3fb2bff565a52d0c85c302861fd7b2079c71884690675eedfdd9a","abstract_canon_sha256":"3940c7c3c225e519d4c0e86a2a7074647247d2dd398311ef337bad662b441488"},"schema_version":"1.0"},"canonical_sha256":"a3a2789ab2c1069a81bbabff4df863b1e01ba8f8917cfb13f51c2b85fed70e3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:33.940079Z","signature_b64":"54x1Es39W5sstzVE0uVvDMS63dGfe2SgDONe4iWQ5xOGMXb8l7GaEc5vvTJ1beefkEYcliBvV4/0yaUPyTMwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3a2789ab2c1069a81bbabff4df863b1e01ba8f8917cfb13f51c2b85fed70e3b","last_reissued_at":"2026-05-17T23:56:33.939242Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:33.939242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.07416","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:56:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ttID+1Yi23DVL1pV7F37FkhDaTU5X6Uce1jddjVt1q2eWVR0EAWRlmd4xbDNF17NDwByPcvlhSM3iYFSzPHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:43:23.098567Z"},"content_sha256":"19f7ca7913d821059e7cb39300e1f41420d0b83d5839e030ceaf4044b0021d5a","schema_version":"1.0","event_id":"sha256:19f7ca7913d821059e7cb39300e1f41420d0b83d5839e030ceaf4044b0021d5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UORHRGVSYEDJVAN3VP7U36DDWH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Kantorovich-Wasserstein Distances on $d$-dimensional histograms using $(d+1)$-partite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Federico Bassetti, Gennaro Auricchio, Marco Veneroni, Stefano Gualandi","submitted_at":"2018-05-18T19:45:05Z","abstract_excerpt":"This paper presents a novel method to compute the exact Kantorovich-Wasserstein distance between a pair of $d$-dimensional histograms having $n$ bins each. We prove that this problem is equivalent to an uncapacitated minimum cost flow problem on a $(d+1)$-partite graph with $(d+1)n$ nodes and $dn^{\\frac{d+1}{d}}$ arcs, whenever the cost is separable along the principal $d$-dimensional directions. We show numerically the benefits of our approach by computing the Kantorovich-Wasserstein distance of order 2 among two sets of instances: gray scale images and $d$-dimensional biomedical histograms. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07416","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:56:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fdDI1Pn0Gh5lCLcjuXpyw1RwQ9MFuKUZJ2Z/eKam7djr51/eLpQBez+3c7GewN3CuWlbWPiksA3u02m/l/NqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:43:23.099248Z"},"content_sha256":"98ec26ce0ad41c907360a49342a2f7e1375eb36ff2afec6b79d62bfdcb50974e","schema_version":"1.0","event_id":"sha256:98ec26ce0ad41c907360a49342a2f7e1375eb36ff2afec6b79d62bfdcb50974e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UORHRGVSYEDJVAN3VP7U36DDWH/bundle.json","state_url":"https://pith.science/pith/UORHRGVSYEDJVAN3VP7U36DDWH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UORHRGVSYEDJVAN3VP7U36DDWH/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-05-27T00:43:23Z","links":{"resolver":"https://pith.science/pith/UORHRGVSYEDJVAN3VP7U36DDWH","bundle":"https://pith.science/pith/UORHRGVSYEDJVAN3VP7U36DDWH/bundle.json","state":"https://pith.science/pith/UORHRGVSYEDJVAN3VP7U36DDWH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UORHRGVSYEDJVAN3VP7U36DDWH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UORHRGVSYEDJVAN3VP7U36DDWH","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":"3940c7c3c225e519d4c0e86a2a7074647247d2dd398311ef337bad662b441488","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-18T19:45:05Z","title_canon_sha256":"4e32cd51e0a3fb2bff565a52d0c85c302861fd7b2079c71884690675eedfdd9a"},"schema_version":"1.0","source":{"id":"1805.07416","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07416","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07416v2","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07416","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"pith_short_12","alias_value":"UORHRGVSYEDJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UORHRGVSYEDJVAN3","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UORHRGVS","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:98ec26ce0ad41c907360a49342a2f7e1375eb36ff2afec6b79d62bfdcb50974e","target":"graph","created_at":"2026-05-17T23:56:33Z","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":"This paper presents a novel method to compute the exact Kantorovich-Wasserstein distance between a pair of $d$-dimensional histograms having $n$ bins each. We prove that this problem is equivalent to an uncapacitated minimum cost flow problem on a $(d+1)$-partite graph with $(d+1)n$ nodes and $dn^{\\frac{d+1}{d}}$ arcs, whenever the cost is separable along the principal $d$-dimensional directions. We show numerically the benefits of our approach by computing the Kantorovich-Wasserstein distance of order 2 among two sets of instances: gray scale images and $d$-dimensional biomedical histograms. ","authors_text":"Federico Bassetti, Gennaro Auricchio, Marco Veneroni, Stefano Gualandi","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-18T19:45:05Z","title":"Computing Kantorovich-Wasserstein Distances on $d$-dimensional histograms using $(d+1)$-partite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07416","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:19f7ca7913d821059e7cb39300e1f41420d0b83d5839e030ceaf4044b0021d5a","target":"record","created_at":"2026-05-17T23:56:33Z","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":"3940c7c3c225e519d4c0e86a2a7074647247d2dd398311ef337bad662b441488","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-18T19:45:05Z","title_canon_sha256":"4e32cd51e0a3fb2bff565a52d0c85c302861fd7b2079c71884690675eedfdd9a"},"schema_version":"1.0","source":{"id":"1805.07416","kind":"arxiv","version":2}},"canonical_sha256":"a3a2789ab2c1069a81bbabff4df863b1e01ba8f8917cfb13f51c2b85fed70e3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3a2789ab2c1069a81bbabff4df863b1e01ba8f8917cfb13f51c2b85fed70e3b","first_computed_at":"2026-05-17T23:56:33.939242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:33.939242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"54x1Es39W5sstzVE0uVvDMS63dGfe2SgDONe4iWQ5xOGMXb8l7GaEc5vvTJ1beefkEYcliBvV4/0yaUPyTMwCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:33.940079Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.07416","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19f7ca7913d821059e7cb39300e1f41420d0b83d5839e030ceaf4044b0021d5a","sha256:98ec26ce0ad41c907360a49342a2f7e1375eb36ff2afec6b79d62bfdcb50974e"],"state_sha256":"7585535d5cea3dc1158aa7150f5e636c0e3bf29f4f76aa02e132f5321f45521a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KXr7NOg+RpaGg4VvKtCv19IcoysJy1PlS6t6L12RYIzztHdYTO9UrCvRw0oKvO1x8JhfcpS0gWIuVpbaiqQiBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:43:23.102863Z","bundle_sha256":"f4ab9a39fc2e8b988dd82c1797bae49b74f950479fbd43cde96e9e9a13f30d0c"}}