{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:A7FI2MEOIPVNE63HN6P6JVOQWF","short_pith_number":"pith:A7FI2MEO","schema_version":"1.0","canonical_sha256":"07ca8d308e43ead27b676f9fe4d5d0b166d6a181630ad10b83c78f20c8210bf1","source":{"kind":"arxiv","id":"2302.05356","version":1},"attestation_state":"computed","paper":{"title":"Approximation and Structured Prediction with Sparse Wasserstein Barycenters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Jean Feydy, Minh-Hieu Do, Olga Mula","submitted_at":"2023-02-10T16:17:30Z","abstract_excerpt":"We develop a general theoretical and algorithmic framework for sparse approximation and structured prediction in $\\mathcal{P}_2(\\Omega)$ with Wasserstein barycenters. The barycenters are sparse in the sense that they are computed from an available dictionary of measures but the approximations only involve a reduced number of atoms. We show that the best reconstruction from the class of sparse barycenters is characterized by a notion of best $n$-term barycenter which we introduce, and which can be understood as a natural extension of the classical concept of best $n$-term approximation in Banac"},"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":"2302.05356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-02-10T16:17:30Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"22edde6f64d117618bcbe602432f93484dfd0b07b99de9a88b447d47da7a223f","abstract_canon_sha256":"a95f16f68ec45cb1f738ae81224906f2fa218e2a8e727e935bed0d0831bd9fa2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:40:38.538832Z","signature_b64":"g22LQmOnloT4Gr9MD+zZXVgj3rXyVercOJYYHh60L24l61znzGoRL7lRNOnLZJom1fzbEucmGEN3hJv13b8qCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07ca8d308e43ead27b676f9fe4d5d0b166d6a181630ad10b83c78f20c8210bf1","last_reissued_at":"2026-07-05T05:40:38.538358Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:40:38.538358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation and Structured Prediction with Sparse Wasserstein Barycenters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Jean Feydy, Minh-Hieu Do, Olga Mula","submitted_at":"2023-02-10T16:17:30Z","abstract_excerpt":"We develop a general theoretical and algorithmic framework for sparse approximation and structured prediction in $\\mathcal{P}_2(\\Omega)$ with Wasserstein barycenters. The barycenters are sparse in the sense that they are computed from an available dictionary of measures but the approximations only involve a reduced number of atoms. We show that the best reconstruction from the class of sparse barycenters is characterized by a notion of best $n$-term barycenter which we introduce, and which can be understood as a natural extension of the classical concept of best $n$-term approximation in Banac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.05356","kind":"arxiv","version":1},"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/2302.05356/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":"2302.05356","created_at":"2026-07-05T05:40:38.538425+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.05356v1","created_at":"2026-07-05T05:40:38.538425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.05356","created_at":"2026-07-05T05:40:38.538425+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7FI2MEOIPVN","created_at":"2026-07-05T05:40:38.538425+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7FI2MEOIPVNE63H","created_at":"2026-07-05T05:40:38.538425+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7FI2MEO","created_at":"2026-07-05T05:40:38.538425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.08750","citing_title":"Optimal Transport-Based Displacement Interpolation with Data Augmentation for Reduced Order Modeling of Nonlinear Dynamical Systems","ref_index":2023,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A7FI2MEOIPVNE63HN6P6JVOQWF","json":"https://pith.science/pith/A7FI2MEOIPVNE63HN6P6JVOQWF.json","graph_json":"https://pith.science/api/pith-number/A7FI2MEOIPVNE63HN6P6JVOQWF/graph.json","events_json":"https://pith.science/api/pith-number/A7FI2MEOIPVNE63HN6P6JVOQWF/events.json","paper":"https://pith.science/paper/A7FI2MEO"},"agent_actions":{"view_html":"https://pith.science/pith/A7FI2MEOIPVNE63HN6P6JVOQWF","download_json":"https://pith.science/pith/A7FI2MEOIPVNE63HN6P6JVOQWF.json","view_paper":"https://pith.science/paper/A7FI2MEO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.05356&json=true","fetch_graph":"https://pith.science/api/pith-number/A7FI2MEOIPVNE63HN6P6JVOQWF/graph.json","fetch_events":"https://pith.science/api/pith-number/A7FI2MEOIPVNE63HN6P6JVOQWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7FI2MEOIPVNE63HN6P6JVOQWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7FI2MEOIPVNE63HN6P6JVOQWF/action/storage_attestation","attest_author":"https://pith.science/pith/A7FI2MEOIPVNE63HN6P6JVOQWF/action/author_attestation","sign_citation":"https://pith.science/pith/A7FI2MEOIPVNE63HN6P6JVOQWF/action/citation_signature","submit_replication":"https://pith.science/pith/A7FI2MEOIPVNE63HN6P6JVOQWF/action/replication_record"}},"created_at":"2026-07-05T05:40:38.538425+00:00","updated_at":"2026-07-05T05:40:38.538425+00:00"}