{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZHKP4OQMDL6PEGS5ZBLLBMELSK","short_pith_number":"pith:ZHKP4OQM","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"},"canonical_sha256":"c9d4fe3a0c1afcf21a5dc856b0b08b92b2411c58d66534156a348632475ba82e","source":{"kind":"arxiv","id":"1402.5056","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5056","created_at":"2026-05-18T02:25:26Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5056v6","created_at":"2026-05-18T02:25:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5056","created_at":"2026-05-18T02:25:26Z"},{"alias_kind":"pith_short_12","alias_value":"ZHKP4OQMDL6P","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZHKP4OQMDL6PEGS5","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZHKP4OQM","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZHKP4OQMDL6PEGS5ZBLLBMELSK","target":"record","payload":{"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"},"canonical_sha256":"c9d4fe3a0c1afcf21a5dc856b0b08b92b2411c58d66534156a348632475ba82e","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"},"source_kind":"arxiv","source_id":"1402.5056","source_version":6,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:25:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vJJalwH+ABzGIt1sY/uFkH789PLpB+x6epIl7dK5KfQDvZ6saIfE3sijrpabDVYk/LugcKZYW3Af6u5oi2lBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:16:35.818558Z"},"content_sha256":"c54a7a15828824ebd942431903aac94ce5632c15c2bda9a0ab73ad43a14ec601","schema_version":"1.0","event_id":"sha256:c54a7a15828824ebd942431903aac94ce5632c15c2bda9a0ab73ad43a14ec601"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZHKP4OQMDL6PEGS5ZBLLBMELSK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:25:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dNkU6Jk7gmfjK12nwoO7glFa5MqcY6a2nCNfw9R/RLIhgGz/fvfr0s1czeruPDmQfd08mDKBUkwj8JTZgMPeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:16:35.818905Z"},"content_sha256":"cb49cf1e11223b7fbea492fca25f9705262ed9aaf7709c37fd79063afee0c61f","schema_version":"1.0","event_id":"sha256:cb49cf1e11223b7fbea492fca25f9705262ed9aaf7709c37fd79063afee0c61f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZHKP4OQMDL6PEGS5ZBLLBMELSK/bundle.json","state_url":"https://pith.science/pith/ZHKP4OQMDL6PEGS5ZBLLBMELSK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZHKP4OQMDL6PEGS5ZBLLBMELSK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T21:16:35Z","links":{"resolver":"https://pith.science/pith/ZHKP4OQMDL6PEGS5ZBLLBMELSK","bundle":"https://pith.science/pith/ZHKP4OQMDL6PEGS5ZBLLBMELSK/bundle.json","state":"https://pith.science/pith/ZHKP4OQMDL6PEGS5ZBLLBMELSK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZHKP4OQMDL6PEGS5ZBLLBMELSK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZHKP4OQMDL6PEGS5ZBLLBMELSK","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":"daa378e6ad30817c0085b8d8345989e56611df39e9c156ea31f0086593d8cdd2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-02-20T16:15:04Z","title_canon_sha256":"ca8205d48af7a62a9f44bc51534ac6d6838846f3d84516047ccbf119e9235f01"},"schema_version":"1.0","source":{"id":"1402.5056","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5056","created_at":"2026-05-18T02:25:26Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5056v6","created_at":"2026-05-18T02:25:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5056","created_at":"2026-05-18T02:25:26Z"},{"alias_kind":"pith_short_12","alias_value":"ZHKP4OQMDL6P","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZHKP4OQMDL6PEGS5","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZHKP4OQM","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:cb49cf1e11223b7fbea492fca25f9705262ed9aaf7709c37fd79063afee0c61f","target":"graph","created_at":"2026-05-18T02:25:26Z","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":"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","authors_text":"Knut Reimer, Steffen B\\\"orm","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-02-20T16:15:04Z","title":"Efficient arithmetic operations for rank-structured matrices based on hierarchical low-rank updates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5056","kind":"arxiv","version":6},"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:c54a7a15828824ebd942431903aac94ce5632c15c2bda9a0ab73ad43a14ec601","target":"record","created_at":"2026-05-18T02:25:26Z","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":"daa378e6ad30817c0085b8d8345989e56611df39e9c156ea31f0086593d8cdd2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-02-20T16:15:04Z","title_canon_sha256":"ca8205d48af7a62a9f44bc51534ac6d6838846f3d84516047ccbf119e9235f01"},"schema_version":"1.0","source":{"id":"1402.5056","kind":"arxiv","version":6}},"canonical_sha256":"c9d4fe3a0c1afcf21a5dc856b0b08b92b2411c58d66534156a348632475ba82e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9d4fe3a0c1afcf21a5dc856b0b08b92b2411c58d66534156a348632475ba82e","first_computed_at":"2026-05-18T02:25:26.584513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:26.584513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3GeeIWpH6fEfqsWh7PhVPGhzyNx0h5g5su7+E+z4aIbSNF1VG2s7V5HP7lLk4jLzQlS4FMkeDgT+/kVWOb8kBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:26.585100Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5056","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c54a7a15828824ebd942431903aac94ce5632c15c2bda9a0ab73ad43a14ec601","sha256:cb49cf1e11223b7fbea492fca25f9705262ed9aaf7709c37fd79063afee0c61f"],"state_sha256":"1b94793c3d22671a179137f50d4d820021a4f3670f9dadf5dd22fe3287372f3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+X/LB22Ha2/mJ2EFlbmw3GBIX4AVtX38cWIvBAaev7TPRfOdJMrk+qJcSl4ZO1iwht8eEu9/733/z2z+eCNqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T21:16:35.820864Z","bundle_sha256":"f42e9d9b2c47bc376de62a2b4531f5e8d31e5df8ed189d5a8a4ebb198ce8dac5"}}