{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:GVSNEILBH5V2TP2AGRXLJ6U3JF","short_pith_number":"pith:GVSNEILB","schema_version":"1.0","canonical_sha256":"3564d221613f6ba9bf40346eb4fa9b494b548c21319c01cd55cafa6381c0e6e1","source":{"kind":"arxiv","id":"2006.06763","version":3},"attestation_state":"computed","paper":{"title":"Stochastic Saddle-Point Optimization for Wasserstein Barycenters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Daniil Tiapkin, Pavel Dvurechensky","submitted_at":"2020-06-11T19:40:38Z","abstract_excerpt":"We consider the population Wasserstein barycenter problem for random probability measures supported on a finite set of points and generated by an online stream of data. This leads to a complicated stochastic optimization problem where the objective is given as an expectation of a function given as a solution to a random optimization problem. We employ the structure of the problem and obtain a convex-concave stochastic saddle-point reformulation of this problem. In the setting when the distribution of random probability measures is discrete, we propose a stochastic optimization algorithm and es"},"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":"2006.06763","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-06-11T19:40:38Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"1fa067a45f70dc74e2bd58bff1d32274c17cdd89feb04fbac983a3a400d9b009","abstract_canon_sha256":"a1bfdaa0e1181467e88af521e6782b853b7cd1b54f9071919178febd11b1abe8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:37:10.580330Z","signature_b64":"bWwMRlLsuVGc8b5LeCBbrPbnPG6hJ+w+fUV41AlYgu6paLmof52D8ZGnLm8fyV7/AfdPrJ5hSHe3BtuWGEIJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3564d221613f6ba9bf40346eb4fa9b494b548c21319c01cd55cafa6381c0e6e1","last_reissued_at":"2026-07-05T03:37:10.579873Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:37:10.579873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Saddle-Point Optimization for Wasserstein Barycenters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Daniil Tiapkin, Pavel Dvurechensky","submitted_at":"2020-06-11T19:40:38Z","abstract_excerpt":"We consider the population Wasserstein barycenter problem for random probability measures supported on a finite set of points and generated by an online stream of data. This leads to a complicated stochastic optimization problem where the objective is given as an expectation of a function given as a solution to a random optimization problem. We employ the structure of the problem and obtain a convex-concave stochastic saddle-point reformulation of this problem. In the setting when the distribution of random probability measures is discrete, we propose a stochastic optimization algorithm and es"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.06763","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/2006.06763/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":"2006.06763","created_at":"2026-07-05T03:37:10.579931+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.06763v3","created_at":"2026-07-05T03:37:10.579931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.06763","created_at":"2026-07-05T03:37:10.579931+00:00"},{"alias_kind":"pith_short_12","alias_value":"GVSNEILBH5V2","created_at":"2026-07-05T03:37:10.579931+00:00"},{"alias_kind":"pith_short_16","alias_value":"GVSNEILBH5V2TP2A","created_at":"2026-07-05T03:37:10.579931+00:00"},{"alias_kind":"pith_short_8","alias_value":"GVSNEILB","created_at":"2026-07-05T03:37:10.579931+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":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GVSNEILBH5V2TP2AGRXLJ6U3JF","json":"https://pith.science/pith/GVSNEILBH5V2TP2AGRXLJ6U3JF.json","graph_json":"https://pith.science/api/pith-number/GVSNEILBH5V2TP2AGRXLJ6U3JF/graph.json","events_json":"https://pith.science/api/pith-number/GVSNEILBH5V2TP2AGRXLJ6U3JF/events.json","paper":"https://pith.science/paper/GVSNEILB"},"agent_actions":{"view_html":"https://pith.science/pith/GVSNEILBH5V2TP2AGRXLJ6U3JF","download_json":"https://pith.science/pith/GVSNEILBH5V2TP2AGRXLJ6U3JF.json","view_paper":"https://pith.science/paper/GVSNEILB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.06763&json=true","fetch_graph":"https://pith.science/api/pith-number/GVSNEILBH5V2TP2AGRXLJ6U3JF/graph.json","fetch_events":"https://pith.science/api/pith-number/GVSNEILBH5V2TP2AGRXLJ6U3JF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GVSNEILBH5V2TP2AGRXLJ6U3JF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GVSNEILBH5V2TP2AGRXLJ6U3JF/action/storage_attestation","attest_author":"https://pith.science/pith/GVSNEILBH5V2TP2AGRXLJ6U3JF/action/author_attestation","sign_citation":"https://pith.science/pith/GVSNEILBH5V2TP2AGRXLJ6U3JF/action/citation_signature","submit_replication":"https://pith.science/pith/GVSNEILBH5V2TP2AGRXLJ6U3JF/action/replication_record"}},"created_at":"2026-07-05T03:37:10.579931+00:00","updated_at":"2026-07-05T03:37:10.579931+00:00"}