{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JJOC3U3DOZDHQLWR3CL2DUJV3M","short_pith_number":"pith:JJOC3U3D","schema_version":"1.0","canonical_sha256":"4a5c2dd3637646782ed1d897a1d135db38cabf45e162e4e0cb25dcff1fb7b95e","source":{"kind":"arxiv","id":"1402.5398","version":1},"attestation_state":"computed","paper":{"title":"An exact solver for simple ${\\mathcal H}$-matrix systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Jessica G\\\"ordes, Steffen B\\\"orm","submitted_at":"2014-02-21T20:15:27Z","abstract_excerpt":"Hierarchical matrices (usually abbreviated ${\\mathcal H}$-matrices) are frequently used to construct preconditioners for systems of linear equations. Since it is possible to compute approximate inverses or $LU$ factorizations in ${\\mathcal H}$-matrix representation using only ${\\mathcal O}(n \\log^2 n)$ operations, these preconditioners can be very efficient.\n  Here we consider an algorithm that allows us to solve a linear system of equations given in a simple ${\\mathcal H}$-matrix format \\emph{exactly} using ${\\mathcal O}(n \\log^2 n)$ operations. The central idea of our approach is to avoid co"},"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":"1402.5398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-02-21T20:15:27Z","cross_cats_sorted":[],"title_canon_sha256":"7e915aff5ddeec4a94e262b6f06e37fb82c9b629bf9509b62c4b2fac4523a3d3","abstract_canon_sha256":"e1a851703ed15715ba3b0b048ebed5a6c07f9720b0874dc8c389a4179999a9a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:22.380592Z","signature_b64":"CMDYxi4329mTdQgbkHJAPtafIIxtt9nik8uaaVDDfBYNoaf282TAR+kvKNl+tqpT8QvUyJVMY1xnsGBcqev+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a5c2dd3637646782ed1d897a1d135db38cabf45e162e4e0cb25dcff1fb7b95e","last_reissued_at":"2026-05-18T02:58:22.379963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:22.379963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An exact solver for simple ${\\mathcal H}$-matrix systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Jessica G\\\"ordes, Steffen B\\\"orm","submitted_at":"2014-02-21T20:15:27Z","abstract_excerpt":"Hierarchical matrices (usually abbreviated ${\\mathcal H}$-matrices) are frequently used to construct preconditioners for systems of linear equations. Since it is possible to compute approximate inverses or $LU$ factorizations in ${\\mathcal H}$-matrix representation using only ${\\mathcal O}(n \\log^2 n)$ operations, these preconditioners can be very efficient.\n  Here we consider an algorithm that allows us to solve a linear system of equations given in a simple ${\\mathcal H}$-matrix format \\emph{exactly} using ${\\mathcal O}(n \\log^2 n)$ operations. The central idea of our approach is to avoid co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5398","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1402.5398","created_at":"2026-05-18T02:58:22.380054+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.5398v1","created_at":"2026-05-18T02:58:22.380054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5398","created_at":"2026-05-18T02:58:22.380054+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJOC3U3DOZDH","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJOC3U3DOZDHQLWR","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJOC3U3D","created_at":"2026-05-18T12:28:33.132498+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/JJOC3U3DOZDHQLWR3CL2DUJV3M","json":"https://pith.science/pith/JJOC3U3DOZDHQLWR3CL2DUJV3M.json","graph_json":"https://pith.science/api/pith-number/JJOC3U3DOZDHQLWR3CL2DUJV3M/graph.json","events_json":"https://pith.science/api/pith-number/JJOC3U3DOZDHQLWR3CL2DUJV3M/events.json","paper":"https://pith.science/paper/JJOC3U3D"},"agent_actions":{"view_html":"https://pith.science/pith/JJOC3U3DOZDHQLWR3CL2DUJV3M","download_json":"https://pith.science/pith/JJOC3U3DOZDHQLWR3CL2DUJV3M.json","view_paper":"https://pith.science/paper/JJOC3U3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.5398&json=true","fetch_graph":"https://pith.science/api/pith-number/JJOC3U3DOZDHQLWR3CL2DUJV3M/graph.json","fetch_events":"https://pith.science/api/pith-number/JJOC3U3DOZDHQLWR3CL2DUJV3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJOC3U3DOZDHQLWR3CL2DUJV3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJOC3U3DOZDHQLWR3CL2DUJV3M/action/storage_attestation","attest_author":"https://pith.science/pith/JJOC3U3DOZDHQLWR3CL2DUJV3M/action/author_attestation","sign_citation":"https://pith.science/pith/JJOC3U3DOZDHQLWR3CL2DUJV3M/action/citation_signature","submit_replication":"https://pith.science/pith/JJOC3U3DOZDHQLWR3CL2DUJV3M/action/replication_record"}},"created_at":"2026-05-18T02:58:22.380054+00:00","updated_at":"2026-05-18T02:58:22.380054+00:00"}