{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6RAFSWTRSRXSTFF77HFKLJGOHN","short_pith_number":"pith:6RAFSWTR","canonical_record":{"source":{"id":"1705.07252","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-20T03:06:13Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"bc30ea5acc842a26612791f11472ae707651a6732b13c69a1af1d6c25d4134ac","abstract_canon_sha256":"62c69c52a0e28dd269c401160b0924ea2c5441c33244ed13c37e28f1370e315b"},"schema_version":"1.0"},"canonical_sha256":"f440595a71946f2994bff9caa5a4ce3b49694257a0e2a6db44500ff6a300e7f4","source":{"kind":"arxiv","id":"1705.07252","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07252","created_at":"2026-05-18T00:25:01Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07252v4","created_at":"2026-05-18T00:25:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07252","created_at":"2026-05-18T00:25:01Z"},{"alias_kind":"pith_short_12","alias_value":"6RAFSWTRSRXS","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6RAFSWTRSRXSTFF7","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6RAFSWTR","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6RAFSWTRSRXSTFF77HFKLJGOHN","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07252","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-20T03:06:13Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"bc30ea5acc842a26612791f11472ae707651a6732b13c69a1af1d6c25d4134ac","abstract_canon_sha256":"62c69c52a0e28dd269c401160b0924ea2c5441c33244ed13c37e28f1370e315b"},"schema_version":"1.0"},"canonical_sha256":"f440595a71946f2994bff9caa5a4ce3b49694257a0e2a6db44500ff6a300e7f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:01.759401Z","signature_b64":"7abVJdOk2vYkVVexDN25cd5zB98+Edhs2Qd8GFZ01Hny+TZ8QTw0x9E3oL/oVN5r7f3xL9AdYYwRcVlbc+xbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f440595a71946f2994bff9caa5a4ce3b49694257a0e2a6db44500ff6a300e7f4","last_reissued_at":"2026-05-18T00:25:01.758942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:01.758942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07252","source_version":4,"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-18T00:25:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"91guF9dCtecX2/FHi8f/IRhlyODfHNt0spaUq0P3zSxZZ9jQYZB/FXZU6nrbEFIqQg0sCO/0y0QUiDUOxCd0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:55:14.532505Z"},"content_sha256":"366ef5df7e8abefe37f30aae14803656be45ea6b1b9e76d1aaccbccab094d4ef","schema_version":"1.0","event_id":"sha256:366ef5df7e8abefe37f30aae14803656be45ea6b1b9e76d1aaccbccab094d4ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6RAFSWTRSRXSTFF77HFKLJGOHN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SVM via Saddle Point Optimization: New Bounds and Distributed Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.LG","authors_text":"Jian Li, Lingxiao Huang, Yifei Jin","submitted_at":"2017-05-20T03:06:13Z","abstract_excerpt":"We study two important SVM variants: hard-margin SVM (for linearly separable cases) and $\\nu$-SVM (for linearly non-separable cases). We propose new algorithms from the perspective of saddle point optimization. Our algorithms achieve $(1-\\epsilon)$-approximations with running time $\\tilde{O}(nd+n\\sqrt{d / \\epsilon})$ for both variants, where $n$ is the number of points and $d$ is the dimensionality. To the best of our knowledge, the current best algorithm for $\\nu$-SVM is based on quadratic programming approach which requires $\\Omega(n^2 d)$ time in worst case~\\cite{joachims1998making,platt199"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07252","kind":"arxiv","version":4},"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-18T00:25:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ksW0F5qGC/rDcxrm+qoUqabShVt77f31yqgBtGCKSlmlrZbfSgevEyDVHUppkPPeCPgYBxYnN8GPJK+nLy9DCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:55:14.533189Z"},"content_sha256":"662122c17263a16a388d11499fb86f1c0137cf9f95f076fdfac232ae9c97eff0","schema_version":"1.0","event_id":"sha256:662122c17263a16a388d11499fb86f1c0137cf9f95f076fdfac232ae9c97eff0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6RAFSWTRSRXSTFF77HFKLJGOHN/bundle.json","state_url":"https://pith.science/pith/6RAFSWTRSRXSTFF77HFKLJGOHN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6RAFSWTRSRXSTFF77HFKLJGOHN/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-06-06T20:55:14Z","links":{"resolver":"https://pith.science/pith/6RAFSWTRSRXSTFF77HFKLJGOHN","bundle":"https://pith.science/pith/6RAFSWTRSRXSTFF77HFKLJGOHN/bundle.json","state":"https://pith.science/pith/6RAFSWTRSRXSTFF77HFKLJGOHN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6RAFSWTRSRXSTFF77HFKLJGOHN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6RAFSWTRSRXSTFF77HFKLJGOHN","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":"62c69c52a0e28dd269c401160b0924ea2c5441c33244ed13c37e28f1370e315b","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-20T03:06:13Z","title_canon_sha256":"bc30ea5acc842a26612791f11472ae707651a6732b13c69a1af1d6c25d4134ac"},"schema_version":"1.0","source":{"id":"1705.07252","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07252","created_at":"2026-05-18T00:25:01Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07252v4","created_at":"2026-05-18T00:25:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07252","created_at":"2026-05-18T00:25:01Z"},{"alias_kind":"pith_short_12","alias_value":"6RAFSWTRSRXS","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6RAFSWTRSRXSTFF7","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6RAFSWTR","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:662122c17263a16a388d11499fb86f1c0137cf9f95f076fdfac232ae9c97eff0","target":"graph","created_at":"2026-05-18T00:25:01Z","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 two important SVM variants: hard-margin SVM (for linearly separable cases) and $\\nu$-SVM (for linearly non-separable cases). We propose new algorithms from the perspective of saddle point optimization. Our algorithms achieve $(1-\\epsilon)$-approximations with running time $\\tilde{O}(nd+n\\sqrt{d / \\epsilon})$ for both variants, where $n$ is the number of points and $d$ is the dimensionality. To the best of our knowledge, the current best algorithm for $\\nu$-SVM is based on quadratic programming approach which requires $\\Omega(n^2 d)$ time in worst case~\\cite{joachims1998making,platt199","authors_text":"Jian Li, Lingxiao Huang, Yifei Jin","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-20T03:06:13Z","title":"SVM via Saddle Point Optimization: New Bounds and Distributed Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07252","kind":"arxiv","version":4},"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:366ef5df7e8abefe37f30aae14803656be45ea6b1b9e76d1aaccbccab094d4ef","target":"record","created_at":"2026-05-18T00:25:01Z","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":"62c69c52a0e28dd269c401160b0924ea2c5441c33244ed13c37e28f1370e315b","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-20T03:06:13Z","title_canon_sha256":"bc30ea5acc842a26612791f11472ae707651a6732b13c69a1af1d6c25d4134ac"},"schema_version":"1.0","source":{"id":"1705.07252","kind":"arxiv","version":4}},"canonical_sha256":"f440595a71946f2994bff9caa5a4ce3b49694257a0e2a6db44500ff6a300e7f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f440595a71946f2994bff9caa5a4ce3b49694257a0e2a6db44500ff6a300e7f4","first_computed_at":"2026-05-18T00:25:01.758942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:01.758942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7abVJdOk2vYkVVexDN25cd5zB98+Edhs2Qd8GFZ01Hny+TZ8QTw0x9E3oL/oVN5r7f3xL9AdYYwRcVlbc+xbCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:01.759401Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07252","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:366ef5df7e8abefe37f30aae14803656be45ea6b1b9e76d1aaccbccab094d4ef","sha256:662122c17263a16a388d11499fb86f1c0137cf9f95f076fdfac232ae9c97eff0"],"state_sha256":"3845fa826c1da000cecf984084b2c13eaed20b3830ccef6d7f968172ad011c62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9hgGzA8or8eUaj0E94uqJrycJbzshRObUFEiAPunLeT1tZ/u504cSVvOheKI9Q/suVVFpTqHaMZ/m/E1kOeXBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:55:14.536616Z","bundle_sha256":"eb8f7e1c39948f61add62556cefd4aa384f05cf092c804854deb13554e40c51a"}}