{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4QFF5TSWGFJAWM2WW6V2MIGJYV","short_pith_number":"pith:4QFF5TSW","schema_version":"1.0","canonical_sha256":"e40a5ece5631520b3356b7aba620c9c5453388c4f93e6f9aaeb4d2c255e538cc","source":{"kind":"arxiv","id":"2303.07984","version":2},"attestation_state":"computed","paper":{"title":"Interlacing Polynomial Method for the Column Subset Selection Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"cs.DS","authors_text":"Jian-Feng Cai, Zhiqiang Xu, Zili Xu","submitted_at":"2023-03-14T15:41:05Z","abstract_excerpt":"This paper investigates the spectral norm version of the column subset selection problem. Given a matrix $\\mathbf{A}\\in\\mathbb{R}^{n\\times d}$ and a positive integer $k\\leq\\text{rank}(\\mathbf{A})$, the objective is to select exactly $k$ columns of $\\mathbf{A}$ that minimize the spectral norm of the residual matrix after projecting $\\mathbf{A}$ onto the space spanned by the selected columns. We use the method of interlacing polynomials introduced by Marcus-Spielman-Srivastava to derive a new upper bound on the minimal approximation error. This new bound is asymptotically sharp when the matrix $"},"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":"2303.07984","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-03-14T15:41:05Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"60b193f46d10b105f2ead0cf83cbff813cbf570db5bf984b02b189526aa6037a","abstract_canon_sha256":"b33ea06ee2901416ca7f1c3be9bd0919d485499333e7487028b86be0c2a61962"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:30:47.361414Z","signature_b64":"NhHnCsv9mX1tBnYiHz7FTFZ51gh/um+BIrkUF5x5n18dYZ4vaf4WREPncYj6MtQz+fFGmeqLYZ1lhJ/sT6g9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e40a5ece5631520b3356b7aba620c9c5453388c4f93e6f9aaeb4d2c255e538cc","last_reissued_at":"2026-07-05T07:30:47.360948Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:30:47.360948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interlacing Polynomial Method for the Column Subset Selection Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"cs.DS","authors_text":"Jian-Feng Cai, Zhiqiang Xu, Zili Xu","submitted_at":"2023-03-14T15:41:05Z","abstract_excerpt":"This paper investigates the spectral norm version of the column subset selection problem. Given a matrix $\\mathbf{A}\\in\\mathbb{R}^{n\\times d}$ and a positive integer $k\\leq\\text{rank}(\\mathbf{A})$, the objective is to select exactly $k$ columns of $\\mathbf{A}$ that minimize the spectral norm of the residual matrix after projecting $\\mathbf{A}$ onto the space spanned by the selected columns. We use the method of interlacing polynomials introduced by Marcus-Spielman-Srivastava to derive a new upper bound on the minimal approximation error. This new bound is asymptotically sharp when the matrix $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.07984","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/2303.07984/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":"2303.07984","created_at":"2026-07-05T07:30:47.361011+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.07984v2","created_at":"2026-07-05T07:30:47.361011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.07984","created_at":"2026-07-05T07:30:47.361011+00:00"},{"alias_kind":"pith_short_12","alias_value":"4QFF5TSWGFJA","created_at":"2026-07-05T07:30:47.361011+00:00"},{"alias_kind":"pith_short_16","alias_value":"4QFF5TSWGFJAWM2W","created_at":"2026-07-05T07:30:47.361011+00:00"},{"alias_kind":"pith_short_8","alias_value":"4QFF5TSW","created_at":"2026-07-05T07:30:47.361011+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/4QFF5TSWGFJAWM2WW6V2MIGJYV","json":"https://pith.science/pith/4QFF5TSWGFJAWM2WW6V2MIGJYV.json","graph_json":"https://pith.science/api/pith-number/4QFF5TSWGFJAWM2WW6V2MIGJYV/graph.json","events_json":"https://pith.science/api/pith-number/4QFF5TSWGFJAWM2WW6V2MIGJYV/events.json","paper":"https://pith.science/paper/4QFF5TSW"},"agent_actions":{"view_html":"https://pith.science/pith/4QFF5TSWGFJAWM2WW6V2MIGJYV","download_json":"https://pith.science/pith/4QFF5TSWGFJAWM2WW6V2MIGJYV.json","view_paper":"https://pith.science/paper/4QFF5TSW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.07984&json=true","fetch_graph":"https://pith.science/api/pith-number/4QFF5TSWGFJAWM2WW6V2MIGJYV/graph.json","fetch_events":"https://pith.science/api/pith-number/4QFF5TSWGFJAWM2WW6V2MIGJYV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4QFF5TSWGFJAWM2WW6V2MIGJYV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4QFF5TSWGFJAWM2WW6V2MIGJYV/action/storage_attestation","attest_author":"https://pith.science/pith/4QFF5TSWGFJAWM2WW6V2MIGJYV/action/author_attestation","sign_citation":"https://pith.science/pith/4QFF5TSWGFJAWM2WW6V2MIGJYV/action/citation_signature","submit_replication":"https://pith.science/pith/4QFF5TSWGFJAWM2WW6V2MIGJYV/action/replication_record"}},"created_at":"2026-07-05T07:30:47.361011+00:00","updated_at":"2026-07-05T07:30:47.361011+00:00"}