{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7YWY5U4VDQHMKTZIBDYURFTHSL","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":"e147aacc34e799e3a721e22d6f171e277d763f6c6847c78abce0f5dcbf9523ef","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-03-02T05:56:59Z","title_canon_sha256":"6711bbe22946250b679ca235e373e246484903b1d2e0f0c782b7069edb2c06d4"},"schema_version":"1.0","source":{"id":"1903.00632","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00632","created_at":"2026-07-05T02:38:11Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00632v2","created_at":"2026-07-05T02:38:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00632","created_at":"2026-07-05T02:38:11Z"},{"alias_kind":"pith_short_12","alias_value":"7YWY5U4VDQHM","created_at":"2026-07-05T02:38:11Z"},{"alias_kind":"pith_short_16","alias_value":"7YWY5U4VDQHMKTZI","created_at":"2026-07-05T02:38:11Z"},{"alias_kind":"pith_short_8","alias_value":"7YWY5U4V","created_at":"2026-07-05T02:38:11Z"}],"graph_snapshots":[{"event_id":"sha256:5c59bbbec64a4a6bebf53bc90546be0b113f9091da7147a46a2e01a2fff10249","target":"graph","created_at":"2026-07-05T02:38:11Z","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/1903.00632/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We generalize the optimal coupling theorem to multiple random variables: Given a collection of random variables, it is possible to couple all of them so that any two differ with probability comparable to the total-variation distance between them. In a number of cases we show that the disagreement probability we achieve is the best possible. The proofs of sharpness rely on new results in extremal combinatorics, which may be of independent interest.","authors_text":"Omer Angel, Yinon Spinka","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-03-02T05:56:59Z","title":"Pairwise optimal coupling of multiple random variables"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00632","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:d6af151f21324aa465df8698273a35fa6341eaa77d671ba48ac3f068f2faedc3","target":"record","created_at":"2026-07-05T02:38:11Z","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":"e147aacc34e799e3a721e22d6f171e277d763f6c6847c78abce0f5dcbf9523ef","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-03-02T05:56:59Z","title_canon_sha256":"6711bbe22946250b679ca235e373e246484903b1d2e0f0c782b7069edb2c06d4"},"schema_version":"1.0","source":{"id":"1903.00632","kind":"arxiv","version":2}},"canonical_sha256":"fe2d8ed3951c0ec54f2808f148966792f9436f056358e40363c2e1d8941169cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe2d8ed3951c0ec54f2808f148966792f9436f056358e40363c2e1d8941169cb","first_computed_at":"2026-07-05T02:38:11.848889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:38:11.848889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SdBBFU6+clUppS30y0mgrasT/aqctIGHd2n6svdxVKCBBEwS4A09UKLdcvf1fFez3V/+yw4NbMn1I9elbv4VDA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:38:11.849346Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.00632","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6af151f21324aa465df8698273a35fa6341eaa77d671ba48ac3f068f2faedc3","sha256:5c59bbbec64a4a6bebf53bc90546be0b113f9091da7147a46a2e01a2fff10249"],"state_sha256":"9d51d9da2db31dc8a9b55f5119e19f163041bdf2eeae645b41a908208cfddd9e"}