{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NAS7HULCUF2DUWV6QVUBNNHRI7","short_pith_number":"pith:NAS7HULC","schema_version":"1.0","canonical_sha256":"6825f3d162a1743a5abe856816b4f147d6e2c81cff8445c74d98246344e0fa8b","source":{"kind":"arxiv","id":"2402.09379","version":3},"attestation_state":"computed","paper":{"title":"Fixed-sparsity matrix approximation from matrix-vector products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Cameron Musco, Christopher Musco, Diana Halikias, Feyza Duman Keles, Noah Amsel, Tyler Chen","submitted_at":"2024-02-14T18:25:13Z","abstract_excerpt":"We study the problem of approximating a matrix $\\mathbf{A}$ with a matrix that has a fixed sparsity pattern (e.g., diagonal, banded, etc.), when $\\mathbf{A}$ is accessed only by matrix-vector products. We describe a simple randomized algorithm that returns an approximation with the given sparsity pattern with Frobenius-norm error at most $(1+\\varepsilon)$ times the best possible error. When each row of the desired sparsity pattern has at most $s$ nonzero entries, this algorithm requires $O(s/\\varepsilon)$ non-adaptive matrix-vector products with $\\mathbf{A}$. We also prove a matching lower-bou"},"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":"2402.09379","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-14T18:25:13Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"309a400a135e4aa56e81bfbb4f8a4ec2bcce4d3a03755b842a984f2b49a977e8","abstract_canon_sha256":"39e1fdf5c756e30d6567ae4c618a73ad21baed172c773ebe36daa33a173c1845"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:00:41.059166Z","signature_b64":"YoNkCnJZWih3EDIOg7fV20kcUBXpAB0THAMJA2QMavVZXwUyhBqZG0qwENyVhaiaCfEkYs4xJka7kbrD1uyCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6825f3d162a1743a5abe856816b4f147d6e2c81cff8445c74d98246344e0fa8b","last_reissued_at":"2026-07-05T08:00:41.058671Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:00:41.058671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed-sparsity matrix approximation from matrix-vector products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Cameron Musco, Christopher Musco, Diana Halikias, Feyza Duman Keles, Noah Amsel, Tyler Chen","submitted_at":"2024-02-14T18:25:13Z","abstract_excerpt":"We study the problem of approximating a matrix $\\mathbf{A}$ with a matrix that has a fixed sparsity pattern (e.g., diagonal, banded, etc.), when $\\mathbf{A}$ is accessed only by matrix-vector products. We describe a simple randomized algorithm that returns an approximation with the given sparsity pattern with Frobenius-norm error at most $(1+\\varepsilon)$ times the best possible error. When each row of the desired sparsity pattern has at most $s$ nonzero entries, this algorithm requires $O(s/\\varepsilon)$ non-adaptive matrix-vector products with $\\mathbf{A}$. We also prove a matching lower-bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.09379","kind":"arxiv","version":3},"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/2402.09379/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":"2402.09379","created_at":"2026-07-05T08:00:41.058732+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.09379v3","created_at":"2026-07-05T08:00:41.058732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.09379","created_at":"2026-07-05T08:00:41.058732+00:00"},{"alias_kind":"pith_short_12","alias_value":"NAS7HULCUF2D","created_at":"2026-07-05T08:00:41.058732+00:00"},{"alias_kind":"pith_short_16","alias_value":"NAS7HULCUF2DUWV6","created_at":"2026-07-05T08:00:41.058732+00:00"},{"alias_kind":"pith_short_8","alias_value":"NAS7HULC","created_at":"2026-07-05T08:00:41.058732+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2408.12385","citing_title":"Sharper Bounds for Chebyshev Moment Matching, with Applications","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NAS7HULCUF2DUWV6QVUBNNHRI7","json":"https://pith.science/pith/NAS7HULCUF2DUWV6QVUBNNHRI7.json","graph_json":"https://pith.science/api/pith-number/NAS7HULCUF2DUWV6QVUBNNHRI7/graph.json","events_json":"https://pith.science/api/pith-number/NAS7HULCUF2DUWV6QVUBNNHRI7/events.json","paper":"https://pith.science/paper/NAS7HULC"},"agent_actions":{"view_html":"https://pith.science/pith/NAS7HULCUF2DUWV6QVUBNNHRI7","download_json":"https://pith.science/pith/NAS7HULCUF2DUWV6QVUBNNHRI7.json","view_paper":"https://pith.science/paper/NAS7HULC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.09379&json=true","fetch_graph":"https://pith.science/api/pith-number/NAS7HULCUF2DUWV6QVUBNNHRI7/graph.json","fetch_events":"https://pith.science/api/pith-number/NAS7HULCUF2DUWV6QVUBNNHRI7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NAS7HULCUF2DUWV6QVUBNNHRI7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NAS7HULCUF2DUWV6QVUBNNHRI7/action/storage_attestation","attest_author":"https://pith.science/pith/NAS7HULCUF2DUWV6QVUBNNHRI7/action/author_attestation","sign_citation":"https://pith.science/pith/NAS7HULCUF2DUWV6QVUBNNHRI7/action/citation_signature","submit_replication":"https://pith.science/pith/NAS7HULCUF2DUWV6QVUBNNHRI7/action/replication_record"}},"created_at":"2026-07-05T08:00:41.058732+00:00","updated_at":"2026-07-05T08:00:41.058732+00:00"}