{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NOLLZKK5QEGUS26BEVL2AGUDVZ","short_pith_number":"pith:NOLLZKK5","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"},"canonical_sha256":"6b96bca95d810d496bc12557a01a83ae5a10bdb43c6648282ac707735294283e","source":{"kind":"arxiv","id":"1510.04149","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04149","created_at":"2026-05-18T01:30:09Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04149v1","created_at":"2026-05-18T01:30:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04149","created_at":"2026-05-18T01:30:09Z"},{"alias_kind":"pith_short_12","alias_value":"NOLLZKK5QEGU","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NOLLZKK5QEGUS26B","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NOLLZKK5","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NOLLZKK5QEGUS26BEVL2AGUDVZ","target":"record","payload":{"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"},"canonical_sha256":"6b96bca95d810d496bc12557a01a83ae5a10bdb43c6648282ac707735294283e","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"},"source_kind":"arxiv","source_id":"1510.04149","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:30:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oHLXTFTbpst2mdQSIgvnHAhjVVifXHL1g6amLTMba7yaX4D7TVxehyoR3vHILmJ5fnRC2VHwNBP0rx42XyuUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:04:19.916060Z"},"content_sha256":"c5e6564d213c9999be4743b3cab070fa815d83c2afd49d65d785c870bd51d4c5","schema_version":"1.0","event_id":"sha256:c5e6564d213c9999be4743b3cab070fa815d83c2afd49d65d785c870bd51d4c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NOLLZKK5QEGUS26BEVL2AGUDVZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:30:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SbMLkQilnyXoy74k6Sx52dA42rP14tZka8RTNth30I1zZi9NmXKURYCL0o5w4a6RsKP11icfkJQF0uxLTEfZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:04:19.916778Z"},"content_sha256":"a78cab939b27d26e18ec98ee6c2e7549c1cf3cd6738eba41aa7c90fd083d6e01","schema_version":"1.0","event_id":"sha256:a78cab939b27d26e18ec98ee6c2e7549c1cf3cd6738eba41aa7c90fd083d6e01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NOLLZKK5QEGUS26BEVL2AGUDVZ/bundle.json","state_url":"https://pith.science/pith/NOLLZKK5QEGUS26BEVL2AGUDVZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NOLLZKK5QEGUS26BEVL2AGUDVZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T17:04:19Z","links":{"resolver":"https://pith.science/pith/NOLLZKK5QEGUS26BEVL2AGUDVZ","bundle":"https://pith.science/pith/NOLLZKK5QEGUS26BEVL2AGUDVZ/bundle.json","state":"https://pith.science/pith/NOLLZKK5QEGUS26BEVL2AGUDVZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NOLLZKK5QEGUS26BEVL2AGUDVZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NOLLZKK5QEGUS26BEVL2AGUDVZ","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":"8ddec995685913c8fa6cc7d3f46e0ecdfc0cbba008987a3df2de2c719ecf724c","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-14T15:23:31Z","title_canon_sha256":"f8da3c46af91891b102ef9aa8be29fe214e87f28fea0a5adb7379ae930852448"},"schema_version":"1.0","source":{"id":"1510.04149","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04149","created_at":"2026-05-18T01:30:09Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04149v1","created_at":"2026-05-18T01:30:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04149","created_at":"2026-05-18T01:30:09Z"},{"alias_kind":"pith_short_12","alias_value":"NOLLZKK5QEGU","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NOLLZKK5QEGUS26B","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NOLLZKK5","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:a78cab939b27d26e18ec98ee6c2e7549c1cf3cd6738eba41aa7c90fd083d6e01","target":"graph","created_at":"2026-05-18T01:30:09Z","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"},"paper":{"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","authors_text":"Malik Magdon-Ismail, Petros Drineas, Saurabh Paul","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-14T15:23:31Z","title":"Column Selection via Adaptive Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04149","kind":"arxiv","version":1},"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:c5e6564d213c9999be4743b3cab070fa815d83c2afd49d65d785c870bd51d4c5","target":"record","created_at":"2026-05-18T01:30:09Z","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":"8ddec995685913c8fa6cc7d3f46e0ecdfc0cbba008987a3df2de2c719ecf724c","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-14T15:23:31Z","title_canon_sha256":"f8da3c46af91891b102ef9aa8be29fe214e87f28fea0a5adb7379ae930852448"},"schema_version":"1.0","source":{"id":"1510.04149","kind":"arxiv","version":1}},"canonical_sha256":"6b96bca95d810d496bc12557a01a83ae5a10bdb43c6648282ac707735294283e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b96bca95d810d496bc12557a01a83ae5a10bdb43c6648282ac707735294283e","first_computed_at":"2026-05-18T01:30:09.085605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:09.085605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hjfMJjxGsvefEGyF5vqIbP5WUhlLorxBnYqGPylMoo+dEYha8qzuhv3Qd5CofaNYTv7UiwQ6O5lYOUm+LgfyAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:09.086247Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.04149","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5e6564d213c9999be4743b3cab070fa815d83c2afd49d65d785c870bd51d4c5","sha256:a78cab939b27d26e18ec98ee6c2e7549c1cf3cd6738eba41aa7c90fd083d6e01"],"state_sha256":"c80a0a6ee81a87851b65b885279c09d7a98f60efdc8b153204fe669a6766a6d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6vYeN8CjBXC6qIOs7/ZH6VSaDsUGE5MbhRAomJMK8kzgYAgxFJQ4XZ+kaVqIBASvZp/qjgQwzPpmiwgi7JdUCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:04:19.920972Z","bundle_sha256":"87edb4559506b7664fce8b53456d7b58646f4ca4184ea24dc5009ade69c8ae12"}}