{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:AWSIIQZI5IS5J6524KERAY4Z3N","short_pith_number":"pith:AWSIIQZI","schema_version":"1.0","canonical_sha256":"05a4844328ea25d4fbbae289106399db73747982ca112ff87f2b5d29b547f04a","source":{"kind":"arxiv","id":"2608.09513","version":1},"attestation_state":"computed","paper":{"title":"Faster Algorithms for Multimarginal Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"quant-ph","authors_text":"Atithi Acharya, Brandon Augustino, Charlie Che, Junhyung Lyle Kim, Shouvanik Chakrabarti, Shree Hari Sureshbabu, Yue Sun","submitted_at":"2026-08-10T12:14:25Z","abstract_excerpt":"We study algorithms for approximating the multimarginal optimal transport (MOT) distance, a generalization of the classic optimal transport distance, between $m$ discrete probability distributions each supported on at most $n$ points. We give a classical algorithm that computes a coupling between these marginals whose expected transportation cost is within an additive $\\varepsilon > 0$ of the MOT distance in time $O(m^2 n^m \\varepsilon^{-1}\\mathrm{polylog}(m,n,\\varepsilon^{-1}))$. This is, to our knowledge, the first bound for general MOT problems with simultaneous linear dependence on the dim"},"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":"2608.09513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-10T12:14:25Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"062a983bb11060f7d2fbb8af1106f70a46802656eeb1a230be300cd2be8e93ac","abstract_canon_sha256":"e47e57f67c24f0235e57d58068f31f43bc7b2f3b4dc9aaf525be1a0948de1863"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T02:24:23.008106Z","signature_b64":"x35PVFMMaIH9qMeGvGDN9VeKZPO35YEd5AlPDG0RAXed2TONeIe0lCowtDNhSFQjaEM/1J4a2xI0gAv6VatdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05a4844328ea25d4fbbae289106399db73747982ca112ff87f2b5d29b547f04a","last_reissued_at":"2026-08-11T02:24:23.006610Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T02:24:23.006610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Algorithms for Multimarginal Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"quant-ph","authors_text":"Atithi Acharya, Brandon Augustino, Charlie Che, Junhyung Lyle Kim, Shouvanik Chakrabarti, Shree Hari Sureshbabu, Yue Sun","submitted_at":"2026-08-10T12:14:25Z","abstract_excerpt":"We study algorithms for approximating the multimarginal optimal transport (MOT) distance, a generalization of the classic optimal transport distance, between $m$ discrete probability distributions each supported on at most $n$ points. We give a classical algorithm that computes a coupling between these marginals whose expected transportation cost is within an additive $\\varepsilon > 0$ of the MOT distance in time $O(m^2 n^m \\varepsilon^{-1}\\mathrm{polylog}(m,n,\\varepsilon^{-1}))$. This is, to our knowledge, the first bound for general MOT problems with simultaneous linear dependence on the dim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.09513","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/2608.09513/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":"2608.09513","created_at":"2026-08-11T02:24:23.007189+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.09513v1","created_at":"2026-08-11T02:24:23.007189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.09513","created_at":"2026-08-11T02:24:23.007189+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWSIIQZI5IS5","created_at":"2026-08-11T02:24:23.007189+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWSIIQZI5IS5J652","created_at":"2026-08-11T02:24:23.007189+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWSIIQZI","created_at":"2026-08-11T02:24:23.007189+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/AWSIIQZI5IS5J6524KERAY4Z3N","json":"https://pith.science/pith/AWSIIQZI5IS5J6524KERAY4Z3N.json","graph_json":"https://pith.science/api/pith-number/AWSIIQZI5IS5J6524KERAY4Z3N/graph.json","events_json":"https://pith.science/api/pith-number/AWSIIQZI5IS5J6524KERAY4Z3N/events.json","paper":"https://pith.science/paper/AWSIIQZI"},"agent_actions":{"view_html":"https://pith.science/pith/AWSIIQZI5IS5J6524KERAY4Z3N","download_json":"https://pith.science/pith/AWSIIQZI5IS5J6524KERAY4Z3N.json","view_paper":"https://pith.science/paper/AWSIIQZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.09513&json=true","fetch_graph":"https://pith.science/api/pith-number/AWSIIQZI5IS5J6524KERAY4Z3N/graph.json","fetch_events":"https://pith.science/api/pith-number/AWSIIQZI5IS5J6524KERAY4Z3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWSIIQZI5IS5J6524KERAY4Z3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWSIIQZI5IS5J6524KERAY4Z3N/action/storage_attestation","attest_author":"https://pith.science/pith/AWSIIQZI5IS5J6524KERAY4Z3N/action/author_attestation","sign_citation":"https://pith.science/pith/AWSIIQZI5IS5J6524KERAY4Z3N/action/citation_signature","submit_replication":"https://pith.science/pith/AWSIIQZI5IS5J6524KERAY4Z3N/action/replication_record"}},"created_at":"2026-08-11T02:24:23.007189+00:00","updated_at":"2026-08-11T02:24:23.007189+00:00"}