{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WNT4JSBMG4C5VLA3FGXSDFVCVQ","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":"a7b6744465d596b817857b935f10e73cbfbdd313c8621800c8df29f687c835a5","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-29T21:54:51Z","title_canon_sha256":"dce9d8e8724094b2dac02a7c2defd0697144589c02763d659fd5d9f56b9898bf"},"schema_version":"1.0","source":{"id":"2405.19540","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.19540","created_at":"2026-07-05T08:25:09Z"},{"alias_kind":"arxiv_version","alias_value":"2405.19540v1","created_at":"2026-07-05T08:25:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.19540","created_at":"2026-07-05T08:25:09Z"},{"alias_kind":"pith_short_12","alias_value":"WNT4JSBMG4C5","created_at":"2026-07-05T08:25:09Z"},{"alias_kind":"pith_short_16","alias_value":"WNT4JSBMG4C5VLA3","created_at":"2026-07-05T08:25:09Z"},{"alias_kind":"pith_short_8","alias_value":"WNT4JSBM","created_at":"2026-07-05T08:25:09Z"}],"graph_snapshots":[{"event_id":"sha256:03edc33df65838883daa3fb4c589ced83d165bb0f823c64d965b4f7d6da4c63f","target":"graph","created_at":"2026-07-05T08:25:09Z","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/2405.19540/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Minimum-entropy coupling (MEC) -- the process of finding a joint distribution with minimum entropy for given marginals -- has applications in areas such as causality and steganography. However, existing algorithms are either computationally intractable for large-support distributions or limited to specific distribution types and sensitive to hyperparameter choices. This work addresses these limitations by unifying a prior family of iterative MEC (IMEC) approaches into a generalized partition-based formalism. From this framework, we derive a novel IMEC algorithm called ARIMEC, capable of handli","authors_text":"Christian Schroeder de Witt, Dylan Sam, Jakob Foerster, J. Zico Kolter, Samuel Sokota, Spencer Compton","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-29T21:54:51Z","title":"Computing Low-Entropy Couplings for Large-Support Distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.19540","kind":"arxiv","version":1},"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:8365740cce7cb19fe9d8532270d88481c758e76d42dfa547bc30f972f3b61424","target":"record","created_at":"2026-07-05T08:25:09Z","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":"a7b6744465d596b817857b935f10e73cbfbdd313c8621800c8df29f687c835a5","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-29T21:54:51Z","title_canon_sha256":"dce9d8e8724094b2dac02a7c2defd0697144589c02763d659fd5d9f56b9898bf"},"schema_version":"1.0","source":{"id":"2405.19540","kind":"arxiv","version":1}},"canonical_sha256":"b367c4c82c3705daac1b29af2196a2ac2450bf55dae22769afd6defd91559532","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b367c4c82c3705daac1b29af2196a2ac2450bf55dae22769afd6defd91559532","first_computed_at":"2026-07-05T08:25:09.060976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:25:09.060976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0ZEB+SziAorjEzNDyj5ipfOv14m5662gptllhL/LRh0WCF2sp0XD2Hz2F8EpLuwy/VhZkc+4mqLB2kGlg5gFCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:25:09.061411Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.19540","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8365740cce7cb19fe9d8532270d88481c758e76d42dfa547bc30f972f3b61424","sha256:03edc33df65838883daa3fb4c589ced83d165bb0f823c64d965b4f7d6da4c63f"],"state_sha256":"e732da70a4a9628e57ad8c54669a7d93869d3d9f1fe394de3df4b90b645fbf55"}