{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:C5PPDRW5GVTYNK2SPGMFONAKLE","short_pith_number":"pith:C5PPDRW5","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"},"canonical_sha256":"175ef1c6dd356786ab52799857340a590885cae890757efa007c94cdc5009a86","source":{"kind":"arxiv","id":"2205.03406","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.03406","created_at":"2026-07-05T08:35:17Z"},{"alias_kind":"arxiv_version","alias_value":"2205.03406v2","created_at":"2026-07-05T08:35:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.03406","created_at":"2026-07-05T08:35:17Z"},{"alias_kind":"pith_short_12","alias_value":"C5PPDRW5GVTY","created_at":"2026-07-05T08:35:17Z"},{"alias_kind":"pith_short_16","alias_value":"C5PPDRW5GVTYNK2S","created_at":"2026-07-05T08:35:17Z"},{"alias_kind":"pith_short_8","alias_value":"C5PPDRW5","created_at":"2026-07-05T08:35:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:C5PPDRW5GVTYNK2SPGMFONAKLE","target":"record","payload":{"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"},"canonical_sha256":"175ef1c6dd356786ab52799857340a590885cae890757efa007c94cdc5009a86","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"},"source_kind":"arxiv","source_id":"2205.03406","source_version":2,"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-07-05T08:35:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ZHDJqtC+f2i6vUxkfdBDY5lccJOg3gTK65+bBdtDGjECIS5dd1bZlmPANnrGD+k6j4jKjkDWLV3Fxcc1w+KCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:20:24.797267Z"},"content_sha256":"3a15c9c272175437ae8e72648f83c7ea20d586b6bac81faf23ebf9bbaf2b81cd","schema_version":"1.0","event_id":"sha256:3a15c9c272175437ae8e72648f83c7ea20d586b6bac81faf23ebf9bbaf2b81cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:C5PPDRW5GVTYNK2SPGMFONAKLE","target":"graph","payload":{"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"},"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-07-05T08:35:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e3+q4K615qvmIOaSslpS8kBExWM7JViaVp0l9l5TPfkIvSlyhm3he4BhNAr8r3n5I1K9US2hAAKNP/19U64YBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:20:24.797904Z"},"content_sha256":"a8ee44e40d78ff2578bc2382d8993c43f695e6d2c6e909403a28f454cdb39483","schema_version":"1.0","event_id":"sha256:a8ee44e40d78ff2578bc2382d8993c43f695e6d2c6e909403a28f454cdb39483"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5PPDRW5GVTYNK2SPGMFONAKLE/bundle.json","state_url":"https://pith.science/pith/C5PPDRW5GVTYNK2SPGMFONAKLE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5PPDRW5GVTYNK2SPGMFONAKLE/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-08-04T12:20:24Z","links":{"resolver":"https://pith.science/pith/C5PPDRW5GVTYNK2SPGMFONAKLE","bundle":"https://pith.science/pith/C5PPDRW5GVTYNK2SPGMFONAKLE/bundle.json","state":"https://pith.science/pith/C5PPDRW5GVTYNK2SPGMFONAKLE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5PPDRW5GVTYNK2SPGMFONAKLE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:C5PPDRW5GVTYNK2SPGMFONAKLE","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":"882bd5453fce9f421b2ffa7397362384bbeca9339d77a670479e3408db46c3a9","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2022-05-06T09:39:14Z","title_canon_sha256":"052db3a08092c19bb656e16fb5159141841d2315a3293f6a3da4a952836ccaa4"},"schema_version":"1.0","source":{"id":"2205.03406","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.03406","created_at":"2026-07-05T08:35:17Z"},{"alias_kind":"arxiv_version","alias_value":"2205.03406v2","created_at":"2026-07-05T08:35:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.03406","created_at":"2026-07-05T08:35:17Z"},{"alias_kind":"pith_short_12","alias_value":"C5PPDRW5GVTY","created_at":"2026-07-05T08:35:17Z"},{"alias_kind":"pith_short_16","alias_value":"C5PPDRW5GVTYNK2S","created_at":"2026-07-05T08:35:17Z"},{"alias_kind":"pith_short_8","alias_value":"C5PPDRW5","created_at":"2026-07-05T08:35:17Z"}],"graph_snapshots":[{"event_id":"sha256:a8ee44e40d78ff2578bc2382d8993c43f695e6d2c6e909403a28f454cdb39483","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.03406/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","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-06T09:39:14Z","title":"Randomized Compression of Rank-Structured Matrices Accelerated with Graph Coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.03406","kind":"arxiv","version":2},"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:3a15c9c272175437ae8e72648f83c7ea20d586b6bac81faf23ebf9bbaf2b81cd","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":"882bd5453fce9f421b2ffa7397362384bbeca9339d77a670479e3408db46c3a9","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2022-05-06T09:39:14Z","title_canon_sha256":"052db3a08092c19bb656e16fb5159141841d2315a3293f6a3da4a952836ccaa4"},"schema_version":"1.0","source":{"id":"2205.03406","kind":"arxiv","version":2}},"canonical_sha256":"175ef1c6dd356786ab52799857340a590885cae890757efa007c94cdc5009a86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"175ef1c6dd356786ab52799857340a590885cae890757efa007c94cdc5009a86","first_computed_at":"2026-07-05T08:35:17.577797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:35:17.577797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e54Qla8zI1SXkffkUmNktWprx2Z2cT5oNqzs330o8NYdpXZde7aKbf0nYFVjy1IM8vqNJZ+Tm4P/6ncHeP5RDw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:35:17.578221Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.03406","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a15c9c272175437ae8e72648f83c7ea20d586b6bac81faf23ebf9bbaf2b81cd","sha256:a8ee44e40d78ff2578bc2382d8993c43f695e6d2c6e909403a28f454cdb39483"],"state_sha256":"7ac18d78ff10c4da7c45ad5e280801d0271adee08d396a54cb401f2da003aa2c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RBx2qzCFoXpxyJ0ruOq+D67yguN0dzYFuoK79rb4JgCW+/HTi56hYjQEcP+VoONaRPu4zEUXnDyl4nRwVQxjAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T12:20:24.803279Z","bundle_sha256":"1c19a1777d321ca9dc4a212a2d963ce8d357d30a4be271e9da9293ea04c6d800"}}