{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:PL36HHZOPFA6Z2473SODHH3FRA","short_pith_number":"pith:PL36HHZO","schema_version":"1.0","canonical_sha256":"7af7e39f2e7941eceb9fdc9c339f65882866cd507b155a8fe76fb71c3f04e999","source":{"kind":"arxiv","id":"2209.05662","version":2},"attestation_state":"computed","paper":{"title":"Fast algorithms for least square problems with Kronecker lower subsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NA"],"primary_cat":"math.NA","authors_text":"Akil Narayan, Alireza Doostan, Nuojin Cheng, Osman Asif Malik, Stephen Becker, Yiming Xu","submitted_at":"2022-09-13T00:35:54Z","abstract_excerpt":"While leverage score sampling provides powerful tools for approximating solutions to large least squares problems, the cost of computing exact scores and sampling often prohibits practical application. This paper addresses this challenge by developing a new and efficient algorithm for exact leverage score sampling applicable to matrices that are lower column subsets of Kronecker product matrices. We synthesize relevant approximation guarantees and detail the algorithm that specifically leverages this structural property for computational efficiency. Through numerical examples, we demonstrate t"},"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":"2209.05662","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2022-09-13T00:35:54Z","cross_cats_sorted":["cs.DS","cs.NA"],"title_canon_sha256":"9d529b375062a75ba1449574048f081ab99a26a5946fe74f8397bc200dc970e9","abstract_canon_sha256":"f136e91390abae9dfcd48f76e1e27c773404ded0a9227bc6089f1d8bda2018a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:54:09.816401Z","signature_b64":"rZt21nhwraueKwrmPpxQVTNq/An3p7QX+vQBzxvyNqYybzMiORjSJXwqqaadT/kr3jfqJvjPR4TFU7erJOEPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7af7e39f2e7941eceb9fdc9c339f65882866cd507b155a8fe76fb71c3f04e999","last_reissued_at":"2026-07-05T10:54:09.815754Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:54:09.815754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast algorithms for least square problems with Kronecker lower subsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NA"],"primary_cat":"math.NA","authors_text":"Akil Narayan, Alireza Doostan, Nuojin Cheng, Osman Asif Malik, Stephen Becker, Yiming Xu","submitted_at":"2022-09-13T00:35:54Z","abstract_excerpt":"While leverage score sampling provides powerful tools for approximating solutions to large least squares problems, the cost of computing exact scores and sampling often prohibits practical application. This paper addresses this challenge by developing a new and efficient algorithm for exact leverage score sampling applicable to matrices that are lower column subsets of Kronecker product matrices. We synthesize relevant approximation guarantees and detail the algorithm that specifically leverages this structural property for computational efficiency. Through numerical examples, we demonstrate t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.05662","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/2209.05662/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":"2209.05662","created_at":"2026-07-05T10:54:09.815839+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.05662v2","created_at":"2026-07-05T10:54:09.815839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.05662","created_at":"2026-07-05T10:54:09.815839+00:00"},{"alias_kind":"pith_short_12","alias_value":"PL36HHZOPFA6","created_at":"2026-07-05T10:54:09.815839+00:00"},{"alias_kind":"pith_short_16","alias_value":"PL36HHZOPFA6Z247","created_at":"2026-07-05T10:54:09.815839+00:00"},{"alias_kind":"pith_short_8","alias_value":"PL36HHZO","created_at":"2026-07-05T10:54:09.815839+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PL36HHZOPFA6Z2473SODHH3FRA","json":"https://pith.science/pith/PL36HHZOPFA6Z2473SODHH3FRA.json","graph_json":"https://pith.science/api/pith-number/PL36HHZOPFA6Z2473SODHH3FRA/graph.json","events_json":"https://pith.science/api/pith-number/PL36HHZOPFA6Z2473SODHH3FRA/events.json","paper":"https://pith.science/paper/PL36HHZO"},"agent_actions":{"view_html":"https://pith.science/pith/PL36HHZOPFA6Z2473SODHH3FRA","download_json":"https://pith.science/pith/PL36HHZOPFA6Z2473SODHH3FRA.json","view_paper":"https://pith.science/paper/PL36HHZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.05662&json=true","fetch_graph":"https://pith.science/api/pith-number/PL36HHZOPFA6Z2473SODHH3FRA/graph.json","fetch_events":"https://pith.science/api/pith-number/PL36HHZOPFA6Z2473SODHH3FRA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PL36HHZOPFA6Z2473SODHH3FRA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PL36HHZOPFA6Z2473SODHH3FRA/action/storage_attestation","attest_author":"https://pith.science/pith/PL36HHZOPFA6Z2473SODHH3FRA/action/author_attestation","sign_citation":"https://pith.science/pith/PL36HHZOPFA6Z2473SODHH3FRA/action/citation_signature","submit_replication":"https://pith.science/pith/PL36HHZOPFA6Z2473SODHH3FRA/action/replication_record"}},"created_at":"2026-07-05T10:54:09.815839+00:00","updated_at":"2026-07-05T10:54:09.815839+00:00"}