{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BC7PYYRN4SJEWUUILO3NPEY2ZZ","short_pith_number":"pith:BC7PYYRN","canonical_record":{"source":{"id":"1904.11803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-26T12:38:11Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e8b390c26b4a16005b023eb8ae3b48a5704ff1a80232a056f25c4e8296277dff","abstract_canon_sha256":"b239e41651c0400f80942f864410dd6dbe3667f2d7ab35eabeac7fb53b0669bc"},"schema_version":"1.0"},"canonical_sha256":"08befc622de4924b52885bb6d7931ace7b4bffd8eb2b79152b598f6e5a1ee34c","source":{"kind":"arxiv","id":"1904.11803","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11803","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11803v1","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11803","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"pith_short_12","alias_value":"BC7PYYRN4SJE","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BC7PYYRN4SJEWUUI","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BC7PYYRN","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BC7PYYRN4SJEWUUILO3NPEY2ZZ","target":"record","payload":{"canonical_record":{"source":{"id":"1904.11803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-26T12:38:11Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e8b390c26b4a16005b023eb8ae3b48a5704ff1a80232a056f25c4e8296277dff","abstract_canon_sha256":"b239e41651c0400f80942f864410dd6dbe3667f2d7ab35eabeac7fb53b0669bc"},"schema_version":"1.0"},"canonical_sha256":"08befc622de4924b52885bb6d7931ace7b4bffd8eb2b79152b598f6e5a1ee34c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:40.893513Z","signature_b64":"2WhS5kmTDWcLCH54L2URrtDZPS57fC0tQxB48o9IwvAuApgltOjTz3+UZ70xRU2FhIr5xZcFLqF+sb1GPEz2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08befc622de4924b52885bb6d7931ace7b4bffd8eb2b79152b598f6e5a1ee34c","last_reissued_at":"2026-05-17T23:47:40.892999Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:40.892999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.11803","source_version":1,"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:47:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dPFq2WhFahZt1EMZ5qLryV2tHNzf8Y8mE4Dss7mQkNuD3AACgQV0CEv97ASxHx63ZmKnHEZ4agZxzj0J4Y7tCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:13:45.160480Z"},"content_sha256":"a3a7cec3915359554e89b867b6e2301720eb8abe6d4f6c911c13e1f05862404b","schema_version":"1.0","event_id":"sha256:a3a7cec3915359554e89b867b6e2301720eb8abe6d4f6c911c13e1f05862404b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BC7PYYRN4SJEWUUILO3NPEY2ZZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robustness Verification of Support Vector Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Francesco Ranzato, Marco Zanella","submitted_at":"2019-04-26T12:38:11Z","abstract_excerpt":"We study the problem of formally verifying the robustness to adversarial examples of support vector machines (SVMs), a major machine learning model for classification and regression tasks. Following a recent stream of works on formal robustness verification of (deep) neural networks, our approach relies on a sound abstract version of a given SVM classifier to be used for checking its robustness. This methodology is parametric on a given numerical abstraction of real values and, analogously to the case of neural networks, needs neither abstract least upper bounds nor widening operators on this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11803","kind":"arxiv","version":1},"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:47:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I8iKxgFO+ajjCDftm3xSgmk8z/3mvxWRaVngBgO/kEUV1tembb6/GEQkUjalJ9N3XQMnIgsimUR5oECB34OcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:13:45.160852Z"},"content_sha256":"a3b523da1694f4f2d299c69f1163735724d27d7b50f64ad150c281cfa5793f42","schema_version":"1.0","event_id":"sha256:a3b523da1694f4f2d299c69f1163735724d27d7b50f64ad150c281cfa5793f42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BC7PYYRN4SJEWUUILO3NPEY2ZZ/bundle.json","state_url":"https://pith.science/pith/BC7PYYRN4SJEWUUILO3NPEY2ZZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BC7PYYRN4SJEWUUILO3NPEY2ZZ/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-05-27T02:13:45Z","links":{"resolver":"https://pith.science/pith/BC7PYYRN4SJEWUUILO3NPEY2ZZ","bundle":"https://pith.science/pith/BC7PYYRN4SJEWUUILO3NPEY2ZZ/bundle.json","state":"https://pith.science/pith/BC7PYYRN4SJEWUUILO3NPEY2ZZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BC7PYYRN4SJEWUUILO3NPEY2ZZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BC7PYYRN4SJEWUUILO3NPEY2ZZ","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":"b239e41651c0400f80942f864410dd6dbe3667f2d7ab35eabeac7fb53b0669bc","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-26T12:38:11Z","title_canon_sha256":"e8b390c26b4a16005b023eb8ae3b48a5704ff1a80232a056f25c4e8296277dff"},"schema_version":"1.0","source":{"id":"1904.11803","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11803","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11803v1","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11803","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"pith_short_12","alias_value":"BC7PYYRN4SJE","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BC7PYYRN4SJEWUUI","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BC7PYYRN","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:a3b523da1694f4f2d299c69f1163735724d27d7b50f64ad150c281cfa5793f42","target":"graph","created_at":"2026-05-17T23:47:40Z","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 study the problem of formally verifying the robustness to adversarial examples of support vector machines (SVMs), a major machine learning model for classification and regression tasks. Following a recent stream of works on formal robustness verification of (deep) neural networks, our approach relies on a sound abstract version of a given SVM classifier to be used for checking its robustness. This methodology is parametric on a given numerical abstraction of real values and, analogously to the case of neural networks, needs neither abstract least upper bounds nor widening operators on this ","authors_text":"Francesco Ranzato, Marco Zanella","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-26T12:38:11Z","title":"Robustness Verification of Support Vector Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11803","kind":"arxiv","version":1},"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:a3a7cec3915359554e89b867b6e2301720eb8abe6d4f6c911c13e1f05862404b","target":"record","created_at":"2026-05-17T23:47:40Z","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":"b239e41651c0400f80942f864410dd6dbe3667f2d7ab35eabeac7fb53b0669bc","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-26T12:38:11Z","title_canon_sha256":"e8b390c26b4a16005b023eb8ae3b48a5704ff1a80232a056f25c4e8296277dff"},"schema_version":"1.0","source":{"id":"1904.11803","kind":"arxiv","version":1}},"canonical_sha256":"08befc622de4924b52885bb6d7931ace7b4bffd8eb2b79152b598f6e5a1ee34c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08befc622de4924b52885bb6d7931ace7b4bffd8eb2b79152b598f6e5a1ee34c","first_computed_at":"2026-05-17T23:47:40.892999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:40.892999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2WhS5kmTDWcLCH54L2URrtDZPS57fC0tQxB48o9IwvAuApgltOjTz3+UZ70xRU2FhIr5xZcFLqF+sb1GPEz2Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:40.893513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.11803","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3a7cec3915359554e89b867b6e2301720eb8abe6d4f6c911c13e1f05862404b","sha256:a3b523da1694f4f2d299c69f1163735724d27d7b50f64ad150c281cfa5793f42"],"state_sha256":"3f22755c1dd4a61930fa88efbc891e6576c94d72f3ba27fdf2efe937669be1bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7/XUat1BUE7cQC/p5593d5rjv/LhN2GWK+3mGjbTzDv2jWZh98teIHgCK0RadBgW+Yr3AeG6g+fOCc6CVB57CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:13:45.163200Z","bundle_sha256":"ed9ab74d3675c30ac91f1503015a05dc8db134b647ea627665481558a021e159"}}