{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PLQMMVXMMU5B2TRT6M5D7JDUAN","short_pith_number":"pith:PLQMMVXM","schema_version":"1.0","canonical_sha256":"7ae0c656ec653a1d4e33f33a3fa4740358b6e0ba81c20722a04f9d8f06cf7b9f","source":{"kind":"arxiv","id":"1104.1732","version":4},"attestation_state":"computed","paper":{"title":"Optimal Column-Based Low-Rank Matrix Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"cs.DS","authors_text":"Ali Kemal Sinop, Venkatesan Guruswami","submitted_at":"2011-04-09T18:40:25Z","abstract_excerpt":"We prove that for any real-valued matrix $X \\in \\R^{m \\times n}$, and positive integers $r \\ge k$, there is a subset of $r$ columns of $X$ such that projecting $X$ onto their span gives a $\\sqrt{\\frac{r+1}{r-k+1}}$-approximation to best rank-$k$ approximation of $X$ in Frobenius norm. We show that the trade-off we achieve between the number of columns and the approximation ratio is optimal up to lower order terms. Furthermore, there is a deterministic algorithm to find such a subset of columns that runs in $O(r n m^{\\omega} \\log m)$ arithmetic operations where $\\omega$ is the exponent of matri"},"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":"1104.1732","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-09T18:40:25Z","cross_cats_sorted":["math.SP"],"title_canon_sha256":"c735097b9653f153546ce6262a27a261d13f7d15a86266fdb1982711682d3da5","abstract_canon_sha256":"de7487ac63269f0c8374fc50753a93e58ce7b60c42813e8e51ddb931711634d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:10.214736Z","signature_b64":"XA7YkSDYOCqPFCHvUPUQKdsEsawXA/x/NY9yoEJY6zzLZF2eYwr2L4o6CflOT/CRgm+7GwYT93DDtAMde0IECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ae0c656ec653a1d4e33f33a3fa4740358b6e0ba81c20722a04f9d8f06cf7b9f","last_reissued_at":"2026-05-18T02:22:10.214074Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:10.214074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Column-Based Low-Rank Matrix Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"cs.DS","authors_text":"Ali Kemal Sinop, Venkatesan Guruswami","submitted_at":"2011-04-09T18:40:25Z","abstract_excerpt":"We prove that for any real-valued matrix $X \\in \\R^{m \\times n}$, and positive integers $r \\ge k$, there is a subset of $r$ columns of $X$ such that projecting $X$ onto their span gives a $\\sqrt{\\frac{r+1}{r-k+1}}$-approximation to best rank-$k$ approximation of $X$ in Frobenius norm. We show that the trade-off we achieve between the number of columns and the approximation ratio is optimal up to lower order terms. Furthermore, there is a deterministic algorithm to find such a subset of columns that runs in $O(r n m^{\\omega} \\log m)$ arithmetic operations where $\\omega$ is the exponent of matri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1732","kind":"arxiv","version":4},"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":"1104.1732","created_at":"2026-05-18T02:22:10.214164+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.1732v4","created_at":"2026-05-18T02:22:10.214164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1732","created_at":"2026-05-18T02:22:10.214164+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLQMMVXMMU5B","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLQMMVXMMU5B2TRT","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLQMMVXM","created_at":"2026-05-18T12:26:39.201973+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/PLQMMVXMMU5B2TRT6M5D7JDUAN","json":"https://pith.science/pith/PLQMMVXMMU5B2TRT6M5D7JDUAN.json","graph_json":"https://pith.science/api/pith-number/PLQMMVXMMU5B2TRT6M5D7JDUAN/graph.json","events_json":"https://pith.science/api/pith-number/PLQMMVXMMU5B2TRT6M5D7JDUAN/events.json","paper":"https://pith.science/paper/PLQMMVXM"},"agent_actions":{"view_html":"https://pith.science/pith/PLQMMVXMMU5B2TRT6M5D7JDUAN","download_json":"https://pith.science/pith/PLQMMVXMMU5B2TRT6M5D7JDUAN.json","view_paper":"https://pith.science/paper/PLQMMVXM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.1732&json=true","fetch_graph":"https://pith.science/api/pith-number/PLQMMVXMMU5B2TRT6M5D7JDUAN/graph.json","fetch_events":"https://pith.science/api/pith-number/PLQMMVXMMU5B2TRT6M5D7JDUAN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLQMMVXMMU5B2TRT6M5D7JDUAN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLQMMVXMMU5B2TRT6M5D7JDUAN/action/storage_attestation","attest_author":"https://pith.science/pith/PLQMMVXMMU5B2TRT6M5D7JDUAN/action/author_attestation","sign_citation":"https://pith.science/pith/PLQMMVXMMU5B2TRT6M5D7JDUAN/action/citation_signature","submit_replication":"https://pith.science/pith/PLQMMVXMMU5B2TRT6M5D7JDUAN/action/replication_record"}},"created_at":"2026-05-18T02:22:10.214164+00:00","updated_at":"2026-05-18T02:22:10.214164+00:00"}