{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:BBHH4DLJD54HLV7TKTVGHDDEPW","short_pith_number":"pith:BBHH4DLJ","canonical_record":{"source":{"id":"0912.2047","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-12-10T16:50:05Z","cross_cats_sorted":["cs.DS","cs.NA","math.NA"],"title_canon_sha256":"eb94ff2236902864ce98be5c1087b5238b1f1937d8572f8b6c12455049004ce6","abstract_canon_sha256":"c4b3e5cc7384743fb2be0e6cba69d0ab1d1dceddbb696bd6514d0d05c556840c"},"schema_version":"1.0"},"canonical_sha256":"084e7e0d691f7875d7f354ea638c647da45605dbe6c20dfebd353ef211329ba9","source":{"kind":"arxiv","id":"0912.2047","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:BBHH4DLJD54HLV7TKTVGHDDEPW","target":"record","payload":{"canonical_record":{"source":{"id":"0912.2047","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-12-10T16:50:05Z","cross_cats_sorted":["cs.DS","cs.NA","math.NA"],"title_canon_sha256":"eb94ff2236902864ce98be5c1087b5238b1f1937d8572f8b6c12455049004ce6","abstract_canon_sha256":"c4b3e5cc7384743fb2be0e6cba69d0ab1d1dceddbb696bd6514d0d05c556840c"},"schema_version":"1.0"},"canonical_sha256":"084e7e0d691f7875d7f354ea638c647da45605dbe6c20dfebd353ef211329ba9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T23:06:31.331440Z","signature_b64":"93yRrdbK17msMghE0D0+JM6PtTKTScERE3wb8JwraTwwqu6cL1wISrEJpkEtKWMQaKquDlYYCA8YBEovybihCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"084e7e0d691f7875d7f354ea638c647da45605dbe6c20dfebd353ef211329ba9","last_reissued_at":"2026-06-03T23:06:31.330835Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T23:06:31.330835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0912.2047","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-06-03T23:06:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kpCQoHYL9lFSA7gscKhpYy0jg+Fx/vI5th3cbsvr4gGlkrZglSXa8apO9SJO2J7HdtldJ95GarexYkmPklt2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:48:51.240255Z"},"content_sha256":"d1e0aa90206e401a7c293a26feb499370e8b00dee28f36fd0735cdb4b62f7b20","schema_version":"1.0","event_id":"sha256:d1e0aa90206e401a7c293a26feb499370e8b00dee28f36fd0735cdb4b62f7b20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:BBHH4DLJD54HLV7TKTVGHDDEPW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Gaussian Elimination on a 2D SIMD Array of Processors without Column Broadcasts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NA","math.NA"],"primary_cat":"cs.DC","authors_text":"Mugurel Ionut Andreica","submitted_at":"2009-12-10T16:50:05Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.2047","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0912.2047/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-03T23:06:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qVL5Nc3UpvxWCiOC/I9+P3BJVjqCYkVlhtpvG2I/no1dLZjs+gKq04lKnwrE/tEwm2cYmesMNOqSBr1BjhaNCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:48:51.241015Z"},"content_sha256":"a6e07d268f265996b6c10c1811032269354378f6174055b344745250907c5812","schema_version":"1.0","event_id":"sha256:a6e07d268f265996b6c10c1811032269354378f6174055b344745250907c5812"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BBHH4DLJD54HLV7TKTVGHDDEPW/bundle.json","state_url":"https://pith.science/pith/BBHH4DLJD54HLV7TKTVGHDDEPW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BBHH4DLJD54HLV7TKTVGHDDEPW/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-08T01:48:51Z","links":{"resolver":"https://pith.science/pith/BBHH4DLJD54HLV7TKTVGHDDEPW","bundle":"https://pith.science/pith/BBHH4DLJD54HLV7TKTVGHDDEPW/bundle.json","state":"https://pith.science/pith/BBHH4DLJD54HLV7TKTVGHDDEPW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BBHH4DLJD54HLV7TKTVGHDDEPW/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gu8AFtwuz3r1pxBjcI7YeUpEmRUtne1KlFJ1NQYxWW+qJBtDb11pOD3QpCsEjlAnA7RmtU27OeeL7Yt8fkSqCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:48:51.244531Z","bundle_sha256":"695687f5a7affb569b2c6ca9a220fc18e13d76d7a1415150b6d1e64b3698b399"}}