{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FJAQ4ZAZBKLFUANVXZKBCWJXXN","short_pith_number":"pith:FJAQ4ZAZ","canonical_record":{"source":{"id":"1708.04539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2017-08-14T00:18:41Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"83adc9dda462d6bc496763495411dff6ffe3e0bc9a2985a3dc29fd21aa3a374e","abstract_canon_sha256":"79e762e3f1e9c6f5bd98f3d118ff01ce7d13539784570f8c1203df0b1342562f"},"schema_version":"1.0"},"canonical_sha256":"2a410e64190a965a01b5be54115937bb70325295bd0dcb7f28ca35f1bbfcb572","source":{"kind":"arxiv","id":"1708.04539","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04539","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04539v1","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04539","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"pith_short_12","alias_value":"FJAQ4ZAZBKLF","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FJAQ4ZAZBKLFUANV","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FJAQ4ZAZ","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FJAQ4ZAZBKLFUANVXZKBCWJXXN","target":"record","payload":{"canonical_record":{"source":{"id":"1708.04539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2017-08-14T00:18:41Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"83adc9dda462d6bc496763495411dff6ffe3e0bc9a2985a3dc29fd21aa3a374e","abstract_canon_sha256":"79e762e3f1e9c6f5bd98f3d118ff01ce7d13539784570f8c1203df0b1342562f"},"schema_version":"1.0"},"canonical_sha256":"2a410e64190a965a01b5be54115937bb70325295bd0dcb7f28ca35f1bbfcb572","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:59.051245Z","signature_b64":"j9DEZ3yVybHEChMDIA2p80yBNoTUjYrtYhi3p1nYt3v+6FWehMaGASyMnRb/xuin2lXVLvBmhd8FKXTGn/xxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a410e64190a965a01b5be54115937bb70325295bd0dcb7f28ca35f1bbfcb572","last_reissued_at":"2026-05-18T00:37:59.050684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:59.050684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.04539","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-18T00:37:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1aTTLdDF+eqdh9VRkcVEU3jAhj2uAL/5cWranRnuYCGEDE235KB8f3alJY5XPyYTKPt4tNWBC3XEjzLgZxUzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:24:18.612600Z"},"content_sha256":"8ed9294c7feeafc5222ca306f658cd4c38656678fca145dd164c4ffbd1cb7b7f","schema_version":"1.0","event_id":"sha256:8ed9294c7feeafc5222ca306f658cd4c38656678fca145dd164c4ffbd1cb7b7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FJAQ4ZAZBKLFUANVXZKBCWJXXN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PSelInv - A Distributed Memory Parallel Algorithm for Selected Inversion: the non-symmetric Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.MS","authors_text":"Chao Yang, Lin Lin, Mathias Jacquelin","submitted_at":"2017-08-14T00:18:41Z","abstract_excerpt":"This paper generalizes the parallel selected inversion algorithm called PSelInv to sparse non- symmetric matrices. We assume a general sparse matrix A has been decomposed as PAQ = LU on a distributed memory parallel machine, where L, U are lower and upper triangular matrices, and P, Q are permutation matrices, respectively. The PSelInv method computes selected elements of A-1. The selection is confined by the sparsity pattern of the matrix AT . Our algorithm does not assume any symmetry properties of A, and our parallel implementation is memory efficient, in the sense that the computed element"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04539","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-18T00:37:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZyPBOudM6eMTjyJt9VJBIfhbI7NM4aR1XcZOc2SKyW1EnHElsb8ogN8lVEfkZA0hPDZFO+Wm18kHc2Y1k+BzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:24:18.612950Z"},"content_sha256":"76c8f0d66463b3915b59512f7f40b9d65432ba4b374721aba5fa3475787d2634","schema_version":"1.0","event_id":"sha256:76c8f0d66463b3915b59512f7f40b9d65432ba4b374721aba5fa3475787d2634"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJAQ4ZAZBKLFUANVXZKBCWJXXN/bundle.json","state_url":"https://pith.science/pith/FJAQ4ZAZBKLFUANVXZKBCWJXXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJAQ4ZAZBKLFUANVXZKBCWJXXN/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-20T08:24:18Z","links":{"resolver":"https://pith.science/pith/FJAQ4ZAZBKLFUANVXZKBCWJXXN","bundle":"https://pith.science/pith/FJAQ4ZAZBKLFUANVXZKBCWJXXN/bundle.json","state":"https://pith.science/pith/FJAQ4ZAZBKLFUANVXZKBCWJXXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJAQ4ZAZBKLFUANVXZKBCWJXXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FJAQ4ZAZBKLFUANVXZKBCWJXXN","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":"79e762e3f1e9c6f5bd98f3d118ff01ce7d13539784570f8c1203df0b1342562f","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2017-08-14T00:18:41Z","title_canon_sha256":"83adc9dda462d6bc496763495411dff6ffe3e0bc9a2985a3dc29fd21aa3a374e"},"schema_version":"1.0","source":{"id":"1708.04539","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04539","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04539v1","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04539","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"pith_short_12","alias_value":"FJAQ4ZAZBKLF","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FJAQ4ZAZBKLFUANV","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FJAQ4ZAZ","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:76c8f0d66463b3915b59512f7f40b9d65432ba4b374721aba5fa3475787d2634","target":"graph","created_at":"2026-05-18T00:37:59Z","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":"This paper generalizes the parallel selected inversion algorithm called PSelInv to sparse non- symmetric matrices. We assume a general sparse matrix A has been decomposed as PAQ = LU on a distributed memory parallel machine, where L, U are lower and upper triangular matrices, and P, Q are permutation matrices, respectively. The PSelInv method computes selected elements of A-1. The selection is confined by the sparsity pattern of the matrix AT . Our algorithm does not assume any symmetry properties of A, and our parallel implementation is memory efficient, in the sense that the computed element","authors_text":"Chao Yang, Lin Lin, Mathias Jacquelin","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2017-08-14T00:18:41Z","title":"PSelInv - A Distributed Memory Parallel Algorithm for Selected Inversion: the non-symmetric Case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04539","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:8ed9294c7feeafc5222ca306f658cd4c38656678fca145dd164c4ffbd1cb7b7f","target":"record","created_at":"2026-05-18T00:37:59Z","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":"79e762e3f1e9c6f5bd98f3d118ff01ce7d13539784570f8c1203df0b1342562f","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2017-08-14T00:18:41Z","title_canon_sha256":"83adc9dda462d6bc496763495411dff6ffe3e0bc9a2985a3dc29fd21aa3a374e"},"schema_version":"1.0","source":{"id":"1708.04539","kind":"arxiv","version":1}},"canonical_sha256":"2a410e64190a965a01b5be54115937bb70325295bd0dcb7f28ca35f1bbfcb572","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a410e64190a965a01b5be54115937bb70325295bd0dcb7f28ca35f1bbfcb572","first_computed_at":"2026-05-18T00:37:59.050684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:59.050684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j9DEZ3yVybHEChMDIA2p80yBNoTUjYrtYhi3p1nYt3v+6FWehMaGASyMnRb/xuin2lXVLvBmhd8FKXTGn/xxAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:59.051245Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04539","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ed9294c7feeafc5222ca306f658cd4c38656678fca145dd164c4ffbd1cb7b7f","sha256:76c8f0d66463b3915b59512f7f40b9d65432ba4b374721aba5fa3475787d2634"],"state_sha256":"54c6feb3ae1a3b05216d0bffa8e7be3d73d6eb12d108ab3253e56d802cdfd138"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/p3uPSj20eusETq4EiDTFNxO8pgdp9JD7OAraHA/5R6LMVJ5tGbJfeBdF7ksmOx3o/nhRwiAS8HatA5L7PrDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T08:24:18.614910Z","bundle_sha256":"da564e8af4aaa1f0401bd5d7304db1553358ca54cd1d401ff48a270d5c5f7baa"}}