{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GOMQ64UFD2RWJKLZPHRCVCDTKX","short_pith_number":"pith:GOMQ64UF","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"},"canonical_sha256":"33990f72851ea364a97979e22a887355f96b21f72b6ac9b6d2ffde56f27261e8","source":{"kind":"arxiv","id":"1503.07152","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07152","created_at":"2026-05-18T02:20:29Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07152v1","created_at":"2026-05-18T02:20:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07152","created_at":"2026-05-18T02:20:29Z"},{"alias_kind":"pith_short_12","alias_value":"GOMQ64UFD2RW","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GOMQ64UFD2RWJKLZ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GOMQ64UF","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GOMQ64UFD2RWJKLZPHRCVCDTKX","target":"record","payload":{"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"},"canonical_sha256":"33990f72851ea364a97979e22a887355f96b21f72b6ac9b6d2ffde56f27261e8","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"},"source_kind":"arxiv","source_id":"1503.07152","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-05-18T02:20:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DAfZOkI1w5PaBfSBqbbGyu77ehV6VNg3p3YmPVO+pQZeKeEah+jr2YuE78SRoU9ORJYItaGVIaLplZVQQr5NDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:29:20.703246Z"},"content_sha256":"35a4d3afc31462fdca511e391246c7b8224e0f9dbcb75e231c1d1efa80299035","schema_version":"1.0","event_id":"sha256:35a4d3afc31462fdca511e391246c7b8224e0f9dbcb75e231c1d1efa80299035"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GOMQ64UFD2RWJKLZPHRCVCDTKX","target":"graph","payload":{"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"},"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-05-18T02:20:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ydx9SALRda4ObBtrdQnxnWorsycmdYp1DzyO4ePnkNR/6ks69vEU51seyTfoVCon9o2dDgH4fnAg5iYqXd3nCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:29:20.703598Z"},"content_sha256":"e47f579ac3ff423858750d68d171da8f0b2bdbe213e6c38d75424533be5b8017","schema_version":"1.0","event_id":"sha256:e47f579ac3ff423858750d68d171da8f0b2bdbe213e6c38d75424533be5b8017"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GOMQ64UFD2RWJKLZPHRCVCDTKX/bundle.json","state_url":"https://pith.science/pith/GOMQ64UFD2RWJKLZPHRCVCDTKX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GOMQ64UFD2RWJKLZPHRCVCDTKX/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-06-01T14:29:20Z","links":{"resolver":"https://pith.science/pith/GOMQ64UFD2RWJKLZPHRCVCDTKX","bundle":"https://pith.science/pith/GOMQ64UFD2RWJKLZPHRCVCDTKX/bundle.json","state":"https://pith.science/pith/GOMQ64UFD2RWJKLZPHRCVCDTKX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GOMQ64UFD2RWJKLZPHRCVCDTKX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GOMQ64UFD2RWJKLZPHRCVCDTKX","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":"6aba1d43f7d932d9087fa4868b3e331851237891795d73e382f34196503cb9d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-03-24T19:49:50Z","title_canon_sha256":"01ddaaafcfa2df22c1a3485026a1f5e75b06dfda920935854396d60b446432e0"},"schema_version":"1.0","source":{"id":"1503.07152","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07152","created_at":"2026-05-18T02:20:29Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07152v1","created_at":"2026-05-18T02:20:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07152","created_at":"2026-05-18T02:20:29Z"},{"alias_kind":"pith_short_12","alias_value":"GOMQ64UFD2RW","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GOMQ64UFD2RWJKLZ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GOMQ64UF","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:e47f579ac3ff423858750d68d171da8f0b2bdbe213e6c38d75424533be5b8017","target":"graph","created_at":"2026-05-18T02:20:29Z","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"},"paper":{"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","authors_text":"Per-Gunnar Martinsson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-03-24T19:49:50Z","title":"Compressing rank-structured matrices via randomized sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07152","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:35a4d3afc31462fdca511e391246c7b8224e0f9dbcb75e231c1d1efa80299035","target":"record","created_at":"2026-05-18T02:20:29Z","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":"6aba1d43f7d932d9087fa4868b3e331851237891795d73e382f34196503cb9d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-03-24T19:49:50Z","title_canon_sha256":"01ddaaafcfa2df22c1a3485026a1f5e75b06dfda920935854396d60b446432e0"},"schema_version":"1.0","source":{"id":"1503.07152","kind":"arxiv","version":1}},"canonical_sha256":"33990f72851ea364a97979e22a887355f96b21f72b6ac9b6d2ffde56f27261e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33990f72851ea364a97979e22a887355f96b21f72b6ac9b6d2ffde56f27261e8","first_computed_at":"2026-05-18T02:20:29.287236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:29.287236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AOC2JM9W8d1io1mX7JKSG37WrlpODspp1t/GpQypZnx16O2/BxuhB2/kevTv4Yv0q9EtoSwWL8MKQOtsLd2nBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:29.287770Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.07152","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35a4d3afc31462fdca511e391246c7b8224e0f9dbcb75e231c1d1efa80299035","sha256:e47f579ac3ff423858750d68d171da8f0b2bdbe213e6c38d75424533be5b8017"],"state_sha256":"4e5c7dfdde335ebf878bf1477a028326676c0fc39d8b749c38b09fd299e7f814"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kwRW2OILWF/wWlrXw2baeooPbhbT4ZdswY3QoXqAL2ThqGrHqDaNfwFxycMZqqOT2xnGQGglPqlz4k3gD7hiDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:29:20.705478Z","bundle_sha256":"26386afa48b644d27e790f32002a1756e3cb6fb33681270bcd5af808f79fd09d"}}