{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZBFQYQQOZXWCKX3H2BA253XZT5","short_pith_number":"pith:ZBFQYQQO","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"},"canonical_sha256":"c84b0c420ecdec255f67d041aeeef99f4c586f7908ac80608859bb37da7ffd01","source":{"kind":"arxiv","id":"1805.10265","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10265","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10265v2","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10265","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZBFQYQQOZXWC","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"ZBFQYQQOZXWCKX3H","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"ZBFQYQQO","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZBFQYQQOZXWCKX3H2BA253XZT5","target":"record","payload":{"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"},"canonical_sha256":"c84b0c420ecdec255f67d041aeeef99f4c586f7908ac80608859bb37da7ffd01","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"},"source_kind":"arxiv","source_id":"1805.10265","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XxjVYklO4t5ZGlrIaTUqLGMHlubuEblPxL8W8XNNlXOkfNCuYZLLprXAO9zk+plL9oENxgMPI4Iaxj+NUwN5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T15:30:02.865009Z"},"content_sha256":"d2070545dbb516473647dafbb7fbf71e0ea3ed8cf779aefb846438780e186508","schema_version":"1.0","event_id":"sha256:d2070545dbb516473647dafbb7fbf71e0ea3ed8cf779aefb846438780e186508"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZBFQYQQOZXWCKX3H2BA253XZT5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zZrf/FjYqgAtyRVz0euWUXylPy2+fFElgEkddl/k5oDRqE/okk0yLLDpyq1jPwVzIZZjuPNg+qDztm1dny3GDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T15:30:02.865730Z"},"content_sha256":"b25c8095b3754b9cf8f39e37abda26195f750a9cc8c1fe0704e05ae007a6913f","schema_version":"1.0","event_id":"sha256:b25c8095b3754b9cf8f39e37abda26195f750a9cc8c1fe0704e05ae007a6913f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZBFQYQQOZXWCKX3H2BA253XZT5/bundle.json","state_url":"https://pith.science/pith/ZBFQYQQOZXWCKX3H2BA253XZT5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZBFQYQQOZXWCKX3H2BA253XZT5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-18T15:30:02Z","links":{"resolver":"https://pith.science/pith/ZBFQYQQOZXWCKX3H2BA253XZT5","bundle":"https://pith.science/pith/ZBFQYQQOZXWCKX3H2BA253XZT5/bundle.json","state":"https://pith.science/pith/ZBFQYQQOZXWCKX3H2BA253XZT5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZBFQYQQOZXWCKX3H2BA253XZT5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZBFQYQQOZXWCKX3H2BA253XZT5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5582ff31daa8affc14aa00dfd8147a86649375c87543d7535a4f22c9b0ddcc5a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T17:35:39Z","title_canon_sha256":"8084e735297a22ebc44c18474cc0f5603650c19e329624065e71fc38e755848b"},"schema_version":"1.0","source":{"id":"1805.10265","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10265","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10265v2","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10265","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZBFQYQQOZXWC","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"ZBFQYQQOZXWCKX3H","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"ZBFQYQQO","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:b25c8095b3754b9cf8f39e37abda26195f750a9cc8c1fe0704e05ae007a6913f","target":"graph","created_at":"2026-05-18T00:14:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Brendan O'Donoghue, Jonathan Uesato, Krishnamurthy Dvijotham, Pushmeet Kohli, Relja Arandjelovic, Robert Stanforth, Sven Gowal","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T17:35:39Z","title":"Training verified learners with learned verifiers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10265","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d2070545dbb516473647dafbb7fbf71e0ea3ed8cf779aefb846438780e186508","target":"record","created_at":"2026-05-18T00:14:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5582ff31daa8affc14aa00dfd8147a86649375c87543d7535a4f22c9b0ddcc5a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T17:35:39Z","title_canon_sha256":"8084e735297a22ebc44c18474cc0f5603650c19e329624065e71fc38e755848b"},"schema_version":"1.0","source":{"id":"1805.10265","kind":"arxiv","version":2}},"canonical_sha256":"c84b0c420ecdec255f67d041aeeef99f4c586f7908ac80608859bb37da7ffd01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c84b0c420ecdec255f67d041aeeef99f4c586f7908ac80608859bb37da7ffd01","first_computed_at":"2026-05-18T00:14:43.737933Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:43.737933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KAcPuLwPWG0JSVmrMBbbxnEgAbdIo43af93ZcAnsIw5MslwOVlZTa7HTlR71LTqFHfEhnDASJSrpthRojrEqAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:43.738461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10265","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2070545dbb516473647dafbb7fbf71e0ea3ed8cf779aefb846438780e186508","sha256:b25c8095b3754b9cf8f39e37abda26195f750a9cc8c1fe0704e05ae007a6913f"],"state_sha256":"4d2b4ceab7307165b52be891ccf709c115a5b438306d00df29fbb91193b2ebaa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Inz9QlQxZs0fYbeBpIylbE10sfCu+cuotjWNIj8QAKyRaFTUFUXnYd+lHEbWNI2pIFf6m4c9P/PeESomLJYBAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T15:30:02.867802Z","bundle_sha256":"ad0602aa25101344f310220e711647d3901d898baa28537dcb85363f7f29ef6f"}}