{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:YBLNDFBUPOB3VCKCJ3E4M6LLNL","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":"2ba6d04451e47fe8182c0c65946377c95ecc98bc7d19af9ce3b79f8d9d891dae","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2022-05-06T02:52:31Z","title_canon_sha256":"2800fc23119c6f6ba1e6639f8dc1f167d6e14461e54c2d9021bdd764dc8afc11"},"schema_version":"1.0","source":{"id":"2205.02990","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.02990","created_at":"2026-07-05T08:35:17Z"},{"alias_kind":"arxiv_version","alias_value":"2205.02990v3","created_at":"2026-07-05T08:35:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.02990","created_at":"2026-07-05T08:35:17Z"},{"alias_kind":"pith_short_12","alias_value":"YBLNDFBUPOB3","created_at":"2026-07-05T08:35:17Z"},{"alias_kind":"pith_short_16","alias_value":"YBLNDFBUPOB3VCKC","created_at":"2026-07-05T08:35:17Z"},{"alias_kind":"pith_short_8","alias_value":"YBLNDFBU","created_at":"2026-07-05T08:35:17Z"}],"graph_snapshots":[{"event_id":"sha256:1d0311f61daf238a8340b1ca5306706672ddf1c420c5ae90ea64f0df42bf513b","target":"graph","created_at":"2026-07-05T08:35:17Z","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/2205.02990/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A randomized algorithm for computing a compressed representation of a given rank-structured matrix $A \\in \\mathbb{R}^{N\\times N}$ is presented. The algorithm interacts with $A$ only through its action on vectors. Specifically, it draws two tall thin matrices $\\Omega,\\,\\Psi \\in \\mathbb{R}^{N\\times s}$ from a suitable distribution, and then reconstructs $A$ from the information contained in the set $\\{A\\Omega,\\,\\Omega,\\,A^{*}\\Psi,\\,\\Psi\\}$. For the specific case of a \"Hierarchically Block Separable (HBS)\" matrix (a.k.a. Hierarchically Semi-Separable matrix) of block rank $k$, the number of sampl","authors_text":"James Levitt, Per-Gunnar Martinsson","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2022-05-06T02:52:31Z","title":"Linear-Complexity Black-Box Randomized Compression of Rank-Structured Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.02990","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:3272fc1b87c22fa55627ec265726707f75e7cff7f04f523a2be511489c17da3a","target":"record","created_at":"2026-07-05T08:35:17Z","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":"2ba6d04451e47fe8182c0c65946377c95ecc98bc7d19af9ce3b79f8d9d891dae","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2022-05-06T02:52:31Z","title_canon_sha256":"2800fc23119c6f6ba1e6639f8dc1f167d6e14461e54c2d9021bdd764dc8afc11"},"schema_version":"1.0","source":{"id":"2205.02990","kind":"arxiv","version":3}},"canonical_sha256":"c056d194347b83ba89424ec9c6796b6aed52e13a18db56ab3285e718610faf27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c056d194347b83ba89424ec9c6796b6aed52e13a18db56ab3285e718610faf27","first_computed_at":"2026-07-05T08:35:17.559822Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:35:17.559822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CgrvsuU60go66zma7aHlVoL0St/yYTCZGwhWB8Pk2f091aQLu9sYGPy3YqMgOgSf7/vsfyAdR86EwOUHvV19Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:35:17.560326Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.02990","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3272fc1b87c22fa55627ec265726707f75e7cff7f04f523a2be511489c17da3a","sha256:1d0311f61daf238a8340b1ca5306706672ddf1c420c5ae90ea64f0df42bf513b"],"state_sha256":"eb7450da4cdc660c9aeae9ffe237e6319020b3d76f6831df44e08468621be46c"}