{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2VN6YPPCXFPLRPOGWJMWUDTUAM","short_pith_number":"pith:2VN6YPPC","schema_version":"1.0","canonical_sha256":"d55bec3de2b95eb8bdc6b2596a0e740315c41c4c76f4d990b8f9a1a4a590db24","source":{"kind":"arxiv","id":"2605.13348","version":2},"attestation_state":"computed","paper":{"title":"Quantitative Linear Logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A family of quantitative sequent calculi pQLL assigns real values to proofs and sequents, proving cut-elimination and completeness for soft lattices while converging to MALL as hardness p increases.","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Charles Grellois, Ekaterina Komendantskaya, Matteo Capucci, Robert Atkey","submitted_at":"2026-05-13T11:05:08Z","abstract_excerpt":"Real-valued logics have seen a renewed interest in verification for probabilistic and quantitative systems, in particular machine learning models, where they can be used to directly integrate specifications in the training objective. To do so effectively one has to strike a balance between the logical properties of the connectives and their semantics. A major hurdle in this sense is to give ``soft'' (i.e. differentiable) semantics to additive connectives -- in linear and fuzzy logics, additives are necessarily ``hard'' lattice operations.\n  In this paper, we solve this problem by combining an "},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.13348","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T11:05:08Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"39a33d9475a347461adb210135d7d2ec0ad386423024aa6d59b75af923bcebd6","abstract_canon_sha256":"616c9003bfff668b59d147136b83496c11d676f9ca305365b1137a024b91b2ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:48.318176Z","signature_b64":"sozLhuYxwBrvD91IKdukFCahh8y26oUGx1uBQZVKv5vycxzQSj2p2m/CJBLRolBBl5eF4rm6l79RrKBCdo0mCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d55bec3de2b95eb8bdc6b2596a0e740315c41c4c76f4d990b8f9a1a4a590db24","last_reissued_at":"2026-05-18T02:44:48.317756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:48.317756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantitative Linear Logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A family of quantitative sequent calculi pQLL assigns real values to proofs and sequents, proving cut-elimination and completeness for soft lattices while converging to MALL as hardness p increases.","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Charles Grellois, Ekaterina Komendantskaya, Matteo Capucci, Robert Atkey","submitted_at":"2026-05-13T11:05:08Z","abstract_excerpt":"Real-valued logics have seen a renewed interest in verification for probabilistic and quantitative systems, in particular machine learning models, where they can be used to directly integrate specifications in the training objective. To do so effectively one has to strike a balance between the logical properties of the connectives and their semantics. A major hurdle in this sense is to give ``soft'' (i.e. differentiable) semantics to additive connectives -- in linear and fuzzy logics, additives are necessarily ``hard'' lattice operations.\n  In this paper, we solve this problem by combining an "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We present a family of calculi, pQLL, indexed by a hardness degree p, prove cut-elimination theorem for them, and show completeness for enriched residuated 'soft' lattices. For p = ∞, pQLL reduces to MALL, with provability in pQLL converging to provability in MALL when p → ∞.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that real-valued sum and product can be lifted to a residuated lattice structure while preserving the logical properties needed for cut elimination and completeness, without introducing inconsistencies when the hardness parameter p varies.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"pQLL calculi assign real-valued strength to proofs, generalize hypersequent and deep inference systems, prove cut elimination, and achieve completeness for soft residuated lattices, recovering MALL as p goes to infinity.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A family of quantitative sequent calculi pQLL assigns real values to proofs and sequents, proving cut-elimination and completeness for soft lattices while converging to MALL as hardness p increases.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9ebe1f5148336e7a53c76c6f51a57292b8bf2cb6abe41d868d2e73297f934a29"},"source":{"id":"2605.13348","kind":"arxiv","version":2},"verdict":{"id":"7de4e613-739f-4023-a208-fcc2aea7c0bf","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T05:59:13.732854Z","strongest_claim":"We present a family of calculi, pQLL, indexed by a hardness degree p, prove cut-elimination theorem for them, and show completeness for enriched residuated 'soft' lattices. For p = ∞, pQLL reduces to MALL, with provability in pQLL converging to provability in MALL when p → ∞.","one_line_summary":"pQLL calculi assign real-valued strength to proofs, generalize hypersequent and deep inference systems, prove cut elimination, and achieve completeness for soft residuated lattices, recovering MALL as p goes to infinity.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that real-valued sum and product can be lifted to a residuated lattice structure while preserving the logical properties needed for cut elimination and completeness, without introducing inconsistencies when the hardness parameter p varies.","pith_extraction_headline":"A family of quantitative sequent calculi pQLL assigns real values to proofs and sequents, proving cut-elimination and completeness for soft lattices while converging to MALL as hardness p increases."},"references":{"count":61,"sample":[{"doi":"10.4230/lipics.itp.2024.4","year":2024,"title":"Reynald Affeldt, Alessandro Bruni, Ekaterina Komendantskaya, Natalia Slusarz, and Kathrin Stark. 2024. Taming Differentiable Logics with Coq Formalisation. In 15th International Conference on Interact","work_id":"683e85a5-917d-43af-9224-f1248a4de11a","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Paolo Aglianò. 2025. An algebraic investigation of linear logic. Archive for Mathematical Logic (2025), 1–23","work_id":"ea3e87de-b6dd-4d88-921e-0e08cd2d02c9","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1987,"title":"Arnon Avron. 1987. A Constructive Analysis of RM. The Journal of symbolic logic 52, 4 (1987), 939–","work_id":"6caf2bea-7e3f-44f5-a7ae-59ccbb30f816","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"https://www.cambridge.org/core/journals/journal-of-symbolic-logic/article/constructive-analysis-of-rm/ 342F0DE51D0878BEC48C03E65FBA03BC","work_id":"d7a80c97-0818-4edb-82ca-502ce92b9471","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1093/logcom/13.6.835","year":2003,"title":"Matthias Baaz, Agata Ciabattoni, and Christian G. Fermüller. 2003. Hypersequent Calculi for Gödel Logics - a Survey. J. Log. Comput. 13, 6 (2003), 835–861. https://doi.org/10.1093/LOGCOM/13.6.835","work_id":"51bc1826-926f-4b0f-819a-61453189f842","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":61,"snapshot_sha256":"af22e3e8959088887dd8a7762ca55d86cbc1b67a451a11448349a1d38aa740ef","internal_anchors":3},"formal_canon":{"evidence_count":3,"snapshot_sha256":"b04067ed7d311622bd902d2a1765e3a09155b5bb9c92539279d906c5f016bc31"},"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":"2605.13348","created_at":"2026-05-18T02:44:48.317821+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13348v2","created_at":"2026-05-18T02:44:48.317821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13348","created_at":"2026-05-18T02:44:48.317821+00:00"},{"alias_kind":"pith_short_12","alias_value":"2VN6YPPCXFPL","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"2VN6YPPCXFPLRPOG","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"2VN6YPPC","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.13845","citing_title":"Quantitative Linear Logic for Neuro-Symbolic Learning and Verification","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":3,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2VN6YPPCXFPLRPOGWJMWUDTUAM","json":"https://pith.science/pith/2VN6YPPCXFPLRPOGWJMWUDTUAM.json","graph_json":"https://pith.science/api/pith-number/2VN6YPPCXFPLRPOGWJMWUDTUAM/graph.json","events_json":"https://pith.science/api/pith-number/2VN6YPPCXFPLRPOGWJMWUDTUAM/events.json","paper":"https://pith.science/paper/2VN6YPPC"},"agent_actions":{"view_html":"https://pith.science/pith/2VN6YPPCXFPLRPOGWJMWUDTUAM","download_json":"https://pith.science/pith/2VN6YPPCXFPLRPOGWJMWUDTUAM.json","view_paper":"https://pith.science/paper/2VN6YPPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13348&json=true","fetch_graph":"https://pith.science/api/pith-number/2VN6YPPCXFPLRPOGWJMWUDTUAM/graph.json","fetch_events":"https://pith.science/api/pith-number/2VN6YPPCXFPLRPOGWJMWUDTUAM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2VN6YPPCXFPLRPOGWJMWUDTUAM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2VN6YPPCXFPLRPOGWJMWUDTUAM/action/storage_attestation","attest_author":"https://pith.science/pith/2VN6YPPCXFPLRPOGWJMWUDTUAM/action/author_attestation","sign_citation":"https://pith.science/pith/2VN6YPPCXFPLRPOGWJMWUDTUAM/action/citation_signature","submit_replication":"https://pith.science/pith/2VN6YPPCXFPLRPOGWJMWUDTUAM/action/replication_record"}},"created_at":"2026-05-18T02:44:48.317821+00:00","updated_at":"2026-05-18T02:44:48.317821+00:00"}