{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:S77EMCU33V5SD7UMCANPRDMV23","short_pith_number":"pith:S77EMCU3","canonical_record":{"source":{"id":"1507.05593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-07-20T19:01:30Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"37ac8275979ef89777a8b72b909f3e2f3bc3b7c5faa3dbc3addd85a41e55c510","abstract_canon_sha256":"6ee0dbdca5310165f7e6d72d5d94c41bd96722ce3ce38e3ea6ac39b9a93237f5"},"schema_version":"1.0"},"canonical_sha256":"97fe460a9bdd7b21fe8c101af88d95d6cffd315cc5d8cbf0ac31ef65fa9a821b","source":{"kind":"arxiv","id":"1507.05593","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05593","created_at":"2026-05-18T01:36:36Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05593v1","created_at":"2026-05-18T01:36:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05593","created_at":"2026-05-18T01:36:36Z"},{"alias_kind":"pith_short_12","alias_value":"S77EMCU33V5S","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S77EMCU33V5SD7UM","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S77EMCU3","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:S77EMCU33V5SD7UMCANPRDMV23","target":"record","payload":{"canonical_record":{"source":{"id":"1507.05593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-07-20T19:01:30Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"37ac8275979ef89777a8b72b909f3e2f3bc3b7c5faa3dbc3addd85a41e55c510","abstract_canon_sha256":"6ee0dbdca5310165f7e6d72d5d94c41bd96722ce3ce38e3ea6ac39b9a93237f5"},"schema_version":"1.0"},"canonical_sha256":"97fe460a9bdd7b21fe8c101af88d95d6cffd315cc5d8cbf0ac31ef65fa9a821b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:36.437352Z","signature_b64":"UQeQeqe/R2wX2P77AFX4PxsOiVjQ033zK8EfLf9cXj9UQGOa2IIrMysh4u88CWZ1+Go87C3tRvtdm+mu6X49DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97fe460a9bdd7b21fe8c101af88d95d6cffd315cc5d8cbf0ac31ef65fa9a821b","last_reissued_at":"2026-05-18T01:36:36.436759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:36.436759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.05593","source_version":1,"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-18T01:36:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sOkVAZu9MKRCkX1ArTqOWuFZJmWwaw3QZQ/tE0s9GC9AHc1gySCg9JNroiXLT+ehiHGNCf8N7jYUQdOVjPIeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:13:45.513809Z"},"content_sha256":"541c6c27fa930cf97d58baf6f88ce41ecd2f4f3f166460d3d93ac9d807db13e2","schema_version":"1.0","event_id":"sha256:541c6c27fa930cf97d58baf6f88ce41ecd2f4f3f166460d3d93ac9d807db13e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:S77EMCU33V5SD7UMCANPRDMV23","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Solver for Sparse Linear Systems Based on Rank-Structured Cholesky Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.NA","authors_text":"David S. Bindel, Jeffrey N. Chadwick","submitted_at":"2015-07-20T19:01:30Z","abstract_excerpt":"Direct factorization methods for the solution of large, sparse linear systems that arise from PDE discretizations are robust, but typically show poor time and memory scalability for large systems. In this paper, we describe an efficient sparse, rank-structured Cholesky algorithm for solution of the positive definite linear system $A x = b$ when $A$ comes from a discretized partial-differential equation. Our approach combines the efficient memory access patterns of conventional supernodal Cholesky algorithms with the memory efficiency of rank-structured direct solvers. For several test problems"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05593","kind":"arxiv","version":1},"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-18T01:36:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JhgNY/sK5b8mYY3/JgnMQ59Hg/vNQHemi//WDEQgDlRJ5nImwS8s9eph5JQrME8PsYq0wqH/X88LrP1/5xb8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:13:45.514175Z"},"content_sha256":"256f748a41573d3810bbdb75fd26cb5a2af5f932134e2c9119ae54cc26bb2c38","schema_version":"1.0","event_id":"sha256:256f748a41573d3810bbdb75fd26cb5a2af5f932134e2c9119ae54cc26bb2c38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S77EMCU33V5SD7UMCANPRDMV23/bundle.json","state_url":"https://pith.science/pith/S77EMCU33V5SD7UMCANPRDMV23/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S77EMCU33V5SD7UMCANPRDMV23/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-05-30T07:13:45Z","links":{"resolver":"https://pith.science/pith/S77EMCU33V5SD7UMCANPRDMV23","bundle":"https://pith.science/pith/S77EMCU33V5SD7UMCANPRDMV23/bundle.json","state":"https://pith.science/pith/S77EMCU33V5SD7UMCANPRDMV23/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S77EMCU33V5SD7UMCANPRDMV23/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:S77EMCU33V5SD7UMCANPRDMV23","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":"6ee0dbdca5310165f7e6d72d5d94c41bd96722ce3ce38e3ea6ac39b9a93237f5","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-07-20T19:01:30Z","title_canon_sha256":"37ac8275979ef89777a8b72b909f3e2f3bc3b7c5faa3dbc3addd85a41e55c510"},"schema_version":"1.0","source":{"id":"1507.05593","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05593","created_at":"2026-05-18T01:36:36Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05593v1","created_at":"2026-05-18T01:36:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05593","created_at":"2026-05-18T01:36:36Z"},{"alias_kind":"pith_short_12","alias_value":"S77EMCU33V5S","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S77EMCU33V5SD7UM","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S77EMCU3","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:256f748a41573d3810bbdb75fd26cb5a2af5f932134e2c9119ae54cc26bb2c38","target":"graph","created_at":"2026-05-18T01:36:36Z","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":"Direct factorization methods for the solution of large, sparse linear systems that arise from PDE discretizations are robust, but typically show poor time and memory scalability for large systems. In this paper, we describe an efficient sparse, rank-structured Cholesky algorithm for solution of the positive definite linear system $A x = b$ when $A$ comes from a discretized partial-differential equation. Our approach combines the efficient memory access patterns of conventional supernodal Cholesky algorithms with the memory efficiency of rank-structured direct solvers. For several test problems","authors_text":"David S. Bindel, Jeffrey N. Chadwick","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-07-20T19:01:30Z","title":"An Efficient Solver for Sparse Linear Systems Based on Rank-Structured Cholesky Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05593","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:541c6c27fa930cf97d58baf6f88ce41ecd2f4f3f166460d3d93ac9d807db13e2","target":"record","created_at":"2026-05-18T01:36:36Z","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":"6ee0dbdca5310165f7e6d72d5d94c41bd96722ce3ce38e3ea6ac39b9a93237f5","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-07-20T19:01:30Z","title_canon_sha256":"37ac8275979ef89777a8b72b909f3e2f3bc3b7c5faa3dbc3addd85a41e55c510"},"schema_version":"1.0","source":{"id":"1507.05593","kind":"arxiv","version":1}},"canonical_sha256":"97fe460a9bdd7b21fe8c101af88d95d6cffd315cc5d8cbf0ac31ef65fa9a821b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97fe460a9bdd7b21fe8c101af88d95d6cffd315cc5d8cbf0ac31ef65fa9a821b","first_computed_at":"2026-05-18T01:36:36.436759Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:36.436759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UQeQeqe/R2wX2P77AFX4PxsOiVjQ033zK8EfLf9cXj9UQGOa2IIrMysh4u88CWZ1+Go87C3tRvtdm+mu6X49DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:36.437352Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05593","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:541c6c27fa930cf97d58baf6f88ce41ecd2f4f3f166460d3d93ac9d807db13e2","sha256:256f748a41573d3810bbdb75fd26cb5a2af5f932134e2c9119ae54cc26bb2c38"],"state_sha256":"2d3ba57301307cb95c3ce98e0cd0cea921174ff42531f850290e88b4925bb19e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/iZIvO47jB/jbKCw4M1U3PBfQeFatIm7CGvhVyyfFsi2dZCJwtZ+sloQeBn11a9Kf2KVZalFsn9aGz3SquMPAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:13:45.516291Z","bundle_sha256":"6d644c5de6fcab8308c36db5288b592fe300c82d6260e414300eb55b975194d3"}}