{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:G4UEIQIFUSKE2MCEAW6CGDSRFI","short_pith_number":"pith:G4UEIQIF","schema_version":"1.0","canonical_sha256":"3728444105a4944d304405bc230e512a3bae56a06aab0f801e36877017789133","source":{"kind":"arxiv","id":"1406.0167","version":3},"attestation_state":"computed","paper":{"title":"Feature Selection for Linear SVM with Provable Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Malik Magdon-Ismail, Petros Drineas, Saurabh Paul","submitted_at":"2014-06-01T14:37:54Z","abstract_excerpt":"We give two provably accurate feature-selection techniques for the linear SVM. The algorithms run in deterministic and randomized time respectively. Our algorithms can be used in an unsupervised or supervised setting. The supervised approach is based on sampling features from support vectors. We prove that the margin in the feature space is preserved to within $\\epsilon$-relative error of the margin in the full feature space in the worst-case. In the unsupervised setting, we also provide worst-case guarantees of the radius of the minimum enclosing ball, thereby ensuring comparable generalizati"},"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":"1406.0167","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-01T14:37:54Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5e67f00ca098e3205abdc73875ae48ea304f718fc4b00151d90b3f8e99144102","abstract_canon_sha256":"8273e3246552f83d4f243d753a7526d07c8f6083dd45d02bac643b081be3d4db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:51.123308Z","signature_b64":"rRbg4K58RZa80aCh01dvPP2Wt6xx1PrBMm4jmnSm6W7R2ZcFkbI5jPDkM4gLoS2aYBtWSAUKnNMJVtQiQ+v0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3728444105a4944d304405bc230e512a3bae56a06aab0f801e36877017789133","last_reissued_at":"2026-05-18T02:27:51.122847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:51.122847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feature Selection for Linear SVM with Provable Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Malik Magdon-Ismail, Petros Drineas, Saurabh Paul","submitted_at":"2014-06-01T14:37:54Z","abstract_excerpt":"We give two provably accurate feature-selection techniques for the linear SVM. The algorithms run in deterministic and randomized time respectively. Our algorithms can be used in an unsupervised or supervised setting. The supervised approach is based on sampling features from support vectors. We prove that the margin in the feature space is preserved to within $\\epsilon$-relative error of the margin in the full feature space in the worst-case. In the unsupervised setting, we also provide worst-case guarantees of the radius of the minimum enclosing ball, thereby ensuring comparable generalizati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0167","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":""},"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":"1406.0167","created_at":"2026-05-18T02:27:51.122929+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.0167v3","created_at":"2026-05-18T02:27:51.122929+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0167","created_at":"2026-05-18T02:27:51.122929+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4UEIQIFUSKE","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4UEIQIFUSKE2MCE","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4UEIQIF","created_at":"2026-05-18T12:28:28.263976+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/G4UEIQIFUSKE2MCEAW6CGDSRFI","json":"https://pith.science/pith/G4UEIQIFUSKE2MCEAW6CGDSRFI.json","graph_json":"https://pith.science/api/pith-number/G4UEIQIFUSKE2MCEAW6CGDSRFI/graph.json","events_json":"https://pith.science/api/pith-number/G4UEIQIFUSKE2MCEAW6CGDSRFI/events.json","paper":"https://pith.science/paper/G4UEIQIF"},"agent_actions":{"view_html":"https://pith.science/pith/G4UEIQIFUSKE2MCEAW6CGDSRFI","download_json":"https://pith.science/pith/G4UEIQIFUSKE2MCEAW6CGDSRFI.json","view_paper":"https://pith.science/paper/G4UEIQIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.0167&json=true","fetch_graph":"https://pith.science/api/pith-number/G4UEIQIFUSKE2MCEAW6CGDSRFI/graph.json","fetch_events":"https://pith.science/api/pith-number/G4UEIQIFUSKE2MCEAW6CGDSRFI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4UEIQIFUSKE2MCEAW6CGDSRFI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4UEIQIFUSKE2MCEAW6CGDSRFI/action/storage_attestation","attest_author":"https://pith.science/pith/G4UEIQIFUSKE2MCEAW6CGDSRFI/action/author_attestation","sign_citation":"https://pith.science/pith/G4UEIQIFUSKE2MCEAW6CGDSRFI/action/citation_signature","submit_replication":"https://pith.science/pith/G4UEIQIFUSKE2MCEAW6CGDSRFI/action/replication_record"}},"created_at":"2026-05-18T02:27:51.122929+00:00","updated_at":"2026-05-18T02:27:51.122929+00:00"}