{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GRO7U7MBC6YBLP2K6XDF2N26YO","short_pith_number":"pith:GRO7U7MB","schema_version":"1.0","canonical_sha256":"345dfa7d8117b015bf4af5c65d375ec3a8c60de991968025538e54c2ab98cdc6","source":{"kind":"arxiv","id":"2308.09068","version":2},"attestation_state":"computed","paper":{"title":"Close to optimal column approximations with a single SVD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alexander Osinsky","submitted_at":"2023-08-17T15:54:41Z","abstract_excerpt":"The best column approximation in the Frobenius norm with $r$ columns has an error at most $\\sqrt{r+1}$ times larger than the truncated singular value decomposition. Reaching this bound in practice involves either expensive random volume sampling or at least $r$ executions of singular value decomposition. In this paper it will be shown that the same column approximation bound can be reached with only a single SVD (which can also be replaced with approximate SVD). As a corollary, it will be shown how to find a highly nondegenerate submatrix in $r$ rows of size $N$ in just $O(Nr^2)$ operations, w"},"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":"2308.09068","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-08-17T15:54:41Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"14ca38c338034d7a2723ef03c41ae244b364e0b2fcb411c32a0cae2872e62729","abstract_canon_sha256":"f2bcc389a5b26a029cbd7b2e85df3b9fd87fbf7fb367e9dd1b0829060f5d30d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:09:51.557165Z","signature_b64":"Mocz1dDEwmO1yj19PwRt0x/j+QA3axAlJbtCd4yR1Q8afRF6AI30ZfEa7dfxi2T1gYrxa7nL/F59svkAOu46Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"345dfa7d8117b015bf4af5c65d375ec3a8c60de991968025538e54c2ab98cdc6","last_reissued_at":"2026-07-05T07:09:51.556671Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:09:51.556671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Close to optimal column approximations with a single SVD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alexander Osinsky","submitted_at":"2023-08-17T15:54:41Z","abstract_excerpt":"The best column approximation in the Frobenius norm with $r$ columns has an error at most $\\sqrt{r+1}$ times larger than the truncated singular value decomposition. Reaching this bound in practice involves either expensive random volume sampling or at least $r$ executions of singular value decomposition. In this paper it will be shown that the same column approximation bound can be reached with only a single SVD (which can also be replaced with approximate SVD). As a corollary, it will be shown how to find a highly nondegenerate submatrix in $r$ rows of size $N$ in just $O(Nr^2)$ operations, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.09068","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.09068/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2308.09068","created_at":"2026-07-05T07:09:51.556728+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.09068v2","created_at":"2026-07-05T07:09:51.556728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.09068","created_at":"2026-07-05T07:09:51.556728+00:00"},{"alias_kind":"pith_short_12","alias_value":"GRO7U7MBC6YB","created_at":"2026-07-05T07:09:51.556728+00:00"},{"alias_kind":"pith_short_16","alias_value":"GRO7U7MBC6YBLP2K","created_at":"2026-07-05T07:09:51.556728+00:00"},{"alias_kind":"pith_short_8","alias_value":"GRO7U7MB","created_at":"2026-07-05T07:09:51.556728+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26688","citing_title":"Adaptive Randomized Pivoting for Tensor Singular Value Decomposition Model","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GRO7U7MBC6YBLP2K6XDF2N26YO","json":"https://pith.science/pith/GRO7U7MBC6YBLP2K6XDF2N26YO.json","graph_json":"https://pith.science/api/pith-number/GRO7U7MBC6YBLP2K6XDF2N26YO/graph.json","events_json":"https://pith.science/api/pith-number/GRO7U7MBC6YBLP2K6XDF2N26YO/events.json","paper":"https://pith.science/paper/GRO7U7MB"},"agent_actions":{"view_html":"https://pith.science/pith/GRO7U7MBC6YBLP2K6XDF2N26YO","download_json":"https://pith.science/pith/GRO7U7MBC6YBLP2K6XDF2N26YO.json","view_paper":"https://pith.science/paper/GRO7U7MB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.09068&json=true","fetch_graph":"https://pith.science/api/pith-number/GRO7U7MBC6YBLP2K6XDF2N26YO/graph.json","fetch_events":"https://pith.science/api/pith-number/GRO7U7MBC6YBLP2K6XDF2N26YO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GRO7U7MBC6YBLP2K6XDF2N26YO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GRO7U7MBC6YBLP2K6XDF2N26YO/action/storage_attestation","attest_author":"https://pith.science/pith/GRO7U7MBC6YBLP2K6XDF2N26YO/action/author_attestation","sign_citation":"https://pith.science/pith/GRO7U7MBC6YBLP2K6XDF2N26YO/action/citation_signature","submit_replication":"https://pith.science/pith/GRO7U7MBC6YBLP2K6XDF2N26YO/action/replication_record"}},"created_at":"2026-07-05T07:09:51.556728+00:00","updated_at":"2026-07-05T07:09:51.556728+00:00"}