{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VQCGFO62DU7LL7L4NJX63ZFRHI","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":"ff3bcc37dc484cf5ec03e4cd36a4898545778c0e240edfa0a0e2b7bf5bdfe531","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-03T11:41:42Z","title_canon_sha256":"8a1746f279105fe0318a11387965275d79aad3b8c97b891c9e6b0746a7c8a759"},"schema_version":"1.0","source":{"id":"2607.03232","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.03232","created_at":"2026-07-07T01:16:47Z"},{"alias_kind":"arxiv_version","alias_value":"2607.03232v1","created_at":"2026-07-07T01:16:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.03232","created_at":"2026-07-07T01:16:47Z"},{"alias_kind":"pith_short_12","alias_value":"VQCGFO62DU7L","created_at":"2026-07-07T01:16:47Z"},{"alias_kind":"pith_short_16","alias_value":"VQCGFO62DU7LL7L4","created_at":"2026-07-07T01:16:47Z"},{"alias_kind":"pith_short_8","alias_value":"VQCGFO62","created_at":"2026-07-07T01:16:47Z"}],"graph_snapshots":[{"event_id":"sha256:5d9c5682ab9fd5c5dcb901921cf5fa4af6f2558af804a437d4d9b655661d72e7","target":"graph","created_at":"2026-07-07T01:16:47Z","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/2607.03232/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a new quadratic model for the certification problem in adversarial robustness, which simultaneously accounts for all possible target classes. Building on this model, we propose a novel semidefinite programming (SDP) relaxation for incomplete verification. A key advantage of our approach is that it certifies robustness in a single optimization, avoiding the need for a separate resolution per class. This yields a significant computational speed-up and enables scalability to large datasets with many classes. To further improve efficiency, we also propose an effective pruning strategy o","authors_text":"Am\\'elie Lambert (CEDRIC - OC), Cl\\'ement Rambour (ISIR), Margot Boyer (CEDRIC - OC), Zacharie Al\\`es (UMA)","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-03T11:41:42Z","title":"Fast SDP certification of neural networks : towards large multi-class datasets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.03232","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:49985206b672acfa8dd285a59404a6f3ee16dad51705ca1d89e87a0697fc1d33","target":"record","created_at":"2026-07-07T01:16:47Z","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":"ff3bcc37dc484cf5ec03e4cd36a4898545778c0e240edfa0a0e2b7bf5bdfe531","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-03T11:41:42Z","title_canon_sha256":"8a1746f279105fe0318a11387965275d79aad3b8c97b891c9e6b0746a7c8a759"},"schema_version":"1.0","source":{"id":"2607.03232","kind":"arxiv","version":1}},"canonical_sha256":"ac0462bbda1d3eb5fd7c6a6fede4b13a27d797a9aae613ad1289e3e5f519e721","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac0462bbda1d3eb5fd7c6a6fede4b13a27d797a9aae613ad1289e3e5f519e721","first_computed_at":"2026-07-07T01:16:47.408836Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T01:16:47.408836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"po4zNEDD27u/T0nKKkJjAqN6qw3Xu5zNOztc3JsiYdEtLYMqaj8WtYM20Q4na/LO9qjc37ERO4d42rfbutPhDQ==","signature_status":"signed_v1","signed_at":"2026-07-07T01:16:47.409454Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.03232","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49985206b672acfa8dd285a59404a6f3ee16dad51705ca1d89e87a0697fc1d33","sha256:5d9c5682ab9fd5c5dcb901921cf5fa4af6f2558af804a437d4d9b655661d72e7"],"state_sha256":"71e51e2554c2c2b243fe5228cbbc5048cce1e184a3162697fd0b964c3addcfbe"}