{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VGSN3Y2EHJGL277UIHUFVEKFDP","short_pith_number":"pith:VGSN3Y2E","schema_version":"1.0","canonical_sha256":"a9a4dde3443a4cbd7ff441e85a91451bc67e3b38541342a7b6180efdacbe86e8","source":{"kind":"arxiv","id":"1804.00445","version":3},"attestation_state":"computed","paper":{"title":"On the Computation of Kantorovich-Wasserstein Distances between 2D-Histograms by Uncapacitated Minimum Cost Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Federico Bassetti, Marco Veneroni, Stefano Gualandi","submitted_at":"2018-04-02T10:40:48Z","abstract_excerpt":"In this work, we present a method to compute the Kantorovich-Wasserstein distance of order one between a pair of two-dimensional histograms. Recent works in Computer Vision and Machine Learning have shown the benefits of measuring Wasserstein distances of order one between histograms with $n$ bins, by solving a classical transportation problem on very large complete bipartite graphs with $n$ nodes and $n^2$ edges. The main contribution of our work is to approximate the original transportation problem by an uncapacitated min cost flow problem on a reduced flow network of size $O(n)$ that exploi"},"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":"1804.00445","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-02T10:40:48Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4ab40afa07d4840108e23f55a104090e05b004a85015ce40b8a3870c9e016997","abstract_canon_sha256":"b6d411292238acae41954c5933e0d79dca755198558891a1078d18fe89797fe6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:32.424102Z","signature_b64":"Br3pkRziM/PyP9LKWnPU3AVEvSu6VvZkiPWlngtpWxInufqSITLcifPuWiUsrX7GOcDBuSWXF7XIZM557v8BDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9a4dde3443a4cbd7ff441e85a91451bc67e3b38541342a7b6180efdacbe86e8","last_reissued_at":"2026-05-17T23:39:32.423409Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:32.423409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Computation of Kantorovich-Wasserstein Distances between 2D-Histograms by Uncapacitated Minimum Cost Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Federico Bassetti, Marco Veneroni, Stefano Gualandi","submitted_at":"2018-04-02T10:40:48Z","abstract_excerpt":"In this work, we present a method to compute the Kantorovich-Wasserstein distance of order one between a pair of two-dimensional histograms. Recent works in Computer Vision and Machine Learning have shown the benefits of measuring Wasserstein distances of order one between histograms with $n$ bins, by solving a classical transportation problem on very large complete bipartite graphs with $n$ nodes and $n^2$ edges. The main contribution of our work is to approximate the original transportation problem by an uncapacitated min cost flow problem on a reduced flow network of size $O(n)$ that exploi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00445","kind":"arxiv","version":3},"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":"1804.00445","created_at":"2026-05-17T23:39:32.423519+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.00445v3","created_at":"2026-05-17T23:39:32.423519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00445","created_at":"2026-05-17T23:39:32.423519+00:00"},{"alias_kind":"pith_short_12","alias_value":"VGSN3Y2EHJGL","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VGSN3Y2EHJGL277U","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VGSN3Y2E","created_at":"2026-05-18T12:32:59.047623+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/VGSN3Y2EHJGL277UIHUFVEKFDP","json":"https://pith.science/pith/VGSN3Y2EHJGL277UIHUFVEKFDP.json","graph_json":"https://pith.science/api/pith-number/VGSN3Y2EHJGL277UIHUFVEKFDP/graph.json","events_json":"https://pith.science/api/pith-number/VGSN3Y2EHJGL277UIHUFVEKFDP/events.json","paper":"https://pith.science/paper/VGSN3Y2E"},"agent_actions":{"view_html":"https://pith.science/pith/VGSN3Y2EHJGL277UIHUFVEKFDP","download_json":"https://pith.science/pith/VGSN3Y2EHJGL277UIHUFVEKFDP.json","view_paper":"https://pith.science/paper/VGSN3Y2E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.00445&json=true","fetch_graph":"https://pith.science/api/pith-number/VGSN3Y2EHJGL277UIHUFVEKFDP/graph.json","fetch_events":"https://pith.science/api/pith-number/VGSN3Y2EHJGL277UIHUFVEKFDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VGSN3Y2EHJGL277UIHUFVEKFDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VGSN3Y2EHJGL277UIHUFVEKFDP/action/storage_attestation","attest_author":"https://pith.science/pith/VGSN3Y2EHJGL277UIHUFVEKFDP/action/author_attestation","sign_citation":"https://pith.science/pith/VGSN3Y2EHJGL277UIHUFVEKFDP/action/citation_signature","submit_replication":"https://pith.science/pith/VGSN3Y2EHJGL277UIHUFVEKFDP/action/replication_record"}},"created_at":"2026-05-17T23:39:32.423519+00:00","updated_at":"2026-05-17T23:39:32.423519+00:00"}