{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:B2XNUIWOIV3YOULUYCDD64VWLX","short_pith_number":"pith:B2XNUIWO","schema_version":"1.0","canonical_sha256":"0eaeda22ce4577875174c0863f72b65dfa5d6dccb80e3694ad66840e81cff118","source":{"kind":"arxiv","id":"1804.01119","version":1},"attestation_state":"computed","paper":{"title":"Feature selection in weakly coherent matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Stephane Chretien, Zhen-Wai Olivier HO","submitted_at":"2018-04-03T18:26:46Z","abstract_excerpt":"A problem of paramount importance in both pure (Restricted Invertibility problem) and applied mathematics (Feature extraction) is the one of selecting a submatrix of a given matrix, such that this submatrix has its smallest singular value above a specified level. Such problems can be addressed using perturbation analysis. In this paper, we propose a perturbation bound for the smallest singular value of a given matrix after appending a column, under the assumption that its initial coherence is not large, and we use this bound to derive a fast algorithm for feature extraction."},"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":"1804.01119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-03T18:26:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f55b4cd62a980d839f5bfde1ca10dfb7fd1017e8df28c00983e8454b804ee782","abstract_canon_sha256":"fecec9943033a7c9cadcd226ba01a99d41e92b92069ac9e453ab8cf95398a661"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:16.060238Z","signature_b64":"9yYkFMwkGukZTWEdMHseqOOhR0Qm9SVQyigKs1b5pkTnrKTnySXfmnPZ0ch6kPHUTTiW0Q8APxaVhDMGwIpDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0eaeda22ce4577875174c0863f72b65dfa5d6dccb80e3694ad66840e81cff118","last_reissued_at":"2026-05-18T00:19:16.059729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:16.059729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feature selection in weakly coherent matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Stephane Chretien, Zhen-Wai Olivier HO","submitted_at":"2018-04-03T18:26:46Z","abstract_excerpt":"A problem of paramount importance in both pure (Restricted Invertibility problem) and applied mathematics (Feature extraction) is the one of selecting a submatrix of a given matrix, such that this submatrix has its smallest singular value above a specified level. Such problems can be addressed using perturbation analysis. In this paper, we propose a perturbation bound for the smallest singular value of a given matrix after appending a column, under the assumption that its initial coherence is not large, and we use this bound to derive a fast algorithm for feature extraction."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01119","kind":"arxiv","version":1},"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":"1804.01119","created_at":"2026-05-18T00:19:16.059815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.01119v1","created_at":"2026-05-18T00:19:16.059815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01119","created_at":"2026-05-18T00:19:16.059815+00:00"},{"alias_kind":"pith_short_12","alias_value":"B2XNUIWOIV3Y","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"B2XNUIWOIV3YOULU","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"B2XNUIWO","created_at":"2026-05-18T12:32:13.499390+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/B2XNUIWOIV3YOULUYCDD64VWLX","json":"https://pith.science/pith/B2XNUIWOIV3YOULUYCDD64VWLX.json","graph_json":"https://pith.science/api/pith-number/B2XNUIWOIV3YOULUYCDD64VWLX/graph.json","events_json":"https://pith.science/api/pith-number/B2XNUIWOIV3YOULUYCDD64VWLX/events.json","paper":"https://pith.science/paper/B2XNUIWO"},"agent_actions":{"view_html":"https://pith.science/pith/B2XNUIWOIV3YOULUYCDD64VWLX","download_json":"https://pith.science/pith/B2XNUIWOIV3YOULUYCDD64VWLX.json","view_paper":"https://pith.science/paper/B2XNUIWO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.01119&json=true","fetch_graph":"https://pith.science/api/pith-number/B2XNUIWOIV3YOULUYCDD64VWLX/graph.json","fetch_events":"https://pith.science/api/pith-number/B2XNUIWOIV3YOULUYCDD64VWLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B2XNUIWOIV3YOULUYCDD64VWLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B2XNUIWOIV3YOULUYCDD64VWLX/action/storage_attestation","attest_author":"https://pith.science/pith/B2XNUIWOIV3YOULUYCDD64VWLX/action/author_attestation","sign_citation":"https://pith.science/pith/B2XNUIWOIV3YOULUYCDD64VWLX/action/citation_signature","submit_replication":"https://pith.science/pith/B2XNUIWOIV3YOULUYCDD64VWLX/action/replication_record"}},"created_at":"2026-05-18T00:19:16.059815+00:00","updated_at":"2026-05-18T00:19:16.059815+00:00"}