{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6RAFSWTRSRXSTFF77HFKLJGOHN","short_pith_number":"pith:6RAFSWTR","schema_version":"1.0","canonical_sha256":"f440595a71946f2994bff9caa5a4ce3b49694257a0e2a6db44500ff6a300e7f4","source":{"kind":"arxiv","id":"1705.07252","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.07252","created_at":"2026-05-18T00:25:01.759014+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07252v4","created_at":"2026-05-18T00:25:01.759014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07252","created_at":"2026-05-18T00:25:01.759014+00:00"},{"alias_kind":"pith_short_12","alias_value":"6RAFSWTRSRXS","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6RAFSWTRSRXSTFF7","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6RAFSWTR","created_at":"2026-05-18T12:31:03.183658+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/6RAFSWTRSRXSTFF77HFKLJGOHN","json":"https://pith.science/pith/6RAFSWTRSRXSTFF77HFKLJGOHN.json","graph_json":"https://pith.science/api/pith-number/6RAFSWTRSRXSTFF77HFKLJGOHN/graph.json","events_json":"https://pith.science/api/pith-number/6RAFSWTRSRXSTFF77HFKLJGOHN/events.json","paper":"https://pith.science/paper/6RAFSWTR"},"agent_actions":{"view_html":"https://pith.science/pith/6RAFSWTRSRXSTFF77HFKLJGOHN","download_json":"https://pith.science/pith/6RAFSWTRSRXSTFF77HFKLJGOHN.json","view_paper":"https://pith.science/paper/6RAFSWTR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07252&json=true","fetch_graph":"https://pith.science/api/pith-number/6RAFSWTRSRXSTFF77HFKLJGOHN/graph.json","fetch_events":"https://pith.science/api/pith-number/6RAFSWTRSRXSTFF77HFKLJGOHN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6RAFSWTRSRXSTFF77HFKLJGOHN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6RAFSWTRSRXSTFF77HFKLJGOHN/action/storage_attestation","attest_author":"https://pith.science/pith/6RAFSWTRSRXSTFF77HFKLJGOHN/action/author_attestation","sign_citation":"https://pith.science/pith/6RAFSWTRSRXSTFF77HFKLJGOHN/action/citation_signature","submit_replication":"https://pith.science/pith/6RAFSWTRSRXSTFF77HFKLJGOHN/action/replication_record"}},"created_at":"2026-05-18T00:25:01.759014+00:00","updated_at":"2026-05-18T00:25:01.759014+00:00"}