{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BC7PYYRN4SJEWUUILO3NPEY2ZZ","short_pith_number":"pith:BC7PYYRN","schema_version":"1.0","canonical_sha256":"08befc622de4924b52885bb6d7931ace7b4bffd8eb2b79152b598f6e5a1ee34c","source":{"kind":"arxiv","id":"1904.11803","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.11803","created_at":"2026-05-17T23:47:40.893064+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.11803v1","created_at":"2026-05-17T23:47:40.893064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11803","created_at":"2026-05-17T23:47:40.893064+00:00"},{"alias_kind":"pith_short_12","alias_value":"BC7PYYRN4SJE","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BC7PYYRN4SJEWUUI","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BC7PYYRN","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BC7PYYRN4SJEWUUILO3NPEY2ZZ","json":"https://pith.science/pith/BC7PYYRN4SJEWUUILO3NPEY2ZZ.json","graph_json":"https://pith.science/api/pith-number/BC7PYYRN4SJEWUUILO3NPEY2ZZ/graph.json","events_json":"https://pith.science/api/pith-number/BC7PYYRN4SJEWUUILO3NPEY2ZZ/events.json","paper":"https://pith.science/paper/BC7PYYRN"},"agent_actions":{"view_html":"https://pith.science/pith/BC7PYYRN4SJEWUUILO3NPEY2ZZ","download_json":"https://pith.science/pith/BC7PYYRN4SJEWUUILO3NPEY2ZZ.json","view_paper":"https://pith.science/paper/BC7PYYRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.11803&json=true","fetch_graph":"https://pith.science/api/pith-number/BC7PYYRN4SJEWUUILO3NPEY2ZZ/graph.json","fetch_events":"https://pith.science/api/pith-number/BC7PYYRN4SJEWUUILO3NPEY2ZZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BC7PYYRN4SJEWUUILO3NPEY2ZZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BC7PYYRN4SJEWUUILO3NPEY2ZZ/action/storage_attestation","attest_author":"https://pith.science/pith/BC7PYYRN4SJEWUUILO3NPEY2ZZ/action/author_attestation","sign_citation":"https://pith.science/pith/BC7PYYRN4SJEWUUILO3NPEY2ZZ/action/citation_signature","submit_replication":"https://pith.science/pith/BC7PYYRN4SJEWUUILO3NPEY2ZZ/action/replication_record"}},"created_at":"2026-05-17T23:47:40.893064+00:00","updated_at":"2026-05-17T23:47:40.893064+00:00"}