{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AJT4QQ4WND5TQ6PHUL3QSRENSQ","short_pith_number":"pith:AJT4QQ4W","canonical_record":{"source":{"id":"1604.02528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-04-09T06:15:15Z","cross_cats_sorted":[],"title_canon_sha256":"110d5314121119d2df2d1457f08d1f6ce61c8ebbf6aeb63974988f82785c4bbc","abstract_canon_sha256":"69b0c36e6008c302b690bf5ecb0be63b7e5b541e8da9b10b12c06124d4e96823"},"schema_version":"1.0"},"canonical_sha256":"0267c8439668fb3879e7a2f709448d94254c621435951f83fae48e071ab7c456","source":{"kind":"arxiv","id":"1604.02528","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02528","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02528v1","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02528","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"pith_short_12","alias_value":"AJT4QQ4WND5T","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AJT4QQ4WND5TQ6PH","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AJT4QQ4W","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AJT4QQ4WND5TQ6PHUL3QSRENSQ","target":"record","payload":{"canonical_record":{"source":{"id":"1604.02528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-04-09T06:15:15Z","cross_cats_sorted":[],"title_canon_sha256":"110d5314121119d2df2d1457f08d1f6ce61c8ebbf6aeb63974988f82785c4bbc","abstract_canon_sha256":"69b0c36e6008c302b690bf5ecb0be63b7e5b541e8da9b10b12c06124d4e96823"},"schema_version":"1.0"},"canonical_sha256":"0267c8439668fb3879e7a2f709448d94254c621435951f83fae48e071ab7c456","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:22.716805Z","signature_b64":"0txIt+r3Go8gyY4bXiJCvgJKnEWgluLUIkvKFI4Z0GrM4E7xzvL+aBFVM4jrLVwrsJXswz3zXhEDaTUta9oeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0267c8439668fb3879e7a2f709448d94254c621435951f83fae48e071ab7c456","last_reissued_at":"2026-05-18T01:17:22.716402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:22.716402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.02528","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:17:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Td/IU2iS4tDvzPSHQVrF6t+JMNNNjW3xtBy2wSKgSfHTGJZSj6w52TwXwy5363GEZ8iD/4/IEHQy583aegU0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T04:49:19.439846Z"},"content_sha256":"17137a1f34422f06eec6b579f4e5f33a744177f944c4b684c0bbb27e72f8ac0d","schema_version":"1.0","event_id":"sha256:17137a1f34422f06eec6b579f4e5f33a744177f944c4b684c0bbb27e72f8ac0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AJT4QQ4WND5TQ6PHUL3QSRENSQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Left-Looking Selected Inversion Algorithm and Task Parallelism on Shared Memory Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Chao Yang, Lin Lin, Mathias Jacquelin, Weile Jia, Yonghua Zhao","submitted_at":"2016-04-09T06:15:15Z","abstract_excerpt":"Given a sparse matrix $A$, the selected inversion algorithm is an efficient method for computing certain selected elements of $A^{-1}$. These selected elements correspond to all or some nonzero elements of the LU factors of $A$. In many ways, the type of matrix updates performed in the selected inversion algorithm is similar to that performed in the LU factorization, although the sequence of operation is different. In the context of LU factorization, it is known that the left-looking and right-looking algorithms exhibit different memory access and data communication patterns, and hence differe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02528","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:17:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3gRscN6S1vko1yiGhj2TEvAdm/aXAa5J1joTYfNGiOvoNbpCq4VrJHgftfe13jGwpt17OkI/EZOqq6VaqfO9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T04:49:19.440191Z"},"content_sha256":"2686169d070b22a255c053f86ff14841a2c01122196762b25162ecf38b874e27","schema_version":"1.0","event_id":"sha256:2686169d070b22a255c053f86ff14841a2c01122196762b25162ecf38b874e27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJT4QQ4WND5TQ6PHUL3QSRENSQ/bundle.json","state_url":"https://pith.science/pith/AJT4QQ4WND5TQ6PHUL3QSRENSQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJT4QQ4WND5TQ6PHUL3QSRENSQ/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-26T04:49:19Z","links":{"resolver":"https://pith.science/pith/AJT4QQ4WND5TQ6PHUL3QSRENSQ","bundle":"https://pith.science/pith/AJT4QQ4WND5TQ6PHUL3QSRENSQ/bundle.json","state":"https://pith.science/pith/AJT4QQ4WND5TQ6PHUL3QSRENSQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJT4QQ4WND5TQ6PHUL3QSRENSQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AJT4QQ4WND5TQ6PHUL3QSRENSQ","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":"69b0c36e6008c302b690bf5ecb0be63b7e5b541e8da9b10b12c06124d4e96823","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-04-09T06:15:15Z","title_canon_sha256":"110d5314121119d2df2d1457f08d1f6ce61c8ebbf6aeb63974988f82785c4bbc"},"schema_version":"1.0","source":{"id":"1604.02528","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02528","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02528v1","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02528","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"pith_short_12","alias_value":"AJT4QQ4WND5T","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AJT4QQ4WND5TQ6PH","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AJT4QQ4W","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:2686169d070b22a255c053f86ff14841a2c01122196762b25162ecf38b874e27","target":"graph","created_at":"2026-05-18T01:17:22Z","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":"Given a sparse matrix $A$, the selected inversion algorithm is an efficient method for computing certain selected elements of $A^{-1}$. These selected elements correspond to all or some nonzero elements of the LU factors of $A$. In many ways, the type of matrix updates performed in the selected inversion algorithm is similar to that performed in the LU factorization, although the sequence of operation is different. In the context of LU factorization, it is known that the left-looking and right-looking algorithms exhibit different memory access and data communication patterns, and hence differe","authors_text":"Chao Yang, Lin Lin, Mathias Jacquelin, Weile Jia, Yonghua Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-04-09T06:15:15Z","title":"A Left-Looking Selected Inversion Algorithm and Task Parallelism on Shared Memory Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02528","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:17137a1f34422f06eec6b579f4e5f33a744177f944c4b684c0bbb27e72f8ac0d","target":"record","created_at":"2026-05-18T01:17:22Z","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":"69b0c36e6008c302b690bf5ecb0be63b7e5b541e8da9b10b12c06124d4e96823","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-04-09T06:15:15Z","title_canon_sha256":"110d5314121119d2df2d1457f08d1f6ce61c8ebbf6aeb63974988f82785c4bbc"},"schema_version":"1.0","source":{"id":"1604.02528","kind":"arxiv","version":1}},"canonical_sha256":"0267c8439668fb3879e7a2f709448d94254c621435951f83fae48e071ab7c456","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0267c8439668fb3879e7a2f709448d94254c621435951f83fae48e071ab7c456","first_computed_at":"2026-05-18T01:17:22.716402Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:22.716402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0txIt+r3Go8gyY4bXiJCvgJKnEWgluLUIkvKFI4Z0GrM4E7xzvL+aBFVM4jrLVwrsJXswz3zXhEDaTUta9oeBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:22.716805Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02528","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17137a1f34422f06eec6b579f4e5f33a744177f944c4b684c0bbb27e72f8ac0d","sha256:2686169d070b22a255c053f86ff14841a2c01122196762b25162ecf38b874e27"],"state_sha256":"78fe21e4e3adf59cab465b9fd74742844420e8fc8b0f2707002e5220229682d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uZxo7gGwKA73jYCRd3AiWVtESdyjdkw4hprpuXoqNrf5mhTlceFix2yE+GVX0+6d0N4HI0PrWruYucWffcs4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T04:49:19.442296Z","bundle_sha256":"c6fccf05badd1f33cb178da7f91c54276489ac6a4b075a5d812985456fc280cd"}}