{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:KLGWDDWCPTBUILO2L2GGUHAANZ","short_pith_number":"pith:KLGWDDWC","schema_version":"1.0","canonical_sha256":"52cd618ec27cc3442dda5e8c6a1c006e69ae2f0852f620c2fdb380bd13ddbafb","source":{"kind":"arxiv","id":"2301.12065","version":2},"attestation_state":"computed","paper":{"title":"Decentralized Entropic Optimal Transport for Distributed Distribution Comparison","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hongteng Xu, Moyi Yang, Xiangfeng Wang","submitted_at":"2023-01-28T02:47:42Z","abstract_excerpt":"Distributed distribution comparison aims to measure the distance between the distributions whose data are scattered across different agents in a distributed system and cannot even be shared directly among the agents. In this study, we propose a novel decentralized entropic optimal transport (DEOT) method, which provides a communication-efficient and privacy-preserving solution to this problem with theoretical guarantees. In particular, we design a mini-batch randomized block-coordinate descent (MRBCD) scheme to optimize the DEOT distance in its dual form. The dual variables are scattered acros"},"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":"2301.12065","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-01-28T02:47:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ab91e0cc07c367b5dcaa3a06c91eafde672dd4ab44fa7949d04eb109846e0ec1","abstract_canon_sha256":"3054a6c2875e1fbcfbd043d68a51cfb6f2e8269f2be55d648de3218ed013d51c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:46:50.669993Z","signature_b64":"epZsEw+8Z2LS0hdbGll/VXPAwFxNu66aWjEzsf2acgGZzo0XMRWiPxqLr07nRpTN0AqRKBsEf6IXbBt0JqdcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52cd618ec27cc3442dda5e8c6a1c006e69ae2f0852f620c2fdb380bd13ddbafb","last_reissued_at":"2026-07-05T08:46:50.669497Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:46:50.669497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decentralized Entropic Optimal Transport for Distributed Distribution Comparison","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hongteng Xu, Moyi Yang, Xiangfeng Wang","submitted_at":"2023-01-28T02:47:42Z","abstract_excerpt":"Distributed distribution comparison aims to measure the distance between the distributions whose data are scattered across different agents in a distributed system and cannot even be shared directly among the agents. In this study, we propose a novel decentralized entropic optimal transport (DEOT) method, which provides a communication-efficient and privacy-preserving solution to this problem with theoretical guarantees. In particular, we design a mini-batch randomized block-coordinate descent (MRBCD) scheme to optimize the DEOT distance in its dual form. The dual variables are scattered acros"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.12065","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/2301.12065/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":"2301.12065","created_at":"2026-07-05T08:46:50.669558+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.12065v2","created_at":"2026-07-05T08:46:50.669558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.12065","created_at":"2026-07-05T08:46:50.669558+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLGWDDWCPTBU","created_at":"2026-07-05T08:46:50.669558+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLGWDDWCPTBUILO2","created_at":"2026-07-05T08:46:50.669558+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLGWDDWC","created_at":"2026-07-05T08:46:50.669558+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/KLGWDDWCPTBUILO2L2GGUHAANZ","json":"https://pith.science/pith/KLGWDDWCPTBUILO2L2GGUHAANZ.json","graph_json":"https://pith.science/api/pith-number/KLGWDDWCPTBUILO2L2GGUHAANZ/graph.json","events_json":"https://pith.science/api/pith-number/KLGWDDWCPTBUILO2L2GGUHAANZ/events.json","paper":"https://pith.science/paper/KLGWDDWC"},"agent_actions":{"view_html":"https://pith.science/pith/KLGWDDWCPTBUILO2L2GGUHAANZ","download_json":"https://pith.science/pith/KLGWDDWCPTBUILO2L2GGUHAANZ.json","view_paper":"https://pith.science/paper/KLGWDDWC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.12065&json=true","fetch_graph":"https://pith.science/api/pith-number/KLGWDDWCPTBUILO2L2GGUHAANZ/graph.json","fetch_events":"https://pith.science/api/pith-number/KLGWDDWCPTBUILO2L2GGUHAANZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLGWDDWCPTBUILO2L2GGUHAANZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLGWDDWCPTBUILO2L2GGUHAANZ/action/storage_attestation","attest_author":"https://pith.science/pith/KLGWDDWCPTBUILO2L2GGUHAANZ/action/author_attestation","sign_citation":"https://pith.science/pith/KLGWDDWCPTBUILO2L2GGUHAANZ/action/citation_signature","submit_replication":"https://pith.science/pith/KLGWDDWCPTBUILO2L2GGUHAANZ/action/replication_record"}},"created_at":"2026-07-05T08:46:50.669558+00:00","updated_at":"2026-07-05T08:46:50.669558+00:00"}