{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:V5YKMSN27EC7UJCUTCEYOGOAE3","short_pith_number":"pith:V5YKMSN2","canonical_record":{"source":{"id":"1905.06394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-15T19:04:16Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"24a3681655082a56d9c3296573deb6df8e181a5055f33f9433b867eee4b6b7ed","abstract_canon_sha256":"37e7d724f72faae800b6b4af02bb6a7da3b2055de71f5ff8b41aa967bf6ae493"},"schema_version":"1.0"},"canonical_sha256":"af70a649baf905fa245498898719c026dc84eb9a498af48f49024c9ab36c2f42","source":{"kind":"arxiv","id":"1905.06394","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.06394","created_at":"2026-05-17T23:46:02Z"},{"alias_kind":"arxiv_version","alias_value":"1905.06394v1","created_at":"2026-05-17T23:46:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06394","created_at":"2026-05-17T23:46:02Z"},{"alias_kind":"pith_short_12","alias_value":"V5YKMSN27EC7","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"V5YKMSN27EC7UJCU","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"V5YKMSN2","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:V5YKMSN27EC7UJCUTCEYOGOAE3","target":"record","payload":{"canonical_record":{"source":{"id":"1905.06394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-15T19:04:16Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"24a3681655082a56d9c3296573deb6df8e181a5055f33f9433b867eee4b6b7ed","abstract_canon_sha256":"37e7d724f72faae800b6b4af02bb6a7da3b2055de71f5ff8b41aa967bf6ae493"},"schema_version":"1.0"},"canonical_sha256":"af70a649baf905fa245498898719c026dc84eb9a498af48f49024c9ab36c2f42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:02.537356Z","signature_b64":"i/HSqbySzQsx/3oViCWMTQlH2Y0lbkDBRYnRncwAatN73Ik8A5q4JsZ2blyMP9baQQpC4Xvtd7W93O8yfDcOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af70a649baf905fa245498898719c026dc84eb9a498af48f49024c9ab36c2f42","last_reissued_at":"2026-05-17T23:46:02.536710Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:02.536710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.06394","source_version":1,"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-17T23:46:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yU3Ig6fms8ET6jp4KulO1efpGNCofHONTPkKlqrQXHOV5XuCIFZEDSAb4+ZGPyCpuM675aKfUZDHssYv6Ti8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:31:32.446972Z"},"content_sha256":"10383852804c9ee47c7877e0e57b1cce202ee2384e32909fabaa528070d3266a","schema_version":"1.0","event_id":"sha256:10383852804c9ee47c7877e0e57b1cce202ee2384e32909fabaa528070d3266a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:V5YKMSN27EC7UJCUTCEYOGOAE3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel $k$-means Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Manuel Fernandez, Taisuke Yasuda","submitted_at":"2019-05-15T19:04:16Z","abstract_excerpt":"We present tight lower bounds on the number of kernel evaluations required to approximately solve kernel ridge regression (KRR) and kernel $k$-means clustering (KKMC) on $n$ input points. For KRR, our bound for relative error approximation to the minimizer of the objective function is $\\Omega(nd_{\\mathrm{eff}}^\\lambda/\\varepsilon)$ where $d_{\\mathrm{eff}}^\\lambda$ is the effective statistical dimension, which is tight up to a $\\log(d_{\\mathrm{eff}}^\\lambda/\\varepsilon)$ factor. For KKMC, our bound for finding a $k$-clustering achieving a relative error approximation of the objective function i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06394","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"},"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-17T23:46:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ScuqYyZjWYT8kqh7uRGSOw3V2Z8nqBYLoSwW4Nc7Qgf0Byds+iVfOTkmx5LOn3zyWnTeILAO9qnrJpPDgeABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:31:32.447327Z"},"content_sha256":"93d3593c0ad9f0456aa28959cd6fc9b8ac4a069cb7ce79a988bdb09f1da14c70","schema_version":"1.0","event_id":"sha256:93d3593c0ad9f0456aa28959cd6fc9b8ac4a069cb7ce79a988bdb09f1da14c70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V5YKMSN27EC7UJCUTCEYOGOAE3/bundle.json","state_url":"https://pith.science/pith/V5YKMSN27EC7UJCUTCEYOGOAE3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V5YKMSN27EC7UJCUTCEYOGOAE3/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-06-08T22:31:32Z","links":{"resolver":"https://pith.science/pith/V5YKMSN27EC7UJCUTCEYOGOAE3","bundle":"https://pith.science/pith/V5YKMSN27EC7UJCUTCEYOGOAE3/bundle.json","state":"https://pith.science/pith/V5YKMSN27EC7UJCUTCEYOGOAE3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V5YKMSN27EC7UJCUTCEYOGOAE3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:V5YKMSN27EC7UJCUTCEYOGOAE3","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":"37e7d724f72faae800b6b4af02bb6a7da3b2055de71f5ff8b41aa967bf6ae493","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-15T19:04:16Z","title_canon_sha256":"24a3681655082a56d9c3296573deb6df8e181a5055f33f9433b867eee4b6b7ed"},"schema_version":"1.0","source":{"id":"1905.06394","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.06394","created_at":"2026-05-17T23:46:02Z"},{"alias_kind":"arxiv_version","alias_value":"1905.06394v1","created_at":"2026-05-17T23:46:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06394","created_at":"2026-05-17T23:46:02Z"},{"alias_kind":"pith_short_12","alias_value":"V5YKMSN27EC7","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"V5YKMSN27EC7UJCU","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"V5YKMSN2","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:93d3593c0ad9f0456aa28959cd6fc9b8ac4a069cb7ce79a988bdb09f1da14c70","target":"graph","created_at":"2026-05-17T23:46:02Z","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":"We present tight lower bounds on the number of kernel evaluations required to approximately solve kernel ridge regression (KRR) and kernel $k$-means clustering (KKMC) on $n$ input points. For KRR, our bound for relative error approximation to the minimizer of the objective function is $\\Omega(nd_{\\mathrm{eff}}^\\lambda/\\varepsilon)$ where $d_{\\mathrm{eff}}^\\lambda$ is the effective statistical dimension, which is tight up to a $\\log(d_{\\mathrm{eff}}^\\lambda/\\varepsilon)$ factor. For KKMC, our bound for finding a $k$-clustering achieving a relative error approximation of the objective function i","authors_text":"David P. Woodruff, Manuel Fernandez, Taisuke Yasuda","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-15T19:04:16Z","title":"Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel $k$-means Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06394","kind":"arxiv","version":1},"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:10383852804c9ee47c7877e0e57b1cce202ee2384e32909fabaa528070d3266a","target":"record","created_at":"2026-05-17T23:46:02Z","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":"37e7d724f72faae800b6b4af02bb6a7da3b2055de71f5ff8b41aa967bf6ae493","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-15T19:04:16Z","title_canon_sha256":"24a3681655082a56d9c3296573deb6df8e181a5055f33f9433b867eee4b6b7ed"},"schema_version":"1.0","source":{"id":"1905.06394","kind":"arxiv","version":1}},"canonical_sha256":"af70a649baf905fa245498898719c026dc84eb9a498af48f49024c9ab36c2f42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af70a649baf905fa245498898719c026dc84eb9a498af48f49024c9ab36c2f42","first_computed_at":"2026-05-17T23:46:02.536710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:02.536710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i/HSqbySzQsx/3oViCWMTQlH2Y0lbkDBRYnRncwAatN73Ik8A5q4JsZ2blyMP9baQQpC4Xvtd7W93O8yfDcOAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:02.537356Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.06394","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10383852804c9ee47c7877e0e57b1cce202ee2384e32909fabaa528070d3266a","sha256:93d3593c0ad9f0456aa28959cd6fc9b8ac4a069cb7ce79a988bdb09f1da14c70"],"state_sha256":"ba59e9d1fca4885ae975e02f32f5deec374704ae83f83a93d4f5978e070b5c6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NJM5drPzYmUs+t50mFlNSkwP8iM1QXl8qwaPRwbsPpxSOjej0O9JkJrk6io8UUtXu+PYk4YvzWhQW76kTlicBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:31:32.449248Z","bundle_sha256":"6391b280b279be7e8ea4fbf64bcd84f2679a2925ea1d1b9a4cfb28f0f2834e18"}}