{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NOLLZKK5QEGUS26BEVL2AGUDVZ","short_pith_number":"pith:NOLLZKK5","schema_version":"1.0","canonical_sha256":"6b96bca95d810d496bc12557a01a83ae5a10bdb43c6648282ac707735294283e","source":{"kind":"arxiv","id":"1510.04149","version":1},"attestation_state":"computed","paper":{"title":"Column Selection via Adaptive Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.DS","authors_text":"Malik Magdon-Ismail, Petros Drineas, Saurabh Paul","submitted_at":"2015-10-14T15:23:31Z","abstract_excerpt":"Selecting a good column (or row) subset of massive data matrices has found many applications in data analysis and machine learning. We propose a new adaptive sampling algorithm that can be used to improve any relative-error column selection algorithm. Our algorithm delivers a tighter theoretical bound on the approximation error which we also demonstrate empirically using two well known relative-error column subset selection algorithms. Our experimental results on synthetic and real-world data show that our algorithm outperforms non-adaptive sampling as well as prior adaptive sampling approache"},"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":"1510.04149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-14T15:23:31Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"f8da3c46af91891b102ef9aa8be29fe214e87f28fea0a5adb7379ae930852448","abstract_canon_sha256":"8ddec995685913c8fa6cc7d3f46e0ecdfc0cbba008987a3df2de2c719ecf724c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:09.086247Z","signature_b64":"hjfMJjxGsvefEGyF5vqIbP5WUhlLorxBnYqGPylMoo+dEYha8qzuhv3Qd5CofaNYTv7UiwQ6O5lYOUm+LgfyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b96bca95d810d496bc12557a01a83ae5a10bdb43c6648282ac707735294283e","last_reissued_at":"2026-05-18T01:30:09.085605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:09.085605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Column Selection via Adaptive Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.DS","authors_text":"Malik Magdon-Ismail, Petros Drineas, Saurabh Paul","submitted_at":"2015-10-14T15:23:31Z","abstract_excerpt":"Selecting a good column (or row) subset of massive data matrices has found many applications in data analysis and machine learning. We propose a new adaptive sampling algorithm that can be used to improve any relative-error column selection algorithm. Our algorithm delivers a tighter theoretical bound on the approximation error which we also demonstrate empirically using two well known relative-error column subset selection algorithms. Our experimental results on synthetic and real-world data show that our algorithm outperforms non-adaptive sampling as well as prior adaptive sampling approache"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04149","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":"1510.04149","created_at":"2026-05-18T01:30:09.085697+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.04149v1","created_at":"2026-05-18T01:30:09.085697+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04149","created_at":"2026-05-18T01:30:09.085697+00:00"},{"alias_kind":"pith_short_12","alias_value":"NOLLZKK5QEGU","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NOLLZKK5QEGUS26B","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NOLLZKK5","created_at":"2026-05-18T12:29:34.919912+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/NOLLZKK5QEGUS26BEVL2AGUDVZ","json":"https://pith.science/pith/NOLLZKK5QEGUS26BEVL2AGUDVZ.json","graph_json":"https://pith.science/api/pith-number/NOLLZKK5QEGUS26BEVL2AGUDVZ/graph.json","events_json":"https://pith.science/api/pith-number/NOLLZKK5QEGUS26BEVL2AGUDVZ/events.json","paper":"https://pith.science/paper/NOLLZKK5"},"agent_actions":{"view_html":"https://pith.science/pith/NOLLZKK5QEGUS26BEVL2AGUDVZ","download_json":"https://pith.science/pith/NOLLZKK5QEGUS26BEVL2AGUDVZ.json","view_paper":"https://pith.science/paper/NOLLZKK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.04149&json=true","fetch_graph":"https://pith.science/api/pith-number/NOLLZKK5QEGUS26BEVL2AGUDVZ/graph.json","fetch_events":"https://pith.science/api/pith-number/NOLLZKK5QEGUS26BEVL2AGUDVZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NOLLZKK5QEGUS26BEVL2AGUDVZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NOLLZKK5QEGUS26BEVL2AGUDVZ/action/storage_attestation","attest_author":"https://pith.science/pith/NOLLZKK5QEGUS26BEVL2AGUDVZ/action/author_attestation","sign_citation":"https://pith.science/pith/NOLLZKK5QEGUS26BEVL2AGUDVZ/action/citation_signature","submit_replication":"https://pith.science/pith/NOLLZKK5QEGUS26BEVL2AGUDVZ/action/replication_record"}},"created_at":"2026-05-18T01:30:09.085697+00:00","updated_at":"2026-05-18T01:30:09.085697+00:00"}