{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:FDBRP6V6TRINERAYUJK2OXMG2N","short_pith_number":"pith:FDBRP6V6","canonical_record":{"source":{"id":"0812.4293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-12-22T21:16:55Z","cross_cats_sorted":[],"title_canon_sha256":"4baa873f081ca24bba7dd5ab2ee5ac15c66b29bd9a9b5c1fd76e1d531abab047","abstract_canon_sha256":"dbd3b352574c537250fb476ce6e1e8a103e9fced9799d9b63d06f41f982cb457"},"schema_version":"1.0"},"canonical_sha256":"28c317fabe9c50d24418a255a75d86d3682f231b9ca00918ca0620185a2d268c","source":{"kind":"arxiv","id":"0812.4293","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0812.4293","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"arxiv_version","alias_value":"0812.4293v2","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.4293","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"pith_short_12","alias_value":"FDBRP6V6TRIN","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"FDBRP6V6TRINERAY","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"FDBRP6V6","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:FDBRP6V6TRINERAYUJK2OXMG2N","target":"record","payload":{"canonical_record":{"source":{"id":"0812.4293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-12-22T21:16:55Z","cross_cats_sorted":[],"title_canon_sha256":"4baa873f081ca24bba7dd5ab2ee5ac15c66b29bd9a9b5c1fd76e1d531abab047","abstract_canon_sha256":"dbd3b352574c537250fb476ce6e1e8a103e9fced9799d9b63d06f41f982cb457"},"schema_version":"1.0"},"canonical_sha256":"28c317fabe9c50d24418a255a75d86d3682f231b9ca00918ca0620185a2d268c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:56.636799Z","signature_b64":"qb9A1syPVkb/dQcgzVCFdISnIQ95YITj+X2ndUfU3olu8M2FecSn+E6N2I4xHl+gk3HVu2eAzN3RCFkjXAN5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28c317fabe9c50d24418a255a75d86d3682f231b9ca00918ca0620185a2d268c","last_reissued_at":"2026-05-18T02:24:56.636130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:56.636130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0812.4293","source_version":2,"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-18T02:24:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nl8PofnszTiIgUqTQvWxXJlyAnjt1P7KRbl5HjL/a1k0Yt8jEThsVDDT3NAHEOZW4DH3kcuzS2oNeuW4QuoJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T02:54:39.119730Z"},"content_sha256":"2b265087886290c380b6b1ae2ce88207858fc37bd7120d4001d82752a3e89cc5","schema_version":"1.0","event_id":"sha256:2b265087886290c380b6b1ae2ce88207858fc37bd7120d4001d82752a3e89cc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:FDBRP6V6TRINERAYUJK2OXMG2N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Approximation Algorithm for the Column Subset Selection Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christos Boutsidis, Michael W. Mahoney, Petros Drineas","submitted_at":"2008-12-22T21:16:55Z","abstract_excerpt":"We consider the problem of selecting the best subset of exactly $k$ columns from an $m \\times n$ matrix $A$. We present and analyze a novel two-stage algorithm that runs in $O(\\min\\{mn^2,m^2n\\})$ time and returns as output an $m \\times k$ matrix $C$ consisting of exactly $k$ columns of $A$. In the first (randomized) stage, the algorithm randomly selects $\\Theta(k \\log k)$ columns according to a judiciously-chosen probability distribution that depends on information in the top-$k$ right singular subspace of $A$. In the second (deterministic) stage, the algorithm applies a deterministic column-s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0812.4293","kind":"arxiv","version":2},"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-18T02:24:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iYHPPjYkzH8mZIrp2pGNs4uHY93yzvdwNWKtkrg72VDe3soPSgrwPxVPGhdKfpH/Frtz/NeyAAmPYhFHHC2yAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T02:54:39.120098Z"},"content_sha256":"c02904e062b61dab58fe9f5b3b7e3066395a7ec7726a964f2a9ff1e3b25293fa","schema_version":"1.0","event_id":"sha256:c02904e062b61dab58fe9f5b3b7e3066395a7ec7726a964f2a9ff1e3b25293fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FDBRP6V6TRINERAYUJK2OXMG2N/bundle.json","state_url":"https://pith.science/pith/FDBRP6V6TRINERAYUJK2OXMG2N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FDBRP6V6TRINERAYUJK2OXMG2N/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-06T02:54:39Z","links":{"resolver":"https://pith.science/pith/FDBRP6V6TRINERAYUJK2OXMG2N","bundle":"https://pith.science/pith/FDBRP6V6TRINERAYUJK2OXMG2N/bundle.json","state":"https://pith.science/pith/FDBRP6V6TRINERAYUJK2OXMG2N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FDBRP6V6TRINERAYUJK2OXMG2N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:FDBRP6V6TRINERAYUJK2OXMG2N","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":"dbd3b352574c537250fb476ce6e1e8a103e9fced9799d9b63d06f41f982cb457","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-12-22T21:16:55Z","title_canon_sha256":"4baa873f081ca24bba7dd5ab2ee5ac15c66b29bd9a9b5c1fd76e1d531abab047"},"schema_version":"1.0","source":{"id":"0812.4293","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0812.4293","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"arxiv_version","alias_value":"0812.4293v2","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.4293","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"pith_short_12","alias_value":"FDBRP6V6TRIN","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"FDBRP6V6TRINERAY","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"FDBRP6V6","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:c02904e062b61dab58fe9f5b3b7e3066395a7ec7726a964f2a9ff1e3b25293fa","target":"graph","created_at":"2026-05-18T02:24:56Z","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 consider the problem of selecting the best subset of exactly $k$ columns from an $m \\times n$ matrix $A$. We present and analyze a novel two-stage algorithm that runs in $O(\\min\\{mn^2,m^2n\\})$ time and returns as output an $m \\times k$ matrix $C$ consisting of exactly $k$ columns of $A$. In the first (randomized) stage, the algorithm randomly selects $\\Theta(k \\log k)$ columns according to a judiciously-chosen probability distribution that depends on information in the top-$k$ right singular subspace of $A$. In the second (deterministic) stage, the algorithm applies a deterministic column-s","authors_text":"Christos Boutsidis, Michael W. Mahoney, Petros Drineas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-12-22T21:16:55Z","title":"An Improved Approximation Algorithm for the Column Subset Selection Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0812.4293","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:2b265087886290c380b6b1ae2ce88207858fc37bd7120d4001d82752a3e89cc5","target":"record","created_at":"2026-05-18T02:24:56Z","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":"dbd3b352574c537250fb476ce6e1e8a103e9fced9799d9b63d06f41f982cb457","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-12-22T21:16:55Z","title_canon_sha256":"4baa873f081ca24bba7dd5ab2ee5ac15c66b29bd9a9b5c1fd76e1d531abab047"},"schema_version":"1.0","source":{"id":"0812.4293","kind":"arxiv","version":2}},"canonical_sha256":"28c317fabe9c50d24418a255a75d86d3682f231b9ca00918ca0620185a2d268c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28c317fabe9c50d24418a255a75d86d3682f231b9ca00918ca0620185a2d268c","first_computed_at":"2026-05-18T02:24:56.636130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:56.636130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qb9A1syPVkb/dQcgzVCFdISnIQ95YITj+X2ndUfU3olu8M2FecSn+E6N2I4xHl+gk3HVu2eAzN3RCFkjXAN5Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:56.636799Z","signed_message":"canonical_sha256_bytes"},"source_id":"0812.4293","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b265087886290c380b6b1ae2ce88207858fc37bd7120d4001d82752a3e89cc5","sha256:c02904e062b61dab58fe9f5b3b7e3066395a7ec7726a964f2a9ff1e3b25293fa"],"state_sha256":"9a8973622ae71660cd6fecc0bb74812433362559c35902da72c5264df1b71c4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RdBNvWB98rAWt7y2HWOzfMbEjTFoWB22ET0KI/kC6Ttgk5sbsUZ5YCXPwmkYogdAcsw+2g3O+CvRlzwcPowKBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T02:54:39.122036Z","bundle_sha256":"cbe4576515c86400d60017bfbacdc275b5fcc9939f18737eb9bc8e3af4bc8851"}}