{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZHKP4OQMDL6PEGS5ZBLLBMELSK","short_pith_number":"pith:ZHKP4OQM","schema_version":"1.0","canonical_sha256":"c9d4fe3a0c1afcf21a5dc856b0b08b92b2411c58d66534156a348632475ba82e","source":{"kind":"arxiv","id":"1402.5056","version":6},"attestation_state":"computed","paper":{"title":"Efficient arithmetic operations for rank-structured matrices based on hierarchical low-rank updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Knut Reimer, Steffen B\\\"orm","submitted_at":"2014-02-20T16:15:04Z","abstract_excerpt":"Many matrices appearing in numerical methods for partial differential equations and integral equations are rank-structured, i.e., they contain submatrices that can be approximated by matrices of low rank. A relatively general class of rank-structured matrices are $\\mathcal{H}^2$-matrices: they can reach the optimal order of complexity, but are still general enough for a large number of practical applications. We consider algorithms for performing algebraic operations with $\\mathcal{H}^2$-matrices, i.e., for approximating the matrix product, inverse or factorizations in almost linear complexity"},"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.5056","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-02-20T16:15:04Z","cross_cats_sorted":[],"title_canon_sha256":"ca8205d48af7a62a9f44bc51534ac6d6838846f3d84516047ccbf119e9235f01","abstract_canon_sha256":"daa378e6ad30817c0085b8d8345989e56611df39e9c156ea31f0086593d8cdd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:26.585100Z","signature_b64":"3GeeIWpH6fEfqsWh7PhVPGhzyNx0h5g5su7+E+z4aIbSNF1VG2s7V5HP7lLk4jLzQlS4FMkeDgT+/kVWOb8kBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9d4fe3a0c1afcf21a5dc856b0b08b92b2411c58d66534156a348632475ba82e","last_reissued_at":"2026-05-18T02:25:26.584513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:26.584513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient arithmetic operations for rank-structured matrices based on hierarchical low-rank updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Knut Reimer, Steffen B\\\"orm","submitted_at":"2014-02-20T16:15:04Z","abstract_excerpt":"Many matrices appearing in numerical methods for partial differential equations and integral equations are rank-structured, i.e., they contain submatrices that can be approximated by matrices of low rank. A relatively general class of rank-structured matrices are $\\mathcal{H}^2$-matrices: they can reach the optimal order of complexity, but are still general enough for a large number of practical applications. We consider algorithms for performing algebraic operations with $\\mathcal{H}^2$-matrices, i.e., for approximating the matrix product, inverse or factorizations in almost linear complexity"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5056","kind":"arxiv","version":6},"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.5056","created_at":"2026-05-18T02:25:26.584596+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.5056v6","created_at":"2026-05-18T02:25:26.584596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5056","created_at":"2026-05-18T02:25:26.584596+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZHKP4OQMDL6P","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZHKP4OQMDL6PEGS5","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZHKP4OQM","created_at":"2026-05-18T12:28:59.999130+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/ZHKP4OQMDL6PEGS5ZBLLBMELSK","json":"https://pith.science/pith/ZHKP4OQMDL6PEGS5ZBLLBMELSK.json","graph_json":"https://pith.science/api/pith-number/ZHKP4OQMDL6PEGS5ZBLLBMELSK/graph.json","events_json":"https://pith.science/api/pith-number/ZHKP4OQMDL6PEGS5ZBLLBMELSK/events.json","paper":"https://pith.science/paper/ZHKP4OQM"},"agent_actions":{"view_html":"https://pith.science/pith/ZHKP4OQMDL6PEGS5ZBLLBMELSK","download_json":"https://pith.science/pith/ZHKP4OQMDL6PEGS5ZBLLBMELSK.json","view_paper":"https://pith.science/paper/ZHKP4OQM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.5056&json=true","fetch_graph":"https://pith.science/api/pith-number/ZHKP4OQMDL6PEGS5ZBLLBMELSK/graph.json","fetch_events":"https://pith.science/api/pith-number/ZHKP4OQMDL6PEGS5ZBLLBMELSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZHKP4OQMDL6PEGS5ZBLLBMELSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZHKP4OQMDL6PEGS5ZBLLBMELSK/action/storage_attestation","attest_author":"https://pith.science/pith/ZHKP4OQMDL6PEGS5ZBLLBMELSK/action/author_attestation","sign_citation":"https://pith.science/pith/ZHKP4OQMDL6PEGS5ZBLLBMELSK/action/citation_signature","submit_replication":"https://pith.science/pith/ZHKP4OQMDL6PEGS5ZBLLBMELSK/action/replication_record"}},"created_at":"2026-05-18T02:25:26.584596+00:00","updated_at":"2026-05-18T02:25:26.584596+00:00"}