{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UKB5EQ3DQ6NLN5DUIV6GUOBZRA","short_pith_number":"pith:UKB5EQ3D","canonical_record":{"source":{"id":"1804.09699","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-25T17:47:56Z","cross_cats_sorted":["cs.CR","cs.CV","cs.LG"],"title_canon_sha256":"a2f83be4f954ea969e12f11165cee2bba0d2ead26f3d6d87507af63bbbb1d5cc","abstract_canon_sha256":"49da703b2d46265358875e9b2dabede98569cc00dd0bf5499a2a00bde62faed7"},"schema_version":"1.0"},"canonical_sha256":"a283d24363879ab6f474457c6a38398819afd455fa7e9cec51127bdbc6ff0ba2","source":{"kind":"arxiv","id":"1804.09699","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09699","created_at":"2026-05-18T00:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09699v4","created_at":"2026-05-18T00:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09699","created_at":"2026-05-18T00:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"UKB5EQ3DQ6NL","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UKB5EQ3DQ6NLN5DU","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UKB5EQ3D","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UKB5EQ3DQ6NLN5DUIV6GUOBZRA","target":"record","payload":{"canonical_record":{"source":{"id":"1804.09699","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-25T17:47:56Z","cross_cats_sorted":["cs.CR","cs.CV","cs.LG"],"title_canon_sha256":"a2f83be4f954ea969e12f11165cee2bba0d2ead26f3d6d87507af63bbbb1d5cc","abstract_canon_sha256":"49da703b2d46265358875e9b2dabede98569cc00dd0bf5499a2a00bde62faed7"},"schema_version":"1.0"},"canonical_sha256":"a283d24363879ab6f474457c6a38398819afd455fa7e9cec51127bdbc6ff0ba2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:23.311213Z","signature_b64":"YGYHremIscBwlOtYb9wlqfcKYaPnFPRvFxVpzFfnFbXvlFV2iEEVl2O4Ulvehx/5DPS10/UXDO3AeoirRWppCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a283d24363879ab6f474457c6a38398819afd455fa7e9cec51127bdbc6ff0ba2","last_reissued_at":"2026-05-18T00:04:23.310598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:23.310598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.09699","source_version":4,"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:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pdLD9iNUjn6LHM3Lo9cv8+WFguc/0Lv+SbTtt270UJe872Y77A8XaTmVtsHkStiSrXgO1JFaROdwoLZ2xKB6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:10:33.939612Z"},"content_sha256":"c9177c21650ca4ea61db66c29cf413b77367aec61fc060c8bde92a564f30be4a","schema_version":"1.0","event_id":"sha256:c9177c21650ca4ea61db66c29cf413b77367aec61fc060c8bde92a564f30be4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UKB5EQ3DQ6NLN5DUIV6GUOBZRA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Fast Computation of Certified Robustness for ReLU Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Cho-Jui Hsieh, Duane Boning, Hongge Chen, Huan Zhang, Inderjit S. Dhillon, Luca Daniel, Tsui-Wei Weng, Zhao Song","submitted_at":"2018-04-25T17:47:56Z","abstract_excerpt":"Verifying the robustness property of a general Rectified Linear Unit (ReLU) network is an NP-complete problem [Katz, Barrett, Dill, Julian and Kochenderfer CAV17]. Although finding the exact minimum adversarial distortion is hard, giving a certified lower bound of the minimum distortion is possible. Current available methods of computing such a bound are either time-consuming or delivering low quality bounds that are too loose to be useful. In this paper, we exploit the special structure of ReLU networks and provide two computationally efficient algorithms Fast-Lin and Fast-Lip that are able t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09699","kind":"arxiv","version":4},"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:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FU51J3any6JGi/1AaNp7vKYClFGoSBrcGKPLGh2vMlRcdcCCgrmSQ5tDdNCcq0Ep0PCzpShdr1PPRR/ibIW9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:10:33.940304Z"},"content_sha256":"31928484592f50898c85d01fcdff0a1492094431f3ad2a3f191dc62a87b1d81f","schema_version":"1.0","event_id":"sha256:31928484592f50898c85d01fcdff0a1492094431f3ad2a3f191dc62a87b1d81f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UKB5EQ3DQ6NLN5DUIV6GUOBZRA/bundle.json","state_url":"https://pith.science/pith/UKB5EQ3DQ6NLN5DUIV6GUOBZRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UKB5EQ3DQ6NLN5DUIV6GUOBZRA/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-06-08T01:10:33Z","links":{"resolver":"https://pith.science/pith/UKB5EQ3DQ6NLN5DUIV6GUOBZRA","bundle":"https://pith.science/pith/UKB5EQ3DQ6NLN5DUIV6GUOBZRA/bundle.json","state":"https://pith.science/pith/UKB5EQ3DQ6NLN5DUIV6GUOBZRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UKB5EQ3DQ6NLN5DUIV6GUOBZRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UKB5EQ3DQ6NLN5DUIV6GUOBZRA","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":"49da703b2d46265358875e9b2dabede98569cc00dd0bf5499a2a00bde62faed7","cross_cats_sorted":["cs.CR","cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-25T17:47:56Z","title_canon_sha256":"a2f83be4f954ea969e12f11165cee2bba0d2ead26f3d6d87507af63bbbb1d5cc"},"schema_version":"1.0","source":{"id":"1804.09699","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09699","created_at":"2026-05-18T00:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09699v4","created_at":"2026-05-18T00:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09699","created_at":"2026-05-18T00:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"UKB5EQ3DQ6NL","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UKB5EQ3DQ6NLN5DU","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UKB5EQ3D","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:31928484592f50898c85d01fcdff0a1492094431f3ad2a3f191dc62a87b1d81f","target":"graph","created_at":"2026-05-18T00:04:23Z","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":"Verifying the robustness property of a general Rectified Linear Unit (ReLU) network is an NP-complete problem [Katz, Barrett, Dill, Julian and Kochenderfer CAV17]. Although finding the exact minimum adversarial distortion is hard, giving a certified lower bound of the minimum distortion is possible. Current available methods of computing such a bound are either time-consuming or delivering low quality bounds that are too loose to be useful. In this paper, we exploit the special structure of ReLU networks and provide two computationally efficient algorithms Fast-Lin and Fast-Lip that are able t","authors_text":"Cho-Jui Hsieh, Duane Boning, Hongge Chen, Huan Zhang, Inderjit S. Dhillon, Luca Daniel, Tsui-Wei Weng, Zhao Song","cross_cats":["cs.CR","cs.CV","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-25T17:47:56Z","title":"Towards Fast Computation of Certified Robustness for ReLU Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09699","kind":"arxiv","version":4},"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:c9177c21650ca4ea61db66c29cf413b77367aec61fc060c8bde92a564f30be4a","target":"record","created_at":"2026-05-18T00:04:23Z","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":"49da703b2d46265358875e9b2dabede98569cc00dd0bf5499a2a00bde62faed7","cross_cats_sorted":["cs.CR","cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-25T17:47:56Z","title_canon_sha256":"a2f83be4f954ea969e12f11165cee2bba0d2ead26f3d6d87507af63bbbb1d5cc"},"schema_version":"1.0","source":{"id":"1804.09699","kind":"arxiv","version":4}},"canonical_sha256":"a283d24363879ab6f474457c6a38398819afd455fa7e9cec51127bdbc6ff0ba2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a283d24363879ab6f474457c6a38398819afd455fa7e9cec51127bdbc6ff0ba2","first_computed_at":"2026-05-18T00:04:23.310598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:23.310598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YGYHremIscBwlOtYb9wlqfcKYaPnFPRvFxVpzFfnFbXvlFV2iEEVl2O4Ulvehx/5DPS10/UXDO3AeoirRWppCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:23.311213Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.09699","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9177c21650ca4ea61db66c29cf413b77367aec61fc060c8bde92a564f30be4a","sha256:31928484592f50898c85d01fcdff0a1492094431f3ad2a3f191dc62a87b1d81f"],"state_sha256":"84cf0b8bd5011da85fd38579734737e1c8afe162c32aae172f1977e2da10ba7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6xRJcZ7ONilI2TsdCZrelpatt236qkKmBI2RFdseoedf6HSI/Z8LWO4lP5CjslGOLewMtdh3B+2m2VR/XoYDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:10:33.944473Z","bundle_sha256":"a817c8e56ca368f9c901fa47d2fc64237412d158ba0034b3e5f0c7d5686a6de7"}}