{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2RHDPYM2RWKLAOAF6PGCHVTR4M","short_pith_number":"pith:2RHDPYM2","schema_version":"1.0","canonical_sha256":"d44e37e19a8d94b03805f3cc23d671e30c45cf7f3ea477a0335225b453356ae3","source":{"kind":"arxiv","id":"1804.04052","version":1},"attestation_state":"computed","paper":{"title":"Constraint-Based Synthesis of Coupling Proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Aws Albarghouthi, Justin Hsu","submitted_at":"2018-04-11T15:34:42Z","abstract_excerpt":"Proof by coupling is a classical technique for proving properties about pairs of randomized algorithms by carefully relating (or coupling) two probabilistic executions. In this paper, we show how to automatically construct such proofs for probabilistic programs. First, we present f-coupled postconditions, an abstraction describing two correlated program executions. Second, we show how properties of f-coupled postconditions can imply various probabilistic properties of the original programs. Third, we demonstrate how to reduce the proof-search problem to a purely logical synthesis problem of th"},"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":"1804.04052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-11T15:34:42Z","cross_cats_sorted":[],"title_canon_sha256":"0211e85410c125f58a740498f2e377d352a758d6f975dec94849f0fd7d743da0","abstract_canon_sha256":"9fbb2d20225b3a94b6beed05081b064dbac3e396715d601b1652cdedb5b76966"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:42.220798Z","signature_b64":"db7ZOdfOLum0bQyz7E9HmGagGHcZO7ZKsK4TyUXUt2I+nemT2ZAev0ASmAorwGslK/llZJr6TRhJ2LTrYYGoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d44e37e19a8d94b03805f3cc23d671e30c45cf7f3ea477a0335225b453356ae3","last_reissued_at":"2026-05-18T00:18:42.220099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:42.220099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constraint-Based Synthesis of Coupling Proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Aws Albarghouthi, Justin Hsu","submitted_at":"2018-04-11T15:34:42Z","abstract_excerpt":"Proof by coupling is a classical technique for proving properties about pairs of randomized algorithms by carefully relating (or coupling) two probabilistic executions. In this paper, we show how to automatically construct such proofs for probabilistic programs. First, we present f-coupled postconditions, an abstraction describing two correlated program executions. Second, we show how properties of f-coupled postconditions can imply various probabilistic properties of the original programs. Third, we demonstrate how to reduce the proof-search problem to a purely logical synthesis problem of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04052","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1804.04052","created_at":"2026-05-18T00:18:42.220200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.04052v1","created_at":"2026-05-18T00:18:42.220200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04052","created_at":"2026-05-18T00:18:42.220200+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RHDPYM2RWKL","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RHDPYM2RWKLAOAF","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RHDPYM2","created_at":"2026-05-18T12:32:02.567920+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/2RHDPYM2RWKLAOAF6PGCHVTR4M","json":"https://pith.science/pith/2RHDPYM2RWKLAOAF6PGCHVTR4M.json","graph_json":"https://pith.science/api/pith-number/2RHDPYM2RWKLAOAF6PGCHVTR4M/graph.json","events_json":"https://pith.science/api/pith-number/2RHDPYM2RWKLAOAF6PGCHVTR4M/events.json","paper":"https://pith.science/paper/2RHDPYM2"},"agent_actions":{"view_html":"https://pith.science/pith/2RHDPYM2RWKLAOAF6PGCHVTR4M","download_json":"https://pith.science/pith/2RHDPYM2RWKLAOAF6PGCHVTR4M.json","view_paper":"https://pith.science/paper/2RHDPYM2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.04052&json=true","fetch_graph":"https://pith.science/api/pith-number/2RHDPYM2RWKLAOAF6PGCHVTR4M/graph.json","fetch_events":"https://pith.science/api/pith-number/2RHDPYM2RWKLAOAF6PGCHVTR4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RHDPYM2RWKLAOAF6PGCHVTR4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RHDPYM2RWKLAOAF6PGCHVTR4M/action/storage_attestation","attest_author":"https://pith.science/pith/2RHDPYM2RWKLAOAF6PGCHVTR4M/action/author_attestation","sign_citation":"https://pith.science/pith/2RHDPYM2RWKLAOAF6PGCHVTR4M/action/citation_signature","submit_replication":"https://pith.science/pith/2RHDPYM2RWKLAOAF6PGCHVTR4M/action/replication_record"}},"created_at":"2026-05-18T00:18:42.220200+00:00","updated_at":"2026-05-18T00:18:42.220200+00:00"}