{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IIBSCLHVP3TZ4XZP4QVKP326O5","short_pith_number":"pith:IIBSCLHV","schema_version":"1.0","canonical_sha256":"4203212cf57ee79e5f2fe42aa7ef5e77674cd0d73f6cf05b1175623a6d3a6373","source":{"kind":"arxiv","id":"2501.18275","version":3},"attestation_state":"computed","paper":{"title":"Induction and Recursion Principles in a Higher-Order Quantitative Logic for Probability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Giorgio Bacci, Rasmus Ejlers M{\\o}gelberg","submitted_at":"2025-01-30T11:27:36Z","abstract_excerpt":"Quantitative logic reasons about the degree to which formulas are satisfied. This paper studies the fundamental reasoning principles of higher-order quantitative logic and their application to reasoning about probabilistic programs and processes.\n  We construct an affine calculus for $1$-bounded complete metric spaces and the monad for probability measures equipped with the Kantorovich distance. The calculus includes a form of guarded recursion interpreted via Banach's fixed point theorem, useful, e.g., for recursive programming with processes. We then define an affine higher-order quantitativ"},"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":"2501.18275","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-01-30T11:27:36Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"11a6d2d1f70621cbac9b2c4f2e6577bf0c26283ab7f367d2550ffa6a4f57017c","abstract_canon_sha256":"b77b2fa1488b1a69504889a6e714532560e6a39ac035eeb01d1c0f0b8db73ae7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:04.189283Z","signature_b64":"fxvLAJHMJ+rFelZbYzDj14vCm8BkIoSKnO/AqORZU7N4SEdqmSy696IA5+AR/a/wEVcq7USV6Hp4vPS/WcULBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4203212cf57ee79e5f2fe42aa7ef5e77674cd0d73f6cf05b1175623a6d3a6373","last_reissued_at":"2026-05-21T01:05:04.188335Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:04.188335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induction and Recursion Principles in a Higher-Order Quantitative Logic for Probability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Giorgio Bacci, Rasmus Ejlers M{\\o}gelberg","submitted_at":"2025-01-30T11:27:36Z","abstract_excerpt":"Quantitative logic reasons about the degree to which formulas are satisfied. This paper studies the fundamental reasoning principles of higher-order quantitative logic and their application to reasoning about probabilistic programs and processes.\n  We construct an affine calculus for $1$-bounded complete metric spaces and the monad for probability measures equipped with the Kantorovich distance. The calculus includes a form of guarded recursion interpreted via Banach's fixed point theorem, useful, e.g., for recursive programming with processes. We then define an affine higher-order quantitativ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.18275","kind":"arxiv","version":3},"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/2501.18275/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":"2501.18275","created_at":"2026-05-21T01:05:04.188450+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.18275v3","created_at":"2026-05-21T01:05:04.188450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18275","created_at":"2026-05-21T01:05:04.188450+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIBSCLHVP3TZ","created_at":"2026-05-21T01:05:04.188450+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIBSCLHVP3TZ4XZP","created_at":"2026-05-21T01:05:04.188450+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIBSCLHV","created_at":"2026-05-21T01:05:04.188450+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.13348","citing_title":"Quantitative Linear Logic","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2605.13348","citing_title":"Quantitative Linear Logic","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IIBSCLHVP3TZ4XZP4QVKP326O5","json":"https://pith.science/pith/IIBSCLHVP3TZ4XZP4QVKP326O5.json","graph_json":"https://pith.science/api/pith-number/IIBSCLHVP3TZ4XZP4QVKP326O5/graph.json","events_json":"https://pith.science/api/pith-number/IIBSCLHVP3TZ4XZP4QVKP326O5/events.json","paper":"https://pith.science/paper/IIBSCLHV"},"agent_actions":{"view_html":"https://pith.science/pith/IIBSCLHVP3TZ4XZP4QVKP326O5","download_json":"https://pith.science/pith/IIBSCLHVP3TZ4XZP4QVKP326O5.json","view_paper":"https://pith.science/paper/IIBSCLHV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.18275&json=true","fetch_graph":"https://pith.science/api/pith-number/IIBSCLHVP3TZ4XZP4QVKP326O5/graph.json","fetch_events":"https://pith.science/api/pith-number/IIBSCLHVP3TZ4XZP4QVKP326O5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIBSCLHVP3TZ4XZP4QVKP326O5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIBSCLHVP3TZ4XZP4QVKP326O5/action/storage_attestation","attest_author":"https://pith.science/pith/IIBSCLHVP3TZ4XZP4QVKP326O5/action/author_attestation","sign_citation":"https://pith.science/pith/IIBSCLHVP3TZ4XZP4QVKP326O5/action/citation_signature","submit_replication":"https://pith.science/pith/IIBSCLHVP3TZ4XZP4QVKP326O5/action/replication_record"}},"created_at":"2026-05-21T01:05:04.188450+00:00","updated_at":"2026-05-21T01:05:04.188450+00:00"}