{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OLQ2BQE55AJ7CBCHFPTB2UOB7S","short_pith_number":"pith:OLQ2BQE5","schema_version":"1.0","canonical_sha256":"72e1a0c09de813f104472be61d51c1fca0febcae82be30e2f6eda4214cf5bf4d","source":{"kind":"arxiv","id":"2605.16157","version":1},"attestation_state":"computed","paper":{"title":"Verifiers and Generators: Epistemic Semantics for Intuitionistic Logic (Long Version)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Epistemic realizability interpretations using verifiers and generators are sound and complete for minimal, second-order, and higher-order intuitionistic logic.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Pablo Barenbaum","submitted_at":"2026-05-15T16:38:04Z","abstract_excerpt":"This paper explores epistemic realizability, a form of realizability in which the property that a piece of data constitutes evidence for a logical proposition is semi-decidable. In this framework, each proposition A is assigned a verifier} program that checks whether a datum X is a realizer for A, and a dual generator program that behaves as a generic realizer for X. We propose epistemic realizability interpretations for minimal logic, second-order intuitionistic logic, and higher-order intuitionistic logic, proving that each system is sound and complete under the proposed semantics."},"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":false},"canonical_record":{"source":{"id":"2605.16157","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-15T16:38:04Z","cross_cats_sorted":[],"title_canon_sha256":"0ec7ed869a40f9e2027dcdc21bcdc42b77db11b4d644bdc03fe35fa5d1438dd5","abstract_canon_sha256":"d9010e334e547c054c7aa9e489f852e36ec6b5658a8a8b85e6c9908b5f2307f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:55.414131Z","signature_b64":"eA9qar+MRFoBcxa9f7CzH0LOQGosaFCiulAtne2Y5SqFPgGJxW6+g5aTL7sSo0oeN+w9zK6mmP+gKFtAH6v9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72e1a0c09de813f104472be61d51c1fca0febcae82be30e2f6eda4214cf5bf4d","last_reissued_at":"2026-05-20T00:01:55.413195Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:55.413195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verifiers and Generators: Epistemic Semantics for Intuitionistic Logic (Long Version)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Epistemic realizability interpretations using verifiers and generators are sound and complete for minimal, second-order, and higher-order intuitionistic logic.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Pablo Barenbaum","submitted_at":"2026-05-15T16:38:04Z","abstract_excerpt":"This paper explores epistemic realizability, a form of realizability in which the property that a piece of data constitutes evidence for a logical proposition is semi-decidable. In this framework, each proposition A is assigned a verifier} program that checks whether a datum X is a realizer for A, and a dual generator program that behaves as a generic realizer for X. We propose epistemic realizability interpretations for minimal logic, second-order intuitionistic logic, and higher-order intuitionistic logic, proving that each system is sound and complete under the proposed semantics."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We propose epistemic realizability interpretations for minimal logic, second-order intuitionistic logic, and higher-order intuitionistic logic, proving that each system is sound and complete under the proposed semantics.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The framework assumes that the property of a datum constituting evidence for a proposition is semi-decidable, which permits the definition of verifier and generator programs that faithfully capture the epistemic content of the logic.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Epistemic realizability assigns verifier and generator programs to propositions and proves soundness and completeness for minimal, second-order, and higher-order intuitionistic logic.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Epistemic realizability interpretations using verifiers and generators are sound and complete for minimal, second-order, and higher-order intuitionistic logic.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8975028fffd4932f907d9132bf80d9ae6fdc5feca9e51629a822c57301c589da"},"source":{"id":"2605.16157","kind":"arxiv","version":1},"verdict":{"id":"2de8b279-a706-4572-8b30-719ebb8b62e6","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T18:42:51.243818Z","strongest_claim":"We propose epistemic realizability interpretations for minimal logic, second-order intuitionistic logic, and higher-order intuitionistic logic, proving that each system is sound and complete under the proposed semantics.","one_line_summary":"Epistemic realizability assigns verifier and generator programs to propositions and proves soundness and completeness for minimal, second-order, and higher-order intuitionistic logic.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The framework assumes that the property of a datum constituting evidence for a proposition is semi-decidable, which permits the definition of verifier and generator programs that faithfully capture the epistemic content of the logic.","pith_extraction_headline":"Epistemic realizability interpretations using verifiers and generators are sound and complete for minimal, second-order, and higher-order intuitionistic logic."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16157/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T19:01:18.933489Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T18:51:32.550628Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T18:22:02.200807Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:31.039052Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"external_links","ran_at":"2026-05-19T17:31:48.626293Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.440123Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"27cc26ae1808c663269eadceb613743399a30a8f0b5be172d005550d2a073553"},"references":{"count":146,"sample":[{"doi":"","year":2018,"title":"Steve Awodey, Jonas Frey, and Sam Speight. 2018. Impredicative encodings of (higher) inductive types. InProceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. 76–85","work_id":"8a940f2f-578f-4890-892c-cb2731ea4804","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1999,"title":"1999.Term Rewriting and All That","work_id":"47b44c57-5410-42c8-a498-2d2b65b3bd99","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1984,"title":"1984.The Lambda Calculus: Its Syntax and Semantics","work_id":"99b9859e-94cb-4128-9c18-f87f143502b0","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1991,"title":"Henk Barendregt. 1991. Introduction to generalized type systems.Journal of Functional Programming1, 2 (1991), 125–154","work_id":"b047fea2-8c05-419a-b103-b9dbe33661c5","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"2013.Lambda Calculus with Types","work_id":"abfc0a04-44dd-4c15-9ea4-6c2382274643","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":146,"snapshot_sha256":"c28434c17f9d21011e7bb378fa8b605784f00c11f91671722d40cfadc473c0ca","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":"2605.16157","created_at":"2026-05-20T00:01:55.413382+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16157v1","created_at":"2026-05-20T00:01:55.413382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16157","created_at":"2026-05-20T00:01:55.413382+00:00"},{"alias_kind":"pith_short_12","alias_value":"OLQ2BQE55AJ7","created_at":"2026-05-20T00:01:55.413382+00:00"},{"alias_kind":"pith_short_16","alias_value":"OLQ2BQE55AJ7CBCH","created_at":"2026-05-20T00:01:55.413382+00:00"},{"alias_kind":"pith_short_8","alias_value":"OLQ2BQE5","created_at":"2026-05-20T00:01:55.413382+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/OLQ2BQE55AJ7CBCHFPTB2UOB7S","json":"https://pith.science/pith/OLQ2BQE55AJ7CBCHFPTB2UOB7S.json","graph_json":"https://pith.science/api/pith-number/OLQ2BQE55AJ7CBCHFPTB2UOB7S/graph.json","events_json":"https://pith.science/api/pith-number/OLQ2BQE55AJ7CBCHFPTB2UOB7S/events.json","paper":"https://pith.science/paper/OLQ2BQE5"},"agent_actions":{"view_html":"https://pith.science/pith/OLQ2BQE55AJ7CBCHFPTB2UOB7S","download_json":"https://pith.science/pith/OLQ2BQE55AJ7CBCHFPTB2UOB7S.json","view_paper":"https://pith.science/paper/OLQ2BQE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16157&json=true","fetch_graph":"https://pith.science/api/pith-number/OLQ2BQE55AJ7CBCHFPTB2UOB7S/graph.json","fetch_events":"https://pith.science/api/pith-number/OLQ2BQE55AJ7CBCHFPTB2UOB7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OLQ2BQE55AJ7CBCHFPTB2UOB7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OLQ2BQE55AJ7CBCHFPTB2UOB7S/action/storage_attestation","attest_author":"https://pith.science/pith/OLQ2BQE55AJ7CBCHFPTB2UOB7S/action/author_attestation","sign_citation":"https://pith.science/pith/OLQ2BQE55AJ7CBCHFPTB2UOB7S/action/citation_signature","submit_replication":"https://pith.science/pith/OLQ2BQE55AJ7CBCHFPTB2UOB7S/action/replication_record"}},"created_at":"2026-05-20T00:01:55.413382+00:00","updated_at":"2026-05-20T00:01:55.413382+00:00"}