{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TYQQXSDZB2LOMTEIEVHFY5CW5E","short_pith_number":"pith:TYQQXSDZ","schema_version":"1.0","canonical_sha256":"9e210bc8790e96e64c88254e5c7456e9002f0309bb0ff4013bbf2f4274c5b194","source":{"kind":"arxiv","id":"1906.00628","version":2},"attestation_state":"computed","paper":{"title":"Fast and Stable Interval Bounds Propagation for Training Verifiably Robust Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jacek Tabor, Marek \\'Smieja, Pawe{\\l} Morawiecki, Przemys{\\l}aw Spurek","submitted_at":"2019-06-03T08:25:47Z","abstract_excerpt":"We present an efficient technique, which allows to train classification networks which are verifiably robust against norm-bounded adversarial attacks. This framework is built upon the work of Gowal et al., who applies the interval arithmetic to bound the activations at each layer and keeps the prediction invariant to the input perturbation. While that method is faster than competitive approaches, it requires careful tuning of hyper-parameters and a large number of epochs to converge. To speed up and stabilize training, we supply the cost function with an additional term, which encourages the m"},"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":"1906.00628","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-03T08:25:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"45558926d94365c1ccb3984cc54164156bc60c999988ddfb95d0680e7b0d882d","abstract_canon_sha256":"756e750a9db02b9ef230e89074bde11cf248022bab11dcaecde463b7ddf06d84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:36.254246Z","signature_b64":"W8mIGh/HtnOPVrSU+bmUL/qLK29CEFHD0GfDL52+0MVLuVR1sO4ra1EBhVOYXpJFBNvcVcg6KXo4B0jqxFW0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e210bc8790e96e64c88254e5c7456e9002f0309bb0ff4013bbf2f4274c5b194","last_reissued_at":"2026-05-17T23:41:36.253589Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:36.253589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Stable Interval Bounds Propagation for Training Verifiably Robust Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jacek Tabor, Marek \\'Smieja, Pawe{\\l} Morawiecki, Przemys{\\l}aw Spurek","submitted_at":"2019-06-03T08:25:47Z","abstract_excerpt":"We present an efficient technique, which allows to train classification networks which are verifiably robust against norm-bounded adversarial attacks. This framework is built upon the work of Gowal et al., who applies the interval arithmetic to bound the activations at each layer and keeps the prediction invariant to the input perturbation. While that method is faster than competitive approaches, it requires careful tuning of hyper-parameters and a large number of epochs to converge. To speed up and stabilize training, we supply the cost function with an additional term, which encourages the m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00628","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.00628","created_at":"2026-05-17T23:41:36.253694+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00628v2","created_at":"2026-05-17T23:41:36.253694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00628","created_at":"2026-05-17T23:41:36.253694+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYQQXSDZB2LO","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYQQXSDZB2LOMTEI","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYQQXSDZ","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08255","citing_title":"SHIELD: Secure Hypernetworks for Incremental Expansion Learning Defense","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TYQQXSDZB2LOMTEIEVHFY5CW5E","json":"https://pith.science/pith/TYQQXSDZB2LOMTEIEVHFY5CW5E.json","graph_json":"https://pith.science/api/pith-number/TYQQXSDZB2LOMTEIEVHFY5CW5E/graph.json","events_json":"https://pith.science/api/pith-number/TYQQXSDZB2LOMTEIEVHFY5CW5E/events.json","paper":"https://pith.science/paper/TYQQXSDZ"},"agent_actions":{"view_html":"https://pith.science/pith/TYQQXSDZB2LOMTEIEVHFY5CW5E","download_json":"https://pith.science/pith/TYQQXSDZB2LOMTEIEVHFY5CW5E.json","view_paper":"https://pith.science/paper/TYQQXSDZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00628&json=true","fetch_graph":"https://pith.science/api/pith-number/TYQQXSDZB2LOMTEIEVHFY5CW5E/graph.json","fetch_events":"https://pith.science/api/pith-number/TYQQXSDZB2LOMTEIEVHFY5CW5E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYQQXSDZB2LOMTEIEVHFY5CW5E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYQQXSDZB2LOMTEIEVHFY5CW5E/action/storage_attestation","attest_author":"https://pith.science/pith/TYQQXSDZB2LOMTEIEVHFY5CW5E/action/author_attestation","sign_citation":"https://pith.science/pith/TYQQXSDZB2LOMTEIEVHFY5CW5E/action/citation_signature","submit_replication":"https://pith.science/pith/TYQQXSDZB2LOMTEIEVHFY5CW5E/action/replication_record"}},"created_at":"2026-05-17T23:41:36.253694+00:00","updated_at":"2026-05-17T23:41:36.253694+00:00"}