{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UQ2Q7K5P6BENPIVECL2WAJTMWR","short_pith_number":"pith:UQ2Q7K5P","schema_version":"1.0","canonical_sha256":"a4350fabaff048d7a2a412f560266cb477fd556b9b6a5f858af1d447351e1d77","source":{"kind":"arxiv","id":"1910.07568","version":3},"attestation_state":"computed","paper":{"title":"On the Computational Complexity of Finding a Sparse Wasserstein Barycenter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.OC","authors_text":"Steffen Borgwardt, Stephan Patterson","submitted_at":"2019-10-16T18:52:28Z","abstract_excerpt":"The discrete Wasserstein barycenter problem is a minimum-cost mass transport problem for a set of probability measures with finite support. In this paper, we show that finding a barycenter of sparse support is hard, even in dimension 2 and for only 3 measures. We prove this claim by showing that a special case of an intimately related decision problem SCMP -- does there exist a measure with a non-mass-splitting transport cost and support size below prescribed bounds? -- is NP-hard for all rational data. Our proof is based on a reduction from planar 3-dimensional matching and follows a strategy"},"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":"1910.07568","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-10-16T18:52:28Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"904f51cbe09c0746fa6073ca802ecbb6c9caf0bd95a993d8f66ac25f1a21c05c","abstract_canon_sha256":"12cf14c9444ecd37bd800c8b7f8a68246ded614e84350f9335f1a5f4bb9841db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:54:53.450100Z","signature_b64":"o+y6u6zCRns182k7k8boggxsrhElR99wk+ewu65EKN5e0I2/MeXHoobX8jG8Hv0lSOIlsFmfYyffw0pB7sBHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4350fabaff048d7a2a412f560266cb477fd556b9b6a5f858af1d447351e1d77","last_reissued_at":"2026-07-05T03:54:53.449691Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:54:53.449691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Computational Complexity of Finding a Sparse Wasserstein Barycenter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.OC","authors_text":"Steffen Borgwardt, Stephan Patterson","submitted_at":"2019-10-16T18:52:28Z","abstract_excerpt":"The discrete Wasserstein barycenter problem is a minimum-cost mass transport problem for a set of probability measures with finite support. In this paper, we show that finding a barycenter of sparse support is hard, even in dimension 2 and for only 3 measures. We prove this claim by showing that a special case of an intimately related decision problem SCMP -- does there exist a measure with a non-mass-splitting transport cost and support size below prescribed bounds? -- is NP-hard for all rational data. Our proof is based on a reduction from planar 3-dimensional matching and follows a strategy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.07568","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.07568/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":"1910.07568","created_at":"2026-07-05T03:54:53.449779+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.07568v3","created_at":"2026-07-05T03:54:53.449779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.07568","created_at":"2026-07-05T03:54:53.449779+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQ2Q7K5P6BEN","created_at":"2026-07-05T03:54:53.449779+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQ2Q7K5P6BENPIVE","created_at":"2026-07-05T03:54:53.449779+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQ2Q7K5P","created_at":"2026-07-05T03:54:53.449779+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.18312","citing_title":"Decentralised convex optimisation with probability-proportional-to-size quantization","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UQ2Q7K5P6BENPIVECL2WAJTMWR","json":"https://pith.science/pith/UQ2Q7K5P6BENPIVECL2WAJTMWR.json","graph_json":"https://pith.science/api/pith-number/UQ2Q7K5P6BENPIVECL2WAJTMWR/graph.json","events_json":"https://pith.science/api/pith-number/UQ2Q7K5P6BENPIVECL2WAJTMWR/events.json","paper":"https://pith.science/paper/UQ2Q7K5P"},"agent_actions":{"view_html":"https://pith.science/pith/UQ2Q7K5P6BENPIVECL2WAJTMWR","download_json":"https://pith.science/pith/UQ2Q7K5P6BENPIVECL2WAJTMWR.json","view_paper":"https://pith.science/paper/UQ2Q7K5P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.07568&json=true","fetch_graph":"https://pith.science/api/pith-number/UQ2Q7K5P6BENPIVECL2WAJTMWR/graph.json","fetch_events":"https://pith.science/api/pith-number/UQ2Q7K5P6BENPIVECL2WAJTMWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQ2Q7K5P6BENPIVECL2WAJTMWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQ2Q7K5P6BENPIVECL2WAJTMWR/action/storage_attestation","attest_author":"https://pith.science/pith/UQ2Q7K5P6BENPIVECL2WAJTMWR/action/author_attestation","sign_citation":"https://pith.science/pith/UQ2Q7K5P6BENPIVECL2WAJTMWR/action/citation_signature","submit_replication":"https://pith.science/pith/UQ2Q7K5P6BENPIVECL2WAJTMWR/action/replication_record"}},"created_at":"2026-07-05T03:54:53.449779+00:00","updated_at":"2026-07-05T03:54:53.449779+00:00"}