{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7YWY5U4VDQHMKTZIBDYURFTHSL","short_pith_number":"pith:7YWY5U4V","schema_version":"1.0","canonical_sha256":"fe2d8ed3951c0ec54f2808f148966792f9436f056358e40363c2e1d8941169cb","source":{"kind":"arxiv","id":"1903.00632","version":2},"attestation_state":"computed","paper":{"title":"Pairwise optimal coupling of multiple random variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Omer Angel, Yinon Spinka","submitted_at":"2019-03-02T05:56:59Z","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."},"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":"1903.00632","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-03-02T05:56:59Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6711bbe22946250b679ca235e373e246484903b1d2e0f0c782b7069edb2c06d4","abstract_canon_sha256":"e147aacc34e799e3a721e22d6f171e277d763f6c6847c78abce0f5dcbf9523ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:38:11.849346Z","signature_b64":"SdBBFU6+clUppS30y0mgrasT/aqctIGHd2n6svdxVKCBBEwS4A09UKLdcvf1fFez3V/+yw4NbMn1I9elbv4VDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe2d8ed3951c0ec54f2808f148966792f9436f056358e40363c2e1d8941169cb","last_reissued_at":"2026-07-05T02:38:11.848889Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:38:11.848889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pairwise optimal coupling of multiple random variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Omer Angel, Yinon Spinka","submitted_at":"2019-03-02T05:56:59Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00632","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/1903.00632/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":"1903.00632","created_at":"2026-07-05T02:38:11.848944+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.00632v2","created_at":"2026-07-05T02:38:11.848944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00632","created_at":"2026-07-05T02:38:11.848944+00:00"},{"alias_kind":"pith_short_12","alias_value":"7YWY5U4VDQHM","created_at":"2026-07-05T02:38:11.848944+00:00"},{"alias_kind":"pith_short_16","alias_value":"7YWY5U4VDQHMKTZI","created_at":"2026-07-05T02:38:11.848944+00:00"},{"alias_kind":"pith_short_8","alias_value":"7YWY5U4V","created_at":"2026-07-05T02:38:11.848944+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01963","citing_title":"Entropy Bounds for Local Coordination and Graph Amenability","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12807","citing_title":"Multi-Marginal Couplings for Metropolis-Hastings","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7YWY5U4VDQHMKTZIBDYURFTHSL","json":"https://pith.science/pith/7YWY5U4VDQHMKTZIBDYURFTHSL.json","graph_json":"https://pith.science/api/pith-number/7YWY5U4VDQHMKTZIBDYURFTHSL/graph.json","events_json":"https://pith.science/api/pith-number/7YWY5U4VDQHMKTZIBDYURFTHSL/events.json","paper":"https://pith.science/paper/7YWY5U4V"},"agent_actions":{"view_html":"https://pith.science/pith/7YWY5U4VDQHMKTZIBDYURFTHSL","download_json":"https://pith.science/pith/7YWY5U4VDQHMKTZIBDYURFTHSL.json","view_paper":"https://pith.science/paper/7YWY5U4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.00632&json=true","fetch_graph":"https://pith.science/api/pith-number/7YWY5U4VDQHMKTZIBDYURFTHSL/graph.json","fetch_events":"https://pith.science/api/pith-number/7YWY5U4VDQHMKTZIBDYURFTHSL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7YWY5U4VDQHMKTZIBDYURFTHSL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7YWY5U4VDQHMKTZIBDYURFTHSL/action/storage_attestation","attest_author":"https://pith.science/pith/7YWY5U4VDQHMKTZIBDYURFTHSL/action/author_attestation","sign_citation":"https://pith.science/pith/7YWY5U4VDQHMKTZIBDYURFTHSL/action/citation_signature","submit_replication":"https://pith.science/pith/7YWY5U4VDQHMKTZIBDYURFTHSL/action/replication_record"}},"created_at":"2026-07-05T02:38:11.848944+00:00","updated_at":"2026-07-05T02:38:11.848944+00:00"}