{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZKPHDTSP6BZXWTRN6YOXACCUJV","short_pith_number":"pith:ZKPHDTSP","canonical_record":{"source":{"id":"1711.01596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-05T14:36:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f31951d0571800248161fffa26ea2247581c2e016a71163bad1549b2d6b76dcf","abstract_canon_sha256":"8fb00af4aba2319b1401b2becaacb310308b5f5ba5bd90d743e0b0536ca10731"},"schema_version":"1.0"},"canonical_sha256":"ca9e71ce4ff0737b4e2df61d7008544d7b92d0c6e71f9ad406524f393f2d7fad","source":{"kind":"arxiv","id":"1711.01596","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01596","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01596v1","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01596","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"pith_short_12","alias_value":"ZKPHDTSP6BZX","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZKPHDTSP6BZXWTRN","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZKPHDTSP","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZKPHDTSP6BZXWTRN6YOXACCUJV","target":"record","payload":{"canonical_record":{"source":{"id":"1711.01596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-05T14:36:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f31951d0571800248161fffa26ea2247581c2e016a71163bad1549b2d6b76dcf","abstract_canon_sha256":"8fb00af4aba2319b1401b2becaacb310308b5f5ba5bd90d743e0b0536ca10731"},"schema_version":"1.0"},"canonical_sha256":"ca9e71ce4ff0737b4e2df61d7008544d7b92d0c6e71f9ad406524f393f2d7fad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:17.346424Z","signature_b64":"06k5qGz3RZj4NbPIc2K4AXoFgFhnCurkYN987F3nCvzXfbXIll1NHrlTD3ogahUzAHc7TiFBw19ZAPDyr28DCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca9e71ce4ff0737b4e2df61d7008544d7b92d0c6e71f9ad406524f393f2d7fad","last_reissued_at":"2026-05-18T00:31:17.345618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:17.345618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.01596","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-18T00:31:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NhCOwj3pF8Yxmjs1B+e9pc+pexBJT5XHiZMsqxJb6lprqTiBsN9M7CKTrHvKZKTkQJQ6ENz4YFQN1BYnwKUAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:36:49.350741Z"},"content_sha256":"d9082846bbc7c031c7ff913c5a027469562511b621bb20059ae32501bb32d41c","schema_version":"1.0","event_id":"sha256:d9082846bbc7c031c7ff913c5a027469562511b621bb20059ae32501bb32d41c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZKPHDTSP6BZXWTRN6YOXACCUJV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Is Input Sparsity Time Possible for Kernel Low-Rank Approximation?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Cameron Musco, David P. Woodruff","submitted_at":"2017-11-05T14:36:25Z","abstract_excerpt":"Low-rank approximation is a common tool used to accelerate kernel methods: the $n \\times n$ kernel matrix $K$ is approximated via a rank-$k$ matrix $\\tilde K$ which can be stored in much less space and processed more quickly. In this work we study the limits of computationally efficient low-rank kernel approximation. We show that for a broad class of kernels, including the popular Gaussian and polynomial kernels, computing a relative error $k$-rank approximation to $K$ is at least as difficult as multiplying the input data matrix $A \\in \\mathbb{R}^{n \\times d}$ by an arbitrary matrix $C \\in \\m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01596","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-18T00:31:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ErDSCmBTS8TGfqaBwyOvul7Zys+mNYnYv6BMEdTby3hXMNdEvTgvqJjSo4tJ051QFHoA7zWizBF7o038jER3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:36:49.351075Z"},"content_sha256":"7a2db63422d39e4cab4a3730461f1932a06ca3d6a87d856012fbb6aabfde129e","schema_version":"1.0","event_id":"sha256:7a2db63422d39e4cab4a3730461f1932a06ca3d6a87d856012fbb6aabfde129e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZKPHDTSP6BZXWTRN6YOXACCUJV/bundle.json","state_url":"https://pith.science/pith/ZKPHDTSP6BZXWTRN6YOXACCUJV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZKPHDTSP6BZXWTRN6YOXACCUJV/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-20T05:36:49Z","links":{"resolver":"https://pith.science/pith/ZKPHDTSP6BZXWTRN6YOXACCUJV","bundle":"https://pith.science/pith/ZKPHDTSP6BZXWTRN6YOXACCUJV/bundle.json","state":"https://pith.science/pith/ZKPHDTSP6BZXWTRN6YOXACCUJV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZKPHDTSP6BZXWTRN6YOXACCUJV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZKPHDTSP6BZXWTRN6YOXACCUJV","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":"8fb00af4aba2319b1401b2becaacb310308b5f5ba5bd90d743e0b0536ca10731","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-05T14:36:25Z","title_canon_sha256":"f31951d0571800248161fffa26ea2247581c2e016a71163bad1549b2d6b76dcf"},"schema_version":"1.0","source":{"id":"1711.01596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01596","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01596v1","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01596","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"pith_short_12","alias_value":"ZKPHDTSP6BZX","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZKPHDTSP6BZXWTRN","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZKPHDTSP","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:7a2db63422d39e4cab4a3730461f1932a06ca3d6a87d856012fbb6aabfde129e","target":"graph","created_at":"2026-05-18T00:31:17Z","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":"Low-rank approximation is a common tool used to accelerate kernel methods: the $n \\times n$ kernel matrix $K$ is approximated via a rank-$k$ matrix $\\tilde K$ which can be stored in much less space and processed more quickly. In this work we study the limits of computationally efficient low-rank kernel approximation. We show that for a broad class of kernels, including the popular Gaussian and polynomial kernels, computing a relative error $k$-rank approximation to $K$ is at least as difficult as multiplying the input data matrix $A \\in \\mathbb{R}^{n \\times d}$ by an arbitrary matrix $C \\in \\m","authors_text":"Cameron Musco, David P. Woodruff","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-05T14:36:25Z","title":"Is Input Sparsity Time Possible for Kernel Low-Rank Approximation?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01596","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:d9082846bbc7c031c7ff913c5a027469562511b621bb20059ae32501bb32d41c","target":"record","created_at":"2026-05-18T00:31:17Z","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":"8fb00af4aba2319b1401b2becaacb310308b5f5ba5bd90d743e0b0536ca10731","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-05T14:36:25Z","title_canon_sha256":"f31951d0571800248161fffa26ea2247581c2e016a71163bad1549b2d6b76dcf"},"schema_version":"1.0","source":{"id":"1711.01596","kind":"arxiv","version":1}},"canonical_sha256":"ca9e71ce4ff0737b4e2df61d7008544d7b92d0c6e71f9ad406524f393f2d7fad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca9e71ce4ff0737b4e2df61d7008544d7b92d0c6e71f9ad406524f393f2d7fad","first_computed_at":"2026-05-18T00:31:17.345618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:17.345618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"06k5qGz3RZj4NbPIc2K4AXoFgFhnCurkYN987F3nCvzXfbXIll1NHrlTD3ogahUzAHc7TiFBw19ZAPDyr28DCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:17.346424Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9082846bbc7c031c7ff913c5a027469562511b621bb20059ae32501bb32d41c","sha256:7a2db63422d39e4cab4a3730461f1932a06ca3d6a87d856012fbb6aabfde129e"],"state_sha256":"4cac604311ce8e3d4bdfb82a99c24afc0db16d4fd7d4ba60bac5f35cceb0c6dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7dGqsLn736TJL19tzDqfP88mnHaJr+nO4Eh3MukGn7zvWw8iDFrDzuQhrN9eYTb9McIoycB4qXg89Zuuw5trCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:36:49.352886Z","bundle_sha256":"7df4aa24311c5a0b917878f28861bdd408a92fa183ed4299bcaddbe8df9df167"}}