{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NAS7HULCUF2DUWV6QVUBNNHRI7","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":"39e1fdf5c756e30d6567ae4c618a73ad21baed172c773ebe36daa33a173c1845","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-14T18:25:13Z","title_canon_sha256":"309a400a135e4aa56e81bfbb4f8a4ec2bcce4d3a03755b842a984f2b49a977e8"},"schema_version":"1.0","source":{"id":"2402.09379","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.09379","created_at":"2026-07-05T08:00:41Z"},{"alias_kind":"arxiv_version","alias_value":"2402.09379v3","created_at":"2026-07-05T08:00:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.09379","created_at":"2026-07-05T08:00:41Z"},{"alias_kind":"pith_short_12","alias_value":"NAS7HULCUF2D","created_at":"2026-07-05T08:00:41Z"},{"alias_kind":"pith_short_16","alias_value":"NAS7HULCUF2DUWV6","created_at":"2026-07-05T08:00:41Z"},{"alias_kind":"pith_short_8","alias_value":"NAS7HULC","created_at":"2026-07-05T08:00:41Z"}],"graph_snapshots":[{"event_id":"sha256:fde2c39843acaf0de5b6c66559e417ce8eb95d3c8ee23f2ce3795ee2fb8e3abb","target":"graph","created_at":"2026-07-05T08:00:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2402.09379/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Cameron Musco, Christopher Musco, Diana Halikias, Feyza Duman Keles, Noah Amsel, Tyler Chen","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-14T18:25:13Z","title":"Fixed-sparsity matrix approximation from matrix-vector products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.09379","kind":"arxiv","version":3},"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:5e204b71a771b65ee9a21700c185a02c4035fb61f65bdda83f1a43e13c3b1e8c","target":"record","created_at":"2026-07-05T08:00:41Z","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":"39e1fdf5c756e30d6567ae4c618a73ad21baed172c773ebe36daa33a173c1845","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-14T18:25:13Z","title_canon_sha256":"309a400a135e4aa56e81bfbb4f8a4ec2bcce4d3a03755b842a984f2b49a977e8"},"schema_version":"1.0","source":{"id":"2402.09379","kind":"arxiv","version":3}},"canonical_sha256":"6825f3d162a1743a5abe856816b4f147d6e2c81cff8445c74d98246344e0fa8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6825f3d162a1743a5abe856816b4f147d6e2c81cff8445c74d98246344e0fa8b","first_computed_at":"2026-07-05T08:00:41.058671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:00:41.058671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YoNkCnJZWih3EDIOg7fV20kcUBXpAB0THAMJA2QMavVZXwUyhBqZG0qwENyVhaiaCfEkYs4xJka7kbrD1uyCBw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:00:41.059166Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.09379","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e204b71a771b65ee9a21700c185a02c4035fb61f65bdda83f1a43e13c3b1e8c","sha256:fde2c39843acaf0de5b6c66559e417ce8eb95d3c8ee23f2ce3795ee2fb8e3abb"],"state_sha256":"5995b8999c23cbba56fc27b52140ad1f82de392a1b127d869caf72329220e9da"}