{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:K6MDJ4476TURBIKT3N4JQMRYKW","short_pith_number":"pith:K6MDJ447","schema_version":"1.0","canonical_sha256":"579834f39ff4e910a153db78983238558d6468e7004feb6a9f10c5eff0b4e324","source":{"kind":"arxiv","id":"2511.04607","version":2},"attestation_state":"computed","paper":{"title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiaqi Wang, Weijun Xie","submitted_at":"2025-11-06T17:58:42Z","abstract_excerpt":"Given a collection of probability measures, the Wasserstein barycenter problem seeks a probability measure that minimizes the weighted sum of their squared type-$2$ Wasserstein distances. We study the discrete setting, in which every input measure has finite support; this setting arises frequently in machine learning and operations research. Since computing a discrete Wasserstein barycenter is NP-hard, we develop approximation algorithms with provable performance guarantees. The best previously known polynomial-time guarantee is a factor of $2$. We improve this bound by proposing a polynomial-"},"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":"2511.04607","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-11-06T17:58:42Z","cross_cats_sorted":[],"title_canon_sha256":"6919b1d170b318da617bdb41cb0d466e46269739eb0ef16305140b4e8d6cfcc8","abstract_canon_sha256":"32f438568dd1e6ce88b28e2ee76e292f983762e41b91fcb0b27c0ad312e2d18b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T01:58:07.198164Z","signature_b64":"UFl4IsQyFey07XQ3jSWEqXAnv+p/RvbDMf4fXXLD7C1U3FwVzYTudiUNvOu/bFYUfgWI+fyP2bZenkvAFazZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"579834f39ff4e910a153db78983238558d6468e7004feb6a9f10c5eff0b4e324","last_reissued_at":"2026-08-04T01:58:07.196610Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T01:58:07.196610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiaqi Wang, Weijun Xie","submitted_at":"2025-11-06T17:58:42Z","abstract_excerpt":"Given a collection of probability measures, the Wasserstein barycenter problem seeks a probability measure that minimizes the weighted sum of their squared type-$2$ Wasserstein distances. We study the discrete setting, in which every input measure has finite support; this setting arises frequently in machine learning and operations research. Since computing a discrete Wasserstein barycenter is NP-hard, we develop approximation algorithms with provable performance guarantees. The best previously known polynomial-time guarantee is a factor of $2$. We improve this bound by proposing a polynomial-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.04607","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2511.04607/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":"2511.04607","created_at":"2026-08-04T01:58:07.197963+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.04607v2","created_at":"2026-08-04T01:58:07.197963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.04607","created_at":"2026-08-04T01:58:07.197963+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6MDJ4476TUR","created_at":"2026-08-04T01:58:07.197963+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6MDJ4476TURBIKT","created_at":"2026-08-04T01:58:07.197963+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6MDJ447","created_at":"2026-08-04T01:58:07.197963+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/K6MDJ4476TURBIKT3N4JQMRYKW","json":"https://pith.science/pith/K6MDJ4476TURBIKT3N4JQMRYKW.json","graph_json":"https://pith.science/api/pith-number/K6MDJ4476TURBIKT3N4JQMRYKW/graph.json","events_json":"https://pith.science/api/pith-number/K6MDJ4476TURBIKT3N4JQMRYKW/events.json","paper":"https://pith.science/paper/K6MDJ447"},"agent_actions":{"view_html":"https://pith.science/pith/K6MDJ4476TURBIKT3N4JQMRYKW","download_json":"https://pith.science/pith/K6MDJ4476TURBIKT3N4JQMRYKW.json","view_paper":"https://pith.science/paper/K6MDJ447","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.04607&json=true","fetch_graph":"https://pith.science/api/pith-number/K6MDJ4476TURBIKT3N4JQMRYKW/graph.json","fetch_events":"https://pith.science/api/pith-number/K6MDJ4476TURBIKT3N4JQMRYKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6MDJ4476TURBIKT3N4JQMRYKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6MDJ4476TURBIKT3N4JQMRYKW/action/storage_attestation","attest_author":"https://pith.science/pith/K6MDJ4476TURBIKT3N4JQMRYKW/action/author_attestation","sign_citation":"https://pith.science/pith/K6MDJ4476TURBIKT3N4JQMRYKW/action/citation_signature","submit_replication":"https://pith.science/pith/K6MDJ4476TURBIKT3N4JQMRYKW/action/replication_record"}},"created_at":"2026-08-04T01:58:07.197963+00:00","updated_at":"2026-08-04T01:58:07.197963+00:00"}