{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GOMQ64UFD2RWJKLZPHRCVCDTKX","short_pith_number":"pith:GOMQ64UF","schema_version":"1.0","canonical_sha256":"33990f72851ea364a97979e22a887355f96b21f72b6ac9b6d2ffde56f27261e8","source":{"kind":"arxiv","id":"1503.07152","version":1},"attestation_state":"computed","paper":{"title":"Compressing rank-structured matrices via randomized sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Per-Gunnar Martinsson","submitted_at":"2015-03-24T19:49:50Z","abstract_excerpt":"Randomized sampling has recently been proven a highly efficient technique for computing approximate factorizations of matrices that have low numerical rank. This paper describes an extension of such techniques to a wider class of matrices that are not themselves rank-deficient, but have off-diagonal blocks that are; specifically, the classes of so called \\textit{Hierarchically Off-Diagonal Low Rank (HODLR)} matrices and \\textit{Hierarchically Block Separable (HBS)} matrices. Such matrices arise frequently in numerical analysis and signal processing, in particular in the construction of fast me"},"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":"1503.07152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-03-24T19:49:50Z","cross_cats_sorted":[],"title_canon_sha256":"01ddaaafcfa2df22c1a3485026a1f5e75b06dfda920935854396d60b446432e0","abstract_canon_sha256":"6aba1d43f7d932d9087fa4868b3e331851237891795d73e382f34196503cb9d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:29.287770Z","signature_b64":"AOC2JM9W8d1io1mX7JKSG37WrlpODspp1t/GpQypZnx16O2/BxuhB2/kevTv4Yv0q9EtoSwWL8MKQOtsLd2nBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33990f72851ea364a97979e22a887355f96b21f72b6ac9b6d2ffde56f27261e8","last_reissued_at":"2026-05-18T02:20:29.287236Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:29.287236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressing rank-structured matrices via randomized sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Per-Gunnar Martinsson","submitted_at":"2015-03-24T19:49:50Z","abstract_excerpt":"Randomized sampling has recently been proven a highly efficient technique for computing approximate factorizations of matrices that have low numerical rank. This paper describes an extension of such techniques to a wider class of matrices that are not themselves rank-deficient, but have off-diagonal blocks that are; specifically, the classes of so called \\textit{Hierarchically Off-Diagonal Low Rank (HODLR)} matrices and \\textit{Hierarchically Block Separable (HBS)} matrices. Such matrices arise frequently in numerical analysis and signal processing, in particular in the construction of fast me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07152","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":""},"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":"1503.07152","created_at":"2026-05-18T02:20:29.287331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.07152v1","created_at":"2026-05-18T02:20:29.287331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07152","created_at":"2026-05-18T02:20:29.287331+00:00"},{"alias_kind":"pith_short_12","alias_value":"GOMQ64UFD2RW","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GOMQ64UFD2RWJKLZ","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GOMQ64UF","created_at":"2026-05-18T12:29:22.688609+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/GOMQ64UFD2RWJKLZPHRCVCDTKX","json":"https://pith.science/pith/GOMQ64UFD2RWJKLZPHRCVCDTKX.json","graph_json":"https://pith.science/api/pith-number/GOMQ64UFD2RWJKLZPHRCVCDTKX/graph.json","events_json":"https://pith.science/api/pith-number/GOMQ64UFD2RWJKLZPHRCVCDTKX/events.json","paper":"https://pith.science/paper/GOMQ64UF"},"agent_actions":{"view_html":"https://pith.science/pith/GOMQ64UFD2RWJKLZPHRCVCDTKX","download_json":"https://pith.science/pith/GOMQ64UFD2RWJKLZPHRCVCDTKX.json","view_paper":"https://pith.science/paper/GOMQ64UF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.07152&json=true","fetch_graph":"https://pith.science/api/pith-number/GOMQ64UFD2RWJKLZPHRCVCDTKX/graph.json","fetch_events":"https://pith.science/api/pith-number/GOMQ64UFD2RWJKLZPHRCVCDTKX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GOMQ64UFD2RWJKLZPHRCVCDTKX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GOMQ64UFD2RWJKLZPHRCVCDTKX/action/storage_attestation","attest_author":"https://pith.science/pith/GOMQ64UFD2RWJKLZPHRCVCDTKX/action/author_attestation","sign_citation":"https://pith.science/pith/GOMQ64UFD2RWJKLZPHRCVCDTKX/action/citation_signature","submit_replication":"https://pith.science/pith/GOMQ64UFD2RWJKLZPHRCVCDTKX/action/replication_record"}},"created_at":"2026-05-18T02:20:29.287331+00:00","updated_at":"2026-05-18T02:20:29.287331+00:00"}