{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FJAQ4ZAZBKLFUANVXZKBCWJXXN","short_pith_number":"pith:FJAQ4ZAZ","schema_version":"1.0","canonical_sha256":"2a410e64190a965a01b5be54115937bb70325295bd0dcb7f28ca35f1bbfcb572","source":{"kind":"arxiv","id":"1708.04539","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.04539","created_at":"2026-05-18T00:37:59.050777+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04539v1","created_at":"2026-05-18T00:37:59.050777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04539","created_at":"2026-05-18T00:37:59.050777+00:00"},{"alias_kind":"pith_short_12","alias_value":"FJAQ4ZAZBKLF","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FJAQ4ZAZBKLFUANV","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FJAQ4ZAZ","created_at":"2026-05-18T12:31:15.632608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FJAQ4ZAZBKLFUANVXZKBCWJXXN","json":"https://pith.science/pith/FJAQ4ZAZBKLFUANVXZKBCWJXXN.json","graph_json":"https://pith.science/api/pith-number/FJAQ4ZAZBKLFUANVXZKBCWJXXN/graph.json","events_json":"https://pith.science/api/pith-number/FJAQ4ZAZBKLFUANVXZKBCWJXXN/events.json","paper":"https://pith.science/paper/FJAQ4ZAZ"},"agent_actions":{"view_html":"https://pith.science/pith/FJAQ4ZAZBKLFUANVXZKBCWJXXN","download_json":"https://pith.science/pith/FJAQ4ZAZBKLFUANVXZKBCWJXXN.json","view_paper":"https://pith.science/paper/FJAQ4ZAZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04539&json=true","fetch_graph":"https://pith.science/api/pith-number/FJAQ4ZAZBKLFUANVXZKBCWJXXN/graph.json","fetch_events":"https://pith.science/api/pith-number/FJAQ4ZAZBKLFUANVXZKBCWJXXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FJAQ4ZAZBKLFUANVXZKBCWJXXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FJAQ4ZAZBKLFUANVXZKBCWJXXN/action/storage_attestation","attest_author":"https://pith.science/pith/FJAQ4ZAZBKLFUANVXZKBCWJXXN/action/author_attestation","sign_citation":"https://pith.science/pith/FJAQ4ZAZBKLFUANVXZKBCWJXXN/action/citation_signature","submit_replication":"https://pith.science/pith/FJAQ4ZAZBKLFUANVXZKBCWJXXN/action/replication_record"}},"created_at":"2026-05-18T00:37:59.050777+00:00","updated_at":"2026-05-18T00:37:59.050777+00:00"}