{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:R4LJGHPXMTK57IVMD2FO2QXETP","short_pith_number":"pith:R4LJGHPX","schema_version":"1.0","canonical_sha256":"8f16931df764d5dfa2ac1e8aed42e49bd37594dac1c8c3ced9baa876f57e9a07","source":{"kind":"arxiv","id":"0912.1403","version":2},"attestation_state":"computed","paper":{"title":"Algorithms and Hardness for Subspace Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Amit Deshpande, Kasturi Varadarajan, Madhur Tulsiani, Nisheeth K. Vishnoi","submitted_at":"2009-12-08T04:54:17Z","abstract_excerpt":"The subspace approximation problem Subspace($k$,$p$) asks for a $k$-dimensional linear subspace that fits a given set of points optimally, where the error for fitting is a generalization of the least squares fit and uses the $\\ell_{p}$ norm instead. Most of the previous work on subspace approximation has focused on small or constant $k$ and $p$, using coresets and sampling techniques from computational geometry.\n  In this paper, extending another line of work based on convex relaxation and rounding, we give a polynomial time algorithm, \\emph{for any $k$ and any $p \\geq 2$}, with the approximat"},"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":"0912.1403","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-12-08T04:54:17Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7913dbcde2aee687c5842c57d5e1d6e0f0791bc7b1550a0fbd5eca3acfc54ebc","abstract_canon_sha256":"36093c427a9edfcdf98bd24b883d52b5456d47dc819cb70e6c3dfc3a02067459"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:19.598846Z","signature_b64":"FEiKdJpv6wCFQ+lWdif5iDFknEzp+yAQf/S5R5HQJ1nrQa++VxBNYLuj/h3Q7eV9s8a0A/zznbK4qpOw/t9vCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f16931df764d5dfa2ac1e8aed42e49bd37594dac1c8c3ced9baa876f57e9a07","last_reissued_at":"2026-05-18T04:32:19.598158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:19.598158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms and Hardness for Subspace Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Amit Deshpande, Kasturi Varadarajan, Madhur Tulsiani, Nisheeth K. Vishnoi","submitted_at":"2009-12-08T04:54:17Z","abstract_excerpt":"The subspace approximation problem Subspace($k$,$p$) asks for a $k$-dimensional linear subspace that fits a given set of points optimally, where the error for fitting is a generalization of the least squares fit and uses the $\\ell_{p}$ norm instead. Most of the previous work on subspace approximation has focused on small or constant $k$ and $p$, using coresets and sampling techniques from computational geometry.\n  In this paper, extending another line of work based on convex relaxation and rounding, we give a polynomial time algorithm, \\emph{for any $k$ and any $p \\geq 2$}, with the approximat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.1403","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":"0912.1403","created_at":"2026-05-18T04:32:19.598257+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.1403v2","created_at":"2026-05-18T04:32:19.598257+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.1403","created_at":"2026-05-18T04:32:19.598257+00:00"},{"alias_kind":"pith_short_12","alias_value":"R4LJGHPXMTK5","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"R4LJGHPXMTK57IVM","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"R4LJGHPX","created_at":"2026-05-18T12:26:01.383474+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/R4LJGHPXMTK57IVMD2FO2QXETP","json":"https://pith.science/pith/R4LJGHPXMTK57IVMD2FO2QXETP.json","graph_json":"https://pith.science/api/pith-number/R4LJGHPXMTK57IVMD2FO2QXETP/graph.json","events_json":"https://pith.science/api/pith-number/R4LJGHPXMTK57IVMD2FO2QXETP/events.json","paper":"https://pith.science/paper/R4LJGHPX"},"agent_actions":{"view_html":"https://pith.science/pith/R4LJGHPXMTK57IVMD2FO2QXETP","download_json":"https://pith.science/pith/R4LJGHPXMTK57IVMD2FO2QXETP.json","view_paper":"https://pith.science/paper/R4LJGHPX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.1403&json=true","fetch_graph":"https://pith.science/api/pith-number/R4LJGHPXMTK57IVMD2FO2QXETP/graph.json","fetch_events":"https://pith.science/api/pith-number/R4LJGHPXMTK57IVMD2FO2QXETP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R4LJGHPXMTK57IVMD2FO2QXETP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R4LJGHPXMTK57IVMD2FO2QXETP/action/storage_attestation","attest_author":"https://pith.science/pith/R4LJGHPXMTK57IVMD2FO2QXETP/action/author_attestation","sign_citation":"https://pith.science/pith/R4LJGHPXMTK57IVMD2FO2QXETP/action/citation_signature","submit_replication":"https://pith.science/pith/R4LJGHPXMTK57IVMD2FO2QXETP/action/replication_record"}},"created_at":"2026-05-18T04:32:19.598257+00:00","updated_at":"2026-05-18T04:32:19.598257+00:00"}