{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BGPO7RWCABIQK56R7ICYHHPLQE","short_pith_number":"pith:BGPO7RWC","schema_version":"1.0","canonical_sha256":"099eefc6c200510577d1fa05839deb8102026024e637f6d42bc27561cd8cb283","source":{"kind":"arxiv","id":"2407.17127","version":2},"attestation_state":"computed","paper":{"title":"A quantitative probabilistic relational Hoare logic","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Benjamin Gr\\'egoire, Davide Davoli, Gilles Barthe, Martin Avanzini","submitted_at":"2024-07-24T09:58:21Z","abstract_excerpt":"We introduce eRHL, a program logic for reasoning about relational expectation properties of pairs of probabilistic programs. eRHL is quantitative, i.e., its pre- and post-conditions take values in the extended non-negative reals. Thanks to its quantitative assertions, eRHL overcomes randomness alignment restrictions from prior logics, including PRHL, a popular relational program logic used to reason about security of cryptographic constructions, and apRHL, a variant of PRHL for differential privacy. As a result, eRHL is the first relational probabilistic program logic to be supported by non-tr"},"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":"2407.17127","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LO","submitted_at":"2024-07-24T09:58:21Z","cross_cats_sorted":[],"title_canon_sha256":"1d5ba0763bb0b49791bf2a23dc9d2a2cfd4c6344782c0d260101942de484a158","abstract_canon_sha256":"c1c57170f51d9e3293d394c8c96f5e9a42c090ec0148b168ba5b06a2e55d4d37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:22.910845Z","signature_b64":"JFZRZhGYd2RzQG+lCYPacCFjdlPjxL/3qhzB+Mi70vArFBt1WqR/bWS0Ky5tDJTAxDadHa3YpJ0qhHoPJv97BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"099eefc6c200510577d1fa05839deb8102026024e637f6d42bc27561cd8cb283","last_reissued_at":"2026-07-05T09:58:22.910423Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:22.910423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A quantitative probabilistic relational Hoare logic","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Benjamin Gr\\'egoire, Davide Davoli, Gilles Barthe, Martin Avanzini","submitted_at":"2024-07-24T09:58:21Z","abstract_excerpt":"We introduce eRHL, a program logic for reasoning about relational expectation properties of pairs of probabilistic programs. eRHL is quantitative, i.e., its pre- and post-conditions take values in the extended non-negative reals. Thanks to its quantitative assertions, eRHL overcomes randomness alignment restrictions from prior logics, including PRHL, a popular relational program logic used to reason about security of cryptographic constructions, and apRHL, a variant of PRHL for differential privacy. As a result, eRHL is the first relational probabilistic program logic to be supported by non-tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.17127","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/2407.17127/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":"2407.17127","created_at":"2026-07-05T09:58:22.910483+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.17127v2","created_at":"2026-07-05T09:58:22.910483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.17127","created_at":"2026-07-05T09:58:22.910483+00:00"},{"alias_kind":"pith_short_12","alias_value":"BGPO7RWCABIQ","created_at":"2026-07-05T09:58:22.910483+00:00"},{"alias_kind":"pith_short_16","alias_value":"BGPO7RWCABIQK56R","created_at":"2026-07-05T09:58:22.910483+00:00"},{"alias_kind":"pith_short_8","alias_value":"BGPO7RWC","created_at":"2026-07-05T09:58:22.910483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.09963","citing_title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","ref_index":78,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BGPO7RWCABIQK56R7ICYHHPLQE","json":"https://pith.science/pith/BGPO7RWCABIQK56R7ICYHHPLQE.json","graph_json":"https://pith.science/api/pith-number/BGPO7RWCABIQK56R7ICYHHPLQE/graph.json","events_json":"https://pith.science/api/pith-number/BGPO7RWCABIQK56R7ICYHHPLQE/events.json","paper":"https://pith.science/paper/BGPO7RWC"},"agent_actions":{"view_html":"https://pith.science/pith/BGPO7RWCABIQK56R7ICYHHPLQE","download_json":"https://pith.science/pith/BGPO7RWCABIQK56R7ICYHHPLQE.json","view_paper":"https://pith.science/paper/BGPO7RWC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.17127&json=true","fetch_graph":"https://pith.science/api/pith-number/BGPO7RWCABIQK56R7ICYHHPLQE/graph.json","fetch_events":"https://pith.science/api/pith-number/BGPO7RWCABIQK56R7ICYHHPLQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BGPO7RWCABIQK56R7ICYHHPLQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BGPO7RWCABIQK56R7ICYHHPLQE/action/storage_attestation","attest_author":"https://pith.science/pith/BGPO7RWCABIQK56R7ICYHHPLQE/action/author_attestation","sign_citation":"https://pith.science/pith/BGPO7RWCABIQK56R7ICYHHPLQE/action/citation_signature","submit_replication":"https://pith.science/pith/BGPO7RWCABIQK56R7ICYHHPLQE/action/replication_record"}},"created_at":"2026-07-05T09:58:22.910483+00:00","updated_at":"2026-07-05T09:58:22.910483+00:00"}