{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5LR52ZSV6AHBKI2SXYP6KHXATC","short_pith_number":"pith:5LR52ZSV","schema_version":"1.0","canonical_sha256":"eae3dd6655f00e152352be1fe51ee09891779469c95ab2d8242f53d4142aa613","source":{"kind":"arxiv","id":"1404.0447","version":3},"attestation_state":"computed","paper":{"title":"PSelInv -- A Distributed Memory Parallel Algorithm for Selected Inversion : the Symmetric Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NA"],"primary_cat":"math.NA","authors_text":"Chao Yang, Lin Lin, Mathias Jacquelin","submitted_at":"2014-04-02T03:48:45Z","abstract_excerpt":"We describe an efficient parallel implementation of the selected inversion algorithm for distributed memory computer systems, which we call \\texttt{PSelInv}. The \\texttt{PSelInv} method computes selected elements of a general sparse matrix $A$ that can be decomposed as $A = LU$, where $L$ is lower triangular and $U$ is upper triangular. The implementation described in this paper focuses on the case of sparse symmetric matrices. It contains an interface that is compatible with the distributed memory parallel sparse direct factorization \\texttt{SuperLU\\_DIST}. However, the underlying data struct"},"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":"1404.0447","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-04-02T03:48:45Z","cross_cats_sorted":["cs.DC","cs.NA"],"title_canon_sha256":"57d93e4c7c23babc2165160d232135fd1446909ab265dc0c1dc499b18013d52c","abstract_canon_sha256":"cef5c3eec3ec568e0d8db0b32c15879538133eb4721655a5417c927ea9426216"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:02.685812Z","signature_b64":"KrC4FhKE+Vw2EtypkH1rF8Yb1CyGfJmgxEuPkiP93BefvOXD9iIyD2qLrQ4yl9+AnAxLMvRc2EqUOXpdj813AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eae3dd6655f00e152352be1fe51ee09891779469c95ab2d8242f53d4142aa613","last_reissued_at":"2026-05-18T02:00:02.685285Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:02.685285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PSelInv -- A Distributed Memory Parallel Algorithm for Selected Inversion : the Symmetric Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NA"],"primary_cat":"math.NA","authors_text":"Chao Yang, Lin Lin, Mathias Jacquelin","submitted_at":"2014-04-02T03:48:45Z","abstract_excerpt":"We describe an efficient parallel implementation of the selected inversion algorithm for distributed memory computer systems, which we call \\texttt{PSelInv}. The \\texttt{PSelInv} method computes selected elements of a general sparse matrix $A$ that can be decomposed as $A = LU$, where $L$ is lower triangular and $U$ is upper triangular. The implementation described in this paper focuses on the case of sparse symmetric matrices. It contains an interface that is compatible with the distributed memory parallel sparse direct factorization \\texttt{SuperLU\\_DIST}. However, the underlying data struct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0447","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.0447","created_at":"2026-05-18T02:00:02.685375+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.0447v3","created_at":"2026-05-18T02:00:02.685375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0447","created_at":"2026-05-18T02:00:02.685375+00:00"},{"alias_kind":"pith_short_12","alias_value":"5LR52ZSV6AHB","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5LR52ZSV6AHBKI2S","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5LR52ZSV","created_at":"2026-05-18T12:28:14.216126+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/5LR52ZSV6AHBKI2SXYP6KHXATC","json":"https://pith.science/pith/5LR52ZSV6AHBKI2SXYP6KHXATC.json","graph_json":"https://pith.science/api/pith-number/5LR52ZSV6AHBKI2SXYP6KHXATC/graph.json","events_json":"https://pith.science/api/pith-number/5LR52ZSV6AHBKI2SXYP6KHXATC/events.json","paper":"https://pith.science/paper/5LR52ZSV"},"agent_actions":{"view_html":"https://pith.science/pith/5LR52ZSV6AHBKI2SXYP6KHXATC","download_json":"https://pith.science/pith/5LR52ZSV6AHBKI2SXYP6KHXATC.json","view_paper":"https://pith.science/paper/5LR52ZSV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.0447&json=true","fetch_graph":"https://pith.science/api/pith-number/5LR52ZSV6AHBKI2SXYP6KHXATC/graph.json","fetch_events":"https://pith.science/api/pith-number/5LR52ZSV6AHBKI2SXYP6KHXATC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5LR52ZSV6AHBKI2SXYP6KHXATC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5LR52ZSV6AHBKI2SXYP6KHXATC/action/storage_attestation","attest_author":"https://pith.science/pith/5LR52ZSV6AHBKI2SXYP6KHXATC/action/author_attestation","sign_citation":"https://pith.science/pith/5LR52ZSV6AHBKI2SXYP6KHXATC/action/citation_signature","submit_replication":"https://pith.science/pith/5LR52ZSV6AHBKI2SXYP6KHXATC/action/replication_record"}},"created_at":"2026-05-18T02:00:02.685375+00:00","updated_at":"2026-05-18T02:00:02.685375+00:00"}