{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:X63JUZI4PDAIO65IOYLSV743RC","short_pith_number":"pith:X63JUZI4","canonical_record":{"source":{"id":"1201.0127","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-30T13:54:29Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"d602101588f00aa5706f2fd07faf7a8c5f3117498f88a65069d0c8af162daeb6","abstract_canon_sha256":"3864f145a8ac1347bfb6d9faec7d44df33b55c01c368b06207afb94d6c2a74ed"},"schema_version":"1.0"},"canonical_sha256":"bfb69a651c78c0877ba876172aff9b88a26c6d6a29ce0e0969d7876887e06898","source":{"kind":"arxiv","id":"1201.0127","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0127","created_at":"2026-05-18T03:20:18Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0127v4","created_at":"2026-05-18T03:20:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0127","created_at":"2026-05-18T03:20:18Z"},{"alias_kind":"pith_short_12","alias_value":"X63JUZI4PDAI","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"X63JUZI4PDAIO65I","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"X63JUZI4","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:X63JUZI4PDAIO65IOYLSV743RC","target":"record","payload":{"canonical_record":{"source":{"id":"1201.0127","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-30T13:54:29Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"d602101588f00aa5706f2fd07faf7a8c5f3117498f88a65069d0c8af162daeb6","abstract_canon_sha256":"3864f145a8ac1347bfb6d9faec7d44df33b55c01c368b06207afb94d6c2a74ed"},"schema_version":"1.0"},"canonical_sha256":"bfb69a651c78c0877ba876172aff9b88a26c6d6a29ce0e0969d7876887e06898","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:18.757165Z","signature_b64":"YT5ArkrSRNmkGbh6Cp/LuSyGrI0mrVjFViGMrjCy8gluEn9HSwylE0VkPMBX1Ngdf/yIEauGN9F7p29f4/ieBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfb69a651c78c0877ba876172aff9b88a26c6d6a29ce0e0969d7876887e06898","last_reissued_at":"2026-05-18T03:20:18.756444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:18.756444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.0127","source_version":4,"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-18T03:20:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hl9zRN4GszYcmBtK1m2V+kXEbt1bx9RAuiqypanJZgQ+pzP+yB7s9C2lGa6TVHJde2b606XoWUfIcHyG2gDHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:13:11.239222Z"},"content_sha256":"cf6771a301c9a1090646aa197a079a72cb2e7ab9dcb680e3f6f2d81f6a4ea2c7","schema_version":"1.0","event_id":"sha256:cf6771a301c9a1090646aa197a079a72cb2e7ab9dcb680e3f6f2d81f6a4ea2c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:X63JUZI4PDAIO65IOYLSV743RC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Subset Selection for Matrices and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.DS","authors_text":"Christos Boutsidis, Haim Avron","submitted_at":"2011-12-30T13:54:29Z","abstract_excerpt":"We study subset selection for matrices defined as follows: given a matrix $\\matX \\in \\R^{n \\times m}$ ($m > n$) and an oversampling parameter $k$ ($n \\le k \\le m$), select a subset of $k$ columns from $\\matX$ such that the pseudo-inverse of the subsampled matrix has as smallest norm as possible. In this work, we focus on the Frobenius and the spectral matrix norms. We describe several novel (deterministic and randomized) approximation algorithms for this problem with approximation bounds that are optimal up to constant factors. Additionally, we show that the combinatorial problem of finding a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0127","kind":"arxiv","version":4},"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-18T03:20:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b4RcpC+DTWYDWNcEmFxXDwyhyhPXoKTb2bcf7Eert7GOvlMJ8R/BLnhRJ55tUhPBfxJ0esKJKCG/MZLeK77gCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:13:11.239622Z"},"content_sha256":"20e88552608ed7b59786353a6c8810f6f63380183e14ca1e66955232664b9db2","schema_version":"1.0","event_id":"sha256:20e88552608ed7b59786353a6c8810f6f63380183e14ca1e66955232664b9db2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X63JUZI4PDAIO65IOYLSV743RC/bundle.json","state_url":"https://pith.science/pith/X63JUZI4PDAIO65IOYLSV743RC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X63JUZI4PDAIO65IOYLSV743RC/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-06-07T11:13:11Z","links":{"resolver":"https://pith.science/pith/X63JUZI4PDAIO65IOYLSV743RC","bundle":"https://pith.science/pith/X63JUZI4PDAIO65IOYLSV743RC/bundle.json","state":"https://pith.science/pith/X63JUZI4PDAIO65IOYLSV743RC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X63JUZI4PDAIO65IOYLSV743RC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:X63JUZI4PDAIO65IOYLSV743RC","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":"3864f145a8ac1347bfb6d9faec7d44df33b55c01c368b06207afb94d6c2a74ed","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-30T13:54:29Z","title_canon_sha256":"d602101588f00aa5706f2fd07faf7a8c5f3117498f88a65069d0c8af162daeb6"},"schema_version":"1.0","source":{"id":"1201.0127","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0127","created_at":"2026-05-18T03:20:18Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0127v4","created_at":"2026-05-18T03:20:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0127","created_at":"2026-05-18T03:20:18Z"},{"alias_kind":"pith_short_12","alias_value":"X63JUZI4PDAI","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"X63JUZI4PDAIO65I","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"X63JUZI4","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:20e88552608ed7b59786353a6c8810f6f63380183e14ca1e66955232664b9db2","target":"graph","created_at":"2026-05-18T03:20:18Z","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":"We study subset selection for matrices defined as follows: given a matrix $\\matX \\in \\R^{n \\times m}$ ($m > n$) and an oversampling parameter $k$ ($n \\le k \\le m$), select a subset of $k$ columns from $\\matX$ such that the pseudo-inverse of the subsampled matrix has as smallest norm as possible. In this work, we focus on the Frobenius and the spectral matrix norms. We describe several novel (deterministic and randomized) approximation algorithms for this problem with approximation bounds that are optimal up to constant factors. Additionally, we show that the combinatorial problem of finding a ","authors_text":"Christos Boutsidis, Haim Avron","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-30T13:54:29Z","title":"Faster Subset Selection for Matrices and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0127","kind":"arxiv","version":4},"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:cf6771a301c9a1090646aa197a079a72cb2e7ab9dcb680e3f6f2d81f6a4ea2c7","target":"record","created_at":"2026-05-18T03:20:18Z","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":"3864f145a8ac1347bfb6d9faec7d44df33b55c01c368b06207afb94d6c2a74ed","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-30T13:54:29Z","title_canon_sha256":"d602101588f00aa5706f2fd07faf7a8c5f3117498f88a65069d0c8af162daeb6"},"schema_version":"1.0","source":{"id":"1201.0127","kind":"arxiv","version":4}},"canonical_sha256":"bfb69a651c78c0877ba876172aff9b88a26c6d6a29ce0e0969d7876887e06898","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfb69a651c78c0877ba876172aff9b88a26c6d6a29ce0e0969d7876887e06898","first_computed_at":"2026-05-18T03:20:18.756444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:18.756444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YT5ArkrSRNmkGbh6Cp/LuSyGrI0mrVjFViGMrjCy8gluEn9HSwylE0VkPMBX1Ngdf/yIEauGN9F7p29f4/ieBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:18.757165Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0127","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf6771a301c9a1090646aa197a079a72cb2e7ab9dcb680e3f6f2d81f6a4ea2c7","sha256:20e88552608ed7b59786353a6c8810f6f63380183e14ca1e66955232664b9db2"],"state_sha256":"687e6f36d1b321adcac18a7b3f915a14236d66c14dd3fc109038b36219359d5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rQJ6izKsXt4s5wEGYTJqTjtmMivKLq6T2vZS+KtKG8h4v0t3mG65mcgWKfBnn7Jbu9TYYkLiXqp3TM0I1hzgBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T11:13:11.241666Z","bundle_sha256":"83ead8a6a8596f79b48799f026923e6ebd473d6a19189ecfb54f1ff7a914f0e5"}}