{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KETLXG3X3GBVYLPKCYOSWET2MD","short_pith_number":"pith:KETLXG3X","schema_version":"1.0","canonical_sha256":"5126bb9b77d9835c2dea161d2b127a60d609fc26b6c09a4945e80c75538dcecb","source":{"kind":"arxiv","id":"1905.07547","version":5},"attestation_state":"computed","paper":{"title":"Kantorovich distance on a finite metric space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Giovanni Pistone, Luigi Montrucchio","submitted_at":"2019-05-18T07:41:26Z","abstract_excerpt":"Kantorovich distance (or 1-Wasserstein distance) on the probability simplex of a finite metric space is the value of a Linear Programming problem for which a closed-form expression is known in some cases. When the ground distance is defined by a graph, a few examples have already been studied. In the present paper, after re-deriving, with different tools, the result for trees, we prove that, for an arbitrary weighted graph, the K-distance is the minimum of the K-distances over all the spanning trees associated with the graph. We work in the dual LP-problem by using Arens-Eells norm associated "},"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":"1905.07547","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-05-18T07:41:26Z","cross_cats_sorted":[],"title_canon_sha256":"263086205695b006d753fe69e56e26faf8e263f06c9102583c5bb32961637209","abstract_canon_sha256":"befb3e569fdec66a79078d381a292a81e7109a5445b71c59d0186c144fe8a2f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:18:07.628536Z","signature_b64":"WxbiyWIAxicn1FDf4hn7W9hKRhCeh15mS5sfJCUmf1sp/tQXSzlAaAGjSPODSV9Zu+BjUIkFggcAjU3OEI8fCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5126bb9b77d9835c2dea161d2b127a60d609fc26b6c09a4945e80c75538dcecb","last_reissued_at":"2026-07-05T00:18:07.628114Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:18:07.628114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kantorovich distance on a finite metric space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Giovanni Pistone, Luigi Montrucchio","submitted_at":"2019-05-18T07:41:26Z","abstract_excerpt":"Kantorovich distance (or 1-Wasserstein distance) on the probability simplex of a finite metric space is the value of a Linear Programming problem for which a closed-form expression is known in some cases. When the ground distance is defined by a graph, a few examples have already been studied. In the present paper, after re-deriving, with different tools, the result for trees, we prove that, for an arbitrary weighted graph, the K-distance is the minimum of the K-distances over all the spanning trees associated with the graph. We work in the dual LP-problem by using Arens-Eells norm associated "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07547","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.07547/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1905.07547","created_at":"2026-07-05T00:18:07.628169+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.07547v5","created_at":"2026-07-05T00:18:07.628169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07547","created_at":"2026-07-05T00:18:07.628169+00:00"},{"alias_kind":"pith_short_12","alias_value":"KETLXG3X3GBV","created_at":"2026-07-05T00:18:07.628169+00:00"},{"alias_kind":"pith_short_16","alias_value":"KETLXG3X3GBVYLPK","created_at":"2026-07-05T00:18:07.628169+00:00"},{"alias_kind":"pith_short_8","alias_value":"KETLXG3X","created_at":"2026-07-05T00:18:07.628169+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2404.15261","citing_title":"Resistance Distance and Linearized Optimal Transport on Graphs","ref_index":57,"is_internal_anchor":false},{"citing_arxiv_id":"2601.04193","citing_title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KETLXG3X3GBVYLPKCYOSWET2MD","json":"https://pith.science/pith/KETLXG3X3GBVYLPKCYOSWET2MD.json","graph_json":"https://pith.science/api/pith-number/KETLXG3X3GBVYLPKCYOSWET2MD/graph.json","events_json":"https://pith.science/api/pith-number/KETLXG3X3GBVYLPKCYOSWET2MD/events.json","paper":"https://pith.science/paper/KETLXG3X"},"agent_actions":{"view_html":"https://pith.science/pith/KETLXG3X3GBVYLPKCYOSWET2MD","download_json":"https://pith.science/pith/KETLXG3X3GBVYLPKCYOSWET2MD.json","view_paper":"https://pith.science/paper/KETLXG3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.07547&json=true","fetch_graph":"https://pith.science/api/pith-number/KETLXG3X3GBVYLPKCYOSWET2MD/graph.json","fetch_events":"https://pith.science/api/pith-number/KETLXG3X3GBVYLPKCYOSWET2MD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KETLXG3X3GBVYLPKCYOSWET2MD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KETLXG3X3GBVYLPKCYOSWET2MD/action/storage_attestation","attest_author":"https://pith.science/pith/KETLXG3X3GBVYLPKCYOSWET2MD/action/author_attestation","sign_citation":"https://pith.science/pith/KETLXG3X3GBVYLPKCYOSWET2MD/action/citation_signature","submit_replication":"https://pith.science/pith/KETLXG3X3GBVYLPKCYOSWET2MD/action/replication_record"}},"created_at":"2026-07-05T00:18:07.628169+00:00","updated_at":"2026-07-05T00:18:07.628169+00:00"}