{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CXKSHIU4255BCVTAVO5VLXBUAE","short_pith_number":"pith:CXKSHIU4","schema_version":"1.0","canonical_sha256":"15d523a29cd77a115660abbb55dc34012bee9b70e4431db26643b2918fb4a16c","source":{"kind":"arxiv","id":"2311.07185","version":1},"attestation_state":"computed","paper":{"title":"Dedukti: a Logical Framework based on the $\\lambda$$\\Pi$-Calculus Modulo Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ali Assaf, Catherine Dubois (ENSIIE), David Delahaye (CNAM), Fr\\'ed\\'eric Gilbert, Gilles Dowek, Guillaume Burel (ENSIIE), Olivier Hermant, Pierre Halmagrand, Rapha\\\"el Cauderlier, Ronan Saillard","submitted_at":"2023-11-13T09:22:36Z","abstract_excerpt":"Dedukti is a Logical Framework based on the $\\lambda$$\\Pi$-Calculus Modulo Theory. We show that many theories can be expressed in Dedukti: constructive and classical predicate logic, Simple type theory, programming languages, Pure type systems, the Calculus of inductive constructions with universes, etc. and that permits to used it to check large libraries of proofs developed in other proof systems: Zenon, iProver, FoCaLiZe, HOL Light, and Matita."},"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":"2311.07185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2023-11-13T09:22:36Z","cross_cats_sorted":[],"title_canon_sha256":"b3ca3afe134b6fb529e6b7c824b9ed79da343200bd5cfe0186365e63490c0824","abstract_canon_sha256":"52b687605c7e717df4d91cbdfb753854f708f0eaafedded484837da7dd1113f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:12:09.268385Z","signature_b64":"0YeaY4q3wHHjdI3/4lD3w+fpsWFAh1eys4YVv84P8r/RMVFGCdM+w68UMzkB1JQPHMZIm61G9LbeUpwQCxdFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15d523a29cd77a115660abbb55dc34012bee9b70e4431db26643b2918fb4a16c","last_reissued_at":"2026-07-05T07:12:09.267900Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:12:09.267900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dedukti: a Logical Framework based on the $\\lambda$$\\Pi$-Calculus Modulo Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ali Assaf, Catherine Dubois (ENSIIE), David Delahaye (CNAM), Fr\\'ed\\'eric Gilbert, Gilles Dowek, Guillaume Burel (ENSIIE), Olivier Hermant, Pierre Halmagrand, Rapha\\\"el Cauderlier, Ronan Saillard","submitted_at":"2023-11-13T09:22:36Z","abstract_excerpt":"Dedukti is a Logical Framework based on the $\\lambda$$\\Pi$-Calculus Modulo Theory. We show that many theories can be expressed in Dedukti: constructive and classical predicate logic, Simple type theory, programming languages, Pure type systems, the Calculus of inductive constructions with universes, etc. and that permits to used it to check large libraries of proofs developed in other proof systems: Zenon, iProver, FoCaLiZe, HOL Light, and Matita."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.07185","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.07185/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":"2311.07185","created_at":"2026-07-05T07:12:09.267965+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.07185v1","created_at":"2026-07-05T07:12:09.267965+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.07185","created_at":"2026-07-05T07:12:09.267965+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXKSHIU4255B","created_at":"2026-07-05T07:12:09.267965+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXKSHIU4255BCVTA","created_at":"2026-07-05T07:12:09.267965+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXKSHIU4","created_at":"2026-07-05T07:12:09.267965+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.21191","citing_title":"Encoding Event-B Proof Rules in Prolog: An Interactive Sequent Prover for ProB","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CXKSHIU4255BCVTAVO5VLXBUAE","json":"https://pith.science/pith/CXKSHIU4255BCVTAVO5VLXBUAE.json","graph_json":"https://pith.science/api/pith-number/CXKSHIU4255BCVTAVO5VLXBUAE/graph.json","events_json":"https://pith.science/api/pith-number/CXKSHIU4255BCVTAVO5VLXBUAE/events.json","paper":"https://pith.science/paper/CXKSHIU4"},"agent_actions":{"view_html":"https://pith.science/pith/CXKSHIU4255BCVTAVO5VLXBUAE","download_json":"https://pith.science/pith/CXKSHIU4255BCVTAVO5VLXBUAE.json","view_paper":"https://pith.science/paper/CXKSHIU4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.07185&json=true","fetch_graph":"https://pith.science/api/pith-number/CXKSHIU4255BCVTAVO5VLXBUAE/graph.json","fetch_events":"https://pith.science/api/pith-number/CXKSHIU4255BCVTAVO5VLXBUAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXKSHIU4255BCVTAVO5VLXBUAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXKSHIU4255BCVTAVO5VLXBUAE/action/storage_attestation","attest_author":"https://pith.science/pith/CXKSHIU4255BCVTAVO5VLXBUAE/action/author_attestation","sign_citation":"https://pith.science/pith/CXKSHIU4255BCVTAVO5VLXBUAE/action/citation_signature","submit_replication":"https://pith.science/pith/CXKSHIU4255BCVTAVO5VLXBUAE/action/replication_record"}},"created_at":"2026-07-05T07:12:09.267965+00:00","updated_at":"2026-07-05T07:12:09.267965+00:00"}