{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:PZUX6SBQE5NAJQTMH2TU76JYTM","short_pith_number":"pith:PZUX6SBQ","canonical_record":{"source":{"id":"2306.06223","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-06-09T19:40:53Z","cross_cats_sorted":[],"title_canon_sha256":"7a1429e3f6aa973bd0eae89f26a6cce466dacf22136540eae5b03ddeb9b105ee","abstract_canon_sha256":"c80b06fbcd057183118529b0c8999a0f4a3f3b64a6e2b5b59010b111ab18c929"},"schema_version":"1.0"},"canonical_sha256":"7e697f4830275a04c26c3ea74ff9389b05dce4d407b410542ca33ad97de6799d","source":{"kind":"arxiv","id":"2306.06223","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.06223","created_at":"2026-07-05T11:36:17Z"},{"alias_kind":"arxiv_version","alias_value":"2306.06223v3","created_at":"2026-07-05T11:36:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.06223","created_at":"2026-07-05T11:36:17Z"},{"alias_kind":"pith_short_12","alias_value":"PZUX6SBQE5NA","created_at":"2026-07-05T11:36:17Z"},{"alias_kind":"pith_short_16","alias_value":"PZUX6SBQE5NAJQTM","created_at":"2026-07-05T11:36:17Z"},{"alias_kind":"pith_short_8","alias_value":"PZUX6SBQ","created_at":"2026-07-05T11:36:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:PZUX6SBQE5NAJQTMH2TU76JYTM","target":"record","payload":{"canonical_record":{"source":{"id":"2306.06223","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-06-09T19:40:53Z","cross_cats_sorted":[],"title_canon_sha256":"7a1429e3f6aa973bd0eae89f26a6cce466dacf22136540eae5b03ddeb9b105ee","abstract_canon_sha256":"c80b06fbcd057183118529b0c8999a0f4a3f3b64a6e2b5b59010b111ab18c929"},"schema_version":"1.0"},"canonical_sha256":"7e697f4830275a04c26c3ea74ff9389b05dce4d407b410542ca33ad97de6799d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:17.761107Z","signature_b64":"3WfeeGbERXMeFiJi8i3wnO08NWorIIcW4Cn3USL3dg+yw64bR2iDKcw9XK+h23IKSm9BaFJDbJZ11s/xxDxDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e697f4830275a04c26c3ea74ff9389b05dce4d407b410542ca33ad97de6799d","last_reissued_at":"2026-07-05T11:36:17.760610Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:17.760610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.06223","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-05T11:36:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y5kMKw8Q7BrUvR1zqfxl0wOUjQMeeEm7TAPLIxFF6IzUFcckz8F0LFBudKOIRRG/D/unJIjGCAlk+xFbAHcoDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:51:34.641157Z"},"content_sha256":"02dc12905fd38fb8c716c6e84e2af8cad25d2f935c6927c8967fc5207468c369","schema_version":"1.0","event_id":"sha256:02dc12905fd38fb8c716c6e84e2af8cad25d2f935c6927c8967fc5207468c369"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:PZUX6SBQE5NAJQTMH2TU76JYTM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Robust Optimization Model for Nonlinear Support Vector Machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Spinelli, Francesca Maggioni","submitted_at":"2023-06-09T19:40:53Z","abstract_excerpt":"In this paper, we present new optimization models for Support Vector Machine (SVM), with the aim of separating data points in two or more classes. The classification task is handled by means of nonlinear classifiers induced by kernel functions and consists in two consecutive phases: first, a classical SVM model is solved, followed by a linear search procedure, aimed at minimizing the total number of misclassified data points. To address the problem of data perturbations and protect the model against uncertainty, we construct bounded-by-norm uncertainty sets around each training data and apply "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.06223","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/2306.06223/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-05T11:36:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"agTpx2fFzlQyf8F9BCvFtaqY8HwbtkjxTaIxa01r1LGBi+NC8OWWYUTfM1PwQGt+DeIgLnGA9RAL7eGzYxRrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:51:34.641682Z"},"content_sha256":"4c489879ea5de9184c3dfd2d6d27f8687bf5f50606f4cf5721ff9de90b5a5e5a","schema_version":"1.0","event_id":"sha256:4c489879ea5de9184c3dfd2d6d27f8687bf5f50606f4cf5721ff9de90b5a5e5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PZUX6SBQE5NAJQTMH2TU76JYTM/bundle.json","state_url":"https://pith.science/pith/PZUX6SBQE5NAJQTMH2TU76JYTM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PZUX6SBQE5NAJQTMH2TU76JYTM/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-03T19:51:34Z","links":{"resolver":"https://pith.science/pith/PZUX6SBQE5NAJQTMH2TU76JYTM","bundle":"https://pith.science/pith/PZUX6SBQE5NAJQTMH2TU76JYTM/bundle.json","state":"https://pith.science/pith/PZUX6SBQE5NAJQTMH2TU76JYTM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PZUX6SBQE5NAJQTMH2TU76JYTM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:PZUX6SBQE5NAJQTMH2TU76JYTM","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":"c80b06fbcd057183118529b0c8999a0f4a3f3b64a6e2b5b59010b111ab18c929","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-06-09T19:40:53Z","title_canon_sha256":"7a1429e3f6aa973bd0eae89f26a6cce466dacf22136540eae5b03ddeb9b105ee"},"schema_version":"1.0","source":{"id":"2306.06223","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.06223","created_at":"2026-07-05T11:36:17Z"},{"alias_kind":"arxiv_version","alias_value":"2306.06223v3","created_at":"2026-07-05T11:36:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.06223","created_at":"2026-07-05T11:36:17Z"},{"alias_kind":"pith_short_12","alias_value":"PZUX6SBQE5NA","created_at":"2026-07-05T11:36:17Z"},{"alias_kind":"pith_short_16","alias_value":"PZUX6SBQE5NAJQTM","created_at":"2026-07-05T11:36:17Z"},{"alias_kind":"pith_short_8","alias_value":"PZUX6SBQ","created_at":"2026-07-05T11:36:17Z"}],"graph_snapshots":[{"event_id":"sha256:4c489879ea5de9184c3dfd2d6d27f8687bf5f50606f4cf5721ff9de90b5a5e5a","target":"graph","created_at":"2026-07-05T11:36:17Z","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/2306.06223/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we present new optimization models for Support Vector Machine (SVM), with the aim of separating data points in two or more classes. The classification task is handled by means of nonlinear classifiers induced by kernel functions and consists in two consecutive phases: first, a classical SVM model is solved, followed by a linear search procedure, aimed at minimizing the total number of misclassified data points. To address the problem of data perturbations and protect the model against uncertainty, we construct bounded-by-norm uncertainty sets around each training data and apply ","authors_text":"Andrea Spinelli, Francesca Maggioni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-06-09T19:40:53Z","title":"A Novel Robust Optimization Model for Nonlinear Support Vector Machine"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.06223","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:02dc12905fd38fb8c716c6e84e2af8cad25d2f935c6927c8967fc5207468c369","target":"record","created_at":"2026-07-05T11:36:17Z","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":"c80b06fbcd057183118529b0c8999a0f4a3f3b64a6e2b5b59010b111ab18c929","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-06-09T19:40:53Z","title_canon_sha256":"7a1429e3f6aa973bd0eae89f26a6cce466dacf22136540eae5b03ddeb9b105ee"},"schema_version":"1.0","source":{"id":"2306.06223","kind":"arxiv","version":3}},"canonical_sha256":"7e697f4830275a04c26c3ea74ff9389b05dce4d407b410542ca33ad97de6799d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e697f4830275a04c26c3ea74ff9389b05dce4d407b410542ca33ad97de6799d","first_computed_at":"2026-07-05T11:36:17.760610Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:36:17.760610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3WfeeGbERXMeFiJi8i3wnO08NWorIIcW4Cn3USL3dg+yw64bR2iDKcw9XK+h23IKSm9BaFJDbJZ11s/xxDxDCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:36:17.761107Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.06223","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02dc12905fd38fb8c716c6e84e2af8cad25d2f935c6927c8967fc5207468c369","sha256:4c489879ea5de9184c3dfd2d6d27f8687bf5f50606f4cf5721ff9de90b5a5e5a"],"state_sha256":"fea566126cc15b468f678d510b5e4d30c911c747a99c64bcb4db730f6b058ed8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wCiSwTZn/TWG+ekKxDnTi9MiL7YYzAPCYuVnU9/TslbNIdJ6k0Bjq7e6+7wIurSwvYZ6Zmxph+2Fd8QcmyttDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T19:51:34.647127Z","bundle_sha256":"7001954c2f60e7351da453d9371342e53a598729bc79e2027eceb9027fef1283"}}