{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KKS3MYI5VPLBAKOAT57Y4IVRDB","short_pith_number":"pith:KKS3MYI5","schema_version":"1.0","canonical_sha256":"52a5b6611dabd61029c09f7f8e22b1186a37c0d0dafd662fbb0fae060ce23540","source":{"kind":"arxiv","id":"1607.06996","version":6},"attestation_state":"computed","paper":{"title":"Scaling Up Sparse Support Vector Machines by Simultaneous Feature and Sample Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Bin Hong, Deng Cai, Jieping Ye, Jie Wang, Wei Liu, Weizhong Zhang, Xiaofei He","submitted_at":"2016-07-24T04:00:30Z","abstract_excerpt":"Sparse support vector machine (SVM) is a popular classification technique that can simultaneously learn a small set of the most interpretable features and identify the support vectors. It has achieved great successes in many real-world applications. However, for large-scale problems involving a huge number of samples and ultra-high dimensional features, solving sparse SVMs remains challenging. By noting that sparse SVMs induce sparsities in both feature and sample spaces, we propose a novel approach, which is based on accurate estimations of the primal and dual optima of sparse SVMs, to simult"},"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":"1607.06996","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-24T04:00:30Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"eb6829bddfec577e686933a86ca3ac5919559b7d1489fd8bf76f5b9ddf63ade9","abstract_canon_sha256":"ffcb8d772d56fda57cdddb57b41a04054adce3b1853ed7376493afcb2ce5b695"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:21.134823Z","signature_b64":"VFO/zENOUgQcPJcICM2mgWrTuQYhtGJ/pK0CLE3mvZECHX5ERpy8fq82cTg3DkQR3Ns9YnU1IGmF359nbNwaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52a5b6611dabd61029c09f7f8e22b1186a37c0d0dafd662fbb0fae060ce23540","last_reissued_at":"2026-05-17T23:40:21.134187Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:21.134187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling Up Sparse Support Vector Machines by Simultaneous Feature and Sample Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Bin Hong, Deng Cai, Jieping Ye, Jie Wang, Wei Liu, Weizhong Zhang, Xiaofei He","submitted_at":"2016-07-24T04:00:30Z","abstract_excerpt":"Sparse support vector machine (SVM) is a popular classification technique that can simultaneously learn a small set of the most interpretable features and identify the support vectors. It has achieved great successes in many real-world applications. However, for large-scale problems involving a huge number of samples and ultra-high dimensional features, solving sparse SVMs remains challenging. By noting that sparse SVMs induce sparsities in both feature and sample spaces, we propose a novel approach, which is based on accurate estimations of the primal and dual optima of sparse SVMs, to simult"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06996","kind":"arxiv","version":6},"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":"1607.06996","created_at":"2026-05-17T23:40:21.134269+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.06996v6","created_at":"2026-05-17T23:40:21.134269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06996","created_at":"2026-05-17T23:40:21.134269+00:00"},{"alias_kind":"pith_short_12","alias_value":"KKS3MYI5VPLB","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KKS3MYI5VPLBAKOA","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KKS3MYI5","created_at":"2026-05-18T12:30:25.849896+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/KKS3MYI5VPLBAKOAT57Y4IVRDB","json":"https://pith.science/pith/KKS3MYI5VPLBAKOAT57Y4IVRDB.json","graph_json":"https://pith.science/api/pith-number/KKS3MYI5VPLBAKOAT57Y4IVRDB/graph.json","events_json":"https://pith.science/api/pith-number/KKS3MYI5VPLBAKOAT57Y4IVRDB/events.json","paper":"https://pith.science/paper/KKS3MYI5"},"agent_actions":{"view_html":"https://pith.science/pith/KKS3MYI5VPLBAKOAT57Y4IVRDB","download_json":"https://pith.science/pith/KKS3MYI5VPLBAKOAT57Y4IVRDB.json","view_paper":"https://pith.science/paper/KKS3MYI5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.06996&json=true","fetch_graph":"https://pith.science/api/pith-number/KKS3MYI5VPLBAKOAT57Y4IVRDB/graph.json","fetch_events":"https://pith.science/api/pith-number/KKS3MYI5VPLBAKOAT57Y4IVRDB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KKS3MYI5VPLBAKOAT57Y4IVRDB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KKS3MYI5VPLBAKOAT57Y4IVRDB/action/storage_attestation","attest_author":"https://pith.science/pith/KKS3MYI5VPLBAKOAT57Y4IVRDB/action/author_attestation","sign_citation":"https://pith.science/pith/KKS3MYI5VPLBAKOAT57Y4IVRDB/action/citation_signature","submit_replication":"https://pith.science/pith/KKS3MYI5VPLBAKOAT57Y4IVRDB/action/replication_record"}},"created_at":"2026-05-17T23:40:21.134269+00:00","updated_at":"2026-05-17T23:40:21.134269+00:00"}