{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TYQQXSDZB2LOMTEIEVHFY5CW5E","short_pith_number":"pith:TYQQXSDZ","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"},"canonical_sha256":"9e210bc8790e96e64c88254e5c7456e9002f0309bb0ff4013bbf2f4274c5b194","source":{"kind":"arxiv","id":"1906.00628","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00628","created_at":"2026-05-17T23:41:36Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00628v2","created_at":"2026-05-17T23:41:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00628","created_at":"2026-05-17T23:41:36Z"},{"alias_kind":"pith_short_12","alias_value":"TYQQXSDZB2LO","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TYQQXSDZB2LOMTEI","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TYQQXSDZ","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TYQQXSDZB2LOMTEIEVHFY5CW5E","target":"record","payload":{"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"},"canonical_sha256":"9e210bc8790e96e64c88254e5c7456e9002f0309bb0ff4013bbf2f4274c5b194","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"},"source_kind":"arxiv","source_id":"1906.00628","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:41:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+expmuhp7n4b8Jy0y0i4OBFBJurUM4UaUjdcxk+tL2VMGkh0JAxC51ul7rYko7r9foMYqSHR1rMB8ee0ZQSTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:57:56.081725Z"},"content_sha256":"9a72562d0172ff76ae4f96d0f394dd5cb3c4c3587c0785d9a77d3b825df8e38d","schema_version":"1.0","event_id":"sha256:9a72562d0172ff76ae4f96d0f394dd5cb3c4c3587c0785d9a77d3b825df8e38d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TYQQXSDZB2LOMTEIEVHFY5CW5E","target":"graph","payload":{"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"},"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:41:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yiugHvbBxLTO7clOYLUwKDtoDuo3kjLJmRvge4NxwZfbOZ2A5vLCGxxIeNWsTDAVZ/NXBcWAoIhiBCOywroZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:57:56.082312Z"},"content_sha256":"b8aafadc554153f118b450345ff7d6f4b83ad07d8ab66335f8e8218b764053e1","schema_version":"1.0","event_id":"sha256:b8aafadc554153f118b450345ff7d6f4b83ad07d8ab66335f8e8218b764053e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TYQQXSDZB2LOMTEIEVHFY5CW5E/bundle.json","state_url":"https://pith.science/pith/TYQQXSDZB2LOMTEIEVHFY5CW5E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TYQQXSDZB2LOMTEIEVHFY5CW5E/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-08T15:57:56Z","links":{"resolver":"https://pith.science/pith/TYQQXSDZB2LOMTEIEVHFY5CW5E","bundle":"https://pith.science/pith/TYQQXSDZB2LOMTEIEVHFY5CW5E/bundle.json","state":"https://pith.science/pith/TYQQXSDZB2LOMTEIEVHFY5CW5E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TYQQXSDZB2LOMTEIEVHFY5CW5E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TYQQXSDZB2LOMTEIEVHFY5CW5E","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":"756e750a9db02b9ef230e89074bde11cf248022bab11dcaecde463b7ddf06d84","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-03T08:25:47Z","title_canon_sha256":"45558926d94365c1ccb3984cc54164156bc60c999988ddfb95d0680e7b0d882d"},"schema_version":"1.0","source":{"id":"1906.00628","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00628","created_at":"2026-05-17T23:41:36Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00628v2","created_at":"2026-05-17T23:41:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00628","created_at":"2026-05-17T23:41:36Z"},{"alias_kind":"pith_short_12","alias_value":"TYQQXSDZB2LO","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TYQQXSDZB2LOMTEI","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TYQQXSDZ","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:b8aafadc554153f118b450345ff7d6f4b83ad07d8ab66335f8e8218b764053e1","target":"graph","created_at":"2026-05-17T23:41:36Z","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":"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","authors_text":"Jacek Tabor, Marek \\'Smieja, Pawe{\\l} Morawiecki, Przemys{\\l}aw Spurek","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-03T08:25:47Z","title":"Fast and Stable Interval Bounds Propagation for Training Verifiably Robust Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00628","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:9a72562d0172ff76ae4f96d0f394dd5cb3c4c3587c0785d9a77d3b825df8e38d","target":"record","created_at":"2026-05-17T23:41:36Z","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":"756e750a9db02b9ef230e89074bde11cf248022bab11dcaecde463b7ddf06d84","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-03T08:25:47Z","title_canon_sha256":"45558926d94365c1ccb3984cc54164156bc60c999988ddfb95d0680e7b0d882d"},"schema_version":"1.0","source":{"id":"1906.00628","kind":"arxiv","version":2}},"canonical_sha256":"9e210bc8790e96e64c88254e5c7456e9002f0309bb0ff4013bbf2f4274c5b194","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e210bc8790e96e64c88254e5c7456e9002f0309bb0ff4013bbf2f4274c5b194","first_computed_at":"2026-05-17T23:41:36.253589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:36.253589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W8mIGh/HtnOPVrSU+bmUL/qLK29CEFHD0GfDL52+0MVLuVR1sO4ra1EBhVOYXpJFBNvcVcg6KXo4B0jqxFW0BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:36.254246Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.00628","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a72562d0172ff76ae4f96d0f394dd5cb3c4c3587c0785d9a77d3b825df8e38d","sha256:b8aafadc554153f118b450345ff7d6f4b83ad07d8ab66335f8e8218b764053e1"],"state_sha256":"2a13f5e6c29b0a295e9b791deb5addf9ff52f85d3ea4cf0325788d0cd61aff28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eOgorEUVqsnIW3i6dDOBDsKkr0In3vkN7DuCqi4qIHnYkSTdBfudqmFnkPAWKEpVxQGxorzWvN+etGLX5hOFCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T15:57:56.086443Z","bundle_sha256":"fb62b6fda7dcff1a8432734890c57be95d34033a1a556df085a9c258deec16b6"}}