{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3SEAAVUM6TLAMCRM56BQAXMYRH","short_pith_number":"pith:3SEAAVUM","schema_version":"1.0","canonical_sha256":"dc8800568cf4d6060a2cef83005d9889cd370a24fd99878b97b93d7a96a615e8","source":{"kind":"arxiv","id":"2507.19290","version":1},"attestation_state":"computed","paper":{"title":"Query Efficient Structured Matrix Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Cameron Musco, Chinmay Hegde, Christopher Musco, David Persson, Feyza Duman Keles, Noah Amsel, Pratyush Avi, Tyler Chen","submitted_at":"2025-07-25T14:04:20Z","abstract_excerpt":"We study the problem of learning a structured approximation (low-rank, sparse, banded, etc.) to an unknown matrix $A$ given access to matrix-vector product (matvec) queries of the form $x \\rightarrow Ax$ and $x \\rightarrow A^Tx$. This problem is of central importance to algorithms across scientific computing and machine learning, with applications to fast multiplication and inversion for structured matrices, building preconditioners for first-order optimization, and as a model for differential operator learning. Prior work focuses on obtaining query complexity upper and lower bounds for learni"},"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":"2507.19290","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-25T14:04:20Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"title_canon_sha256":"915799f852232087e610d550892d4917344cf4285d6eaf6ffd0f30a9f2468b6a","abstract_canon_sha256":"ab9586f8f07fc62ca3321b23751662c8eb4b17773b43faeba61611e9f7fae30a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:43:22.969448Z","signature_b64":"nn5MfUiYjunQENramkysBWN+QiZzozWPnNJW1cWZHOjYq50xrhkyu1Yuha3JFNG+aj3xwc/CmEbmI3m197rUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc8800568cf4d6060a2cef83005d9889cd370a24fd99878b97b93d7a96a615e8","last_reissued_at":"2026-07-05T11:43:22.968840Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:43:22.968840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Query Efficient Structured Matrix Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Cameron Musco, Chinmay Hegde, Christopher Musco, David Persson, Feyza Duman Keles, Noah Amsel, Pratyush Avi, Tyler Chen","submitted_at":"2025-07-25T14:04:20Z","abstract_excerpt":"We study the problem of learning a structured approximation (low-rank, sparse, banded, etc.) to an unknown matrix $A$ given access to matrix-vector product (matvec) queries of the form $x \\rightarrow Ax$ and $x \\rightarrow A^Tx$. This problem is of central importance to algorithms across scientific computing and machine learning, with applications to fast multiplication and inversion for structured matrices, building preconditioners for first-order optimization, and as a model for differential operator learning. Prior work focuses on obtaining query complexity upper and lower bounds for learni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.19290","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.19290/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":"2507.19290","created_at":"2026-07-05T11:43:22.968917+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.19290v1","created_at":"2026-07-05T11:43:22.968917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19290","created_at":"2026-07-05T11:43:22.968917+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SEAAVUM6TLA","created_at":"2026-07-05T11:43:22.968917+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SEAAVUM6TLAMCRM","created_at":"2026-07-05T11:43:22.968917+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SEAAVUM","created_at":"2026-07-05T11:43:22.968917+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.01335","citing_title":"Transpose-free linear algebra","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3SEAAVUM6TLAMCRM56BQAXMYRH","json":"https://pith.science/pith/3SEAAVUM6TLAMCRM56BQAXMYRH.json","graph_json":"https://pith.science/api/pith-number/3SEAAVUM6TLAMCRM56BQAXMYRH/graph.json","events_json":"https://pith.science/api/pith-number/3SEAAVUM6TLAMCRM56BQAXMYRH/events.json","paper":"https://pith.science/paper/3SEAAVUM"},"agent_actions":{"view_html":"https://pith.science/pith/3SEAAVUM6TLAMCRM56BQAXMYRH","download_json":"https://pith.science/pith/3SEAAVUM6TLAMCRM56BQAXMYRH.json","view_paper":"https://pith.science/paper/3SEAAVUM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.19290&json=true","fetch_graph":"https://pith.science/api/pith-number/3SEAAVUM6TLAMCRM56BQAXMYRH/graph.json","fetch_events":"https://pith.science/api/pith-number/3SEAAVUM6TLAMCRM56BQAXMYRH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SEAAVUM6TLAMCRM56BQAXMYRH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SEAAVUM6TLAMCRM56BQAXMYRH/action/storage_attestation","attest_author":"https://pith.science/pith/3SEAAVUM6TLAMCRM56BQAXMYRH/action/author_attestation","sign_citation":"https://pith.science/pith/3SEAAVUM6TLAMCRM56BQAXMYRH/action/citation_signature","submit_replication":"https://pith.science/pith/3SEAAVUM6TLAMCRM56BQAXMYRH/action/replication_record"}},"created_at":"2026-07-05T11:43:22.968917+00:00","updated_at":"2026-07-05T11:43:22.968917+00:00"}