{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UYDHMQ4WJMIO5QJSFXQME2HMLD","short_pith_number":"pith:UYDHMQ4W","schema_version":"1.0","canonical_sha256":"a6067643964b10eec1322de0c268ec58d9ac936664b60e17e9f914cb74957b2f","source":{"kind":"arxiv","id":"1810.04249","version":2},"attestation_state":"computed","paper":{"title":"Data-dependent compression of random features for large-scale kernel approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jonathan H. Huggins, Raj Agrawal, Tamara Broderick, Trevor Campbell","submitted_at":"2018-10-09T21:20:41Z","abstract_excerpt":"Kernel methods offer the flexibility to learn complex relationships in modern, large data sets while enjoying strong theoretical guarantees on quality. Unfortunately, these methods typically require cubic running time in the data set size, a prohibitive cost in the large-data setting. Random feature maps (RFMs) and the Nystrom method both consider low-rank approximations to the kernel matrix as a potential solution. But, in order to achieve desirable theoretical guarantees, the former may require a prohibitively large number of features J+, and the latter may be prohibitively expensive for hig"},"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":"1810.04249","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-09T21:20:41Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ca72aa42f1d52d13faee76f0a9e1e0f8cfcd815887eb3f07919e0e9820a27f45","abstract_canon_sha256":"b23185d06ab60d0251b3388e18ad3f1a72eaa59cabbf05556d7c6d0ec60f4f13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:27.087444Z","signature_b64":"H7hivavzSo4GExcgYHCcr2uHibeUtA2gP4I8NOv1f5GKgiLHjIwcq8wqh6SJvEh4Zte/T0d0KYIDQ+lrq1vtCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6067643964b10eec1322de0c268ec58d9ac936664b60e17e9f914cb74957b2f","last_reissued_at":"2026-05-17T23:52:27.086918Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:27.086918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-dependent compression of random features for large-scale kernel approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jonathan H. Huggins, Raj Agrawal, Tamara Broderick, Trevor Campbell","submitted_at":"2018-10-09T21:20:41Z","abstract_excerpt":"Kernel methods offer the flexibility to learn complex relationships in modern, large data sets while enjoying strong theoretical guarantees on quality. Unfortunately, these methods typically require cubic running time in the data set size, a prohibitive cost in the large-data setting. Random feature maps (RFMs) and the Nystrom method both consider low-rank approximations to the kernel matrix as a potential solution. But, in order to achieve desirable theoretical guarantees, the former may require a prohibitively large number of features J+, and the latter may be prohibitively expensive for hig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04249","kind":"arxiv","version":2},"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":"1810.04249","created_at":"2026-05-17T23:52:27.087002+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.04249v2","created_at":"2026-05-17T23:52:27.087002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04249","created_at":"2026-05-17T23:52:27.087002+00:00"},{"alias_kind":"pith_short_12","alias_value":"UYDHMQ4WJMIO","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UYDHMQ4WJMIO5QJS","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UYDHMQ4W","created_at":"2026-05-18T12:32:56.356000+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/UYDHMQ4WJMIO5QJSFXQME2HMLD","json":"https://pith.science/pith/UYDHMQ4WJMIO5QJSFXQME2HMLD.json","graph_json":"https://pith.science/api/pith-number/UYDHMQ4WJMIO5QJSFXQME2HMLD/graph.json","events_json":"https://pith.science/api/pith-number/UYDHMQ4WJMIO5QJSFXQME2HMLD/events.json","paper":"https://pith.science/paper/UYDHMQ4W"},"agent_actions":{"view_html":"https://pith.science/pith/UYDHMQ4WJMIO5QJSFXQME2HMLD","download_json":"https://pith.science/pith/UYDHMQ4WJMIO5QJSFXQME2HMLD.json","view_paper":"https://pith.science/paper/UYDHMQ4W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.04249&json=true","fetch_graph":"https://pith.science/api/pith-number/UYDHMQ4WJMIO5QJSFXQME2HMLD/graph.json","fetch_events":"https://pith.science/api/pith-number/UYDHMQ4WJMIO5QJSFXQME2HMLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UYDHMQ4WJMIO5QJSFXQME2HMLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UYDHMQ4WJMIO5QJSFXQME2HMLD/action/storage_attestation","attest_author":"https://pith.science/pith/UYDHMQ4WJMIO5QJSFXQME2HMLD/action/author_attestation","sign_citation":"https://pith.science/pith/UYDHMQ4WJMIO5QJSFXQME2HMLD/action/citation_signature","submit_replication":"https://pith.science/pith/UYDHMQ4WJMIO5QJSFXQME2HMLD/action/replication_record"}},"created_at":"2026-05-17T23:52:27.087002+00:00","updated_at":"2026-05-17T23:52:27.087002+00:00"}