{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:W42ASNPXZADT5N7SMKZU5TYU25","short_pith_number":"pith:W42ASNPX","canonical_record":{"source":{"id":"1509.08083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-27T11:07:03Z","cross_cats_sorted":["cs.LG","math.FA","math.IT","math.ST","stat.TH"],"title_canon_sha256":"c62e0344c431135960b97922a972891529a65004461e9c0e394df7a271ebc11b","abstract_canon_sha256":"55382a0793b0e8040a373c622b827f4883c1e705c33775732d9cf361635b1256"},"schema_version":"1.0"},"canonical_sha256":"b7340935f7c8073eb7f262b34ecf14d754fb2c5a1e05666e317009152b43f462","source":{"kind":"arxiv","id":"1509.08083","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08083","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08083v1","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08083","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"W42ASNPXZADT","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W42ASNPXZADT5N7S","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W42ASNPX","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:W42ASNPXZADT5N7SMKZU5TYU25","target":"record","payload":{"canonical_record":{"source":{"id":"1509.08083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-27T11:07:03Z","cross_cats_sorted":["cs.LG","math.FA","math.IT","math.ST","stat.TH"],"title_canon_sha256":"c62e0344c431135960b97922a972891529a65004461e9c0e394df7a271ebc11b","abstract_canon_sha256":"55382a0793b0e8040a373c622b827f4883c1e705c33775732d9cf361635b1256"},"schema_version":"1.0"},"canonical_sha256":"b7340935f7c8073eb7f262b34ecf14d754fb2c5a1e05666e317009152b43f462","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:54.762478Z","signature_b64":"tZoHXa5WFiHHJ9Ewuqwo8qhBAuOxRg5++98FOGsxsFtP8wpnZ3yXV/9wDJDpmnEyH0VRomB8Eg2Qbk7M2lX5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7340935f7c8073eb7f262b34ecf14d754fb2c5a1e05666e317009152b43f462","last_reissued_at":"2026-05-18T01:31:54.762076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:54.762076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.08083","source_version":1,"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-18T01:31:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ZYDdHNXAYtTz0WMCSoNcGUFHQEPPgyTIilWdGCMUxCOg+jUjNisEtz1t2TUCHNOREQkC1xXNbCpGD4Qtdp0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:17:22.596093Z"},"content_sha256":"9acbb567fba09f64a423f70859f2c8b06ddc80f43a194abf255bc01d31f21227","schema_version":"1.0","event_id":"sha256:9acbb567fba09f64a423f70859f2c8b06ddc80f43a194abf255bc01d31f21227"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:W42ASNPXZADT5N7SMKZU5TYU25","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-asymptotic Analysis of $\\ell_1$-norm Support Vector Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.FA","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Anton Kolleck, Jan Vyb\\'iral","submitted_at":"2015-09-27T11:07:03Z","abstract_excerpt":"Support Vector Machines (SVM) with $\\ell_1$ penalty became a standard tool in analysis of highdimensional classification problems with sparsity constraints in many applications including bioinformatics and signal processing. Although SVM have been studied intensively in the literature, this paper has to our knowledge first non-asymptotic results on the performance of $\\ell_1$-SVM in identification of sparse classifiers. We show that a $d$-dimensional $s$-sparse classification vector can be (with high probability) well approximated from only $O(s\\log(d))$ Gaussian trials. The methods used in th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08083","kind":"arxiv","version":1},"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-18T01:31:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NeCmSmDEo/5JsccHantBAf7wLta74606UjsX/+jCVr8zvtP4QwzZrwz35AVub6/0vMxdddsarx5as6ci92kzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:17:22.596766Z"},"content_sha256":"25bc17dee570cd1a967f1f6fe0c985f89fbe3c3da7c2187c0aa9b02a4a9f988b","schema_version":"1.0","event_id":"sha256:25bc17dee570cd1a967f1f6fe0c985f89fbe3c3da7c2187c0aa9b02a4a9f988b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W42ASNPXZADT5N7SMKZU5TYU25/bundle.json","state_url":"https://pith.science/pith/W42ASNPXZADT5N7SMKZU5TYU25/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W42ASNPXZADT5N7SMKZU5TYU25/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-27T23:17:22Z","links":{"resolver":"https://pith.science/pith/W42ASNPXZADT5N7SMKZU5TYU25","bundle":"https://pith.science/pith/W42ASNPXZADT5N7SMKZU5TYU25/bundle.json","state":"https://pith.science/pith/W42ASNPXZADT5N7SMKZU5TYU25/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W42ASNPXZADT5N7SMKZU5TYU25/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:W42ASNPXZADT5N7SMKZU5TYU25","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":"55382a0793b0e8040a373c622b827f4883c1e705c33775732d9cf361635b1256","cross_cats_sorted":["cs.LG","math.FA","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-27T11:07:03Z","title_canon_sha256":"c62e0344c431135960b97922a972891529a65004461e9c0e394df7a271ebc11b"},"schema_version":"1.0","source":{"id":"1509.08083","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08083","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08083v1","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08083","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"W42ASNPXZADT","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W42ASNPXZADT5N7S","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W42ASNPX","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:25bc17dee570cd1a967f1f6fe0c985f89fbe3c3da7c2187c0aa9b02a4a9f988b","target":"graph","created_at":"2026-05-18T01:31:54Z","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":"Support Vector Machines (SVM) with $\\ell_1$ penalty became a standard tool in analysis of highdimensional classification problems with sparsity constraints in many applications including bioinformatics and signal processing. Although SVM have been studied intensively in the literature, this paper has to our knowledge first non-asymptotic results on the performance of $\\ell_1$-SVM in identification of sparse classifiers. We show that a $d$-dimensional $s$-sparse classification vector can be (with high probability) well approximated from only $O(s\\log(d))$ Gaussian trials. The methods used in th","authors_text":"Anton Kolleck, Jan Vyb\\'iral","cross_cats":["cs.LG","math.FA","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-27T11:07:03Z","title":"Non-asymptotic Analysis of $\\ell_1$-norm Support Vector Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08083","kind":"arxiv","version":1},"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:9acbb567fba09f64a423f70859f2c8b06ddc80f43a194abf255bc01d31f21227","target":"record","created_at":"2026-05-18T01:31:54Z","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":"55382a0793b0e8040a373c622b827f4883c1e705c33775732d9cf361635b1256","cross_cats_sorted":["cs.LG","math.FA","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-27T11:07:03Z","title_canon_sha256":"c62e0344c431135960b97922a972891529a65004461e9c0e394df7a271ebc11b"},"schema_version":"1.0","source":{"id":"1509.08083","kind":"arxiv","version":1}},"canonical_sha256":"b7340935f7c8073eb7f262b34ecf14d754fb2c5a1e05666e317009152b43f462","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7340935f7c8073eb7f262b34ecf14d754fb2c5a1e05666e317009152b43f462","first_computed_at":"2026-05-18T01:31:54.762076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:54.762076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tZoHXa5WFiHHJ9Ewuqwo8qhBAuOxRg5++98FOGsxsFtP8wpnZ3yXV/9wDJDpmnEyH0VRomB8Eg2Qbk7M2lX5Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:54.762478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.08083","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9acbb567fba09f64a423f70859f2c8b06ddc80f43a194abf255bc01d31f21227","sha256:25bc17dee570cd1a967f1f6fe0c985f89fbe3c3da7c2187c0aa9b02a4a9f988b"],"state_sha256":"742aaf32c8aaf756bbf48f51423f3a137222429abbebe481e2934abea3739f9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oB13Smdovv4/o37FC+Aiub6BTe9lObxDxYEWA6qau9VhwiTF/A13XukYadHyfybxh+vPQ4I6gxP2dt35UStgCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:17:22.600214Z","bundle_sha256":"ea55b24e1f55df6bd629c45435d4528c8c9e4d9c66504c082e2f2aec0e0cba37"}}