{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5S7N6IXJVHGJWHWPGC4XDOPFJ2","short_pith_number":"pith:5S7N6IXJ","canonical_record":{"source":{"id":"1312.7499","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-29T04:48:13Z","cross_cats_sorted":[],"title_canon_sha256":"50f02ec18a281eaa79e24614a6e5342e29dc0c353b3b7b52f8fca305ec344340","abstract_canon_sha256":"2bdaac2bcf610e05d3a7172ecc107f3c1251966270da157ed559c07ce9ed832c"},"schema_version":"1.0"},"canonical_sha256":"ecbedf22e9a9cc9b1ecf30b971b9e54ea20928da4dc876c0095ae7024de2ee6b","source":{"kind":"arxiv","id":"1312.7499","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7499","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7499v1","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7499","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"pith_short_12","alias_value":"5S7N6IXJVHGJ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5S7N6IXJVHGJWHWP","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5S7N6IXJ","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5S7N6IXJVHGJWHWPGC4XDOPFJ2","target":"record","payload":{"canonical_record":{"source":{"id":"1312.7499","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-29T04:48:13Z","cross_cats_sorted":[],"title_canon_sha256":"50f02ec18a281eaa79e24614a6e5342e29dc0c353b3b7b52f8fca305ec344340","abstract_canon_sha256":"2bdaac2bcf610e05d3a7172ecc107f3c1251966270da157ed559c07ce9ed832c"},"schema_version":"1.0"},"canonical_sha256":"ecbedf22e9a9cc9b1ecf30b971b9e54ea20928da4dc876c0095ae7024de2ee6b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:43.286470Z","signature_b64":"3VdabacmTDLavxXKDfKVgQm0fmklDHIDHybYO4lObECssVMW/xYxN1+Gh7pd4pZ9xI1WHngHPaqe80qNnEZiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecbedf22e9a9cc9b1ecf30b971b9e54ea20928da4dc876c0095ae7024de2ee6b","last_reissued_at":"2026-05-18T03:03:43.285694Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:43.285694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.7499","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-18T03:03:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0IxEQsLA3VG7FSOq8zFLRgYgqJH2yhIQw3uxGx7daPWOok05J//hcnDIln2WDTZnIQFXLF2b5Px9cXSXhAwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:46:09.921143Z"},"content_sha256":"fd42d7fa95bd6ec8908080899a79587044b7a8ad607dd5ec9f21f70a8babdb82","schema_version":"1.0","event_id":"sha256:fd42d7fa95bd6ec8908080899a79587044b7a8ad607dd5ec9f21f70a8babdb82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5S7N6IXJVHGJWHWPGC4XDOPFJ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on sparse least-squares regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christos Boutsidis, Malik Magdon-Ismail","submitted_at":"2013-12-29T04:48:13Z","abstract_excerpt":"We compute a \\emph{sparse} solution to the classical least-squares problem $\\min_x||A x -b||,$ where $A$ is an arbitrary matrix. We describe a novel algorithm for this sparse least-squares problem. The algorithm operates as follows: first, it selects columns from $A$, and then solves a least-squares problem only with the selected columns. The column selection algorithm that we use is known to perform well for the well studied column subset selection problem. The contribution of this article is to show that it gives favorable results for sparse least-squares as well. Specifically, we prove that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7499","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-18T03:03:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zJDsNHOPCWnzOOdXDQnfH7yB6z1HJkBJT7XT4rFWvtodV7lNb3F3T/OXdoFAcRSCVf/0ZymxWLdW89psRanvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:46:09.921852Z"},"content_sha256":"a7ca7bb52c55c5f4e40180007958e74430ee7e3db77aef0ed62a73f8c4624aef","schema_version":"1.0","event_id":"sha256:a7ca7bb52c55c5f4e40180007958e74430ee7e3db77aef0ed62a73f8c4624aef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5S7N6IXJVHGJWHWPGC4XDOPFJ2/bundle.json","state_url":"https://pith.science/pith/5S7N6IXJVHGJWHWPGC4XDOPFJ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5S7N6IXJVHGJWHWPGC4XDOPFJ2/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:46:09Z","links":{"resolver":"https://pith.science/pith/5S7N6IXJVHGJWHWPGC4XDOPFJ2","bundle":"https://pith.science/pith/5S7N6IXJVHGJWHWPGC4XDOPFJ2/bundle.json","state":"https://pith.science/pith/5S7N6IXJVHGJWHWPGC4XDOPFJ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5S7N6IXJVHGJWHWPGC4XDOPFJ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5S7N6IXJVHGJWHWPGC4XDOPFJ2","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":"2bdaac2bcf610e05d3a7172ecc107f3c1251966270da157ed559c07ce9ed832c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-29T04:48:13Z","title_canon_sha256":"50f02ec18a281eaa79e24614a6e5342e29dc0c353b3b7b52f8fca305ec344340"},"schema_version":"1.0","source":{"id":"1312.7499","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7499","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7499v1","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7499","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"pith_short_12","alias_value":"5S7N6IXJVHGJ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5S7N6IXJVHGJWHWP","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5S7N6IXJ","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:a7ca7bb52c55c5f4e40180007958e74430ee7e3db77aef0ed62a73f8c4624aef","target":"graph","created_at":"2026-05-18T03:03:43Z","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 compute a \\emph{sparse} solution to the classical least-squares problem $\\min_x||A x -b||,$ where $A$ is an arbitrary matrix. We describe a novel algorithm for this sparse least-squares problem. The algorithm operates as follows: first, it selects columns from $A$, and then solves a least-squares problem only with the selected columns. The column selection algorithm that we use is known to perform well for the well studied column subset selection problem. The contribution of this article is to show that it gives favorable results for sparse least-squares as well. Specifically, we prove that","authors_text":"Christos Boutsidis, Malik Magdon-Ismail","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-29T04:48:13Z","title":"A note on sparse least-squares regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7499","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:fd42d7fa95bd6ec8908080899a79587044b7a8ad607dd5ec9f21f70a8babdb82","target":"record","created_at":"2026-05-18T03:03:43Z","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":"2bdaac2bcf610e05d3a7172ecc107f3c1251966270da157ed559c07ce9ed832c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-29T04:48:13Z","title_canon_sha256":"50f02ec18a281eaa79e24614a6e5342e29dc0c353b3b7b52f8fca305ec344340"},"schema_version":"1.0","source":{"id":"1312.7499","kind":"arxiv","version":1}},"canonical_sha256":"ecbedf22e9a9cc9b1ecf30b971b9e54ea20928da4dc876c0095ae7024de2ee6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecbedf22e9a9cc9b1ecf30b971b9e54ea20928da4dc876c0095ae7024de2ee6b","first_computed_at":"2026-05-18T03:03:43.285694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:43.285694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3VdabacmTDLavxXKDfKVgQm0fmklDHIDHybYO4lObECssVMW/xYxN1+Gh7pd4pZ9xI1WHngHPaqe80qNnEZiAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:43.286470Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7499","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd42d7fa95bd6ec8908080899a79587044b7a8ad607dd5ec9f21f70a8babdb82","sha256:a7ca7bb52c55c5f4e40180007958e74430ee7e3db77aef0ed62a73f8c4624aef"],"state_sha256":"9f6d317aba9d212a6bea5c09d8d4ac3b14a39dafcb8a65d1353ac20a5fcdc397"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j1207wMB1uXTAhQN1b1bsL4XROKzhopi+ecFtthPNe8tUOvO9fFW0m18dBVwS8GQEuir59WiBN3DONq9df17AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:46:09.925605Z","bundle_sha256":"8e4e9d14969c374bc53c38fb4ec62d553729355b8e44e72ee9afd416380752a2"}}