{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:EZOGBVMLQA7WLUYLRA2QA3IGRM","short_pith_number":"pith:EZOGBVML","schema_version":"1.0","canonical_sha256":"265c60d58b803f65d30b8835006d068b0e129ab2696c7ef61b14ab925f8eaec9","source":{"kind":"arxiv","id":"1110.5305","version":1},"attestation_state":"computed","paper":{"title":"The spectral norm error of the naive Nystrom extension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alex Gittens","submitted_at":"2011-10-24T18:57:57Z","abstract_excerpt":"The naive Nystrom extension forms a low-rank approximation to a positive-semidefinite matrix by uniformly randomly sampling from its columns. This paper provides the first relative-error bound on the spectral norm error incurred in this process. This bound follows from a natural connection between the Nystrom extension and the column subset selection problem. The main tool is a matrix Chernoff bound for sampling without replacement."},"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":"1110.5305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-10-24T18:57:57Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"a7c64729b72f0bff159a0986e73f02a159d2d3887d374333de8ffc717345545d","abstract_canon_sha256":"b432b87142f9b37899b2f3e16a1da037fd682d747dcac7ccb1e17bd5702f84ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:24.169953Z","signature_b64":"M8DYOJZdQHuYB1kqoiuRdhm3/HOC5e+B3oBKiRrWtODyocZi5GgIg9HfxjNfNjQali6NzVZcmf3UmawNNrv0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"265c60d58b803f65d30b8835006d068b0e129ab2696c7ef61b14ab925f8eaec9","last_reissued_at":"2026-05-18T04:10:24.169194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:24.169194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The spectral norm error of the naive Nystrom extension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alex Gittens","submitted_at":"2011-10-24T18:57:57Z","abstract_excerpt":"The naive Nystrom extension forms a low-rank approximation to a positive-semidefinite matrix by uniformly randomly sampling from its columns. This paper provides the first relative-error bound on the spectral norm error incurred in this process. This bound follows from a natural connection between the Nystrom extension and the column subset selection problem. The main tool is a matrix Chernoff bound for sampling without replacement."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5305","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1110.5305","created_at":"2026-05-18T04:10:24.169314+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.5305v1","created_at":"2026-05-18T04:10:24.169314+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5305","created_at":"2026-05-18T04:10:24.169314+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZOGBVMLQA7W","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZOGBVMLQA7WLUYL","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZOGBVML","created_at":"2026-05-18T12:26:28.662955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.19096","citing_title":"Sharp analysis of sketched least squares and randomized low-rank approximation","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EZOGBVMLQA7WLUYLRA2QA3IGRM","json":"https://pith.science/pith/EZOGBVMLQA7WLUYLRA2QA3IGRM.json","graph_json":"https://pith.science/api/pith-number/EZOGBVMLQA7WLUYLRA2QA3IGRM/graph.json","events_json":"https://pith.science/api/pith-number/EZOGBVMLQA7WLUYLRA2QA3IGRM/events.json","paper":"https://pith.science/paper/EZOGBVML"},"agent_actions":{"view_html":"https://pith.science/pith/EZOGBVMLQA7WLUYLRA2QA3IGRM","download_json":"https://pith.science/pith/EZOGBVMLQA7WLUYLRA2QA3IGRM.json","view_paper":"https://pith.science/paper/EZOGBVML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.5305&json=true","fetch_graph":"https://pith.science/api/pith-number/EZOGBVMLQA7WLUYLRA2QA3IGRM/graph.json","fetch_events":"https://pith.science/api/pith-number/EZOGBVMLQA7WLUYLRA2QA3IGRM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZOGBVMLQA7WLUYLRA2QA3IGRM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZOGBVMLQA7WLUYLRA2QA3IGRM/action/storage_attestation","attest_author":"https://pith.science/pith/EZOGBVMLQA7WLUYLRA2QA3IGRM/action/author_attestation","sign_citation":"https://pith.science/pith/EZOGBVMLQA7WLUYLRA2QA3IGRM/action/citation_signature","submit_replication":"https://pith.science/pith/EZOGBVMLQA7WLUYLRA2QA3IGRM/action/replication_record"}},"created_at":"2026-05-18T04:10:24.169314+00:00","updated_at":"2026-05-18T04:10:24.169314+00:00"}