{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZSBS7B3XXFLRNS2HWXMG554N4R","short_pith_number":"pith:ZSBS7B3X","canonical_record":{"source":{"id":"1910.08623","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-18T20:55:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"cb8fbbcd0226aa39110662414752518150e738bf685355d044fe1e13edec6740","abstract_canon_sha256":"200dcbe604dd02cc723596c3cfdad94fca8a03d38d82e49b2b15684ad7339b2c"},"schema_version":"1.0"},"canonical_sha256":"cc832f8777b95716cb47b5d86ef78de459c88947c9ae37627043481c79bed615","source":{"kind":"arxiv","id":"1910.08623","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.08623","created_at":"2026-07-05T02:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"1910.08623v3","created_at":"2026-07-05T02:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.08623","created_at":"2026-07-05T02:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"ZSBS7B3XXFLR","created_at":"2026-07-05T02:19:14Z"},{"alias_kind":"pith_short_16","alias_value":"ZSBS7B3XXFLRNS2H","created_at":"2026-07-05T02:19:14Z"},{"alias_kind":"pith_short_8","alias_value":"ZSBS7B3X","created_at":"2026-07-05T02:19:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZSBS7B3XXFLRNS2HWXMG554N4R","target":"record","payload":{"canonical_record":{"source":{"id":"1910.08623","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-18T20:55:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"cb8fbbcd0226aa39110662414752518150e738bf685355d044fe1e13edec6740","abstract_canon_sha256":"200dcbe604dd02cc723596c3cfdad94fca8a03d38d82e49b2b15684ad7339b2c"},"schema_version":"1.0"},"canonical_sha256":"cc832f8777b95716cb47b5d86ef78de459c88947c9ae37627043481c79bed615","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:19:14.461218Z","signature_b64":"SfbXYGItIvFoPNsW98vbnhglfB1YNXHn4eyBAYbbSGb44t3qaVvxsXJHT9BEWmETS/VyPVGnUn2vm12u2R1pCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc832f8777b95716cb47b5d86ef78de459c88947c9ae37627043481c79bed615","last_reissued_at":"2026-07-05T02:19:14.460737Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:19:14.460737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1910.08623","source_version":3,"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:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x8jW1SnTTls7umPTXoaAxH/HfdmstnIh6Gb4gYWACUB6oL2EndFwf62hXxbjcNiFarZPhit6Ozj8zgaJccDGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T07:49:54.582989Z"},"content_sha256":"d6f073195979d72710c27d8f356d3b57bf9dc4a69f46d02b1e010e798397f602","schema_version":"1.0","event_id":"sha256:d6f073195979d72710c27d8f356d3b57bf9dc4a69f46d02b1e010e798397f602"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZSBS7B3XXFLRNS2HWXMG554N4R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast Saddle-Point Dynamical System Approach to Robust Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aditya Balu, Keivan Ebrahimi, Nicola Elia, Soumik Sarkar, Umesh Vaidya, Yasaman Esfandiari","submitted_at":"2019-10-18T20:55:39Z","abstract_excerpt":"Recent focus on robustness to adversarial attacks for deep neural networks produced a large variety of algorithms for training robust models. Most of the effective algorithms involve solving the min-max optimization problem for training robust models (min step) under worst-case attacks (max step). However, they often suffer from high computational cost from running several inner maximization iterations (to find an optimal attack) inside every outer minimization iteration. Therefore, it becomes difficult to readily apply such algorithms for moderate to large size real world data sets. To allevi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.08623","kind":"arxiv","version":3},"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/1910.08623/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:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uEfbXnLN1uUvGCDxwZgrxXV7Q3fU0FJAINU3A8etf1us2vZVt5W4i+JquOXfNInpo3yd5ZZ5fZXoRrUoeB9hAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T07:49:54.583399Z"},"content_sha256":"212c4fb375559b2205eacaecfd3b8f31e03b5b56f87628025af02de75c385eba","schema_version":"1.0","event_id":"sha256:212c4fb375559b2205eacaecfd3b8f31e03b5b56f87628025af02de75c385eba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZSBS7B3XXFLRNS2HWXMG554N4R/bundle.json","state_url":"https://pith.science/pith/ZSBS7B3XXFLRNS2HWXMG554N4R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZSBS7B3XXFLRNS2HWXMG554N4R/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-07-08T07:49:54Z","links":{"resolver":"https://pith.science/pith/ZSBS7B3XXFLRNS2HWXMG554N4R","bundle":"https://pith.science/pith/ZSBS7B3XXFLRNS2HWXMG554N4R/bundle.json","state":"https://pith.science/pith/ZSBS7B3XXFLRNS2HWXMG554N4R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZSBS7B3XXFLRNS2HWXMG554N4R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZSBS7B3XXFLRNS2HWXMG554N4R","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":"200dcbe604dd02cc723596c3cfdad94fca8a03d38d82e49b2b15684ad7339b2c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-18T20:55:39Z","title_canon_sha256":"cb8fbbcd0226aa39110662414752518150e738bf685355d044fe1e13edec6740"},"schema_version":"1.0","source":{"id":"1910.08623","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.08623","created_at":"2026-07-05T02:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"1910.08623v3","created_at":"2026-07-05T02:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.08623","created_at":"2026-07-05T02:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"ZSBS7B3XXFLR","created_at":"2026-07-05T02:19:14Z"},{"alias_kind":"pith_short_16","alias_value":"ZSBS7B3XXFLRNS2H","created_at":"2026-07-05T02:19:14Z"},{"alias_kind":"pith_short_8","alias_value":"ZSBS7B3X","created_at":"2026-07-05T02:19:14Z"}],"graph_snapshots":[{"event_id":"sha256:212c4fb375559b2205eacaecfd3b8f31e03b5b56f87628025af02de75c385eba","target":"graph","created_at":"2026-07-05T02:19:14Z","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/1910.08623/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent focus on robustness to adversarial attacks for deep neural networks produced a large variety of algorithms for training robust models. Most of the effective algorithms involve solving the min-max optimization problem for training robust models (min step) under worst-case attacks (max step). However, they often suffer from high computational cost from running several inner maximization iterations (to find an optimal attack) inside every outer minimization iteration. Therefore, it becomes difficult to readily apply such algorithms for moderate to large size real world data sets. To allevi","authors_text":"Aditya Balu, Keivan Ebrahimi, Nicola Elia, Soumik Sarkar, Umesh Vaidya, Yasaman Esfandiari","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-18T20:55:39Z","title":"A Fast Saddle-Point Dynamical System Approach to Robust Deep Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.08623","kind":"arxiv","version":3},"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:d6f073195979d72710c27d8f356d3b57bf9dc4a69f46d02b1e010e798397f602","target":"record","created_at":"2026-07-05T02:19:14Z","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":"200dcbe604dd02cc723596c3cfdad94fca8a03d38d82e49b2b15684ad7339b2c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-18T20:55:39Z","title_canon_sha256":"cb8fbbcd0226aa39110662414752518150e738bf685355d044fe1e13edec6740"},"schema_version":"1.0","source":{"id":"1910.08623","kind":"arxiv","version":3}},"canonical_sha256":"cc832f8777b95716cb47b5d86ef78de459c88947c9ae37627043481c79bed615","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc832f8777b95716cb47b5d86ef78de459c88947c9ae37627043481c79bed615","first_computed_at":"2026-07-05T02:19:14.460737Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:19:14.460737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SfbXYGItIvFoPNsW98vbnhglfB1YNXHn4eyBAYbbSGb44t3qaVvxsXJHT9BEWmETS/VyPVGnUn2vm12u2R1pCA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:19:14.461218Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.08623","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6f073195979d72710c27d8f356d3b57bf9dc4a69f46d02b1e010e798397f602","sha256:212c4fb375559b2205eacaecfd3b8f31e03b5b56f87628025af02de75c385eba"],"state_sha256":"120818415e590a178016459e71bf2a39ed4b44bb237977aa006961e4919a1bc3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WQ7BeZSz8GkOjiJhXJSqerPT9EH/lWj2jcdi2gfTbCR6BQJFd0mkymWTKznmp73ZO1QgnYQqxexNrZfuCe/EBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T07:49:54.586300Z","bundle_sha256":"64c0deb33e998d34994b8a68fa098c45e978397957ff9af51f5011708705b5b9"}}