{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZBFQYQQOZXWCKX3H2BA253XZT5","short_pith_number":"pith:ZBFQYQQO","schema_version":"1.0","canonical_sha256":"c84b0c420ecdec255f67d041aeeef99f4c586f7908ac80608859bb37da7ffd01","source":{"kind":"arxiv","id":"1805.10265","version":2},"attestation_state":"computed","paper":{"title":"Training verified learners with learned verifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Brendan O'Donoghue, Jonathan Uesato, Krishnamurthy Dvijotham, Pushmeet Kohli, Relja Arandjelovic, Robert Stanforth, Sven Gowal","submitted_at":"2018-05-25T17:35:39Z","abstract_excerpt":"This paper proposes a new algorithmic framework, predictor-verifier training, to train neural networks that are verifiable, i.e., networks that provably satisfy some desired input-output properties. The key idea is to simultaneously train two networks: a predictor network that performs the task at hand,e.g., predicting labels given inputs, and a verifier network that computes a bound on how well the predictor satisfies the properties being verified. Both networks can be trained simultaneously to optimize a weighted combination of the standard data-fitting loss and a term that bounds the maximu"},"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":"1805.10265","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T17:35:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8084e735297a22ebc44c18474cc0f5603650c19e329624065e71fc38e755848b","abstract_canon_sha256":"5582ff31daa8affc14aa00dfd8147a86649375c87543d7535a4f22c9b0ddcc5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:43.738461Z","signature_b64":"KAcPuLwPWG0JSVmrMBbbxnEgAbdIo43af93ZcAnsIw5MslwOVlZTa7HTlR71LTqFHfEhnDASJSrpthRojrEqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c84b0c420ecdec255f67d041aeeef99f4c586f7908ac80608859bb37da7ffd01","last_reissued_at":"2026-05-18T00:14:43.737933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:43.737933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Training verified learners with learned verifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Brendan O'Donoghue, Jonathan Uesato, Krishnamurthy Dvijotham, Pushmeet Kohli, Relja Arandjelovic, Robert Stanforth, Sven Gowal","submitted_at":"2018-05-25T17:35:39Z","abstract_excerpt":"This paper proposes a new algorithmic framework, predictor-verifier training, to train neural networks that are verifiable, i.e., networks that provably satisfy some desired input-output properties. The key idea is to simultaneously train two networks: a predictor network that performs the task at hand,e.g., predicting labels given inputs, and a verifier network that computes a bound on how well the predictor satisfies the properties being verified. Both networks can be trained simultaneously to optimize a weighted combination of the standard data-fitting loss and a term that bounds the maximu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10265","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":""},"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":"1805.10265","created_at":"2026-05-18T00:14:43.738036+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.10265v2","created_at":"2026-05-18T00:14:43.738036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10265","created_at":"2026-05-18T00:14:43.738036+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBFQYQQOZXWC","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBFQYQQOZXWCKX3H","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBFQYQQO","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.22746","citing_title":"Relaxation-Informed Training of Neural Network Surrogate Models","ref_index":50,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZBFQYQQOZXWCKX3H2BA253XZT5","json":"https://pith.science/pith/ZBFQYQQOZXWCKX3H2BA253XZT5.json","graph_json":"https://pith.science/api/pith-number/ZBFQYQQOZXWCKX3H2BA253XZT5/graph.json","events_json":"https://pith.science/api/pith-number/ZBFQYQQOZXWCKX3H2BA253XZT5/events.json","paper":"https://pith.science/paper/ZBFQYQQO"},"agent_actions":{"view_html":"https://pith.science/pith/ZBFQYQQOZXWCKX3H2BA253XZT5","download_json":"https://pith.science/pith/ZBFQYQQOZXWCKX3H2BA253XZT5.json","view_paper":"https://pith.science/paper/ZBFQYQQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.10265&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBFQYQQOZXWCKX3H2BA253XZT5/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBFQYQQOZXWCKX3H2BA253XZT5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBFQYQQOZXWCKX3H2BA253XZT5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBFQYQQOZXWCKX3H2BA253XZT5/action/storage_attestation","attest_author":"https://pith.science/pith/ZBFQYQQOZXWCKX3H2BA253XZT5/action/author_attestation","sign_citation":"https://pith.science/pith/ZBFQYQQOZXWCKX3H2BA253XZT5/action/citation_signature","submit_replication":"https://pith.science/pith/ZBFQYQQOZXWCKX3H2BA253XZT5/action/replication_record"}},"created_at":"2026-05-18T00:14:43.738036+00:00","updated_at":"2026-05-18T00:14:43.738036+00:00"}