{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:F6WVCYQEA42GFPCDCPQT62NVXO","short_pith_number":"pith:F6WVCYQE","schema_version":"1.0","canonical_sha256":"2fad516204073462bc4313e13f69b5bb8384ecb350773ae773a7d0b81d8a8143","source":{"kind":"arxiv","id":"2606.23768","version":1},"attestation_state":"computed","paper":{"title":"Cryptographic certificates of validity for trustworthy AI","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LO"],"primary_cat":"cs.CR","authors_text":"Murdoch J. Gabbay","submitted_at":"2026-06-22T16:42:25Z","abstract_excerpt":"We propose cryptographic certificates of validity for agentic AI systems. The core idea is to formally specify a correctness or policy condition as a logical predicate, compile this predicate to a witness-checking problem over polynomial constraints, and use a succinct cryptographic proof system (and optionally zero-knowledge) to certify that the condition holds.\n  This offers a middle ground between formal verification of source code, and cryptographic authentication. An agent's action can be accompanied by an independently checkable proof that it satisfies an agreed formal policy, without re"},"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":"2606.23768","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-06-22T16:42:25Z","cross_cats_sorted":["cs.AI","cs.LO"],"title_canon_sha256":"fc5ae42ff1da4b4b549a846792784941d165104f15fcd5247ea22e4251346143","abstract_canon_sha256":"37fd42614289c065b9fea6ea5a037d28bc62ac752e6d18413b589c9972fef497"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T00:14:25.482204Z","signature_b64":"ABNz40QXY8TCgY6fiSNTFVXumMiwbidwjgKzLtPSt83pcFzV1Vg/fO0zKUWGdHfZnPHjw+SymxCs/shj1pqODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fad516204073462bc4313e13f69b5bb8384ecb350773ae773a7d0b81d8a8143","last_reissued_at":"2026-06-24T00:14:25.481788Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T00:14:25.481788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cryptographic certificates of validity for trustworthy AI","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LO"],"primary_cat":"cs.CR","authors_text":"Murdoch J. Gabbay","submitted_at":"2026-06-22T16:42:25Z","abstract_excerpt":"We propose cryptographic certificates of validity for agentic AI systems. The core idea is to formally specify a correctness or policy condition as a logical predicate, compile this predicate to a witness-checking problem over polynomial constraints, and use a succinct cryptographic proof system (and optionally zero-knowledge) to certify that the condition holds.\n  This offers a middle ground between formal verification of source code, and cryptographic authentication. An agent's action can be accompanied by an independently checkable proof that it satisfies an agreed formal policy, without re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23768","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/2606.23768/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":"2606.23768","created_at":"2026-06-24T00:14:25.481852+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.23768v1","created_at":"2026-06-24T00:14:25.481852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23768","created_at":"2026-06-24T00:14:25.481852+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6WVCYQEA42G","created_at":"2026-06-24T00:14:25.481852+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6WVCYQEA42GFPCD","created_at":"2026-06-24T00:14:25.481852+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6WVCYQE","created_at":"2026-06-24T00:14:25.481852+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/F6WVCYQEA42GFPCDCPQT62NVXO","json":"https://pith.science/pith/F6WVCYQEA42GFPCDCPQT62NVXO.json","graph_json":"https://pith.science/api/pith-number/F6WVCYQEA42GFPCDCPQT62NVXO/graph.json","events_json":"https://pith.science/api/pith-number/F6WVCYQEA42GFPCDCPQT62NVXO/events.json","paper":"https://pith.science/paper/F6WVCYQE"},"agent_actions":{"view_html":"https://pith.science/pith/F6WVCYQEA42GFPCDCPQT62NVXO","download_json":"https://pith.science/pith/F6WVCYQEA42GFPCDCPQT62NVXO.json","view_paper":"https://pith.science/paper/F6WVCYQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.23768&json=true","fetch_graph":"https://pith.science/api/pith-number/F6WVCYQEA42GFPCDCPQT62NVXO/graph.json","fetch_events":"https://pith.science/api/pith-number/F6WVCYQEA42GFPCDCPQT62NVXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6WVCYQEA42GFPCDCPQT62NVXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6WVCYQEA42GFPCDCPQT62NVXO/action/storage_attestation","attest_author":"https://pith.science/pith/F6WVCYQEA42GFPCDCPQT62NVXO/action/author_attestation","sign_citation":"https://pith.science/pith/F6WVCYQEA42GFPCDCPQT62NVXO/action/citation_signature","submit_replication":"https://pith.science/pith/F6WVCYQEA42GFPCDCPQT62NVXO/action/replication_record"}},"created_at":"2026-06-24T00:14:25.481852+00:00","updated_at":"2026-06-24T00:14:25.481852+00:00"}