{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:C5PPDRW5GVTYNK2SPGMFONAKLE","short_pith_number":"pith:C5PPDRW5","schema_version":"1.0","canonical_sha256":"175ef1c6dd356786ab52799857340a590885cae890757efa007c94cdc5009a86","source":{"kind":"arxiv","id":"2205.03406","version":2},"attestation_state":"computed","paper":{"title":"Randomized Compression of Rank-Structured Matrices Accelerated with Graph Coloring","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-06T09:39:14Z","abstract_excerpt":"A randomized algorithm for computing a data sparse representation of a given rank structured matrix $A$ (a.k.a. an $H$-matrix) is presented. The algorithm draws on the randomized singular value decomposition (RSVD), and operates under the assumption that algorithms for rapidly applying $A$ and $A^{*}$ to vectors are available. The algorithm analyzes the hierarchical tree that defines the rank structure using graph coloring algorithms to generate a set of random test vectors. The matrix is then applied to the test vectors, and in a final step the matrix itself is reconstructed by the observed i"},"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.03406","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2022-05-06T09:39:14Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"052db3a08092c19bb656e16fb5159141841d2315a3293f6a3da4a952836ccaa4","abstract_canon_sha256":"882bd5453fce9f421b2ffa7397362384bbeca9339d77a670479e3408db46c3a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:35:17.578221Z","signature_b64":"e54Qla8zI1SXkffkUmNktWprx2Z2cT5oNqzs330o8NYdpXZde7aKbf0nYFVjy1IM8vqNJZ+Tm4P/6ncHeP5RDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"175ef1c6dd356786ab52799857340a590885cae890757efa007c94cdc5009a86","last_reissued_at":"2026-07-05T08:35:17.577797Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:35:17.577797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Compression of Rank-Structured Matrices Accelerated with Graph Coloring","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-06T09:39:14Z","abstract_excerpt":"A randomized algorithm for computing a data sparse representation of a given rank structured matrix $A$ (a.k.a. an $H$-matrix) is presented. The algorithm draws on the randomized singular value decomposition (RSVD), and operates under the assumption that algorithms for rapidly applying $A$ and $A^{*}$ to vectors are available. The algorithm analyzes the hierarchical tree that defines the rank structure using graph coloring algorithms to generate a set of random test vectors. The matrix is then applied to the test vectors, and in a final step the matrix itself is reconstructed by the observed i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.03406","kind":"arxiv","version":2},"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.03406/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.03406","created_at":"2026-07-05T08:35:17.577847+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.03406v2","created_at":"2026-07-05T08:35:17.577847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.03406","created_at":"2026-07-05T08:35:17.577847+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5PPDRW5GVTY","created_at":"2026-07-05T08:35:17.577847+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5PPDRW5GVTYNK2S","created_at":"2026-07-05T08:35:17.577847+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5PPDRW5","created_at":"2026-07-05T08:35:17.577847+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/C5PPDRW5GVTYNK2SPGMFONAKLE","json":"https://pith.science/pith/C5PPDRW5GVTYNK2SPGMFONAKLE.json","graph_json":"https://pith.science/api/pith-number/C5PPDRW5GVTYNK2SPGMFONAKLE/graph.json","events_json":"https://pith.science/api/pith-number/C5PPDRW5GVTYNK2SPGMFONAKLE/events.json","paper":"https://pith.science/paper/C5PPDRW5"},"agent_actions":{"view_html":"https://pith.science/pith/C5PPDRW5GVTYNK2SPGMFONAKLE","download_json":"https://pith.science/pith/C5PPDRW5GVTYNK2SPGMFONAKLE.json","view_paper":"https://pith.science/paper/C5PPDRW5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.03406&json=true","fetch_graph":"https://pith.science/api/pith-number/C5PPDRW5GVTYNK2SPGMFONAKLE/graph.json","fetch_events":"https://pith.science/api/pith-number/C5PPDRW5GVTYNK2SPGMFONAKLE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5PPDRW5GVTYNK2SPGMFONAKLE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5PPDRW5GVTYNK2SPGMFONAKLE/action/storage_attestation","attest_author":"https://pith.science/pith/C5PPDRW5GVTYNK2SPGMFONAKLE/action/author_attestation","sign_citation":"https://pith.science/pith/C5PPDRW5GVTYNK2SPGMFONAKLE/action/citation_signature","submit_replication":"https://pith.science/pith/C5PPDRW5GVTYNK2SPGMFONAKLE/action/replication_record"}},"created_at":"2026-07-05T08:35:17.577847+00:00","updated_at":"2026-07-05T08:35:17.577847+00:00"}