{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:73JG6VT5JXLE34V6WCU6WKSNDU","short_pith_number":"pith:73JG6VT5","schema_version":"1.0","canonical_sha256":"fed26f567d4dd64df2beb0a9eb2a4d1d372742cb2b1b28c5658e4ee2704101a6","source":{"kind":"arxiv","id":"2509.19598","version":3},"attestation_state":"computed","paper":{"title":"Efficient $\\varepsilon$-approximate minimum-entropy couplings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Spencer Compton","submitted_at":"2025-09-23T21:44:54Z","abstract_excerpt":"Given $m \\ge 2$ discrete probability distributions over $n$ states each, the minimum-entropy coupling is the minimum-entropy joint distribution whose marginals are the same as the input distributions. Computing the minimum-entropy coupling is NP-hard, but there has been significant progress in designing approximation algorithms; prior to this work, the best known polynomial-time algorithms attain guarantees of the form $H(\\operatorname{ALG}) \\le H(\\operatorname{OPT}) + c$, where $c \\approx 0.53$ for $m=2$, and $c \\approx 1.22$ for general $m$ [CKQGK '23].\n  A main open question is whether this"},"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":"2509.19598","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-09-23T21:44:54Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"97966d960ba7a10f84f8fa2f126625c2ea084cf65311f291bcff50709c42fd85","abstract_canon_sha256":"c21b3175b4bf317a8b19e40613017d675a0f8abc47c987d9c52a4102c1d5fd2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:15.103721Z","signature_b64":"MA/9upbYrAcWiSKJwV6fUunWgW0PUFD9hyjnR511azJ1PmXDv0hUbrbzQez15TgTkkU+6oXRFjUydkDnRU4gBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fed26f567d4dd64df2beb0a9eb2a4d1d372742cb2b1b28c5658e4ee2704101a6","last_reissued_at":"2026-06-19T16:12:15.103328Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:15.103328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient $\\varepsilon$-approximate minimum-entropy couplings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Spencer Compton","submitted_at":"2025-09-23T21:44:54Z","abstract_excerpt":"Given $m \\ge 2$ discrete probability distributions over $n$ states each, the minimum-entropy coupling is the minimum-entropy joint distribution whose marginals are the same as the input distributions. Computing the minimum-entropy coupling is NP-hard, but there has been significant progress in designing approximation algorithms; prior to this work, the best known polynomial-time algorithms attain guarantees of the form $H(\\operatorname{ALG}) \\le H(\\operatorname{OPT}) + c$, where $c \\approx 0.53$ for $m=2$, and $c \\approx 1.22$ for general $m$ [CKQGK '23].\n  A main open question is whether this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.19598","kind":"arxiv","version":3},"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/2509.19598/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":"2509.19598","created_at":"2026-06-19T16:12:15.103386+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.19598v3","created_at":"2026-06-19T16:12:15.103386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.19598","created_at":"2026-06-19T16:12:15.103386+00:00"},{"alias_kind":"pith_short_12","alias_value":"73JG6VT5JXLE","created_at":"2026-06-19T16:12:15.103386+00:00"},{"alias_kind":"pith_short_16","alias_value":"73JG6VT5JXLE34V6","created_at":"2026-06-19T16:12:15.103386+00:00"},{"alias_kind":"pith_short_8","alias_value":"73JG6VT5","created_at":"2026-06-19T16:12:15.103386+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/73JG6VT5JXLE34V6WCU6WKSNDU","json":"https://pith.science/pith/73JG6VT5JXLE34V6WCU6WKSNDU.json","graph_json":"https://pith.science/api/pith-number/73JG6VT5JXLE34V6WCU6WKSNDU/graph.json","events_json":"https://pith.science/api/pith-number/73JG6VT5JXLE34V6WCU6WKSNDU/events.json","paper":"https://pith.science/paper/73JG6VT5"},"agent_actions":{"view_html":"https://pith.science/pith/73JG6VT5JXLE34V6WCU6WKSNDU","download_json":"https://pith.science/pith/73JG6VT5JXLE34V6WCU6WKSNDU.json","view_paper":"https://pith.science/paper/73JG6VT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.19598&json=true","fetch_graph":"https://pith.science/api/pith-number/73JG6VT5JXLE34V6WCU6WKSNDU/graph.json","fetch_events":"https://pith.science/api/pith-number/73JG6VT5JXLE34V6WCU6WKSNDU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/73JG6VT5JXLE34V6WCU6WKSNDU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/73JG6VT5JXLE34V6WCU6WKSNDU/action/storage_attestation","attest_author":"https://pith.science/pith/73JG6VT5JXLE34V6WCU6WKSNDU/action/author_attestation","sign_citation":"https://pith.science/pith/73JG6VT5JXLE34V6WCU6WKSNDU/action/citation_signature","submit_replication":"https://pith.science/pith/73JG6VT5JXLE34V6WCU6WKSNDU/action/replication_record"}},"created_at":"2026-06-19T16:12:15.103386+00:00","updated_at":"2026-06-19T16:12:15.103386+00:00"}