{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NKKSHHJ6CUKULTJYSQ76RMMM35","short_pith_number":"pith:NKKSHHJ6","canonical_record":{"source":{"id":"1211.6085","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-26T20:35:12Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b587e19525b129a08f87d30fe35470827e76ab16675aba5cd952eb9df13279da","abstract_canon_sha256":"777bc65f2ed06c9b9e4ff63540d2e6558ab4f0b08533172ba1c369996f0862ba"},"schema_version":"1.0"},"canonical_sha256":"6a95239d3e151545cd38943fe8b18cdf743631a3a65305484b6d5b86f0ed4c74","source":{"kind":"arxiv","id":"1211.6085","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6085","created_at":"2026-05-18T02:54:05Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6085v5","created_at":"2026-05-18T02:54:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6085","created_at":"2026-05-18T02:54:05Z"},{"alias_kind":"pith_short_12","alias_value":"NKKSHHJ6CUKU","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NKKSHHJ6CUKULTJY","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NKKSHHJ6","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NKKSHHJ6CUKULTJYSQ76RMMM35","target":"record","payload":{"canonical_record":{"source":{"id":"1211.6085","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-26T20:35:12Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b587e19525b129a08f87d30fe35470827e76ab16675aba5cd952eb9df13279da","abstract_canon_sha256":"777bc65f2ed06c9b9e4ff63540d2e6558ab4f0b08533172ba1c369996f0862ba"},"schema_version":"1.0"},"canonical_sha256":"6a95239d3e151545cd38943fe8b18cdf743631a3a65305484b6d5b86f0ed4c74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:05.309728Z","signature_b64":"XXDip+vyahJ46GKjsVZRbQY6iOHTI8pU+xZbcocjK3SXu5krkZdrcoWJRDeSTHeJSyCrFbetb+sFIK762If6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a95239d3e151545cd38943fe8b18cdf743631a3a65305484b6d5b86f0ed4c74","last_reissued_at":"2026-05-18T02:54:05.309151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:05.309151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.6085","source_version":5,"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-18T02:54:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rakWmVrKtYSZdzsrJdeGZgkRQj95xXCSTbsqUxfhXOaFi9zG2LQsWSdcffXQmopdAC6kOAr9TN3VV1IDrEqNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:23:54.695043Z"},"content_sha256":"797d0d473deb8e0e717c80057d4c2e74dc53459af38676b6da7e31767720f648","schema_version":"1.0","event_id":"sha256:797d0d473deb8e0e717c80057d4c2e74dc53459af38676b6da7e31767720f648"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NKKSHHJ6CUKULTJYSQ76RMMM35","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Projections for Linear Support Vector Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Christos Boutsidis, Malik Magdon-Ismail, Petros Drineas, Saurabh Paul","submitted_at":"2012-11-26T20:35:12Z","abstract_excerpt":"Let X be a data matrix of rank \\rho, whose rows represent n points in d-dimensional space. The linear support vector machine constructs a hyperplane separator that maximizes the 1-norm soft margin. We develop a new oblivious dimension reduction technique which is precomputed and can be applied to any input matrix X. We prove that, with high probability, the margin and minimum enclosing ball in the feature space are preserved to within \\epsilon-relative error, ensuring comparable generalization as in the original space in the case of classification. For regression, we show that the margin is pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6085","kind":"arxiv","version":5},"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-18T02:54:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gKOQwLB2jx7TFfKhIlK0LIup6ilc7VMZg4SWoIE+YQe60v3gC552S1GRiWjx5kJlnKVK0GQK3K4fpR4GfVpPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:23:54.695769Z"},"content_sha256":"989eeebf9980c8625456f08abcfd0f12319a85a52c297f3b824fe452111b4d4f","schema_version":"1.0","event_id":"sha256:989eeebf9980c8625456f08abcfd0f12319a85a52c297f3b824fe452111b4d4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NKKSHHJ6CUKULTJYSQ76RMMM35/bundle.json","state_url":"https://pith.science/pith/NKKSHHJ6CUKULTJYSQ76RMMM35/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NKKSHHJ6CUKULTJYSQ76RMMM35/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-25T17:23:54Z","links":{"resolver":"https://pith.science/pith/NKKSHHJ6CUKULTJYSQ76RMMM35","bundle":"https://pith.science/pith/NKKSHHJ6CUKULTJYSQ76RMMM35/bundle.json","state":"https://pith.science/pith/NKKSHHJ6CUKULTJYSQ76RMMM35/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NKKSHHJ6CUKULTJYSQ76RMMM35/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NKKSHHJ6CUKULTJYSQ76RMMM35","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":"777bc65f2ed06c9b9e4ff63540d2e6558ab4f0b08533172ba1c369996f0862ba","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-26T20:35:12Z","title_canon_sha256":"b587e19525b129a08f87d30fe35470827e76ab16675aba5cd952eb9df13279da"},"schema_version":"1.0","source":{"id":"1211.6085","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6085","created_at":"2026-05-18T02:54:05Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6085v5","created_at":"2026-05-18T02:54:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6085","created_at":"2026-05-18T02:54:05Z"},{"alias_kind":"pith_short_12","alias_value":"NKKSHHJ6CUKU","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NKKSHHJ6CUKULTJY","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NKKSHHJ6","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:989eeebf9980c8625456f08abcfd0f12319a85a52c297f3b824fe452111b4d4f","target":"graph","created_at":"2026-05-18T02:54:05Z","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":"Let X be a data matrix of rank \\rho, whose rows represent n points in d-dimensional space. The linear support vector machine constructs a hyperplane separator that maximizes the 1-norm soft margin. We develop a new oblivious dimension reduction technique which is precomputed and can be applied to any input matrix X. We prove that, with high probability, the margin and minimum enclosing ball in the feature space are preserved to within \\epsilon-relative error, ensuring comparable generalization as in the original space in the case of classification. For regression, we show that the margin is pr","authors_text":"Christos Boutsidis, Malik Magdon-Ismail, Petros Drineas, Saurabh Paul","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-26T20:35:12Z","title":"Random Projections for Linear Support Vector Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6085","kind":"arxiv","version":5},"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:797d0d473deb8e0e717c80057d4c2e74dc53459af38676b6da7e31767720f648","target":"record","created_at":"2026-05-18T02:54:05Z","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":"777bc65f2ed06c9b9e4ff63540d2e6558ab4f0b08533172ba1c369996f0862ba","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-26T20:35:12Z","title_canon_sha256":"b587e19525b129a08f87d30fe35470827e76ab16675aba5cd952eb9df13279da"},"schema_version":"1.0","source":{"id":"1211.6085","kind":"arxiv","version":5}},"canonical_sha256":"6a95239d3e151545cd38943fe8b18cdf743631a3a65305484b6d5b86f0ed4c74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a95239d3e151545cd38943fe8b18cdf743631a3a65305484b6d5b86f0ed4c74","first_computed_at":"2026-05-18T02:54:05.309151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:05.309151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XXDip+vyahJ46GKjsVZRbQY6iOHTI8pU+xZbcocjK3SXu5krkZdrcoWJRDeSTHeJSyCrFbetb+sFIK762If6AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:05.309728Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.6085","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:797d0d473deb8e0e717c80057d4c2e74dc53459af38676b6da7e31767720f648","sha256:989eeebf9980c8625456f08abcfd0f12319a85a52c297f3b824fe452111b4d4f"],"state_sha256":"0ad3e51ce895538f60de6c4c2846df7829fcd31095f2639ef871b1d3546b2593"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UrNIWxi0SqPl3YH3PtOiL6pF9yVB1A4Gq5wKdwJ0pzKCuQsDVboKzDluzEEd/zLA3EPXuCXr5jt58pTsqbUiCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:23:54.699745Z","bundle_sha256":"29dfef9fb9950fd2842c1fa880a0a3a61565773b1618589731ab7ddbd00e88a4"}}