{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:4QFF5TSWGFJAWM2WW6V2MIGJYV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b33ea06ee2901416ca7f1c3be9bd0919d485499333e7487028b86be0c2a61962","cross_cats_sorted":["math.FA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-03-14T15:41:05Z","title_canon_sha256":"60b193f46d10b105f2ead0cf83cbff813cbf570db5bf984b02b189526aa6037a"},"schema_version":"1.0","source":{"id":"2303.07984","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.07984","created_at":"2026-07-05T07:30:47Z"},{"alias_kind":"arxiv_version","alias_value":"2303.07984v2","created_at":"2026-07-05T07:30:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.07984","created_at":"2026-07-05T07:30:47Z"},{"alias_kind":"pith_short_12","alias_value":"4QFF5TSWGFJA","created_at":"2026-07-05T07:30:47Z"},{"alias_kind":"pith_short_16","alias_value":"4QFF5TSWGFJAWM2W","created_at":"2026-07-05T07:30:47Z"},{"alias_kind":"pith_short_8","alias_value":"4QFF5TSW","created_at":"2026-07-05T07:30:47Z"}],"graph_snapshots":[{"event_id":"sha256:354620bf932f9c7b60839bb13bc8ff4af106a80aa3f452144bece7b2650f97cf","target":"graph","created_at":"2026-07-05T07:30:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2303.07984/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 $","authors_text":"Jian-Feng Cai, Zhiqiang Xu, Zili Xu","cross_cats":["math.FA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-03-14T15:41:05Z","title":"Interlacing Polynomial Method for the Column Subset Selection Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.07984","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:31de5313bd6172453bf70819cb8725fda345cfdabe146f2b46aa4c329fca4248","target":"record","created_at":"2026-07-05T07:30:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b33ea06ee2901416ca7f1c3be9bd0919d485499333e7487028b86be0c2a61962","cross_cats_sorted":["math.FA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-03-14T15:41:05Z","title_canon_sha256":"60b193f46d10b105f2ead0cf83cbff813cbf570db5bf984b02b189526aa6037a"},"schema_version":"1.0","source":{"id":"2303.07984","kind":"arxiv","version":2}},"canonical_sha256":"e40a5ece5631520b3356b7aba620c9c5453388c4f93e6f9aaeb4d2c255e538cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e40a5ece5631520b3356b7aba620c9c5453388c4f93e6f9aaeb4d2c255e538cc","first_computed_at":"2026-07-05T07:30:47.360948Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:30:47.360948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NhHnCsv9mX1tBnYiHz7FTFZ51gh/um+BIrkUF5x5n18dYZ4vaf4WREPncYj6MtQz+fFGmeqLYZ1lhJ/sT6g9CA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:30:47.361414Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.07984","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31de5313bd6172453bf70819cb8725fda345cfdabe146f2b46aa4c329fca4248","sha256:354620bf932f9c7b60839bb13bc8ff4af106a80aa3f452144bece7b2650f97cf"],"state_sha256":"b5c7b4733b312fada862a7587225bae794c81a1dc80efe46e88f244065c10dec"}