{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3DGIZWS7F6UZKIYMTTAXJOILSL","short_pith_number":"pith:3DGIZWS7","schema_version":"1.0","canonical_sha256":"d8cc8cda5f2fa995230c9cc174b90b92eacf5d3f79880a79f88480602e703102","source":{"kind":"arxiv","id":"1810.12715","version":4},"attestation_state":"computed","paper":{"title":"On the Effectiveness of Interval Bound Propagation for Training Verifiably Robust Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chongli Qin, Jonathan Uesato, Krishnamurthy Dvijotham, Pushmeet Kohli, Relja Arandjelovic, Robert Stanforth, Rudy Bunel, Sven Gowal, Timothy Mann","submitted_at":"2018-10-30T13:12:47Z","abstract_excerpt":"Recent work has shown that it is possible to train deep neural networks that are provably robust to norm-bounded adversarial perturbations. Most of these methods are based on minimizing an upper bound on the worst-case loss over all possible adversarial perturbations. While these techniques show promise, they often result in difficult optimization procedures that remain hard to scale to larger networks. Through a comprehensive analysis, we show how a simple bounding technique, interval bound propagation (IBP), can be exploited to train large provably robust neural networks that beat the state-"},"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":"1810.12715","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-30T13:12:47Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"6c841c7bfbcb6bc7a03ca755b062a12f6a9d43e7c673a0b4958139e436d21cc8","abstract_canon_sha256":"face99cec17541bc86d15b3e2960cc6d6f265ecd4771e75918ec2a348fe1c533"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:00:23.626058Z","signature_b64":"6cM78Y+dBLfI+K1bYyyH7rJEPzVqb24HGT4f/64+HNMkbK+u1UP0GHhICpdMHefD214/3VKXDFOlo33v4PoDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8cc8cda5f2fa995230c9cc174b90b92eacf5d3f79880a79f88480602e703102","last_reissued_at":"2026-07-05T00:00:23.625637Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:00:23.625637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Effectiveness of Interval Bound Propagation for Training Verifiably Robust Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chongli Qin, Jonathan Uesato, Krishnamurthy Dvijotham, Pushmeet Kohli, Relja Arandjelovic, Robert Stanforth, Rudy Bunel, Sven Gowal, Timothy Mann","submitted_at":"2018-10-30T13:12:47Z","abstract_excerpt":"Recent work has shown that it is possible to train deep neural networks that are provably robust to norm-bounded adversarial perturbations. Most of these methods are based on minimizing an upper bound on the worst-case loss over all possible adversarial perturbations. While these techniques show promise, they often result in difficult optimization procedures that remain hard to scale to larger networks. Through a comprehensive analysis, we show how a simple bounding technique, interval bound propagation (IBP), can be exploited to train large provably robust neural networks that beat the state-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12715","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1810.12715/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.12715","created_at":"2026-07-05T00:00:23.625688+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.12715v4","created_at":"2026-07-05T00:00:23.625688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12715","created_at":"2026-07-05T00:00:23.625688+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DGIZWS7F6UZ","created_at":"2026-07-05T00:00:23.625688+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DGIZWS7F6UZKIYM","created_at":"2026-07-05T00:00:23.625688+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DGIZWS7","created_at":"2026-07-05T00:00:23.625688+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":19,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26446","citing_title":"Input Convex Neural Network as a Surrogate in Stability-Constrained Optimization for IBR-dominated Power Systems","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2606.27215","citing_title":"Vulnerability of Natural Language Classifiers to Evolutionary Generated Adversarial Text","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2606.18454","citing_title":"Veriphi: Attack-Guided Neural Network Verification with Dataset-Dependent Training Methods","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09746","citing_title":"Hybrid Robustness Verification for Spatio-Temporal Neural Networks","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25965","citing_title":"Adversarial Robustness of NTK Neural Networks","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.26577","citing_title":"Bridging Control with Neural Network Verifier alpha-beta-CROWN: A Tutorial","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"1907.07732","citing_title":"Connecting Lyapunov Control Theory to Adversarial Attacks","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2410.03000","citing_title":"Towards Generalized Certified Robustness with Multi-Norm Training","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2411.18235","citing_title":"Certified Training with Branch-and-Bound for Lyapunov-stable Neural Control","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2412.14113","citing_title":"Adversarial Hubness in Multi-Modal Retrieval","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2509.22849","citing_title":"Parameterized Hardness of Zonotope Containment and Neural Network Verification","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17153","citing_title":"Stress-Testing Neural Network Verifiers with Provably Robust Instances","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2506.23964","citing_title":"Making Logic a First-Class Citizen in Generative ML for Networking","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2511.15624","citing_title":"Fast and Certified Bounding of Security-Constrained DCOPF via Interval Bound Propagation","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2603.23878","citing_title":"The Luna Bound Propagator for Formal Analysis of Neural Networks","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08938","citing_title":"Can We Formally Verify Neural PDE Surrogates? SMT Compilation of Small Fourier Neural Operators","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25965","citing_title":"Adversarial Robustness of NTK Neural Networks","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22746","citing_title":"Relaxation-Informed Training of Neural Network Surrogate Models","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09452","citing_title":"SafeAdapt: Provably Safe Policy Updates in Deep Reinforcement Learning","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3DGIZWS7F6UZKIYMTTAXJOILSL","json":"https://pith.science/pith/3DGIZWS7F6UZKIYMTTAXJOILSL.json","graph_json":"https://pith.science/api/pith-number/3DGIZWS7F6UZKIYMTTAXJOILSL/graph.json","events_json":"https://pith.science/api/pith-number/3DGIZWS7F6UZKIYMTTAXJOILSL/events.json","paper":"https://pith.science/paper/3DGIZWS7"},"agent_actions":{"view_html":"https://pith.science/pith/3DGIZWS7F6UZKIYMTTAXJOILSL","download_json":"https://pith.science/pith/3DGIZWS7F6UZKIYMTTAXJOILSL.json","view_paper":"https://pith.science/paper/3DGIZWS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.12715&json=true","fetch_graph":"https://pith.science/api/pith-number/3DGIZWS7F6UZKIYMTTAXJOILSL/graph.json","fetch_events":"https://pith.science/api/pith-number/3DGIZWS7F6UZKIYMTTAXJOILSL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DGIZWS7F6UZKIYMTTAXJOILSL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DGIZWS7F6UZKIYMTTAXJOILSL/action/storage_attestation","attest_author":"https://pith.science/pith/3DGIZWS7F6UZKIYMTTAXJOILSL/action/author_attestation","sign_citation":"https://pith.science/pith/3DGIZWS7F6UZKIYMTTAXJOILSL/action/citation_signature","submit_replication":"https://pith.science/pith/3DGIZWS7F6UZKIYMTTAXJOILSL/action/replication_record"}},"created_at":"2026-07-05T00:00:23.625688+00:00","updated_at":"2026-07-05T00:00:23.625688+00:00"}