{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FU63CQT7G7T2L3B4KW4SIFPR6N","short_pith_number":"pith:FU63CQT7","schema_version":"1.0","canonical_sha256":"2d3db1427f37e7a5ec3c55b92415f1f3531e141ac48fa40f7a01f88b4bf004d8","source":{"kind":"arxiv","id":"2412.08897","version":2},"attestation_state":"computed","paper":{"title":"Neural Interactive Proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Lewis Hammond, Sam Adam-Day","submitted_at":"2024-12-12T03:21:53Z","abstract_excerpt":"We consider the problem of how a trusted, but computationally bounded agent (a 'verifier') can learn to interact with one or more powerful but untrusted agents ('provers') in order to solve a given task. More specifically, we study the case in which agents are represented using neural networks and refer to solutions of this problem as neural interactive proofs. First we introduce a unifying framework based on prover-verifier games, which generalises previously proposed interaction protocols. We then describe several new protocols for generating neural interactive proofs, and provide a theoreti"},"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":"2412.08897","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-12-12T03:21:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e2635ab65ff4bf9ecb0e8e469389f86de6458e4794db91ffc61c1cebc033146d","abstract_canon_sha256":"7e73858952e9f20a8df3adc94f81219b9d07125de67eb0b45a479ed610aba2be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:33:07.370963Z","signature_b64":"lzvP66fPnY0CB6a5IIwEkzD3h+hShpKs5mQn6FcMMhpdisg6SrkeLOuz2rn5PH9MvL45iER9QyclzkYeuhxuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d3db1427f37e7a5ec3c55b92415f1f3531e141ac48fa40f7a01f88b4bf004d8","last_reissued_at":"2026-07-05T10:33:07.370167Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:33:07.370167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Interactive Proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Lewis Hammond, Sam Adam-Day","submitted_at":"2024-12-12T03:21:53Z","abstract_excerpt":"We consider the problem of how a trusted, but computationally bounded agent (a 'verifier') can learn to interact with one or more powerful but untrusted agents ('provers') in order to solve a given task. More specifically, we study the case in which agents are represented using neural networks and refer to solutions of this problem as neural interactive proofs. First we introduce a unifying framework based on prover-verifier games, which generalises previously proposed interaction protocols. We then describe several new protocols for generating neural interactive proofs, and provide a theoreti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.08897","kind":"arxiv","version":2},"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/2412.08897/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":"2412.08897","created_at":"2026-07-05T10:33:07.370290+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.08897v2","created_at":"2026-07-05T10:33:07.370290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.08897","created_at":"2026-07-05T10:33:07.370290+00:00"},{"alias_kind":"pith_short_12","alias_value":"FU63CQT7G7T2","created_at":"2026-07-05T10:33:07.370290+00:00"},{"alias_kind":"pith_short_16","alias_value":"FU63CQT7G7T2L3B4","created_at":"2026-07-05T10:33:07.370290+00:00"},{"alias_kind":"pith_short_8","alias_value":"FU63CQT7","created_at":"2026-07-05T10:33:07.370290+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/FU63CQT7G7T2L3B4KW4SIFPR6N","json":"https://pith.science/pith/FU63CQT7G7T2L3B4KW4SIFPR6N.json","graph_json":"https://pith.science/api/pith-number/FU63CQT7G7T2L3B4KW4SIFPR6N/graph.json","events_json":"https://pith.science/api/pith-number/FU63CQT7G7T2L3B4KW4SIFPR6N/events.json","paper":"https://pith.science/paper/FU63CQT7"},"agent_actions":{"view_html":"https://pith.science/pith/FU63CQT7G7T2L3B4KW4SIFPR6N","download_json":"https://pith.science/pith/FU63CQT7G7T2L3B4KW4SIFPR6N.json","view_paper":"https://pith.science/paper/FU63CQT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.08897&json=true","fetch_graph":"https://pith.science/api/pith-number/FU63CQT7G7T2L3B4KW4SIFPR6N/graph.json","fetch_events":"https://pith.science/api/pith-number/FU63CQT7G7T2L3B4KW4SIFPR6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FU63CQT7G7T2L3B4KW4SIFPR6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FU63CQT7G7T2L3B4KW4SIFPR6N/action/storage_attestation","attest_author":"https://pith.science/pith/FU63CQT7G7T2L3B4KW4SIFPR6N/action/author_attestation","sign_citation":"https://pith.science/pith/FU63CQT7G7T2L3B4KW4SIFPR6N/action/citation_signature","submit_replication":"https://pith.science/pith/FU63CQT7G7T2L3B4KW4SIFPR6N/action/replication_record"}},"created_at":"2026-07-05T10:33:07.370290+00:00","updated_at":"2026-07-05T10:33:07.370290+00:00"}