{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KESD26A23A67IVQ4EXFYOSCMXL","short_pith_number":"pith:KESD26A2","schema_version":"1.0","canonical_sha256":"51243d781ad83df4561c25cb87484cbaea4f5f77e8fc1621ffcf817880eaec03","source":{"kind":"arxiv","id":"1605.07583","version":5},"attestation_state":"computed","paper":{"title":"Recursive Sampling for the Nystr\\\"om Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cameron Musco, Christopher Musco","submitted_at":"2016-05-24T18:56:57Z","abstract_excerpt":"We give the first algorithm for kernel Nystr\\\"om approximation that runs in *linear time in the number of training points* and is provably accurate for all kernel matrices, without dependence on regularity or incoherence conditions. The algorithm projects the kernel onto a set of $s$ landmark points sampled by their *ridge leverage scores*, requiring just $O(ns)$ kernel evaluations and $O(ns^2)$ additional runtime. While leverage score sampling has long been known to give strong theoretical guarantees for Nystr\\\"om approximation, by employing a fast recursive sampling scheme, our algorithm is "},"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":"1605.07583","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-24T18:56:57Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"58f13505ab7813b40c700ad22378762ca07455c4b29099392516a6b7ea38e171","abstract_canon_sha256":"8a22d97cb8a61bdca39639481615814b39869861d9adb94db06b1421124ce3ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:24.011041Z","signature_b64":"EscTo9WUwI/MFG7WIXKr1bVotc1LjL1VWfwnQc4G0Kd3/cc72r87C+YfUgfUcbuXQWTJqCJ5InIfQBJb3nY6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51243d781ad83df4561c25cb87484cbaea4f5f77e8fc1621ffcf817880eaec03","last_reissued_at":"2026-05-18T00:31:24.010626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:24.010626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recursive Sampling for the Nystr\\\"om Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cameron Musco, Christopher Musco","submitted_at":"2016-05-24T18:56:57Z","abstract_excerpt":"We give the first algorithm for kernel Nystr\\\"om approximation that runs in *linear time in the number of training points* and is provably accurate for all kernel matrices, without dependence on regularity or incoherence conditions. The algorithm projects the kernel onto a set of $s$ landmark points sampled by their *ridge leverage scores*, requiring just $O(ns)$ kernel evaluations and $O(ns^2)$ additional runtime. While leverage score sampling has long been known to give strong theoretical guarantees for Nystr\\\"om approximation, by employing a fast recursive sampling scheme, our algorithm is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07583","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.07583","created_at":"2026-05-18T00:31:24.010700+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.07583v5","created_at":"2026-05-18T00:31:24.010700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07583","created_at":"2026-05-18T00:31:24.010700+00:00"},{"alias_kind":"pith_short_12","alias_value":"KESD26A23A67","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KESD26A23A67IVQ4","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KESD26A2","created_at":"2026-05-18T12:30:25.849896+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/KESD26A23A67IVQ4EXFYOSCMXL","json":"https://pith.science/pith/KESD26A23A67IVQ4EXFYOSCMXL.json","graph_json":"https://pith.science/api/pith-number/KESD26A23A67IVQ4EXFYOSCMXL/graph.json","events_json":"https://pith.science/api/pith-number/KESD26A23A67IVQ4EXFYOSCMXL/events.json","paper":"https://pith.science/paper/KESD26A2"},"agent_actions":{"view_html":"https://pith.science/pith/KESD26A23A67IVQ4EXFYOSCMXL","download_json":"https://pith.science/pith/KESD26A23A67IVQ4EXFYOSCMXL.json","view_paper":"https://pith.science/paper/KESD26A2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.07583&json=true","fetch_graph":"https://pith.science/api/pith-number/KESD26A23A67IVQ4EXFYOSCMXL/graph.json","fetch_events":"https://pith.science/api/pith-number/KESD26A23A67IVQ4EXFYOSCMXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KESD26A23A67IVQ4EXFYOSCMXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KESD26A23A67IVQ4EXFYOSCMXL/action/storage_attestation","attest_author":"https://pith.science/pith/KESD26A23A67IVQ4EXFYOSCMXL/action/author_attestation","sign_citation":"https://pith.science/pith/KESD26A23A67IVQ4EXFYOSCMXL/action/citation_signature","submit_replication":"https://pith.science/pith/KESD26A23A67IVQ4EXFYOSCMXL/action/replication_record"}},"created_at":"2026-05-18T00:31:24.010700+00:00","updated_at":"2026-05-18T00:31:24.010700+00:00"}