{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5POYYKBBX7K5YDZE3E4QB5MWWX","short_pith_number":"pith:5POYYKBB","schema_version":"1.0","canonical_sha256":"ebdd8c2821bfd5dc0f24d93900f596b5fb27a6c0d4d0bb5ec8615c58d966d4cb","source":{"kind":"arxiv","id":"1901.06101","version":3},"attestation_state":"computed","paper":{"title":"A Parallel Hierarchical Blocked Adaptive Cross Approximation Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Elizaveta Rebrova, Pieter Ghysels, Wissam Sid-Lakhdar, Xiaoye Sherry Li, Yang Liu","submitted_at":"2019-01-18T06:39:57Z","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"},"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":"1901.06101","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-01-18T06:39:57Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"a3e0ff302d3c2756933ab8678ae264e131d528676612ef014849752ddb6bb4f1","abstract_canon_sha256":"ca62511aeb51001165f7e6e354f4efd9c3a2940ec41ab741782cca4e0bfabb63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:02:25.013778Z","signature_b64":"MrgR+INlM/dJUQ9m16n1Xq21Z1eUGHcAHkim8Ia+UOhbrsyHnMF4aC7sH4Erpl48/ciFKhwoOpdpk/Z7XHtLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebdd8c2821bfd5dc0f24d93900f596b5fb27a6c0d4d0bb5ec8615c58d966d4cb","last_reissued_at":"2026-07-05T00:02:25.013309Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:02:25.013309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Parallel Hierarchical Blocked Adaptive Cross Approximation Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Elizaveta Rebrova, Pieter Ghysels, Wissam Sid-Lakhdar, Xiaoye Sherry Li, Yang Liu","submitted_at":"2019-01-18T06:39:57Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06101","kind":"arxiv","version":3},"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/1901.06101/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":"1901.06101","created_at":"2026-07-05T00:02:25.013376+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.06101v3","created_at":"2026-07-05T00:02:25.013376+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06101","created_at":"2026-07-05T00:02:25.013376+00:00"},{"alias_kind":"pith_short_12","alias_value":"5POYYKBBX7K5","created_at":"2026-07-05T00:02:25.013376+00:00"},{"alias_kind":"pith_short_16","alias_value":"5POYYKBBX7K5YDZE","created_at":"2026-07-05T00:02:25.013376+00:00"},{"alias_kind":"pith_short_8","alias_value":"5POYYKBB","created_at":"2026-07-05T00:02:25.013376+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/5POYYKBBX7K5YDZE3E4QB5MWWX","json":"https://pith.science/pith/5POYYKBBX7K5YDZE3E4QB5MWWX.json","graph_json":"https://pith.science/api/pith-number/5POYYKBBX7K5YDZE3E4QB5MWWX/graph.json","events_json":"https://pith.science/api/pith-number/5POYYKBBX7K5YDZE3E4QB5MWWX/events.json","paper":"https://pith.science/paper/5POYYKBB"},"agent_actions":{"view_html":"https://pith.science/pith/5POYYKBBX7K5YDZE3E4QB5MWWX","download_json":"https://pith.science/pith/5POYYKBBX7K5YDZE3E4QB5MWWX.json","view_paper":"https://pith.science/paper/5POYYKBB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.06101&json=true","fetch_graph":"https://pith.science/api/pith-number/5POYYKBBX7K5YDZE3E4QB5MWWX/graph.json","fetch_events":"https://pith.science/api/pith-number/5POYYKBBX7K5YDZE3E4QB5MWWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5POYYKBBX7K5YDZE3E4QB5MWWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5POYYKBBX7K5YDZE3E4QB5MWWX/action/storage_attestation","attest_author":"https://pith.science/pith/5POYYKBBX7K5YDZE3E4QB5MWWX/action/author_attestation","sign_citation":"https://pith.science/pith/5POYYKBBX7K5YDZE3E4QB5MWWX/action/citation_signature","submit_replication":"https://pith.science/pith/5POYYKBBX7K5YDZE3E4QB5MWWX/action/replication_record"}},"created_at":"2026-07-05T00:02:25.013376+00:00","updated_at":"2026-07-05T00:02:25.013376+00:00"}