{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UORHRGVSYEDJVAN3VP7U36DDWH","short_pith_number":"pith:UORHRGVS","schema_version":"1.0","canonical_sha256":"a3a2789ab2c1069a81bbabff4df863b1e01ba8f8917cfb13f51c2b85fed70e3b","source":{"kind":"arxiv","id":"1805.07416","version":2},"attestation_state":"computed","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. "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.07416","created_at":"2026-05-17T23:56:33.939369+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07416v2","created_at":"2026-05-17T23:56:33.939369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07416","created_at":"2026-05-17T23:56:33.939369+00:00"},{"alias_kind":"pith_short_12","alias_value":"UORHRGVSYEDJ","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UORHRGVSYEDJVAN3","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UORHRGVS","created_at":"2026-05-18T12:32:56.356000+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/UORHRGVSYEDJVAN3VP7U36DDWH","json":"https://pith.science/pith/UORHRGVSYEDJVAN3VP7U36DDWH.json","graph_json":"https://pith.science/api/pith-number/UORHRGVSYEDJVAN3VP7U36DDWH/graph.json","events_json":"https://pith.science/api/pith-number/UORHRGVSYEDJVAN3VP7U36DDWH/events.json","paper":"https://pith.science/paper/UORHRGVS"},"agent_actions":{"view_html":"https://pith.science/pith/UORHRGVSYEDJVAN3VP7U36DDWH","download_json":"https://pith.science/pith/UORHRGVSYEDJVAN3VP7U36DDWH.json","view_paper":"https://pith.science/paper/UORHRGVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07416&json=true","fetch_graph":"https://pith.science/api/pith-number/UORHRGVSYEDJVAN3VP7U36DDWH/graph.json","fetch_events":"https://pith.science/api/pith-number/UORHRGVSYEDJVAN3VP7U36DDWH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UORHRGVSYEDJVAN3VP7U36DDWH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UORHRGVSYEDJVAN3VP7U36DDWH/action/storage_attestation","attest_author":"https://pith.science/pith/UORHRGVSYEDJVAN3VP7U36DDWH/action/author_attestation","sign_citation":"https://pith.science/pith/UORHRGVSYEDJVAN3VP7U36DDWH/action/citation_signature","submit_replication":"https://pith.science/pith/UORHRGVSYEDJVAN3VP7U36DDWH/action/replication_record"}},"created_at":"2026-05-17T23:56:33.939369+00:00","updated_at":"2026-05-17T23:56:33.939369+00:00"}