{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2JTOAT4N2I7QYI56NJIIGZSQ6C","short_pith_number":"pith:2JTOAT4N","canonical_record":{"source":{"id":"1907.05767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-12T14:35:32Z","cross_cats_sorted":[],"title_canon_sha256":"a5ad7578df945f78c25c823e774955e0272e5c78a367052030fa699ae2f05b23","abstract_canon_sha256":"13015867bc67bcf3a2f82eb5c1b37e743e102018a753d420c014370f70126dc9"},"schema_version":"1.0"},"canonical_sha256":"d266e04f8dd23f0c23be6a50836650f09934ba5abc2fd3df7a673a74d7905d90","source":{"kind":"arxiv","id":"1907.05767","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.05767","created_at":"2026-05-17T23:40:44Z"},{"alias_kind":"arxiv_version","alias_value":"1907.05767v1","created_at":"2026-05-17T23:40:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05767","created_at":"2026-05-17T23:40:44Z"},{"alias_kind":"pith_short_12","alias_value":"2JTOAT4N2I7Q","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2JTOAT4N2I7QYI56","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2JTOAT4N","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2JTOAT4N2I7QYI56NJIIGZSQ6C","target":"record","payload":{"canonical_record":{"source":{"id":"1907.05767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-12T14:35:32Z","cross_cats_sorted":[],"title_canon_sha256":"a5ad7578df945f78c25c823e774955e0272e5c78a367052030fa699ae2f05b23","abstract_canon_sha256":"13015867bc67bcf3a2f82eb5c1b37e743e102018a753d420c014370f70126dc9"},"schema_version":"1.0"},"canonical_sha256":"d266e04f8dd23f0c23be6a50836650f09934ba5abc2fd3df7a673a74d7905d90","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:44.482986Z","signature_b64":"abhD3ruVfLsZiCowgUBeBg+zgPR4JOfCRjp+Skt07XF7A8RCR0su/7QyMVMCg/0p+kX8xMZqmJ1BDg0IBQSRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d266e04f8dd23f0c23be6a50836650f09934ba5abc2fd3df7a673a74d7905d90","last_reissued_at":"2026-05-17T23:40:44.482264Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:44.482264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.05767","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-17T23:40:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R1xYCEukoXWwEr272Kqrzs9vMLmfDM+zXUhmairixc3xoG68l/T5kV/MiFE9H1PASxIEiikScLHCmet4cCyUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:34:27.514751Z"},"content_sha256":"b679dc5b6752a90534ab2aefeacccf5d3b3fd84e6ef2de72e7694145b5527213","schema_version":"1.0","event_id":"sha256:b679dc5b6752a90534ab2aefeacccf5d3b3fd84e6ef2de72e7694145b5527213"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2JTOAT4N2I7QYI56NJIIGZSQ6C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Equal bi-Vectorized (EBV) method to high performance on GPU","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Amirreza Hashemi, Ebrahim Shirani, Mohsen Lahooti","submitted_at":"2019-07-12T14:35:32Z","abstract_excerpt":"Due to importance of reducing of time solution in numerical codes, we propose an algorithm for parallel LU decomposition solver for dense and sparse matrices on GPU. This algorithm is based on first bi-vectorizing a triangular matrices of decomposed coefficient matrix and then equalizing vectors. So we improve performance of LU decomposition on equal contributed scheme on threads. This algorithm also is convenient for other parallelism method and multi devices. Several test cases show advantage of this method over other familiar method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05767","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-17T23:40:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j5+NYPazZFGrF44am+PE5BdCv2UWFf6U81X/6b6a70c585bOqAZ+YLJLqP4s194jTxbhuovjk8XtQ+bADMSBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:34:27.515428Z"},"content_sha256":"bdf64cd3d54dd7823b01b41aeeb4ccc1e43b9a5d8de22ff31b3ea72ce2dd6569","schema_version":"1.0","event_id":"sha256:bdf64cd3d54dd7823b01b41aeeb4ccc1e43b9a5d8de22ff31b3ea72ce2dd6569"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2JTOAT4N2I7QYI56NJIIGZSQ6C/bundle.json","state_url":"https://pith.science/pith/2JTOAT4N2I7QYI56NJIIGZSQ6C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2JTOAT4N2I7QYI56NJIIGZSQ6C/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-30T06:34:27Z","links":{"resolver":"https://pith.science/pith/2JTOAT4N2I7QYI56NJIIGZSQ6C","bundle":"https://pith.science/pith/2JTOAT4N2I7QYI56NJIIGZSQ6C/bundle.json","state":"https://pith.science/pith/2JTOAT4N2I7QYI56NJIIGZSQ6C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2JTOAT4N2I7QYI56NJIIGZSQ6C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2JTOAT4N2I7QYI56NJIIGZSQ6C","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":"13015867bc67bcf3a2f82eb5c1b37e743e102018a753d420c014370f70126dc9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-12T14:35:32Z","title_canon_sha256":"a5ad7578df945f78c25c823e774955e0272e5c78a367052030fa699ae2f05b23"},"schema_version":"1.0","source":{"id":"1907.05767","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.05767","created_at":"2026-05-17T23:40:44Z"},{"alias_kind":"arxiv_version","alias_value":"1907.05767v1","created_at":"2026-05-17T23:40:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05767","created_at":"2026-05-17T23:40:44Z"},{"alias_kind":"pith_short_12","alias_value":"2JTOAT4N2I7Q","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2JTOAT4N2I7QYI56","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2JTOAT4N","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:bdf64cd3d54dd7823b01b41aeeb4ccc1e43b9a5d8de22ff31b3ea72ce2dd6569","target":"graph","created_at":"2026-05-17T23:40:44Z","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":"Due to importance of reducing of time solution in numerical codes, we propose an algorithm for parallel LU decomposition solver for dense and sparse matrices on GPU. This algorithm is based on first bi-vectorizing a triangular matrices of decomposed coefficient matrix and then equalizing vectors. So we improve performance of LU decomposition on equal contributed scheme on threads. This algorithm also is convenient for other parallelism method and multi devices. Several test cases show advantage of this method over other familiar method.","authors_text":"Amirreza Hashemi, Ebrahim Shirani, Mohsen Lahooti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-12T14:35:32Z","title":"Equal bi-Vectorized (EBV) method to high performance on GPU"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05767","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:b679dc5b6752a90534ab2aefeacccf5d3b3fd84e6ef2de72e7694145b5527213","target":"record","created_at":"2026-05-17T23:40:44Z","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":"13015867bc67bcf3a2f82eb5c1b37e743e102018a753d420c014370f70126dc9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-12T14:35:32Z","title_canon_sha256":"a5ad7578df945f78c25c823e774955e0272e5c78a367052030fa699ae2f05b23"},"schema_version":"1.0","source":{"id":"1907.05767","kind":"arxiv","version":1}},"canonical_sha256":"d266e04f8dd23f0c23be6a50836650f09934ba5abc2fd3df7a673a74d7905d90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d266e04f8dd23f0c23be6a50836650f09934ba5abc2fd3df7a673a74d7905d90","first_computed_at":"2026-05-17T23:40:44.482264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:44.482264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"abhD3ruVfLsZiCowgUBeBg+zgPR4JOfCRjp+Skt07XF7A8RCR0su/7QyMVMCg/0p+kX8xMZqmJ1BDg0IBQSRAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:44.482986Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.05767","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b679dc5b6752a90534ab2aefeacccf5d3b3fd84e6ef2de72e7694145b5527213","sha256:bdf64cd3d54dd7823b01b41aeeb4ccc1e43b9a5d8de22ff31b3ea72ce2dd6569"],"state_sha256":"14c91c1d6d79bc8e68e70512673a86f684ae5545e8096f11c2577728f345ced7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WhbH9nM8Ud7qQJryTVA1A0dzuyAZxOYPrxKR2Gj4ORuaioCeysskd4xC8rUDugFCF5WtWj0wPt4C7MapuusxAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:34:27.518648Z","bundle_sha256":"c3ab9b4597e0458921e1d359143cd236e61517ccaf8c0a53750261f0d02a2220"}}