{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:IMD57G6FXOJLB4VSYJ4ZQQRI6R","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":"8d714af61ea6711d0d0894eeec53d97c52223f4a1d280daf90837f5496b9e271","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-07-05T17:49:15Z","title_canon_sha256":"56b13c734dedb0ee4cd02e2eedbaeaf3c318fdca415b6ba06b5780040cb0173a"},"schema_version":"1.0","source":{"id":"2407.04686","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.04686","created_at":"2026-07-05T09:25:20Z"},{"alias_kind":"arxiv_version","alias_value":"2407.04686v2","created_at":"2026-07-05T09:25:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.04686","created_at":"2026-07-05T09:25:20Z"},{"alias_kind":"pith_short_12","alias_value":"IMD57G6FXOJL","created_at":"2026-07-05T09:25:20Z"},{"alias_kind":"pith_short_16","alias_value":"IMD57G6FXOJLB4VS","created_at":"2026-07-05T09:25:20Z"},{"alias_kind":"pith_short_8","alias_value":"IMD57G6F","created_at":"2026-07-05T09:25:20Z"}],"graph_snapshots":[{"event_id":"sha256:89373c07b664f5a7b2a6b130afff34a0a26872523f0fa1b2d4916f6a74a706c8","target":"graph","created_at":"2026-07-05T09:25:20Z","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/2407.04686/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We describe a randomized algorithm for producing a near-optimal hierarchical off-diagonal low-rank (HODLR) approximation to an $n\\times n$ matrix $\\mathbf{A}$, accessible only though matrix-vector products with $\\mathbf{A}$ and $\\mathbf{A}^{\\mathsf{T}}$. We prove that, for the rank-$k$ HODLR approximation problem, our method achieves a $(1+\\beta)^{\\log(n)}$-optimal approximation in expected Frobenius norm using $O(k\\log(n)/\\beta^3)$ matrix-vector products. In particular, the algorithm obtains a $(1+\\varepsilon)$-optimal approximation with $O(k\\log^4(n)/\\varepsilon^3)$ matrix-vector products, a","authors_text":"Cameron Musco, Christopher Musco, David Persson, Diana Halikias, Feyza Duman Keles, 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-07-05T17:49:15Z","title":"Near-optimal hierarchical matrix approximation from matrix-vector products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.04686","kind":"arxiv","version":2},"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:7e5f9eed48fba8b54b4e1ac01acb49e1c1f237210a38d59c7c8f59382f64b631","target":"record","created_at":"2026-07-05T09:25:20Z","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":"8d714af61ea6711d0d0894eeec53d97c52223f4a1d280daf90837f5496b9e271","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-07-05T17:49:15Z","title_canon_sha256":"56b13c734dedb0ee4cd02e2eedbaeaf3c318fdca415b6ba06b5780040cb0173a"},"schema_version":"1.0","source":{"id":"2407.04686","kind":"arxiv","version":2}},"canonical_sha256":"4307df9bc5bb92b0f2b2c279984228f46f4909518dd6cf6adcec8256861ec88c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4307df9bc5bb92b0f2b2c279984228f46f4909518dd6cf6adcec8256861ec88c","first_computed_at":"2026-07-05T09:25:20.109198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:25:20.109198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kfwGJa7si75goBAMmeYkamJhYOXxzC/jTmItGDx0Hde925Cr9z6B5G4PP0bZvP15t00JP7Fajpnib0GrKlK7AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:25:20.109675Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.04686","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e5f9eed48fba8b54b4e1ac01acb49e1c1f237210a38d59c7c8f59382f64b631","sha256:89373c07b664f5a7b2a6b130afff34a0a26872523f0fa1b2d4916f6a74a706c8"],"state_sha256":"d2694b51add2f0d8b2d1f776dc4af42c61a097e908e083e90e06c01ebc6308c4"}