{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KKS3MYI5VPLBAKOAT57Y4IVRDB","short_pith_number":"pith:KKS3MYI5","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"},"canonical_sha256":"52a5b6611dabd61029c09f7f8e22b1186a37c0d0dafd662fbb0fae060ce23540","source":{"kind":"arxiv","id":"1607.06996","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06996","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06996v6","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06996","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"pith_short_12","alias_value":"KKS3MYI5VPLB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KKS3MYI5VPLBAKOA","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KKS3MYI5","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KKS3MYI5VPLBAKOAT57Y4IVRDB","target":"record","payload":{"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"},"canonical_sha256":"52a5b6611dabd61029c09f7f8e22b1186a37c0d0dafd662fbb0fae060ce23540","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"},"source_kind":"arxiv","source_id":"1607.06996","source_version":6,"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-17T23:40:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1rgQ3m6/3NWdkrCPweIXN2/LKnwSps/+q+E9G+MYYEHXsOPXsj6WA9d1M3PV5u2qeZ7jjFHM84YeF/mXeIbOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T16:21:15.736107Z"},"content_sha256":"1d138bd93e3e5cd1a17a4208305d7e09901892e1f790b8737157a184ab75581d","schema_version":"1.0","event_id":"sha256:1d138bd93e3e5cd1a17a4208305d7e09901892e1f790b8737157a184ab75581d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KKS3MYI5VPLBAKOAT57Y4IVRDB","target":"graph","payload":{"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"},"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-17T23:40:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qZqxRbH7UiFifEUqjcN1ir7S0qnU+r4ZQD7Zo6gkd5Wid/QNDWYhc+YsH7Ix0p7cTDQgrU1VVcoBTmph8d6xAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T16:21:15.736469Z"},"content_sha256":"8b4656329fb99eb6f602025b31156db76825f621a20e0ebf073393eb4379c5a9","schema_version":"1.0","event_id":"sha256:8b4656329fb99eb6f602025b31156db76825f621a20e0ebf073393eb4379c5a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KKS3MYI5VPLBAKOAT57Y4IVRDB/bundle.json","state_url":"https://pith.science/pith/KKS3MYI5VPLBAKOAT57Y4IVRDB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KKS3MYI5VPLBAKOAT57Y4IVRDB/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-05-20T16:21:15Z","links":{"resolver":"https://pith.science/pith/KKS3MYI5VPLBAKOAT57Y4IVRDB","bundle":"https://pith.science/pith/KKS3MYI5VPLBAKOAT57Y4IVRDB/bundle.json","state":"https://pith.science/pith/KKS3MYI5VPLBAKOAT57Y4IVRDB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KKS3MYI5VPLBAKOAT57Y4IVRDB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KKS3MYI5VPLBAKOAT57Y4IVRDB","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":"ffcb8d772d56fda57cdddb57b41a04054adce3b1853ed7376493afcb2ce5b695","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-24T04:00:30Z","title_canon_sha256":"eb6829bddfec577e686933a86ca3ac5919559b7d1489fd8bf76f5b9ddf63ade9"},"schema_version":"1.0","source":{"id":"1607.06996","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06996","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06996v6","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06996","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"pith_short_12","alias_value":"KKS3MYI5VPLB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KKS3MYI5VPLBAKOA","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KKS3MYI5","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:8b4656329fb99eb6f602025b31156db76825f621a20e0ebf073393eb4379c5a9","target":"graph","created_at":"2026-05-17T23:40:21Z","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":"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","authors_text":"Bin Hong, Deng Cai, Jieping Ye, Jie Wang, Wei Liu, Weizhong Zhang, Xiaofei He","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-24T04:00:30Z","title":"Scaling Up Sparse Support Vector Machines by Simultaneous Feature and Sample Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06996","kind":"arxiv","version":6},"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:1d138bd93e3e5cd1a17a4208305d7e09901892e1f790b8737157a184ab75581d","target":"record","created_at":"2026-05-17T23:40:21Z","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":"ffcb8d772d56fda57cdddb57b41a04054adce3b1853ed7376493afcb2ce5b695","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-24T04:00:30Z","title_canon_sha256":"eb6829bddfec577e686933a86ca3ac5919559b7d1489fd8bf76f5b9ddf63ade9"},"schema_version":"1.0","source":{"id":"1607.06996","kind":"arxiv","version":6}},"canonical_sha256":"52a5b6611dabd61029c09f7f8e22b1186a37c0d0dafd662fbb0fae060ce23540","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52a5b6611dabd61029c09f7f8e22b1186a37c0d0dafd662fbb0fae060ce23540","first_computed_at":"2026-05-17T23:40:21.134187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:21.134187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VFO/zENOUgQcPJcICM2mgWrTuQYhtGJ/pK0CLE3mvZECHX5ERpy8fq82cTg3DkQR3Ns9YnU1IGmF359nbNwaDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:21.134823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06996","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d138bd93e3e5cd1a17a4208305d7e09901892e1f790b8737157a184ab75581d","sha256:8b4656329fb99eb6f602025b31156db76825f621a20e0ebf073393eb4379c5a9"],"state_sha256":"f35eea595ed4cbab286722457d874784e79c46460096ea197207307d117af739"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8s8dmosvqLLpyseVegk65fDYCGxU/nKzzSbhc2mJ44xKIL4OXYh291RbQf/GniCd7G5jGlUlYK9nBvqH7c6pBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T16:21:15.738431Z","bundle_sha256":"2a7b1d3ac4e16ac6e4108804a569fab820fc712685441accd0ab27e003946023"}}