{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VM7THJEK4FQKVJRILLG5QTX3ES","short_pith_number":"pith:VM7THJEK","schema_version":"1.0","canonical_sha256":"ab3f33a48ae160aaa6285acdd84efb24af3539fa4422bba8f0b52f52be6e2246","source":{"kind":"arxiv","id":"1603.06052","version":2},"attestation_state":"computed","paper":{"title":"Fast DPP Sampling for Nystr\\\"om with Application to Kernel Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chengtao Li, Stefanie Jegelka, Suvrit Sra","submitted_at":"2016-03-19T06:14:28Z","abstract_excerpt":"The Nystr\\\"om method has long been popular for scaling up kernel methods. Its theoretical guarantees and empirical performance rely critically on the quality of the landmarks selected. We study landmark selection for Nystr\\\"om using Determinantal Point Processes (DPPs), discrete probability models that allow tractable generation of diverse samples. We prove that landmarks selected via DPPs guarantee bounds on approximation errors; subsequently, we analyze implications for kernel ridge regression. Contrary to prior reservations due to cubic complexity of DPPsampling, we show that (under certain"},"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":"1603.06052","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-19T06:14:28Z","cross_cats_sorted":[],"title_canon_sha256":"566368d8b0c89e5ed7e65cfc7151f675e5ab42b206218a4383512c7bdc26e78c","abstract_canon_sha256":"518deeb5f34cf259ebe1fce0e0742adc9db976853235c2987f353faaf19a789f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:23.425422Z","signature_b64":"/UcYlfoPYtxZ/JuLw13OzrERw0oC55mGRjJvzumg6KqgSsXKeDau6Ah1NVZaEeeaz6QSmFOLK+O5YC2m3vsuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab3f33a48ae160aaa6285acdd84efb24af3539fa4422bba8f0b52f52be6e2246","last_reissued_at":"2026-05-18T01:13:23.424892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:23.424892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast DPP Sampling for Nystr\\\"om with Application to Kernel Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chengtao Li, Stefanie Jegelka, Suvrit Sra","submitted_at":"2016-03-19T06:14:28Z","abstract_excerpt":"The Nystr\\\"om method has long been popular for scaling up kernel methods. Its theoretical guarantees and empirical performance rely critically on the quality of the landmarks selected. We study landmark selection for Nystr\\\"om using Determinantal Point Processes (DPPs), discrete probability models that allow tractable generation of diverse samples. We prove that landmarks selected via DPPs guarantee bounds on approximation errors; subsequently, we analyze implications for kernel ridge regression. Contrary to prior reservations due to cubic complexity of DPPsampling, we show that (under certain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06052","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":"1603.06052","created_at":"2026-05-18T01:13:23.424980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.06052v2","created_at":"2026-05-18T01:13:23.424980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06052","created_at":"2026-05-18T01:13:23.424980+00:00"},{"alias_kind":"pith_short_12","alias_value":"VM7THJEK4FQK","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VM7THJEK4FQKVJRI","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VM7THJEK","created_at":"2026-05-18T12:30:48.956258+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2512.08089","citing_title":"Efficient and Accurate Graph Classification with Hyperdimensional Computing on FPGA","ref_index":37,"is_internal_anchor":true},{"citing_arxiv_id":"2512.08089","citing_title":"Efficient and Accurate Graph Classification with Hyperdimensional Computing on FPGA","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VM7THJEK4FQKVJRILLG5QTX3ES","json":"https://pith.science/pith/VM7THJEK4FQKVJRILLG5QTX3ES.json","graph_json":"https://pith.science/api/pith-number/VM7THJEK4FQKVJRILLG5QTX3ES/graph.json","events_json":"https://pith.science/api/pith-number/VM7THJEK4FQKVJRILLG5QTX3ES/events.json","paper":"https://pith.science/paper/VM7THJEK"},"agent_actions":{"view_html":"https://pith.science/pith/VM7THJEK4FQKVJRILLG5QTX3ES","download_json":"https://pith.science/pith/VM7THJEK4FQKVJRILLG5QTX3ES.json","view_paper":"https://pith.science/paper/VM7THJEK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.06052&json=true","fetch_graph":"https://pith.science/api/pith-number/VM7THJEK4FQKVJRILLG5QTX3ES/graph.json","fetch_events":"https://pith.science/api/pith-number/VM7THJEK4FQKVJRILLG5QTX3ES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VM7THJEK4FQKVJRILLG5QTX3ES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VM7THJEK4FQKVJRILLG5QTX3ES/action/storage_attestation","attest_author":"https://pith.science/pith/VM7THJEK4FQKVJRILLG5QTX3ES/action/author_attestation","sign_citation":"https://pith.science/pith/VM7THJEK4FQKVJRILLG5QTX3ES/action/citation_signature","submit_replication":"https://pith.science/pith/VM7THJEK4FQKVJRILLG5QTX3ES/action/replication_record"}},"created_at":"2026-05-18T01:13:23.424980+00:00","updated_at":"2026-05-18T01:13:23.424980+00:00"}