{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:YBLNDFBUPOB3VCKCJ3E4M6LLNL","short_pith_number":"pith:YBLNDFBU","schema_version":"1.0","canonical_sha256":"c056d194347b83ba89424ec9c6796b6aed52e13a18db56ab3285e718610faf27","source":{"kind":"arxiv","id":"2205.02990","version":3},"attestation_state":"computed","paper":{"title":"Linear-Complexity Black-Box Randomized Compression of Rank-Structured Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"James Levitt, Per-Gunnar Martinsson","submitted_at":"2022-05-06T02:52:31Z","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"},"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":"2205.02990","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2022-05-06T02:52:31Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"2800fc23119c6f6ba1e6639f8dc1f167d6e14461e54c2d9021bdd764dc8afc11","abstract_canon_sha256":"2ba6d04451e47fe8182c0c65946377c95ecc98bc7d19af9ce3b79f8d9d891dae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:35:17.560326Z","signature_b64":"CgrvsuU60go66zma7aHlVoL0St/yYTCZGwhWB8Pk2f091aQLu9sYGPy3YqMgOgSf7/vsfyAdR86EwOUHvV19Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c056d194347b83ba89424ec9c6796b6aed52e13a18db56ab3285e718610faf27","last_reissued_at":"2026-07-05T08:35:17.559822Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:35:17.559822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-Complexity Black-Box Randomized Compression of Rank-Structured Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"James Levitt, Per-Gunnar Martinsson","submitted_at":"2022-05-06T02:52:31Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.02990","kind":"arxiv","version":3},"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/2205.02990/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":"2205.02990","created_at":"2026-07-05T08:35:17.559879+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.02990v3","created_at":"2026-07-05T08:35:17.559879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.02990","created_at":"2026-07-05T08:35:17.559879+00:00"},{"alias_kind":"pith_short_12","alias_value":"YBLNDFBUPOB3","created_at":"2026-07-05T08:35:17.559879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YBLNDFBUPOB3VCKC","created_at":"2026-07-05T08:35:17.559879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YBLNDFBU","created_at":"2026-07-05T08:35:17.559879+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/YBLNDFBUPOB3VCKCJ3E4M6LLNL","json":"https://pith.science/pith/YBLNDFBUPOB3VCKCJ3E4M6LLNL.json","graph_json":"https://pith.science/api/pith-number/YBLNDFBUPOB3VCKCJ3E4M6LLNL/graph.json","events_json":"https://pith.science/api/pith-number/YBLNDFBUPOB3VCKCJ3E4M6LLNL/events.json","paper":"https://pith.science/paper/YBLNDFBU"},"agent_actions":{"view_html":"https://pith.science/pith/YBLNDFBUPOB3VCKCJ3E4M6LLNL","download_json":"https://pith.science/pith/YBLNDFBUPOB3VCKCJ3E4M6LLNL.json","view_paper":"https://pith.science/paper/YBLNDFBU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.02990&json=true","fetch_graph":"https://pith.science/api/pith-number/YBLNDFBUPOB3VCKCJ3E4M6LLNL/graph.json","fetch_events":"https://pith.science/api/pith-number/YBLNDFBUPOB3VCKCJ3E4M6LLNL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YBLNDFBUPOB3VCKCJ3E4M6LLNL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YBLNDFBUPOB3VCKCJ3E4M6LLNL/action/storage_attestation","attest_author":"https://pith.science/pith/YBLNDFBUPOB3VCKCJ3E4M6LLNL/action/author_attestation","sign_citation":"https://pith.science/pith/YBLNDFBUPOB3VCKCJ3E4M6LLNL/action/citation_signature","submit_replication":"https://pith.science/pith/YBLNDFBUPOB3VCKCJ3E4M6LLNL/action/replication_record"}},"created_at":"2026-07-05T08:35:17.559879+00:00","updated_at":"2026-07-05T08:35:17.559879+00:00"}