{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:BBHH4DLJD54HLV7TKTVGHDDEPW","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":"c4b3e5cc7384743fb2be0e6cba69d0ab1d1dceddbb696bd6514d0d05c556840c","cross_cats_sorted":["cs.DS","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-12-10T16:50:05Z","title_canon_sha256":"eb94ff2236902864ce98be5c1087b5238b1f1937d8572f8b6c12455049004ce6"},"schema_version":"1.0","source":{"id":"0912.2047","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.2047","created_at":"2026-06-03T23:06:31Z"},{"alias_kind":"arxiv_version","alias_value":"0912.2047v1","created_at":"2026-06-03T23:06:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.2047","created_at":"2026-06-03T23:06:31Z"},{"alias_kind":"pith_short_12","alias_value":"BBHH4DLJD54H","created_at":"2026-06-03T23:06:31Z"},{"alias_kind":"pith_short_16","alias_value":"BBHH4DLJD54HLV7T","created_at":"2026-06-03T23:06:31Z"},{"alias_kind":"pith_short_8","alias_value":"BBHH4DLJ","created_at":"2026-06-03T23:06:31Z"}],"graph_snapshots":[{"event_id":"sha256:a6e07d268f265996b6c10c1811032269354378f6174055b344745250907c5812","target":"graph","created_at":"2026-06-03T23:06:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0912.2047/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents an efficient method for implementing the Gaussian elimination technique for an nxm (m>=n) matrix, using a 2D SIMD array of nxm processors. The described algorithm consists of 2xn-1=O(n) iterations, which provides an optimal speed-up over the serial version. A particularity of the algorithm is that it only requires broadcasts on the rows of the processor matrix and not on its columns. The paper also presents several extensions and applications of the Gaussian elimination algorithm.","authors_text":"Mugurel Ionut Andreica","cross_cats":["cs.DS","cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-12-10T16:50:05Z","title":"Efficient Gaussian Elimination on a 2D SIMD Array of Processors without Column Broadcasts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.2047","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:d1e0aa90206e401a7c293a26feb499370e8b00dee28f36fd0735cdb4b62f7b20","target":"record","created_at":"2026-06-03T23:06:31Z","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":"c4b3e5cc7384743fb2be0e6cba69d0ab1d1dceddbb696bd6514d0d05c556840c","cross_cats_sorted":["cs.DS","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-12-10T16:50:05Z","title_canon_sha256":"eb94ff2236902864ce98be5c1087b5238b1f1937d8572f8b6c12455049004ce6"},"schema_version":"1.0","source":{"id":"0912.2047","kind":"arxiv","version":1}},"canonical_sha256":"084e7e0d691f7875d7f354ea638c647da45605dbe6c20dfebd353ef211329ba9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"084e7e0d691f7875d7f354ea638c647da45605dbe6c20dfebd353ef211329ba9","first_computed_at":"2026-06-03T23:06:31.330835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T23:06:31.330835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"93yRrdbK17msMghE0D0+JM6PtTKTScERE3wb8JwraTwwqu6cL1wISrEJpkEtKWMQaKquDlYYCA8YBEovybihCw==","signature_status":"signed_v1","signed_at":"2026-06-03T23:06:31.331440Z","signed_message":"canonical_sha256_bytes"},"source_id":"0912.2047","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1e0aa90206e401a7c293a26feb499370e8b00dee28f36fd0735cdb4b62f7b20","sha256:a6e07d268f265996b6c10c1811032269354378f6174055b344745250907c5812"],"state_sha256":"cb399fa0689020c2b657d1effaa1eca71645908c2545f5c207d8e403dcc94e8a"}