{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OD7RVKTUUZVNGDGAYI5HPLOUNX","short_pith_number":"pith:OD7RVKTU","schema_version":"1.0","canonical_sha256":"70ff1aaa74a66ad30cc0c23a77add46dc109e5e76d92530b531c30c1d5071510","source":{"kind":"arxiv","id":"2412.13992","version":2},"attestation_state":"computed","paper":{"title":"Adaptive randomized pivoting for column subset selection, DEIM, and low-rank approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alice Cortinovis, Daniel Kressner","submitted_at":"2024-12-18T16:11:22Z","abstract_excerpt":"We derive a new adaptive leverage score sampling strategy for solving the Column Subset Selection Problem (CSSP). The resulting algorithm, called Adaptive Randomized Pivoting, can be viewed as a randomization of Osinsky's recently proposed deterministic algorithm for CSSP. It guarantees, in expectation, an approximation error that matches the optimal existence result in the Frobenius norm. Although the same guarantee can be achieved with volume sampling, our sampling strategy is much simpler and less expensive. To show the versatility of Adaptive Randomized Pivoting, we apply it to select indi"},"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":"2412.13992","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-12-18T16:11:22Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"010f2f58addcf6971e36496f79aa58d4ce5a66080d2a7f0d5d09a6e1df003cb3","abstract_canon_sha256":"796d591a94232ff9765b34bd411d58b9bd50c98888926f00a806f5fbb2038d9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:24:10.464305Z","signature_b64":"fLjZjzaMx/QR6H4CuNAjgN0wiRLJeZ7gj+zX2W6fOmWhmu1z/H0OSMyTEkmPAhRJq6UAYiS4OnkGQ6u7wG9QBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70ff1aaa74a66ad30cc0c23a77add46dc109e5e76d92530b531c30c1d5071510","last_reissued_at":"2026-07-05T11:24:10.463459Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:24:10.463459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive randomized pivoting for column subset selection, DEIM, and low-rank approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alice Cortinovis, Daniel Kressner","submitted_at":"2024-12-18T16:11:22Z","abstract_excerpt":"We derive a new adaptive leverage score sampling strategy for solving the Column Subset Selection Problem (CSSP). The resulting algorithm, called Adaptive Randomized Pivoting, can be viewed as a randomization of Osinsky's recently proposed deterministic algorithm for CSSP. It guarantees, in expectation, an approximation error that matches the optimal existence result in the Frobenius norm. Although the same guarantee can be achieved with volume sampling, our sampling strategy is much simpler and less expensive. To show the versatility of Adaptive Randomized Pivoting, we apply it to select indi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.13992","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.13992/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.13992","created_at":"2026-07-05T11:24:10.463535+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.13992v2","created_at":"2026-07-05T11:24:10.463535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.13992","created_at":"2026-07-05T11:24:10.463535+00:00"},{"alias_kind":"pith_short_12","alias_value":"OD7RVKTUUZVN","created_at":"2026-07-05T11:24:10.463535+00:00"},{"alias_kind":"pith_short_16","alias_value":"OD7RVKTUUZVNGDGA","created_at":"2026-07-05T11:24:10.463535+00:00"},{"alias_kind":"pith_short_8","alias_value":"OD7RVKTU","created_at":"2026-07-05T11:24:10.463535+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26688","citing_title":"Adaptive Randomized Pivoting for Tensor Singular Value Decomposition Model","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OD7RVKTUUZVNGDGAYI5HPLOUNX","json":"https://pith.science/pith/OD7RVKTUUZVNGDGAYI5HPLOUNX.json","graph_json":"https://pith.science/api/pith-number/OD7RVKTUUZVNGDGAYI5HPLOUNX/graph.json","events_json":"https://pith.science/api/pith-number/OD7RVKTUUZVNGDGAYI5HPLOUNX/events.json","paper":"https://pith.science/paper/OD7RVKTU"},"agent_actions":{"view_html":"https://pith.science/pith/OD7RVKTUUZVNGDGAYI5HPLOUNX","download_json":"https://pith.science/pith/OD7RVKTUUZVNGDGAYI5HPLOUNX.json","view_paper":"https://pith.science/paper/OD7RVKTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.13992&json=true","fetch_graph":"https://pith.science/api/pith-number/OD7RVKTUUZVNGDGAYI5HPLOUNX/graph.json","fetch_events":"https://pith.science/api/pith-number/OD7RVKTUUZVNGDGAYI5HPLOUNX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OD7RVKTUUZVNGDGAYI5HPLOUNX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OD7RVKTUUZVNGDGAYI5HPLOUNX/action/storage_attestation","attest_author":"https://pith.science/pith/OD7RVKTUUZVNGDGAYI5HPLOUNX/action/author_attestation","sign_citation":"https://pith.science/pith/OD7RVKTUUZVNGDGAYI5HPLOUNX/action/citation_signature","submit_replication":"https://pith.science/pith/OD7RVKTUUZVNGDGAYI5HPLOUNX/action/replication_record"}},"created_at":"2026-07-05T11:24:10.463535+00:00","updated_at":"2026-07-05T11:24:10.463535+00:00"}