{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:KBHGJ5DTAWLPTA6Z56JBO5WH3G","short_pith_number":"pith:KBHGJ5DT","canonical_record":{"source":{"id":"2002.09073","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-21T00:43:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d49f3e14a4b4204a8534450457eb0b4ac66e6e7b8687567c65b8967e11650a02","abstract_canon_sha256":"7d723674ee8592ba12c6d8ec446bcc2d6e08e3a86fb25cff787908ac12140535"},"schema_version":"1.0"},"canonical_sha256":"504e64f4730596f983d9ef921776c7d9bf5864ee639c666c3e8705970767713f","source":{"kind":"arxiv","id":"2002.09073","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.09073","created_at":"2026-07-05T02:00:43Z"},{"alias_kind":"arxiv_version","alias_value":"2002.09073v3","created_at":"2026-07-05T02:00:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.09073","created_at":"2026-07-05T02:00:43Z"},{"alias_kind":"pith_short_12","alias_value":"KBHGJ5DTAWLP","created_at":"2026-07-05T02:00:43Z"},{"alias_kind":"pith_short_16","alias_value":"KBHGJ5DTAWLPTA6Z","created_at":"2026-07-05T02:00:43Z"},{"alias_kind":"pith_short_8","alias_value":"KBHGJ5DT","created_at":"2026-07-05T02:00:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:KBHGJ5DTAWLPTA6Z56JBO5WH3G","target":"record","payload":{"canonical_record":{"source":{"id":"2002.09073","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-21T00:43:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d49f3e14a4b4204a8534450457eb0b4ac66e6e7b8687567c65b8967e11650a02","abstract_canon_sha256":"7d723674ee8592ba12c6d8ec446bcc2d6e08e3a86fb25cff787908ac12140535"},"schema_version":"1.0"},"canonical_sha256":"504e64f4730596f983d9ef921776c7d9bf5864ee639c666c3e8705970767713f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:00:43.862541Z","signature_b64":"Os2zhGsgbLOZ0ZH4i9GKuE2oeU1DyNOn9CXnF/UwLZ2edLBVGGRbubZbAtaN8+paazSjdkKcW7sGC9AC9H+9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"504e64f4730596f983d9ef921776c7d9bf5864ee639c666c3e8705970767713f","last_reissued_at":"2026-07-05T02:00:43.862148Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:00:43.862148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.09073","source_version":3,"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-07-05T02:00:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"58VqxlgZnl4bVU2XtWjoP/isJi5fneifUjngCD3bUAamHMUcnJ+yldg5xf2QCR7ld1d7unsKhPw6l+wqnnPADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T00:04:10.763518Z"},"content_sha256":"a4a26048d97995ca64ba369507980ce7178386688eb451bd6ac8cb86ade6893e","schema_version":"1.0","event_id":"sha256:a4a26048d97995ca64ba369507980ce7178386688eb451bd6ac8cb86ade6893e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:KBHGJ5DTAWLPTA6Z56JBO5WH3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved guarantees and a multiple-descent curve for Column Subset Selection and the Nystr\\\"om method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Michael W. Mahoney, Micha{\\l} Derezi\\'nski, Rajiv Khanna","submitted_at":"2020-02-21T00:43:06Z","abstract_excerpt":"The Column Subset Selection Problem (CSSP) and the Nystr\\\"om method are among the leading tools for constructing small low-rank approximations of large datasets in machine learning and scientific computing. A fundamental question in this area is: how well can a data subset of size k compete with the best rank k approximation? We develop techniques which exploit spectral properties of the data matrix to obtain improved approximation guarantees which go beyond the standard worst-case analysis. Our approach leads to significantly better bounds for datasets with known rates of singular value decay"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.09073","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.09073/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:00:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HZUcv0ripyulbhJM5MNWW+xb72gInO/xdymUDiAGez1vrtNOpVHtbvipuw0oZzBAj0m1UzZN+Yk4Z6Xsds7WDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T00:04:10.764427Z"},"content_sha256":"629a0e85e070d64a665d52e26d21c4923fe0bb91b8d5332aa859c21bc96d68d1","schema_version":"1.0","event_id":"sha256:629a0e85e070d64a665d52e26d21c4923fe0bb91b8d5332aa859c21bc96d68d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KBHGJ5DTAWLPTA6Z56JBO5WH3G/bundle.json","state_url":"https://pith.science/pith/KBHGJ5DTAWLPTA6Z56JBO5WH3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KBHGJ5DTAWLPTA6Z56JBO5WH3G/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-08-18T00:04:10Z","links":{"resolver":"https://pith.science/pith/KBHGJ5DTAWLPTA6Z56JBO5WH3G","bundle":"https://pith.science/pith/KBHGJ5DTAWLPTA6Z56JBO5WH3G/bundle.json","state":"https://pith.science/pith/KBHGJ5DTAWLPTA6Z56JBO5WH3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KBHGJ5DTAWLPTA6Z56JBO5WH3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:KBHGJ5DTAWLPTA6Z56JBO5WH3G","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":"7d723674ee8592ba12c6d8ec446bcc2d6e08e3a86fb25cff787908ac12140535","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-21T00:43:06Z","title_canon_sha256":"d49f3e14a4b4204a8534450457eb0b4ac66e6e7b8687567c65b8967e11650a02"},"schema_version":"1.0","source":{"id":"2002.09073","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.09073","created_at":"2026-07-05T02:00:43Z"},{"alias_kind":"arxiv_version","alias_value":"2002.09073v3","created_at":"2026-07-05T02:00:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.09073","created_at":"2026-07-05T02:00:43Z"},{"alias_kind":"pith_short_12","alias_value":"KBHGJ5DTAWLP","created_at":"2026-07-05T02:00:43Z"},{"alias_kind":"pith_short_16","alias_value":"KBHGJ5DTAWLPTA6Z","created_at":"2026-07-05T02:00:43Z"},{"alias_kind":"pith_short_8","alias_value":"KBHGJ5DT","created_at":"2026-07-05T02:00:43Z"}],"graph_snapshots":[{"event_id":"sha256:629a0e85e070d64a665d52e26d21c4923fe0bb91b8d5332aa859c21bc96d68d1","target":"graph","created_at":"2026-07-05T02:00:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2002.09073/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Column Subset Selection Problem (CSSP) and the Nystr\\\"om method are among the leading tools for constructing small low-rank approximations of large datasets in machine learning and scientific computing. A fundamental question in this area is: how well can a data subset of size k compete with the best rank k approximation? We develop techniques which exploit spectral properties of the data matrix to obtain improved approximation guarantees which go beyond the standard worst-case analysis. Our approach leads to significantly better bounds for datasets with known rates of singular value decay","authors_text":"Michael W. Mahoney, Micha{\\l} Derezi\\'nski, Rajiv Khanna","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-21T00:43:06Z","title":"Improved guarantees and a multiple-descent curve for Column Subset Selection and the Nystr\\\"om method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.09073","kind":"arxiv","version":3},"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:a4a26048d97995ca64ba369507980ce7178386688eb451bd6ac8cb86ade6893e","target":"record","created_at":"2026-07-05T02:00:43Z","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":"7d723674ee8592ba12c6d8ec446bcc2d6e08e3a86fb25cff787908ac12140535","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-21T00:43:06Z","title_canon_sha256":"d49f3e14a4b4204a8534450457eb0b4ac66e6e7b8687567c65b8967e11650a02"},"schema_version":"1.0","source":{"id":"2002.09073","kind":"arxiv","version":3}},"canonical_sha256":"504e64f4730596f983d9ef921776c7d9bf5864ee639c666c3e8705970767713f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"504e64f4730596f983d9ef921776c7d9bf5864ee639c666c3e8705970767713f","first_computed_at":"2026-07-05T02:00:43.862148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:00:43.862148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Os2zhGsgbLOZ0ZH4i9GKuE2oeU1DyNOn9CXnF/UwLZ2edLBVGGRbubZbAtaN8+paazSjdkKcW7sGC9AC9H+9CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:00:43.862541Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.09073","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4a26048d97995ca64ba369507980ce7178386688eb451bd6ac8cb86ade6893e","sha256:629a0e85e070d64a665d52e26d21c4923fe0bb91b8d5332aa859c21bc96d68d1"],"state_sha256":"4cf08f05ef57b8aa5cf7b9a33e7c752cee148ae2b754d47094f660f0f19cef06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xlL8MTp0eyzgW1wEexS5Vjtp7KvZvVBNGFZ2N5C0w7/v0xYRBmKvB24ng2whKKxjtYaeXBc0yDzloKNnOAodCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T00:04:10.769067Z","bundle_sha256":"c7c03762fa3e914ab45b2c3647fa696353575a4f4a80db18874ee9f6b9d1cb8a"}}