{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:FDBRP6V6TRINERAYUJK2OXMG2N","short_pith_number":"pith:FDBRP6V6","schema_version":"1.0","canonical_sha256":"28c317fabe9c50d24418a255a75d86d3682f231b9ca00918ca0620185a2d268c","source":{"kind":"arxiv","id":"0812.4293","version":2},"attestation_state":"computed","paper":{"title":"An Improved Approximation Algorithm for the Column Subset Selection Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christos Boutsidis, Michael W. Mahoney, Petros Drineas","submitted_at":"2008-12-22T21:16:55Z","abstract_excerpt":"We consider the problem of selecting the best subset of exactly $k$ columns from an $m \\times n$ matrix $A$. We present and analyze a novel two-stage algorithm that runs in $O(\\min\\{mn^2,m^2n\\})$ time and returns as output an $m \\times k$ matrix $C$ consisting of exactly $k$ columns of $A$. In the first (randomized) stage, the algorithm randomly selects $\\Theta(k \\log k)$ columns according to a judiciously-chosen probability distribution that depends on information in the top-$k$ right singular subspace of $A$. In the second (deterministic) stage, the algorithm applies a deterministic column-s"},"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":"0812.4293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-12-22T21:16:55Z","cross_cats_sorted":[],"title_canon_sha256":"4baa873f081ca24bba7dd5ab2ee5ac15c66b29bd9a9b5c1fd76e1d531abab047","abstract_canon_sha256":"dbd3b352574c537250fb476ce6e1e8a103e9fced9799d9b63d06f41f982cb457"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:56.636799Z","signature_b64":"qb9A1syPVkb/dQcgzVCFdISnIQ95YITj+X2ndUfU3olu8M2FecSn+E6N2I4xHl+gk3HVu2eAzN3RCFkjXAN5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28c317fabe9c50d24418a255a75d86d3682f231b9ca00918ca0620185a2d268c","last_reissued_at":"2026-05-18T02:24:56.636130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:56.636130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Approximation Algorithm for the Column Subset Selection Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christos Boutsidis, Michael W. Mahoney, Petros Drineas","submitted_at":"2008-12-22T21:16:55Z","abstract_excerpt":"We consider the problem of selecting the best subset of exactly $k$ columns from an $m \\times n$ matrix $A$. We present and analyze a novel two-stage algorithm that runs in $O(\\min\\{mn^2,m^2n\\})$ time and returns as output an $m \\times k$ matrix $C$ consisting of exactly $k$ columns of $A$. In the first (randomized) stage, the algorithm randomly selects $\\Theta(k \\log k)$ columns according to a judiciously-chosen probability distribution that depends on information in the top-$k$ right singular subspace of $A$. In the second (deterministic) stage, the algorithm applies a deterministic column-s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0812.4293","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":""},"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":"0812.4293","created_at":"2026-05-18T02:24:56.636226+00:00"},{"alias_kind":"arxiv_version","alias_value":"0812.4293v2","created_at":"2026-05-18T02:24:56.636226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.4293","created_at":"2026-05-18T02:24:56.636226+00:00"},{"alias_kind":"pith_short_12","alias_value":"FDBRP6V6TRIN","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"FDBRP6V6TRINERAY","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"FDBRP6V6","created_at":"2026-05-18T12:25:57.157939+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FDBRP6V6TRINERAYUJK2OXMG2N","json":"https://pith.science/pith/FDBRP6V6TRINERAYUJK2OXMG2N.json","graph_json":"https://pith.science/api/pith-number/FDBRP6V6TRINERAYUJK2OXMG2N/graph.json","events_json":"https://pith.science/api/pith-number/FDBRP6V6TRINERAYUJK2OXMG2N/events.json","paper":"https://pith.science/paper/FDBRP6V6"},"agent_actions":{"view_html":"https://pith.science/pith/FDBRP6V6TRINERAYUJK2OXMG2N","download_json":"https://pith.science/pith/FDBRP6V6TRINERAYUJK2OXMG2N.json","view_paper":"https://pith.science/paper/FDBRP6V6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0812.4293&json=true","fetch_graph":"https://pith.science/api/pith-number/FDBRP6V6TRINERAYUJK2OXMG2N/graph.json","fetch_events":"https://pith.science/api/pith-number/FDBRP6V6TRINERAYUJK2OXMG2N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FDBRP6V6TRINERAYUJK2OXMG2N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FDBRP6V6TRINERAYUJK2OXMG2N/action/storage_attestation","attest_author":"https://pith.science/pith/FDBRP6V6TRINERAYUJK2OXMG2N/action/author_attestation","sign_citation":"https://pith.science/pith/FDBRP6V6TRINERAYUJK2OXMG2N/action/citation_signature","submit_replication":"https://pith.science/pith/FDBRP6V6TRINERAYUJK2OXMG2N/action/replication_record"}},"created_at":"2026-05-18T02:24:56.636226+00:00","updated_at":"2026-05-18T02:24:56.636226+00:00"}