{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NDOOWDKW5IY2P5VVHRF7PSRXHE","short_pith_number":"pith:NDOOWDKW","schema_version":"1.0","canonical_sha256":"68dceb0d56ea31a7f6b53c4bf7ca3739082c0711f9c5fca4bbc4b664c9a32dfc","source":{"kind":"arxiv","id":"1809.04249","version":5},"attestation_state":"computed","paper":{"title":"A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Defeng Sun, Jia Li, Kim-Chuan Toh, Lei Yang","submitted_at":"2018-09-12T04:13:48Z","abstract_excerpt":"We consider the problem of computing a Wasserstein barycenter for a set of discrete probability distributions with finite supports, which finds many applications in areas such as statistics, machine learning and image processing. When the support points of the barycenter are pre-specified, this problem can be modeled as a linear programming (LP) problem whose size can be extremely large. To handle this large-scale LP, we analyse the structure of its dual problem, which is conceivably more tractable and can be reformulated as a well-structured convex problem with 3 kinds of block variables and "},"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":"1809.04249","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-12T04:13:48Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a8a5ce2d7dec335395043cebc8047b5c396b819d0c8cc3d1db9d5d0250ebac9e","abstract_canon_sha256":"9ab3817c62c0e1a0bacd06b6dc71c584315b442ae4d82b27eb35ffa666777c1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:01:59.645366Z","signature_b64":"BHxfjNcxdsnZwp/+VKRxM6LcxlhYQNaLM9JJ8tZV50YxuatyMmG5X1Z1wsAWJKUltVWhTjvuwv2CNSIOmNC/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68dceb0d56ea31a7f6b53c4bf7ca3739082c0711f9c5fca4bbc4b664c9a32dfc","last_reissued_at":"2026-07-05T02:01:59.644972Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:01:59.644972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Defeng Sun, Jia Li, Kim-Chuan Toh, Lei Yang","submitted_at":"2018-09-12T04:13:48Z","abstract_excerpt":"We consider the problem of computing a Wasserstein barycenter for a set of discrete probability distributions with finite supports, which finds many applications in areas such as statistics, machine learning and image processing. When the support points of the barycenter are pre-specified, this problem can be modeled as a linear programming (LP) problem whose size can be extremely large. To handle this large-scale LP, we analyse the structure of its dual problem, which is conceivably more tractable and can be reformulated as a well-structured convex problem with 3 kinds of block variables and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04249","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/1809.04249/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":"1809.04249","created_at":"2026-07-05T02:01:59.645027+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.04249v5","created_at":"2026-07-05T02:01:59.645027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04249","created_at":"2026-07-05T02:01:59.645027+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDOOWDKW5IY2","created_at":"2026-07-05T02:01:59.645027+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDOOWDKW5IY2P5VV","created_at":"2026-07-05T02:01:59.645027+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDOOWDKW","created_at":"2026-07-05T02:01:59.645027+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.04652","citing_title":"A multi-level ADMM algorithm for elliptic PDE-constrained optimization problems","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NDOOWDKW5IY2P5VVHRF7PSRXHE","json":"https://pith.science/pith/NDOOWDKW5IY2P5VVHRF7PSRXHE.json","graph_json":"https://pith.science/api/pith-number/NDOOWDKW5IY2P5VVHRF7PSRXHE/graph.json","events_json":"https://pith.science/api/pith-number/NDOOWDKW5IY2P5VVHRF7PSRXHE/events.json","paper":"https://pith.science/paper/NDOOWDKW"},"agent_actions":{"view_html":"https://pith.science/pith/NDOOWDKW5IY2P5VVHRF7PSRXHE","download_json":"https://pith.science/pith/NDOOWDKW5IY2P5VVHRF7PSRXHE.json","view_paper":"https://pith.science/paper/NDOOWDKW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.04249&json=true","fetch_graph":"https://pith.science/api/pith-number/NDOOWDKW5IY2P5VVHRF7PSRXHE/graph.json","fetch_events":"https://pith.science/api/pith-number/NDOOWDKW5IY2P5VVHRF7PSRXHE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDOOWDKW5IY2P5VVHRF7PSRXHE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDOOWDKW5IY2P5VVHRF7PSRXHE/action/storage_attestation","attest_author":"https://pith.science/pith/NDOOWDKW5IY2P5VVHRF7PSRXHE/action/author_attestation","sign_citation":"https://pith.science/pith/NDOOWDKW5IY2P5VVHRF7PSRXHE/action/citation_signature","submit_replication":"https://pith.science/pith/NDOOWDKW5IY2P5VVHRF7PSRXHE/action/replication_record"}},"created_at":"2026-07-05T02:01:59.645027+00:00","updated_at":"2026-07-05T02:01:59.645027+00:00"}