{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:SUEVI5JLHLNPELCPTAMSIQ7PWM","short_pith_number":"pith:SUEVI5JL","canonical_record":{"source":{"id":"2011.13824","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-11-27T16:42:12Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"82a0ce815390ad371a2ab0998740dd567b45c7c7307b00e610399a4573d973c5","abstract_canon_sha256":"86db0a5cffff90b4918c28f1e10be83db59f4118eb6801a482adbf1c4fa410e3"},"schema_version":"1.0"},"canonical_sha256":"950954752b3adaf22c4f98192443efb318492885e400ae96562d61794f4d8697","source":{"kind":"arxiv","id":"2011.13824","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.13824","created_at":"2026-07-05T02:23:19Z"},{"alias_kind":"arxiv_version","alias_value":"2011.13824v2","created_at":"2026-07-05T02:23:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.13824","created_at":"2026-07-05T02:23:19Z"},{"alias_kind":"pith_short_12","alias_value":"SUEVI5JLHLNP","created_at":"2026-07-05T02:23:19Z"},{"alias_kind":"pith_short_16","alias_value":"SUEVI5JLHLNPELCP","created_at":"2026-07-05T02:23:19Z"},{"alias_kind":"pith_short_8","alias_value":"SUEVI5JL","created_at":"2026-07-05T02:23:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:SUEVI5JLHLNPELCPTAMSIQ7PWM","target":"record","payload":{"canonical_record":{"source":{"id":"2011.13824","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-11-27T16:42:12Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"82a0ce815390ad371a2ab0998740dd567b45c7c7307b00e610399a4573d973c5","abstract_canon_sha256":"86db0a5cffff90b4918c28f1e10be83db59f4118eb6801a482adbf1c4fa410e3"},"schema_version":"1.0"},"canonical_sha256":"950954752b3adaf22c4f98192443efb318492885e400ae96562d61794f4d8697","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:23:19.780425Z","signature_b64":"TmlzjeEMT+5yfrgNJ/eBDY+Rei+S+9kokLlFOxlY6WjGBZcy0xRUkWYEggf14L/+zEGTu9Y1nFdwImo0I6axCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"950954752b3adaf22c4f98192443efb318492885e400ae96562d61794f4d8697","last_reissued_at":"2026-07-05T02:23:19.779894Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:23:19.779894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.13824","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-07-05T02:23:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4RqRmb09WiyLT3SBvDmKmYjqQ57kwlk5Pio+Zlacw14IG0yHmhvPF17K8/thNFcHeKgTgwmRbVILHysOcPC3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T01:34:02.114942Z"},"content_sha256":"56091667705842df6fefb6bc7d11d3cc1ec3c212a11d431bf6340dbc883c0d08","schema_version":"1.0","event_id":"sha256:56091667705842df6fefb6bc7d11d3cc1ec3c212a11d431bf6340dbc883c0d08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:SUEVI5JLHLNPELCPTAMSIQ7PWM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Cho-Jui Hsieh, Huan Zhang, Kaidi Xu, Shiqi Wang, Suman Jana, Xue Lin, Yihan Wang","submitted_at":"2020-11-27T16:42:12Z","abstract_excerpt":"Formal verification of neural networks (NNs) is a challenging and important problem. Existing efficient complete solvers typically require the branch-and-bound (BaB) process, which splits the problem domain into sub-domains and solves each sub-domain using faster but weaker incomplete verifiers, such as Linear Programming (LP) on linearly relaxed sub-domains. In this paper, we propose to use the backward mode linear relaxation based perturbation analysis (LiRPA) to replace LP during the BaB process, which can be efficiently implemented on the typical machine learning accelerators such as GPUs "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.13824","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/2011.13824/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"},"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-07-05T02:23:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jf+lgouRHFdlrA4/pfVlAH3Y10SyL+k2DCZV40l3skzk+Iv08J7rTpcSjO3kdQ05NPZi4oAk4dRkuhlOKumTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T01:34:02.115575Z"},"content_sha256":"730b2fb02c7ffc59e0b3ae74ca932b02416c35e830df04e58a11f1935792b992","schema_version":"1.0","event_id":"sha256:730b2fb02c7ffc59e0b3ae74ca932b02416c35e830df04e58a11f1935792b992"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SUEVI5JLHLNPELCPTAMSIQ7PWM/bundle.json","state_url":"https://pith.science/pith/SUEVI5JLHLNPELCPTAMSIQ7PWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SUEVI5JLHLNPELCPTAMSIQ7PWM/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-08T01:34:02Z","links":{"resolver":"https://pith.science/pith/SUEVI5JLHLNPELCPTAMSIQ7PWM","bundle":"https://pith.science/pith/SUEVI5JLHLNPELCPTAMSIQ7PWM/bundle.json","state":"https://pith.science/pith/SUEVI5JLHLNPELCPTAMSIQ7PWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SUEVI5JLHLNPELCPTAMSIQ7PWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:SUEVI5JLHLNPELCPTAMSIQ7PWM","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":"86db0a5cffff90b4918c28f1e10be83db59f4118eb6801a482adbf1c4fa410e3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-11-27T16:42:12Z","title_canon_sha256":"82a0ce815390ad371a2ab0998740dd567b45c7c7307b00e610399a4573d973c5"},"schema_version":"1.0","source":{"id":"2011.13824","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.13824","created_at":"2026-07-05T02:23:19Z"},{"alias_kind":"arxiv_version","alias_value":"2011.13824v2","created_at":"2026-07-05T02:23:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.13824","created_at":"2026-07-05T02:23:19Z"},{"alias_kind":"pith_short_12","alias_value":"SUEVI5JLHLNP","created_at":"2026-07-05T02:23:19Z"},{"alias_kind":"pith_short_16","alias_value":"SUEVI5JLHLNPELCP","created_at":"2026-07-05T02:23:19Z"},{"alias_kind":"pith_short_8","alias_value":"SUEVI5JL","created_at":"2026-07-05T02:23:19Z"}],"graph_snapshots":[{"event_id":"sha256:730b2fb02c7ffc59e0b3ae74ca932b02416c35e830df04e58a11f1935792b992","target":"graph","created_at":"2026-07-05T02:23:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.13824/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Formal verification of neural networks (NNs) is a challenging and important problem. Existing efficient complete solvers typically require the branch-and-bound (BaB) process, which splits the problem domain into sub-domains and solves each sub-domain using faster but weaker incomplete verifiers, such as Linear Programming (LP) on linearly relaxed sub-domains. In this paper, we propose to use the backward mode linear relaxation based perturbation analysis (LiRPA) to replace LP during the BaB process, which can be efficiently implemented on the typical machine learning accelerators such as GPUs ","authors_text":"Cho-Jui Hsieh, Huan Zhang, Kaidi Xu, Shiqi Wang, Suman Jana, Xue Lin, Yihan Wang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-11-27T16:42:12Z","title":"Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.13824","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:56091667705842df6fefb6bc7d11d3cc1ec3c212a11d431bf6340dbc883c0d08","target":"record","created_at":"2026-07-05T02:23:19Z","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":"86db0a5cffff90b4918c28f1e10be83db59f4118eb6801a482adbf1c4fa410e3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-11-27T16:42:12Z","title_canon_sha256":"82a0ce815390ad371a2ab0998740dd567b45c7c7307b00e610399a4573d973c5"},"schema_version":"1.0","source":{"id":"2011.13824","kind":"arxiv","version":2}},"canonical_sha256":"950954752b3adaf22c4f98192443efb318492885e400ae96562d61794f4d8697","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"950954752b3adaf22c4f98192443efb318492885e400ae96562d61794f4d8697","first_computed_at":"2026-07-05T02:23:19.779894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:23:19.779894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TmlzjeEMT+5yfrgNJ/eBDY+Rei+S+9kokLlFOxlY6WjGBZcy0xRUkWYEggf14L/+zEGTu9Y1nFdwImo0I6axCw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:23:19.780425Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.13824","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56091667705842df6fefb6bc7d11d3cc1ec3c212a11d431bf6340dbc883c0d08","sha256:730b2fb02c7ffc59e0b3ae74ca932b02416c35e830df04e58a11f1935792b992"],"state_sha256":"295020fed51883f49e015d3ac94043d17bd5d19dcf574858d960ce5e5e532ae0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/9kQNKtBWttYbGrPhXEO5ztAWk8b2WP5+8Gs/x77RksS3eAqMp5gC0ORY7pbMUbELJizSsZy+MxJpe6n3hqUCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T01:34:02.120648Z","bundle_sha256":"b3166609f31432d54f5af33224093adaf16112e59da2fc717d346f87b776b42a"}}