{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZACHHLVK6DWHDJQN7AX6QPFPQF","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":"e9d3e867277aa6eb3da0bf25be9b8089ff6f46b16d8591c98fed559cf0de1c58","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-11-30T11:41:52Z","title_canon_sha256":"19b4621d288fd4eede24c086626b2635e2bd0efbd6a55f5cc367bf2e0c824067"},"schema_version":"1.0","source":{"id":"1612.00001","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00001","created_at":"2026-05-18T00:16:45Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00001v2","created_at":"2026-05-18T00:16:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00001","created_at":"2026-05-18T00:16:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZACHHLVK6DWH","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZACHHLVK6DWHDJQN","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZACHHLVK","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:1a7767383601420343deeea05f3f337af015a86b0ff4783533582b626a10ba01","target":"graph","created_at":"2026-05-18T00:16:45Z","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 inversion of extremely high order matrices has been a challenging task because of the limited processing and memory capacity of conventional computers. In a scenario in which the data does not fit in memory, it is worth to consider exchanging less memory usage for more processing time in order to enable the computation of the inverse which otherwise would be prohibitive. We propose a new algorithm to compute the inverse of block partitioned matrices with a reduced memory footprint. The algorithm works recursively to invert one block of a $k \\times k$ block matrix $M$, with $k \\geq 2$, base","authors_text":"Iria C. S. Cosme, Isaac F. Fernandes, Jo\\~ao L. de Carvalho, Samuel Xavier-de-Souza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-11-30T11:41:52Z","title":"Memory-Usage Advantageous Block Recursive Matrix Inverse"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00001","kind":"arxiv","version":2},"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:f19e45a9613421b49e3a0a11078cb8f72a99c2977186293a1f381c9a879731b9","target":"record","created_at":"2026-05-18T00:16:45Z","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":"e9d3e867277aa6eb3da0bf25be9b8089ff6f46b16d8591c98fed559cf0de1c58","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-11-30T11:41:52Z","title_canon_sha256":"19b4621d288fd4eede24c086626b2635e2bd0efbd6a55f5cc367bf2e0c824067"},"schema_version":"1.0","source":{"id":"1612.00001","kind":"arxiv","version":2}},"canonical_sha256":"c80473aeaaf0ec71a60df82fe83caf8163b7ce9863d13ce36b23630162bb8f3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c80473aeaaf0ec71a60df82fe83caf8163b7ce9863d13ce36b23630162bb8f3d","first_computed_at":"2026-05-18T00:16:45.645785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:45.645785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7K293UG1VCLOhcxghMClN+Mo69yOYDwy3cmh/tMmaVagIivjX0HLQ/qbxwS4EBHSPaM6RLvaU9j2zoFJQz+UAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:45.646461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.00001","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f19e45a9613421b49e3a0a11078cb8f72a99c2977186293a1f381c9a879731b9","sha256:1a7767383601420343deeea05f3f337af015a86b0ff4783533582b626a10ba01"],"state_sha256":"68df428c3954cda98d02e7e0fa9f50361d982224435710a79daa77509029fa4d"}