{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5POYYKBBX7K5YDZE3E4QB5MWWX","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":"ca62511aeb51001165f7e6e354f4efd9c3a2940ec41ab741782cca4e0bfabb63","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-01-18T06:39:57Z","title_canon_sha256":"a3e0ff302d3c2756933ab8678ae264e131d528676612ef014849752ddb6bb4f1"},"schema_version":"1.0","source":{"id":"1901.06101","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06101","created_at":"2026-07-05T00:02:25Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06101v3","created_at":"2026-07-05T00:02:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06101","created_at":"2026-07-05T00:02:25Z"},{"alias_kind":"pith_short_12","alias_value":"5POYYKBBX7K5","created_at":"2026-07-05T00:02:25Z"},{"alias_kind":"pith_short_16","alias_value":"5POYYKBBX7K5YDZE","created_at":"2026-07-05T00:02:25Z"},{"alias_kind":"pith_short_8","alias_value":"5POYYKBB","created_at":"2026-07-05T00:02:25Z"}],"graph_snapshots":[{"event_id":"sha256:5c81bce3532919aac2fb27135cd8018e3c073f6d85afdb65959114ae45a95c34","target":"graph","created_at":"2026-07-05T00:02:25Z","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/1901.06101/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a hierarchical low-rank decomposition algorithm assuming any matrix element can be computed in $O(1)$ time. The proposed algorithm computes rank-revealing decompositions of sub-matrices with a blocked adaptive cross approximation (BACA) algorithm, followed by a hierarchical merge operation via truncated singular value decompositions (H-BACA). The proposed algorithm significantly improves the convergence of the baseline ACA algorithm and achieves reduced computational complexity compared to the full decompositions such as rank-revealing QR decompositions. Numerical results d","authors_text":"Elizaveta Rebrova, Pieter Ghysels, Wissam Sid-Lakhdar, Xiaoye Sherry Li, Yang Liu","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-01-18T06:39:57Z","title":"A Parallel Hierarchical Blocked Adaptive Cross Approximation Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06101","kind":"arxiv","version":3},"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:17814970ce0f2d932a5adc8ab4335a34813110b6ef97365a0dcec1a10a5f47e6","target":"record","created_at":"2026-07-05T00:02:25Z","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":"ca62511aeb51001165f7e6e354f4efd9c3a2940ec41ab741782cca4e0bfabb63","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-01-18T06:39:57Z","title_canon_sha256":"a3e0ff302d3c2756933ab8678ae264e131d528676612ef014849752ddb6bb4f1"},"schema_version":"1.0","source":{"id":"1901.06101","kind":"arxiv","version":3}},"canonical_sha256":"ebdd8c2821bfd5dc0f24d93900f596b5fb27a6c0d4d0bb5ec8615c58d966d4cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebdd8c2821bfd5dc0f24d93900f596b5fb27a6c0d4d0bb5ec8615c58d966d4cb","first_computed_at":"2026-07-05T00:02:25.013309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:02:25.013309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MrgR+INlM/dJUQ9m16n1Xq21Z1eUGHcAHkim8Ia+UOhbrsyHnMF4aC7sH4Erpl48/ciFKhwoOpdpk/Z7XHtLCA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:02:25.013778Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.06101","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17814970ce0f2d932a5adc8ab4335a34813110b6ef97365a0dcec1a10a5f47e6","sha256:5c81bce3532919aac2fb27135cd8018e3c073f6d85afdb65959114ae45a95c34"],"state_sha256":"eeba515ed76d4e16ac658841cb2edee79de4ca908b99525465e3b00790f7e5a8"}