{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:HPMOQVIR6YPOCXWD57QKUT6P5M","short_pith_number":"pith:HPMOQVIR","canonical_record":{"source":{"id":"2203.01161","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-02T15:04:37Z","cross_cats_sorted":["cs.CC","cs.LG","stat.ML"],"title_canon_sha256":"3f0cc16ef1701732176abe8a6bc7565883cc92f14c9e27bd4280cc21693fb8d0","abstract_canon_sha256":"bf61207edc9e5b65a4d925502770bbe6f26584b0d09938ed8edaa402342a9d20"},"schema_version":"1.0"},"canonical_sha256":"3bd8e85511f61ee15ec3efe0aa4fcfeb2eb98ceed7aba1e5cc2788ab0e85cc35","source":{"kind":"arxiv","id":"2203.01161","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.01161","created_at":"2026-07-05T05:06:30Z"},{"alias_kind":"arxiv_version","alias_value":"2203.01161v2","created_at":"2026-07-05T05:06:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.01161","created_at":"2026-07-05T05:06:30Z"},{"alias_kind":"pith_short_12","alias_value":"HPMOQVIR6YPO","created_at":"2026-07-05T05:06:30Z"},{"alias_kind":"pith_short_16","alias_value":"HPMOQVIR6YPOCXWD","created_at":"2026-07-05T05:06:30Z"},{"alias_kind":"pith_short_8","alias_value":"HPMOQVIR","created_at":"2026-07-05T05:06:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:HPMOQVIR6YPOCXWD57QKUT6P5M","target":"record","payload":{"canonical_record":{"source":{"id":"2203.01161","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-02T15:04:37Z","cross_cats_sorted":["cs.CC","cs.LG","stat.ML"],"title_canon_sha256":"3f0cc16ef1701732176abe8a6bc7565883cc92f14c9e27bd4280cc21693fb8d0","abstract_canon_sha256":"bf61207edc9e5b65a4d925502770bbe6f26584b0d09938ed8edaa402342a9d20"},"schema_version":"1.0"},"canonical_sha256":"3bd8e85511f61ee15ec3efe0aa4fcfeb2eb98ceed7aba1e5cc2788ab0e85cc35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:06:30.456416Z","signature_b64":"j4T/SNrx7mKEyGk9LZsh1Vrlinefrx50YI7zpYdbHizxF1b5mpzaUCW51EuJIpLYJmXTY0ZF7Z+hcPlHPBEPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bd8e85511f61ee15ec3efe0aa4fcfeb2eb98ceed7aba1e5cc2788ab0e85cc35","last_reissued_at":"2026-07-05T05:06:30.455899Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:06:30.455899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.01161","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:06:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7uNnifA+T32tPGCwYR6eFT5VQ4dfe979RKNyhSdlpf+gV1JmvdCKllZG5G0xpyNkY5ExEKsm/ra0fJroVdRiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:43:13.794152Z"},"content_sha256":"547d6b65f33ae1116e7c87996859c500c255eca6270cb64a251e9dd840fad224","schema_version":"1.0","event_id":"sha256:547d6b65f33ae1116e7c87996859c500c255eca6270cb64a251e9dd840fad224"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:HPMOQVIR6YPOCXWD57QKUT6P5M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discrete Optimal Transport with Independent Marginals is #P-Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Bahar Ta\\c{s}kesen, Daniel Kuhn, Karthik Natarajan, Soroosh Shafieezadeh-Abadeh","submitted_at":"2022-03-02T15:04:37Z","abstract_excerpt":"We study the computational complexity of the optimal transport problem that evaluates the Wasserstein distance between the distributions of two K-dimensional discrete random vectors. The best known algorithms for this problem run in polynomial time in the maximum of the number of atoms of the two distributions. However, if the components of either random vector are independent, then this number can be exponential in K even though the size of the problem description scales linearly with K. We prove that the described optimal transport problem is #P-hard even if all components of the first rando"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.01161","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/2203.01161/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:06:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eqn7Z2OPWHs63rr6xcU7cz8omfEizbmkJNUhJyFT1M6mGe8IUqOS6ald7z8b23jRCnBzaGb0tNOZ5IWwN4stDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:43:13.794534Z"},"content_sha256":"2bc25372249de2aa8a3193fc1413c6fe010e644c7d4a0063ecaabfb7c1bca227","schema_version":"1.0","event_id":"sha256:2bc25372249de2aa8a3193fc1413c6fe010e644c7d4a0063ecaabfb7c1bca227"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HPMOQVIR6YPOCXWD57QKUT6P5M/bundle.json","state_url":"https://pith.science/pith/HPMOQVIR6YPOCXWD57QKUT6P5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HPMOQVIR6YPOCXWD57QKUT6P5M/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T18:43:13Z","links":{"resolver":"https://pith.science/pith/HPMOQVIR6YPOCXWD57QKUT6P5M","bundle":"https://pith.science/pith/HPMOQVIR6YPOCXWD57QKUT6P5M/bundle.json","state":"https://pith.science/pith/HPMOQVIR6YPOCXWD57QKUT6P5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HPMOQVIR6YPOCXWD57QKUT6P5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:HPMOQVIR6YPOCXWD57QKUT6P5M","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bf61207edc9e5b65a4d925502770bbe6f26584b0d09938ed8edaa402342a9d20","cross_cats_sorted":["cs.CC","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-02T15:04:37Z","title_canon_sha256":"3f0cc16ef1701732176abe8a6bc7565883cc92f14c9e27bd4280cc21693fb8d0"},"schema_version":"1.0","source":{"id":"2203.01161","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.01161","created_at":"2026-07-05T05:06:30Z"},{"alias_kind":"arxiv_version","alias_value":"2203.01161v2","created_at":"2026-07-05T05:06:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.01161","created_at":"2026-07-05T05:06:30Z"},{"alias_kind":"pith_short_12","alias_value":"HPMOQVIR6YPO","created_at":"2026-07-05T05:06:30Z"},{"alias_kind":"pith_short_16","alias_value":"HPMOQVIR6YPOCXWD","created_at":"2026-07-05T05:06:30Z"},{"alias_kind":"pith_short_8","alias_value":"HPMOQVIR","created_at":"2026-07-05T05:06:30Z"}],"graph_snapshots":[{"event_id":"sha256:2bc25372249de2aa8a3193fc1413c6fe010e644c7d4a0063ecaabfb7c1bca227","target":"graph","created_at":"2026-07-05T05:06:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.01161/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the computational complexity of the optimal transport problem that evaluates the Wasserstein distance between the distributions of two K-dimensional discrete random vectors. The best known algorithms for this problem run in polynomial time in the maximum of the number of atoms of the two distributions. However, if the components of either random vector are independent, then this number can be exponential in K even though the size of the problem description scales linearly with K. We prove that the described optimal transport problem is #P-hard even if all components of the first rando","authors_text":"Bahar Ta\\c{s}kesen, Daniel Kuhn, Karthik Natarajan, Soroosh Shafieezadeh-Abadeh","cross_cats":["cs.CC","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-02T15:04:37Z","title":"Discrete Optimal Transport with Independent Marginals is #P-Hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.01161","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:547d6b65f33ae1116e7c87996859c500c255eca6270cb64a251e9dd840fad224","target":"record","created_at":"2026-07-05T05:06:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"bf61207edc9e5b65a4d925502770bbe6f26584b0d09938ed8edaa402342a9d20","cross_cats_sorted":["cs.CC","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-02T15:04:37Z","title_canon_sha256":"3f0cc16ef1701732176abe8a6bc7565883cc92f14c9e27bd4280cc21693fb8d0"},"schema_version":"1.0","source":{"id":"2203.01161","kind":"arxiv","version":2}},"canonical_sha256":"3bd8e85511f61ee15ec3efe0aa4fcfeb2eb98ceed7aba1e5cc2788ab0e85cc35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bd8e85511f61ee15ec3efe0aa4fcfeb2eb98ceed7aba1e5cc2788ab0e85cc35","first_computed_at":"2026-07-05T05:06:30.455899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:06:30.455899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j4T/SNrx7mKEyGk9LZsh1Vrlinefrx50YI7zpYdbHizxF1b5mpzaUCW51EuJIpLYJmXTY0ZF7Z+hcPlHPBEPAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:06:30.456416Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.01161","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:547d6b65f33ae1116e7c87996859c500c255eca6270cb64a251e9dd840fad224","sha256:2bc25372249de2aa8a3193fc1413c6fe010e644c7d4a0063ecaabfb7c1bca227"],"state_sha256":"66473bd352b103a07598b405ce073517e595210666a849b5854abc796673297c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TKwywu0RZuzaBDCKOfzmQuX3ARS6UOpBrMXXhQCTQACz/os4BQBUzfdJwFqLPE4pyVmevH+1gO0ABmNnWWquCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:43:13.796478Z","bundle_sha256":"6ae6a29e55bee0f567ae7ad5bef5d6c25eb569a174c49a35af3b36dd66a94aa8"}}