{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HKEZSS23PJLADFUS2IV4ETTWFQ","short_pith_number":"pith:HKEZSS23","canonical_record":{"source":{"id":"1510.07363","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-10-26T04:39:37Z","cross_cats_sorted":["cs.DS","cs.NA"],"title_canon_sha256":"39f3259786ddf34f9e5d154b3e5ae44a3b8c1c42e41454b4d0a32db1318c5017","abstract_canon_sha256":"0cdf490643d5893d948cdd47c2d237c221199defde45973ffe81414d85e5274b"},"schema_version":"1.0"},"canonical_sha256":"3a89994b5b7a56019692d22bc24e762c069e22abdaa007de24e40c013cc42a64","source":{"kind":"arxiv","id":"1510.07363","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07363","created_at":"2026-05-18T00:34:16Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07363v3","created_at":"2026-05-18T00:34:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07363","created_at":"2026-05-18T00:34:16Z"},{"alias_kind":"pith_short_12","alias_value":"HKEZSS23PJLA","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HKEZSS23PJLADFUS","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HKEZSS23","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HKEZSS23PJLADFUS2IV4ETTWFQ","target":"record","payload":{"canonical_record":{"source":{"id":"1510.07363","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-10-26T04:39:37Z","cross_cats_sorted":["cs.DS","cs.NA"],"title_canon_sha256":"39f3259786ddf34f9e5d154b3e5ae44a3b8c1c42e41454b4d0a32db1318c5017","abstract_canon_sha256":"0cdf490643d5893d948cdd47c2d237c221199defde45973ffe81414d85e5274b"},"schema_version":"1.0"},"canonical_sha256":"3a89994b5b7a56019692d22bc24e762c069e22abdaa007de24e40c013cc42a64","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:16.101118Z","signature_b64":"Ml+IMT53HA/1GqYsWfYihRAmaaYiUh6nw/BjlXzxnyWQIwm51J4hgYHezEDrLCXs07tadZ20+7MT7iLVumx0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a89994b5b7a56019692d22bc24e762c069e22abdaa007de24e40c013cc42a64","last_reissued_at":"2026-05-18T00:34:16.100493Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:16.100493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.07363","source_version":3,"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-18T00:34:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FdP9m7kwVD/1SHIFH+murqt/ZYBWuKaJQ/pyFJxoeCo6mE5l3KvXJCQqZ60ye0/Wj0b5WVJZnCwWtYIPrhHdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:07:34.866565Z"},"content_sha256":"f1532dd728a5c161f2e9d3bfcb7b1cd37947d15ae9254828fc22000dee28fb78","schema_version":"1.0","event_id":"sha256:f1532dd728a5c161f2e9d3bfcb7b1cd37947d15ae9254828fc22000dee28fb78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HKEZSS23PJLADFUS2IV4ETTWFQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast hierarchical solvers for sparse matrices using extended sparsification and low-rank approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NA"],"primary_cat":"math.NA","authors_text":"Eric Darve, Hadi Pouransari, Pieter Coulier","submitted_at":"2015-10-26T04:39:37Z","abstract_excerpt":"Inversion of sparse matrices with standard direct solve schemes is robust, but computationally expensive. Iterative solvers, on the other hand, demonstrate better scalability; but, need to be used with an appropriate preconditioner (e.g., ILU, AMG, Gauss-Seidel, etc.) for proper convergence. The choice of an effective preconditioner is highly problem dependent. We propose a novel fully algebraic sparse matrix solve algorithm, which has linear complexity with the problem size. Our scheme is based on the Gauss elimination. For a given matrix, we approximate the LU factorization with a tunable ac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07363","kind":"arxiv","version":3},"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-18T00:34:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C+Q3vR7CXMdTA5gOAhQ1aZf1B8WhxW9rgbB3Xs8ko5UjJ7HlJx45aLX7Y7t1JbQVg77P4rXi9vu83CHv/JGTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:07:34.866917Z"},"content_sha256":"ebb9665a9ecc1c42d1d598c562f28366754188adf0381e5c872bad3425aa91ac","schema_version":"1.0","event_id":"sha256:ebb9665a9ecc1c42d1d598c562f28366754188adf0381e5c872bad3425aa91ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HKEZSS23PJLADFUS2IV4ETTWFQ/bundle.json","state_url":"https://pith.science/pith/HKEZSS23PJLADFUS2IV4ETTWFQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HKEZSS23PJLADFUS2IV4ETTWFQ/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-03T16:07:34Z","links":{"resolver":"https://pith.science/pith/HKEZSS23PJLADFUS2IV4ETTWFQ","bundle":"https://pith.science/pith/HKEZSS23PJLADFUS2IV4ETTWFQ/bundle.json","state":"https://pith.science/pith/HKEZSS23PJLADFUS2IV4ETTWFQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HKEZSS23PJLADFUS2IV4ETTWFQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HKEZSS23PJLADFUS2IV4ETTWFQ","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":"0cdf490643d5893d948cdd47c2d237c221199defde45973ffe81414d85e5274b","cross_cats_sorted":["cs.DS","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-10-26T04:39:37Z","title_canon_sha256":"39f3259786ddf34f9e5d154b3e5ae44a3b8c1c42e41454b4d0a32db1318c5017"},"schema_version":"1.0","source":{"id":"1510.07363","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07363","created_at":"2026-05-18T00:34:16Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07363v3","created_at":"2026-05-18T00:34:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07363","created_at":"2026-05-18T00:34:16Z"},{"alias_kind":"pith_short_12","alias_value":"HKEZSS23PJLA","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HKEZSS23PJLADFUS","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HKEZSS23","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:ebb9665a9ecc1c42d1d598c562f28366754188adf0381e5c872bad3425aa91ac","target":"graph","created_at":"2026-05-18T00:34:16Z","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":"Inversion of sparse matrices with standard direct solve schemes is robust, but computationally expensive. Iterative solvers, on the other hand, demonstrate better scalability; but, need to be used with an appropriate preconditioner (e.g., ILU, AMG, Gauss-Seidel, etc.) for proper convergence. The choice of an effective preconditioner is highly problem dependent. We propose a novel fully algebraic sparse matrix solve algorithm, which has linear complexity with the problem size. Our scheme is based on the Gauss elimination. For a given matrix, we approximate the LU factorization with a tunable ac","authors_text":"Eric Darve, Hadi Pouransari, Pieter Coulier","cross_cats":["cs.DS","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-10-26T04:39:37Z","title":"Fast hierarchical solvers for sparse matrices using extended sparsification and low-rank approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07363","kind":"arxiv","version":3},"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:f1532dd728a5c161f2e9d3bfcb7b1cd37947d15ae9254828fc22000dee28fb78","target":"record","created_at":"2026-05-18T00:34:16Z","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":"0cdf490643d5893d948cdd47c2d237c221199defde45973ffe81414d85e5274b","cross_cats_sorted":["cs.DS","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-10-26T04:39:37Z","title_canon_sha256":"39f3259786ddf34f9e5d154b3e5ae44a3b8c1c42e41454b4d0a32db1318c5017"},"schema_version":"1.0","source":{"id":"1510.07363","kind":"arxiv","version":3}},"canonical_sha256":"3a89994b5b7a56019692d22bc24e762c069e22abdaa007de24e40c013cc42a64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a89994b5b7a56019692d22bc24e762c069e22abdaa007de24e40c013cc42a64","first_computed_at":"2026-05-18T00:34:16.100493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:16.100493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ml+IMT53HA/1GqYsWfYihRAmaaYiUh6nw/BjlXzxnyWQIwm51J4hgYHezEDrLCXs07tadZ20+7MT7iLVumx0Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:16.101118Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07363","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1532dd728a5c161f2e9d3bfcb7b1cd37947d15ae9254828fc22000dee28fb78","sha256:ebb9665a9ecc1c42d1d598c562f28366754188adf0381e5c872bad3425aa91ac"],"state_sha256":"9015a8c266c9aa31d2c60bd0cb2c6c35eb8035b2cd962bdce05ccf3eae676ac2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+b7bbvS8VcZlExtgpuPNVkPyXtxThFvohn2G98nTrY50P700QCQ+N+lkC6FzrkzGHO3dkJT86bHGBw0eg3J5Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:07:34.868913Z","bundle_sha256":"2991d6a45da062416f269a99573ad2f00255e75fbb89777fb906bf4ea213135e"}}