{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FKVJPNFGFCFAGFPPSKVVVD6REP","short_pith_number":"pith:FKVJPNFG","schema_version":"1.0","canonical_sha256":"2aaa97b4a6288a0315ef92ab5a8fd123ef3632b473a12ff865f6a773eaff71ed","source":{"kind":"arxiv","id":"2410.03974","version":2},"attestation_state":"computed","paper":{"title":"Robust Barycenter Estimation using Semi-Unbalanced Neural Optimal Transport","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexander Kolesov, Alexander Korotin, Jaemoo Choi, Jaewoong Choi, Milena Gazdieva, Petr Mokrov","submitted_at":"2024-10-04T23:27:33Z","abstract_excerpt":"Aggregating data from multiple sources can be formalized as an Optimal Transport (OT) barycenter problem, which seeks to compute the average of probability distributions with respect to OT discrepancies. However, in real-world scenarios, the presence of outliers and noise in the data measures can significantly hinder the performance of traditional statistical methods for estimating OT barycenters. To address this issue, we propose a novel scalable approach for estimating the robust continuous barycenter, leveraging the dual formulation of the (semi-)unbalanced OT problem. To the best of our kn"},"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":"2410.03974","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-10-04T23:27:33Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"5100b8e319ea1c30819826b065bad523bbe02d63d0033d8199c0216f1d9c0172","abstract_canon_sha256":"ebebfa2cf08c53fd85f26b3f454f909611215aefb9900bde957d33daebc831a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:48:19.872671Z","signature_b64":"RQSfbVzEHMFVV64bi3AmfVyg0KFipmfx3cEXW/bWFZehD3uWU4j0GOqaQ6ePr7RYrgNurvD+3AN6UnzuObK+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2aaa97b4a6288a0315ef92ab5a8fd123ef3632b473a12ff865f6a773eaff71ed","last_reissued_at":"2026-07-05T10:48:19.872143Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:48:19.872143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Barycenter Estimation using Semi-Unbalanced Neural Optimal Transport","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexander Kolesov, Alexander Korotin, Jaemoo Choi, Jaewoong Choi, Milena Gazdieva, Petr Mokrov","submitted_at":"2024-10-04T23:27:33Z","abstract_excerpt":"Aggregating data from multiple sources can be formalized as an Optimal Transport (OT) barycenter problem, which seeks to compute the average of probability distributions with respect to OT discrepancies. However, in real-world scenarios, the presence of outliers and noise in the data measures can significantly hinder the performance of traditional statistical methods for estimating OT barycenters. To address this issue, we propose a novel scalable approach for estimating the robust continuous barycenter, leveraging the dual formulation of the (semi-)unbalanced OT problem. To the best of our kn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.03974","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/2410.03974/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":"2410.03974","created_at":"2026-07-05T10:48:19.872196+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.03974v2","created_at":"2026-07-05T10:48:19.872196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.03974","created_at":"2026-07-05T10:48:19.872196+00:00"},{"alias_kind":"pith_short_12","alias_value":"FKVJPNFGFCFA","created_at":"2026-07-05T10:48:19.872196+00:00"},{"alias_kind":"pith_short_16","alias_value":"FKVJPNFGFCFAGFPP","created_at":"2026-07-05T10:48:19.872196+00:00"},{"alias_kind":"pith_short_8","alias_value":"FKVJPNFG","created_at":"2026-07-05T10:48:19.872196+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/FKVJPNFGFCFAGFPPSKVVVD6REP","json":"https://pith.science/pith/FKVJPNFGFCFAGFPPSKVVVD6REP.json","graph_json":"https://pith.science/api/pith-number/FKVJPNFGFCFAGFPPSKVVVD6REP/graph.json","events_json":"https://pith.science/api/pith-number/FKVJPNFGFCFAGFPPSKVVVD6REP/events.json","paper":"https://pith.science/paper/FKVJPNFG"},"agent_actions":{"view_html":"https://pith.science/pith/FKVJPNFGFCFAGFPPSKVVVD6REP","download_json":"https://pith.science/pith/FKVJPNFGFCFAGFPPSKVVVD6REP.json","view_paper":"https://pith.science/paper/FKVJPNFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.03974&json=true","fetch_graph":"https://pith.science/api/pith-number/FKVJPNFGFCFAGFPPSKVVVD6REP/graph.json","fetch_events":"https://pith.science/api/pith-number/FKVJPNFGFCFAGFPPSKVVVD6REP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FKVJPNFGFCFAGFPPSKVVVD6REP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FKVJPNFGFCFAGFPPSKVVVD6REP/action/storage_attestation","attest_author":"https://pith.science/pith/FKVJPNFGFCFAGFPPSKVVVD6REP/action/author_attestation","sign_citation":"https://pith.science/pith/FKVJPNFGFCFAGFPPSKVVVD6REP/action/citation_signature","submit_replication":"https://pith.science/pith/FKVJPNFGFCFAGFPPSKVVVD6REP/action/replication_record"}},"created_at":"2026-07-05T10:48:19.872196+00:00","updated_at":"2026-07-05T10:48:19.872196+00:00"}