{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MURG53EVK6AOWDIM64KCHZ6BQV","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":"26bc925ec37dd3d2471d7cf45dab82f98a071da9724ee2d14e17aaeffc1045b0","cross_cats_sorted":["cs.MS","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-20T02:54:20Z","title_canon_sha256":"32b4042e21772a514cdf07e7daa4c4fddc16e108ab52a70f36492c2a66a759ee"},"schema_version":"1.0","source":{"id":"1712.07297","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07297","created_at":"2026-05-18T00:27:34Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07297v1","created_at":"2026-05-18T00:27:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07297","created_at":"2026-05-18T00:27:34Z"},{"alias_kind":"pith_short_12","alias_value":"MURG53EVK6AO","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MURG53EVK6AOWDIM","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MURG53EV","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:cea783a65f53b29bc6d2b313dc65cff0aa53b15e3b36b45c0b5ab151afd138fc","target":"graph","created_at":"2026-05-18T00:27:34Z","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":"We present a parallel hierarchical solver for general sparse linear systems on distributed-memory machines. For large-scale problems, this fully algebraic algorithm is faster and more memory-efficient than sparse direct solvers because it exploits the low-rank structure of fill-in blocks. Depending on the accuracy of low-rank approximations, the hierarchical solver can be used either as a direct solver or as a preconditioner. The parallel algorithm is based on data decomposition and requires only local communication for updating boundary data on every processor. Moreover, the computation-to-co","authors_text":"Chao Chen, Eric Darve, Erik G. Boman, Hadi Pouransari, Sivasankaran Rajamanickam","cross_cats":["cs.MS","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-20T02:54:20Z","title":"A distributed-memory hierarchical solver for general sparse linear systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07297","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:500cf23740b7126e03c1f64e06e876fe9cdba7769fe4f1d6b804047a7de51e17","target":"record","created_at":"2026-05-18T00:27:34Z","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":"26bc925ec37dd3d2471d7cf45dab82f98a071da9724ee2d14e17aaeffc1045b0","cross_cats_sorted":["cs.MS","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-20T02:54:20Z","title_canon_sha256":"32b4042e21772a514cdf07e7daa4c4fddc16e108ab52a70f36492c2a66a759ee"},"schema_version":"1.0","source":{"id":"1712.07297","kind":"arxiv","version":1}},"canonical_sha256":"65226eec955780eb0d0cf71423e7c1856b367dcb471f87b5143c1d01e2d80696","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65226eec955780eb0d0cf71423e7c1856b367dcb471f87b5143c1d01e2d80696","first_computed_at":"2026-05-18T00:27:34.927763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:34.927763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EN+C/KaSoSY8KeYIduHuCwKQ4H9kHb9WVZ9qMs2bvx1pQtE69pF7KcFJQH5y/9rB07fIMKcU6ePbMuztqXvrAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:34.928505Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.07297","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:500cf23740b7126e03c1f64e06e876fe9cdba7769fe4f1d6b804047a7de51e17","sha256:cea783a65f53b29bc6d2b313dc65cff0aa53b15e3b36b45c0b5ab151afd138fc"],"state_sha256":"7f359d3a2a0537c7709d17f56426595c05dd4b8e691767713ce4d9ed348af199"}