{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZHB4NVVIXFSU2CQQTMSAGGCIQM","short_pith_number":"pith:ZHB4NVVI","schema_version":"1.0","canonical_sha256":"c9c3c6d6a8b9654d0a109b24031848830abf1a420f925dd71532207165b02b72","source":{"kind":"arxiv","id":"1312.4626","version":1},"attestation_state":"computed","paper":{"title":"Compact Random Feature Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alex Gittens, Dennis DeCoste, Raffay Hamid, Ying Xiao","submitted_at":"2013-12-17T03:33:08Z","abstract_excerpt":"Kernel approximation using randomized feature maps has recently gained a lot of interest. In this work, we identify that previous approaches for polynomial kernel approximation create maps that are rank deficient, and therefore do not utilize the capacity of the projected feature space effectively. To address this challenge, we propose compact random feature maps (CRAFTMaps) to approximate polynomial kernels more concisely and accurately. We prove the error bounds of CRAFTMaps demonstrating their superior kernel reconstruction performance compared to the previous approximation schemes. We show"},"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":"1312.4626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-17T03:33:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7470ebec11ccd092c02be6e8b4267552b9892ac379f69e8cfd31c05f54a0748f","abstract_canon_sha256":"af580279fa6953e1b4781f147636762dd3306023868292da0e257e46b4879c43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:23.471572Z","signature_b64":"HVIsJaVP96GWPVZEtEHnrc5jc6mR0dprGpc1JkBHwfZZTjecRsw4Afk2ZbZbnQyLBooacBV0bWr+6K+goluvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9c3c6d6a8b9654d0a109b24031848830abf1a420f925dd71532207165b02b72","last_reissued_at":"2026-05-18T03:04:23.471009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:23.471009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compact Random Feature Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alex Gittens, Dennis DeCoste, Raffay Hamid, Ying Xiao","submitted_at":"2013-12-17T03:33:08Z","abstract_excerpt":"Kernel approximation using randomized feature maps has recently gained a lot of interest. In this work, we identify that previous approaches for polynomial kernel approximation create maps that are rank deficient, and therefore do not utilize the capacity of the projected feature space effectively. To address this challenge, we propose compact random feature maps (CRAFTMaps) to approximate polynomial kernels more concisely and accurately. We prove the error bounds of CRAFTMaps demonstrating their superior kernel reconstruction performance compared to the previous approximation schemes. We show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4626","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.4626","created_at":"2026-05-18T03:04:23.471083+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.4626v1","created_at":"2026-05-18T03:04:23.471083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4626","created_at":"2026-05-18T03:04:23.471083+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZHB4NVVIXFSU","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZHB4NVVIXFSU2CQQ","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZHB4NVVI","created_at":"2026-05-18T12:28:09.283467+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/ZHB4NVVIXFSU2CQQTMSAGGCIQM","json":"https://pith.science/pith/ZHB4NVVIXFSU2CQQTMSAGGCIQM.json","graph_json":"https://pith.science/api/pith-number/ZHB4NVVIXFSU2CQQTMSAGGCIQM/graph.json","events_json":"https://pith.science/api/pith-number/ZHB4NVVIXFSU2CQQTMSAGGCIQM/events.json","paper":"https://pith.science/paper/ZHB4NVVI"},"agent_actions":{"view_html":"https://pith.science/pith/ZHB4NVVIXFSU2CQQTMSAGGCIQM","download_json":"https://pith.science/pith/ZHB4NVVIXFSU2CQQTMSAGGCIQM.json","view_paper":"https://pith.science/paper/ZHB4NVVI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.4626&json=true","fetch_graph":"https://pith.science/api/pith-number/ZHB4NVVIXFSU2CQQTMSAGGCIQM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZHB4NVVIXFSU2CQQTMSAGGCIQM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZHB4NVVIXFSU2CQQTMSAGGCIQM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZHB4NVVIXFSU2CQQTMSAGGCIQM/action/storage_attestation","attest_author":"https://pith.science/pith/ZHB4NVVIXFSU2CQQTMSAGGCIQM/action/author_attestation","sign_citation":"https://pith.science/pith/ZHB4NVVIXFSU2CQQTMSAGGCIQM/action/citation_signature","submit_replication":"https://pith.science/pith/ZHB4NVVIXFSU2CQQTMSAGGCIQM/action/replication_record"}},"created_at":"2026-05-18T03:04:23.471083+00:00","updated_at":"2026-05-18T03:04:23.471083+00:00"}