{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2CBTRN472EXBYMTVC6GOGAY5QU","short_pith_number":"pith:2CBTRN47","canonical_record":{"source":{"id":"1905.03641","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PF","submitted_at":"2019-05-09T14:05:10Z","cross_cats_sorted":[],"title_canon_sha256":"6ef6aecc0a26c530e47c30166b4d4e801af26de85a26a4c05832ecf574abd311","abstract_canon_sha256":"9a455fa8dae624ff00f326ac24986beb839497294885f05e76cd5fcaede78220"},"schema_version":"1.0"},"canonical_sha256":"d08338b79fd12e1c3275178ce3031d850685b31485a7033c4fd303913f9d9d0b","source":{"kind":"arxiv","id":"1905.03641","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03641","created_at":"2026-05-17T23:46:37Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03641v1","created_at":"2026-05-17T23:46:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03641","created_at":"2026-05-17T23:46:37Z"},{"alias_kind":"pith_short_12","alias_value":"2CBTRN472EXB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2CBTRN472EXBYMTV","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2CBTRN47","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2CBTRN472EXBYMTVC6GOGAY5QU","target":"record","payload":{"canonical_record":{"source":{"id":"1905.03641","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PF","submitted_at":"2019-05-09T14:05:10Z","cross_cats_sorted":[],"title_canon_sha256":"6ef6aecc0a26c530e47c30166b4d4e801af26de85a26a4c05832ecf574abd311","abstract_canon_sha256":"9a455fa8dae624ff00f326ac24986beb839497294885f05e76cd5fcaede78220"},"schema_version":"1.0"},"canonical_sha256":"d08338b79fd12e1c3275178ce3031d850685b31485a7033c4fd303913f9d9d0b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:37.107620Z","signature_b64":"VLQ6/qQKmXrYnq0z/QQ6GcuSWb1Mmy/ZW6shNtK24KRTsX33+96c7Mb7eRVZEblKLJVoC0DB7WerCb/DoNjFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d08338b79fd12e1c3275178ce3031d850685b31485a7033c4fd303913f9d9d0b","last_reissued_at":"2026-05-17T23:46:37.107087Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:37.107087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.03641","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:46:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygm2TDRojCdgAgoHG2Lp5JFeJRiakwU/0bb7StLtj/+bYUj/b7/rTU2a/FCinvoWzYofWBv4k4dPPcTZ0Y0nAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T13:19:32.352177Z"},"content_sha256":"3c636b7016959be7be3e526deb5f389b179a32e36d10208a6323b062667ad4b4","schema_version":"1.0","event_id":"sha256:3c636b7016959be7be3e526deb5f389b179a32e36d10208a6323b062667ad4b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2CBTRN472EXBYMTVC6GOGAY5QU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiplica\\c{c}\\~ao de matrizes: uma compara\\c{c}\\~ao entre as abordagens sequencial (CPU) e paralela (GPU)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Andre G. C. Pacheco","submitted_at":"2019-05-09T14:05:10Z","abstract_excerpt":"Designing problems using matrices is very important in Computer Science. Fields like graph computer, graphs theory, and machine learning use matrices very often to solve their own problems. The most often matrix operation is the multiplication. It may be time-consuming if the matrices to be multiplied are large. For this reason, the parallel computer became a must to tackle this problem. In this report, it is presented a comparison between sequential and parallel approaches to computing the matrix multiplication using CUDA and openMP. The results show the importance of parallelizing mainly whe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03641","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:46:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0NEo+JccqU95Uygra5HGjlOjR41zKF+ORlPlx5plKlytMQnhLGS6jf0b/dvglQjYs3FmM6+ir/Z+jzqumeHkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T13:19:32.352539Z"},"content_sha256":"d7c58a5d1f2de73dd5ba97fb062c46e90de24c16e5e3f2c52f07d73096130d5e","schema_version":"1.0","event_id":"sha256:d7c58a5d1f2de73dd5ba97fb062c46e90de24c16e5e3f2c52f07d73096130d5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2CBTRN472EXBYMTVC6GOGAY5QU/bundle.json","state_url":"https://pith.science/pith/2CBTRN472EXBYMTVC6GOGAY5QU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2CBTRN472EXBYMTVC6GOGAY5QU/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-07-16T13:19:32Z","links":{"resolver":"https://pith.science/pith/2CBTRN472EXBYMTVC6GOGAY5QU","bundle":"https://pith.science/pith/2CBTRN472EXBYMTVC6GOGAY5QU/bundle.json","state":"https://pith.science/pith/2CBTRN472EXBYMTVC6GOGAY5QU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2CBTRN472EXBYMTVC6GOGAY5QU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2CBTRN472EXBYMTVC6GOGAY5QU","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":"9a455fa8dae624ff00f326ac24986beb839497294885f05e76cd5fcaede78220","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PF","submitted_at":"2019-05-09T14:05:10Z","title_canon_sha256":"6ef6aecc0a26c530e47c30166b4d4e801af26de85a26a4c05832ecf574abd311"},"schema_version":"1.0","source":{"id":"1905.03641","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03641","created_at":"2026-05-17T23:46:37Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03641v1","created_at":"2026-05-17T23:46:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03641","created_at":"2026-05-17T23:46:37Z"},{"alias_kind":"pith_short_12","alias_value":"2CBTRN472EXB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2CBTRN472EXBYMTV","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2CBTRN47","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:d7c58a5d1f2de73dd5ba97fb062c46e90de24c16e5e3f2c52f07d73096130d5e","target":"graph","created_at":"2026-05-17T23:46:37Z","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":"Designing problems using matrices is very important in Computer Science. Fields like graph computer, graphs theory, and machine learning use matrices very often to solve their own problems. The most often matrix operation is the multiplication. It may be time-consuming if the matrices to be multiplied are large. For this reason, the parallel computer became a must to tackle this problem. In this report, it is presented a comparison between sequential and parallel approaches to computing the matrix multiplication using CUDA and openMP. The results show the importance of parallelizing mainly whe","authors_text":"Andre G. C. Pacheco","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PF","submitted_at":"2019-05-09T14:05:10Z","title":"Multiplica\\c{c}\\~ao de matrizes: uma compara\\c{c}\\~ao entre as abordagens sequencial (CPU) e paralela (GPU)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03641","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:3c636b7016959be7be3e526deb5f389b179a32e36d10208a6323b062667ad4b4","target":"record","created_at":"2026-05-17T23:46:37Z","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":"9a455fa8dae624ff00f326ac24986beb839497294885f05e76cd5fcaede78220","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PF","submitted_at":"2019-05-09T14:05:10Z","title_canon_sha256":"6ef6aecc0a26c530e47c30166b4d4e801af26de85a26a4c05832ecf574abd311"},"schema_version":"1.0","source":{"id":"1905.03641","kind":"arxiv","version":1}},"canonical_sha256":"d08338b79fd12e1c3275178ce3031d850685b31485a7033c4fd303913f9d9d0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d08338b79fd12e1c3275178ce3031d850685b31485a7033c4fd303913f9d9d0b","first_computed_at":"2026-05-17T23:46:37.107087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:37.107087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VLQ6/qQKmXrYnq0z/QQ6GcuSWb1Mmy/ZW6shNtK24KRTsX33+96c7Mb7eRVZEblKLJVoC0DB7WerCb/DoNjFDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:37.107620Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.03641","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c636b7016959be7be3e526deb5f389b179a32e36d10208a6323b062667ad4b4","sha256:d7c58a5d1f2de73dd5ba97fb062c46e90de24c16e5e3f2c52f07d73096130d5e"],"state_sha256":"3683114cfc7289703cb658472d8163ce6a5816b847e597471d54879201e35a56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/FzW05qxiwCPl14wwhRmdE7Hw6faDRyH8SUgO+624iTFTVRQaVcQFI0DWqCzxr9Fq6OmMnGmY0HnMFANLp9rAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-16T13:19:32.355111Z","bundle_sha256":"0599acb6baff0e306e4face3a010a45e68dd9bc74eee6e6f6d1671f8444c90ec"}}