{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SY7QLMOH3XM52FHBRFIPODJOHC","short_pith_number":"pith:SY7QLMOH","schema_version":"1.0","canonical_sha256":"963f05b1c7ddd9dd14e18950f70d2e38a3e6aebea437cab4afb7bd055d914657","source":{"kind":"arxiv","id":"2606.12179","version":1},"attestation_state":"computed","paper":{"title":"Nearly Instance Optimal Sparse 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":"Christoper Musco, Indu Ramesh","submitted_at":"2026-06-10T15:04:46Z","abstract_excerpt":"A large body of work studies the problem of learning an approximation to an implicit matrix $A\\in \\mathbb{R}^{m\\times n}$ that is only accessible implicitly via matrix-vector product queries (matvec queries) of the form ${x} \\rightarrow {A}{x}$ or ${x} \\rightarrow {A}^T{x}$. Of particular interest are methods that learn a near-optimal approximation with a fixed sparsity pattern. For example, we might want to learn a near-optimal diagonal, banded, or arrow-head approximation to an implicit matrix $A$.\n  Naturally, the number of matvec queries required to solve this problem depends on the sparsi"},"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":"2606.12179","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-10T15:04:46Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"0fde4166bfb5bae4d47227e9cf10cdf5db022b53f8151230dd6c7c99c26db24e","abstract_canon_sha256":"e45237ad5577695aa53704c8c869797761158728fb0d9b835111527ba9215401"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:52.701221Z","signature_b64":"YLNgZ1to8EJEepYS7mENAucuFTLK+KAiJZm6troTOLYzbA+xMqeAw5Y58u9y/hmf/KWnMt93WVwcoZ+PkEz9Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"963f05b1c7ddd9dd14e18950f70d2e38a3e6aebea437cab4afb7bd055d914657","last_reissued_at":"2026-06-11T01:10:52.700476Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:52.700476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly Instance Optimal Sparse 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":"Christoper Musco, Indu Ramesh","submitted_at":"2026-06-10T15:04:46Z","abstract_excerpt":"A large body of work studies the problem of learning an approximation to an implicit matrix $A\\in \\mathbb{R}^{m\\times n}$ that is only accessible implicitly via matrix-vector product queries (matvec queries) of the form ${x} \\rightarrow {A}{x}$ or ${x} \\rightarrow {A}^T{x}$. Of particular interest are methods that learn a near-optimal approximation with a fixed sparsity pattern. For example, we might want to learn a near-optimal diagonal, banded, or arrow-head approximation to an implicit matrix $A$.\n  Naturally, the number of matvec queries required to solve this problem depends on the sparsi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12179","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/2606.12179/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":"2606.12179","created_at":"2026-06-11T01:10:52.700602+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.12179v1","created_at":"2026-06-11T01:10:52.700602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12179","created_at":"2026-06-11T01:10:52.700602+00:00"},{"alias_kind":"pith_short_12","alias_value":"SY7QLMOH3XM5","created_at":"2026-06-11T01:10:52.700602+00:00"},{"alias_kind":"pith_short_16","alias_value":"SY7QLMOH3XM52FHB","created_at":"2026-06-11T01:10:52.700602+00:00"},{"alias_kind":"pith_short_8","alias_value":"SY7QLMOH","created_at":"2026-06-11T01:10:52.700602+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/SY7QLMOH3XM52FHBRFIPODJOHC","json":"https://pith.science/pith/SY7QLMOH3XM52FHBRFIPODJOHC.json","graph_json":"https://pith.science/api/pith-number/SY7QLMOH3XM52FHBRFIPODJOHC/graph.json","events_json":"https://pith.science/api/pith-number/SY7QLMOH3XM52FHBRFIPODJOHC/events.json","paper":"https://pith.science/paper/SY7QLMOH"},"agent_actions":{"view_html":"https://pith.science/pith/SY7QLMOH3XM52FHBRFIPODJOHC","download_json":"https://pith.science/pith/SY7QLMOH3XM52FHBRFIPODJOHC.json","view_paper":"https://pith.science/paper/SY7QLMOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.12179&json=true","fetch_graph":"https://pith.science/api/pith-number/SY7QLMOH3XM52FHBRFIPODJOHC/graph.json","fetch_events":"https://pith.science/api/pith-number/SY7QLMOH3XM52FHBRFIPODJOHC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SY7QLMOH3XM52FHBRFIPODJOHC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SY7QLMOH3XM52FHBRFIPODJOHC/action/storage_attestation","attest_author":"https://pith.science/pith/SY7QLMOH3XM52FHBRFIPODJOHC/action/author_attestation","sign_citation":"https://pith.science/pith/SY7QLMOH3XM52FHBRFIPODJOHC/action/citation_signature","submit_replication":"https://pith.science/pith/SY7QLMOH3XM52FHBRFIPODJOHC/action/replication_record"}},"created_at":"2026-06-11T01:10:52.700602+00:00","updated_at":"2026-06-11T01:10:52.700602+00:00"}