{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZD4RVKBYVHPFR6NMYKJL5WZOYG","short_pith_number":"pith:ZD4RVKBY","schema_version":"1.0","canonical_sha256":"c8f91aa838a9de58f9acc292bedb2ec1b668a0e81bc26f4e1902273464e9088e","source":{"kind":"arxiv","id":"2307.07735","version":3},"attestation_state":"computed","paper":{"title":"Faster Algorithms for Structured Linear and Kernel Support Vector Machines","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Lichen Zhang, Yuzhou Gu, Zhao Song","submitted_at":"2023-07-15T07:19:29Z","abstract_excerpt":"Quadratic programming is a ubiquitous prototype in convex programming. Many machine learning problems can be formulated as quadratic programming, including the famous Support Vector Machines (SVMs). Linear and kernel SVMs have been among the most popular models in machine learning over the past three decades, prior to the deep learning era.\n  Generally, a quadratic program has an input size of $\\Theta(n^2)$, where $n$ is the number of variables. Assuming the Strong Exponential Time Hypothesis ($\\textsf{SETH}$), it is known that no $O(n^{2-o(1)})$ time algorithm exists when the quadratic object"},"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":"2307.07735","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2023-07-15T07:19:29Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"f446bda88c807cd3d2367c69be68c394a02f01537b16af9924321d1af28eceb2","abstract_canon_sha256":"e7e961810523c1364e5790e4c207e04974b3df47ae690e41674aba325a48f368"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:12:56.126791Z","signature_b64":"azMOqv8pJzk57mqe6jo9LPAa1k0aLadKzTMuPR8nvEWJK89cfvJ6R6Tp+z4/SYRcIIUAzeGoHhsQvVbCgV0YDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8f91aa838a9de58f9acc292bedb2ec1b668a0e81bc26f4e1902273464e9088e","last_reissued_at":"2026-07-05T10:12:56.126310Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:12:56.126310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Algorithms for Structured Linear and Kernel Support Vector Machines","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Lichen Zhang, Yuzhou Gu, Zhao Song","submitted_at":"2023-07-15T07:19:29Z","abstract_excerpt":"Quadratic programming is a ubiquitous prototype in convex programming. Many machine learning problems can be formulated as quadratic programming, including the famous Support Vector Machines (SVMs). Linear and kernel SVMs have been among the most popular models in machine learning over the past three decades, prior to the deep learning era.\n  Generally, a quadratic program has an input size of $\\Theta(n^2)$, where $n$ is the number of variables. Assuming the Strong Exponential Time Hypothesis ($\\textsf{SETH}$), it is known that no $O(n^{2-o(1)})$ time algorithm exists when the quadratic object"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.07735","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/2307.07735/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2307.07735","created_at":"2026-07-05T10:12:56.126380+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.07735v3","created_at":"2026-07-05T10:12:56.126380+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.07735","created_at":"2026-07-05T10:12:56.126380+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZD4RVKBYVHPF","created_at":"2026-07-05T10:12:56.126380+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZD4RVKBYVHPFR6NM","created_at":"2026-07-05T10:12:56.126380+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZD4RVKBY","created_at":"2026-07-05T10:12:56.126380+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2306.14048","citing_title":"H$_2$O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models","ref_index":141,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZD4RVKBYVHPFR6NMYKJL5WZOYG","json":"https://pith.science/pith/ZD4RVKBYVHPFR6NMYKJL5WZOYG.json","graph_json":"https://pith.science/api/pith-number/ZD4RVKBYVHPFR6NMYKJL5WZOYG/graph.json","events_json":"https://pith.science/api/pith-number/ZD4RVKBYVHPFR6NMYKJL5WZOYG/events.json","paper":"https://pith.science/paper/ZD4RVKBY"},"agent_actions":{"view_html":"https://pith.science/pith/ZD4RVKBYVHPFR6NMYKJL5WZOYG","download_json":"https://pith.science/pith/ZD4RVKBYVHPFR6NMYKJL5WZOYG.json","view_paper":"https://pith.science/paper/ZD4RVKBY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.07735&json=true","fetch_graph":"https://pith.science/api/pith-number/ZD4RVKBYVHPFR6NMYKJL5WZOYG/graph.json","fetch_events":"https://pith.science/api/pith-number/ZD4RVKBYVHPFR6NMYKJL5WZOYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZD4RVKBYVHPFR6NMYKJL5WZOYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZD4RVKBYVHPFR6NMYKJL5WZOYG/action/storage_attestation","attest_author":"https://pith.science/pith/ZD4RVKBYVHPFR6NMYKJL5WZOYG/action/author_attestation","sign_citation":"https://pith.science/pith/ZD4RVKBYVHPFR6NMYKJL5WZOYG/action/citation_signature","submit_replication":"https://pith.science/pith/ZD4RVKBYVHPFR6NMYKJL5WZOYG/action/replication_record"}},"created_at":"2026-07-05T10:12:56.126380+00:00","updated_at":"2026-07-05T10:12:56.126380+00:00"}