{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IRQANXXOZMF4GNXBULOMWMQ4DY","short_pith_number":"pith:IRQANXXO","canonical_record":{"source":{"id":"1904.09959","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-04-22T17:21:52Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7bc52fdb99d545d8d898af2001faf19c65092c89343f3d24451f584467fda0b0","abstract_canon_sha256":"330cf56e64643305861effe697d5a07e58f97f64f4c97c342f7d4d097e9360cc"},"schema_version":"1.0"},"canonical_sha256":"446006deeecb0bc336e1a2dccb321c1e30f7bc5ee6e0cc5a11422b6177a59be0","source":{"kind":"arxiv","id":"1904.09959","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09959","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09959v2","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09959","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"IRQANXXOZMF4","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IRQANXXOZMF4GNXB","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IRQANXXO","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IRQANXXOZMF4GNXBULOMWMQ4DY","target":"record","payload":{"canonical_record":{"source":{"id":"1904.09959","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-04-22T17:21:52Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7bc52fdb99d545d8d898af2001faf19c65092c89343f3d24451f584467fda0b0","abstract_canon_sha256":"330cf56e64643305861effe697d5a07e58f97f64f4c97c342f7d4d097e9360cc"},"schema_version":"1.0"},"canonical_sha256":"446006deeecb0bc336e1a2dccb321c1e30f7bc5ee6e0cc5a11422b6177a59be0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:15.465020Z","signature_b64":"G8HLQ1z51mx6HQZ4CiS0DnY24AfqvZsu9ZgpnqpzhAY9buNYBeclbkOIbf2fmrk6ZHUyMOkSc1n51ZfHuuxiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"446006deeecb0bc336e1a2dccb321c1e30f7bc5ee6e0cc5a11422b6177a59be0","last_reissued_at":"2026-05-17T23:47:15.464604Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:15.464604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.09959","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-17T23:47:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eAr0A+Vm1tep/pGzl8ZLWoud8H/DAogQWhSgjMzAzkW8RmkoRWcIPkP9RWZajJLYVc/4pb02cRdv19qn5J3LAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T09:05:38.825971Z"},"content_sha256":"21cdfa50fe5cd959438178bfe58051a3e45ed7e169e8edf850471b4fea6aee75","schema_version":"1.0","event_id":"sha256:21cdfa50fe5cd959438178bfe58051a3e45ed7e169e8edf850471b4fea6aee75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IRQANXXOZMF4GNXBULOMWMQ4DY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization and Abstraction: A Synergistic Approach for Analyzing Neural Network Robustness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.PL","authors_text":"Greg Anderson, Isil Dillig, Shankara Pailoor, Swarat Chaudhuri","submitted_at":"2019-04-22T17:21:52Z","abstract_excerpt":"In recent years, the notion of local robustness (or robustness for short) has emerged as a desirable property of deep neural networks. Intuitively, robustness means that small perturbations to an input do not cause the network to perform misclassifications. In this paper, we present a novel algorithm for verifying robustness properties of neural networks. Our method synergistically combines gradient-based optimization methods for counterexample search with abstraction-based proof search to obtain a sound and ({\\delta}-)complete decision procedure. Our method also employs a data-driven approach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09959","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-17T23:47:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CyU+fWCupEIIYdau9JVLMtolx13nbwlAHCJWi33U8ug7MnLLZja6PkKmPvFviY7HM/NAuUJ8QgbJfMB9mwlWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T09:05:38.826835Z"},"content_sha256":"2878c8c27817bf444188336db33258e68281cbdaaa3c6c59bcac1a9c23f16624","schema_version":"1.0","event_id":"sha256:2878c8c27817bf444188336db33258e68281cbdaaa3c6c59bcac1a9c23f16624"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IRQANXXOZMF4GNXBULOMWMQ4DY/bundle.json","state_url":"https://pith.science/pith/IRQANXXOZMF4GNXBULOMWMQ4DY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IRQANXXOZMF4GNXBULOMWMQ4DY/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-08-15T09:05:38Z","links":{"resolver":"https://pith.science/pith/IRQANXXOZMF4GNXBULOMWMQ4DY","bundle":"https://pith.science/pith/IRQANXXOZMF4GNXBULOMWMQ4DY/bundle.json","state":"https://pith.science/pith/IRQANXXOZMF4GNXBULOMWMQ4DY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IRQANXXOZMF4GNXBULOMWMQ4DY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IRQANXXOZMF4GNXBULOMWMQ4DY","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":"330cf56e64643305861effe697d5a07e58f97f64f4c97c342f7d4d097e9360cc","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-04-22T17:21:52Z","title_canon_sha256":"7bc52fdb99d545d8d898af2001faf19c65092c89343f3d24451f584467fda0b0"},"schema_version":"1.0","source":{"id":"1904.09959","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09959","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09959v2","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09959","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"IRQANXXOZMF4","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IRQANXXOZMF4GNXB","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IRQANXXO","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:2878c8c27817bf444188336db33258e68281cbdaaa3c6c59bcac1a9c23f16624","target":"graph","created_at":"2026-05-17T23:47:15Z","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":"In recent years, the notion of local robustness (or robustness for short) has emerged as a desirable property of deep neural networks. Intuitively, robustness means that small perturbations to an input do not cause the network to perform misclassifications. In this paper, we present a novel algorithm for verifying robustness properties of neural networks. Our method synergistically combines gradient-based optimization methods for counterexample search with abstraction-based proof search to obtain a sound and ({\\delta}-)complete decision procedure. Our method also employs a data-driven approach","authors_text":"Greg Anderson, Isil Dillig, Shankara Pailoor, Swarat Chaudhuri","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-04-22T17:21:52Z","title":"Optimization and Abstraction: A Synergistic Approach for Analyzing Neural Network Robustness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09959","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:21cdfa50fe5cd959438178bfe58051a3e45ed7e169e8edf850471b4fea6aee75","target":"record","created_at":"2026-05-17T23:47:15Z","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":"330cf56e64643305861effe697d5a07e58f97f64f4c97c342f7d4d097e9360cc","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-04-22T17:21:52Z","title_canon_sha256":"7bc52fdb99d545d8d898af2001faf19c65092c89343f3d24451f584467fda0b0"},"schema_version":"1.0","source":{"id":"1904.09959","kind":"arxiv","version":2}},"canonical_sha256":"446006deeecb0bc336e1a2dccb321c1e30f7bc5ee6e0cc5a11422b6177a59be0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"446006deeecb0bc336e1a2dccb321c1e30f7bc5ee6e0cc5a11422b6177a59be0","first_computed_at":"2026-05-17T23:47:15.464604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:15.464604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G8HLQ1z51mx6HQZ4CiS0DnY24AfqvZsu9ZgpnqpzhAY9buNYBeclbkOIbf2fmrk6ZHUyMOkSc1n51ZfHuuxiDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:15.465020Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.09959","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21cdfa50fe5cd959438178bfe58051a3e45ed7e169e8edf850471b4fea6aee75","sha256:2878c8c27817bf444188336db33258e68281cbdaaa3c6c59bcac1a9c23f16624"],"state_sha256":"ecef7b6324bc4ed5b2d3d2e78ba22a672d6d059c2640fe55bfa2854eb6e03d95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mR7HZ7n6rJ36I9FBrYVmWQo/0qP1iINxH+fsRn79NFOAFn70r5dRGj0WcynD8JG5APDL7JzKe53ldiBRpq4gBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T09:05:38.834175Z","bundle_sha256":"cc1476cd174ca0b2d1b59cb27c20c847f223e8cac242bc4a6ddd56bf9eca2e79"}}