{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SY7QLMOH3XM52FHBRFIPODJOHC","short_pith_number":"pith:SY7QLMOH","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"},"canonical_sha256":"963f05b1c7ddd9dd14e18950f70d2e38a3e6aebea437cab4afb7bd055d914657","source":{"kind":"arxiv","id":"2606.12179","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.12179","created_at":"2026-06-11T01:10:52Z"},{"alias_kind":"arxiv_version","alias_value":"2606.12179v1","created_at":"2026-06-11T01:10:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12179","created_at":"2026-06-11T01:10:52Z"},{"alias_kind":"pith_short_12","alias_value":"SY7QLMOH3XM5","created_at":"2026-06-11T01:10:52Z"},{"alias_kind":"pith_short_16","alias_value":"SY7QLMOH3XM52FHB","created_at":"2026-06-11T01:10:52Z"},{"alias_kind":"pith_short_8","alias_value":"SY7QLMOH","created_at":"2026-06-11T01:10:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SY7QLMOH3XM52FHBRFIPODJOHC","target":"record","payload":{"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"},"canonical_sha256":"963f05b1c7ddd9dd14e18950f70d2e38a3e6aebea437cab4afb7bd055d914657","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"},"source_kind":"arxiv","source_id":"2606.12179","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T01:10:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vYNxEdxg66oJ8sdgbPjUDkUpfkat2j2EhG/rprZo6kdb+nJXssdg3JorwfS6Kdwy50pSwz7scA29uZZLY0sKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:50:26.798449Z"},"content_sha256":"b6dc932fe95f1bb106d3c1adecac079212c57192dff0458d72611d4dfcf395f2","schema_version":"1.0","event_id":"sha256:b6dc932fe95f1bb106d3c1adecac079212c57192dff0458d72611d4dfcf395f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SY7QLMOH3XM52FHBRFIPODJOHC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T01:10:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZmrR1YBbsUaVhRYolKOA7jSeJavDTUxsYthch0+yUL8ao+/fFg1I8sDxa89lS/bAsDctIReQ/f1vSPK+tSGxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:50:26.798991Z"},"content_sha256":"2239c901eb0c7a87d13e8af5d60a5eb0681593a068b70762f3802ed0ab9de1b2","schema_version":"1.0","event_id":"sha256:2239c901eb0c7a87d13e8af5d60a5eb0681593a068b70762f3802ed0ab9de1b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SY7QLMOH3XM52FHBRFIPODJOHC/bundle.json","state_url":"https://pith.science/pith/SY7QLMOH3XM52FHBRFIPODJOHC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SY7QLMOH3XM52FHBRFIPODJOHC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T12:50:26Z","links":{"resolver":"https://pith.science/pith/SY7QLMOH3XM52FHBRFIPODJOHC","bundle":"https://pith.science/pith/SY7QLMOH3XM52FHBRFIPODJOHC/bundle.json","state":"https://pith.science/pith/SY7QLMOH3XM52FHBRFIPODJOHC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SY7QLMOH3XM52FHBRFIPODJOHC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SY7QLMOH3XM52FHBRFIPODJOHC","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":"e45237ad5577695aa53704c8c869797761158728fb0d9b835111527ba9215401","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-10T15:04:46Z","title_canon_sha256":"0fde4166bfb5bae4d47227e9cf10cdf5db022b53f8151230dd6c7c99c26db24e"},"schema_version":"1.0","source":{"id":"2606.12179","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.12179","created_at":"2026-06-11T01:10:52Z"},{"alias_kind":"arxiv_version","alias_value":"2606.12179v1","created_at":"2026-06-11T01:10:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12179","created_at":"2026-06-11T01:10:52Z"},{"alias_kind":"pith_short_12","alias_value":"SY7QLMOH3XM5","created_at":"2026-06-11T01:10:52Z"},{"alias_kind":"pith_short_16","alias_value":"SY7QLMOH3XM52FHB","created_at":"2026-06-11T01:10:52Z"},{"alias_kind":"pith_short_8","alias_value":"SY7QLMOH","created_at":"2026-06-11T01:10:52Z"}],"graph_snapshots":[{"event_id":"sha256:2239c901eb0c7a87d13e8af5d60a5eb0681593a068b70762f3802ed0ab9de1b2","target":"graph","created_at":"2026-06-11T01:10:52Z","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/2606.12179/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Christoper Musco, Indu Ramesh","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12179","kind":"arxiv","version":1},"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:b6dc932fe95f1bb106d3c1adecac079212c57192dff0458d72611d4dfcf395f2","target":"record","created_at":"2026-06-11T01:10:52Z","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":"e45237ad5577695aa53704c8c869797761158728fb0d9b835111527ba9215401","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-10T15:04:46Z","title_canon_sha256":"0fde4166bfb5bae4d47227e9cf10cdf5db022b53f8151230dd6c7c99c26db24e"},"schema_version":"1.0","source":{"id":"2606.12179","kind":"arxiv","version":1}},"canonical_sha256":"963f05b1c7ddd9dd14e18950f70d2e38a3e6aebea437cab4afb7bd055d914657","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"963f05b1c7ddd9dd14e18950f70d2e38a3e6aebea437cab4afb7bd055d914657","first_computed_at":"2026-06-11T01:10:52.700476Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:10:52.700476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YLNgZ1to8EJEepYS7mENAucuFTLK+KAiJZm6troTOLYzbA+xMqeAw5Y58u9y/hmf/KWnMt93WVwcoZ+PkEz9Aw==","signature_status":"signed_v1","signed_at":"2026-06-11T01:10:52.701221Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.12179","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6dc932fe95f1bb106d3c1adecac079212c57192dff0458d72611d4dfcf395f2","sha256:2239c901eb0c7a87d13e8af5d60a5eb0681593a068b70762f3802ed0ab9de1b2"],"state_sha256":"70d7b2b0e1b45ba92e0885ea515320017e5bb9aa09f4f0da39c48579e6e9029f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uq7Bp24eW3Uaiz72t4zTeTJX08RACulbAH1zKUUDL+xGSRfeWOQ3kjrfFriM3JMF3vEczSHQvORqKx4GaTf2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T12:50:26.802146Z","bundle_sha256":"30d36b04075e4217f73d96efa5e0b6e117f67e5798d06a857d4d07678ce1acf7"}}