{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7T4HBYIEAGDJAAW6KEZU5DWHWJ","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":"c8ecd631b018a81ba9f6463ecab89a7bf96cad2574972f23750b990828cb1bde","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-05-23T08:01:38Z","title_canon_sha256":"281f101fa074e9f342c9ff1f66e48d2e21b056739d2b32bf2814d10c2641c467"},"schema_version":"1.0","source":{"id":"1805.08998","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08998","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08998v1","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08998","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"7T4HBYIEAGDJ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7T4HBYIEAGDJAAW6","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7T4HBYIE","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:f06a682c1141bbe374337c2c7350cf7042e2602dbb8d0bbeb3c9c666d06c0a9d","target":"graph","created_at":"2026-05-18T00:15:08Z","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":"The multiplication of matrices is an important arithmetic operation in computational mathematics. In the context of hierarchical matrices, this operation can be realized by the multiplication of structured block-wise low-rank matrices, resulting in an almost linear cost. However, the computational efficiency of the algorithm is based on a recursive scheme which makes the error analysis quite involved. In this article, we propose a new algorithmic framework for the multiplication of hierarchical matrices. It improves currently known implementations by reducing the multiplication of hierarchical","authors_text":"Helmut Harbrecht, J\\\"urgen D\\\"olz, Michael D. Multerer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-05-23T08:01:38Z","title":"On the best approximation of the hierarchical matrix product"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08998","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:6eac1b3c5a5cb1fccbc77cf78ade89c1ac83e206378d29272150daafeee369e0","target":"record","created_at":"2026-05-18T00:15:08Z","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":"c8ecd631b018a81ba9f6463ecab89a7bf96cad2574972f23750b990828cb1bde","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-05-23T08:01:38Z","title_canon_sha256":"281f101fa074e9f342c9ff1f66e48d2e21b056739d2b32bf2814d10c2641c467"},"schema_version":"1.0","source":{"id":"1805.08998","kind":"arxiv","version":1}},"canonical_sha256":"fcf870e10401869002de51334e8ec7b268e6786c32467a341adc4926499cced2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcf870e10401869002de51334e8ec7b268e6786c32467a341adc4926499cced2","first_computed_at":"2026-05-18T00:15:08.825766Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:08.825766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eiGEIxTIUagEM31wjgvaibgJ/uUbLXZKQ4yQtpKGIkgtxWxH+ShTxwyJdeWS/pxxQhQSC+yFb1toyjln+MDVBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:08.826178Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08998","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6eac1b3c5a5cb1fccbc77cf78ade89c1ac83e206378d29272150daafeee369e0","sha256:f06a682c1141bbe374337c2c7350cf7042e2602dbb8d0bbeb3c9c666d06c0a9d"],"state_sha256":"45f1fd930583b9b4169271c361cad27631c909a1069b8d07595e4da855b6f8b8"}