{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CMM56JPMR7GTOZU5PCGPNNOSKD","short_pith_number":"pith:CMM56JPM","schema_version":"1.0","canonical_sha256":"1319df25ec8fcd37669d788cf6b5d250f9d688f644a2b1565d4a7fe08a9dbcd3","source":{"kind":"arxiv","id":"2507.19723","version":1},"attestation_state":"computed","paper":{"title":"Accelerating Matrix Multiplication: A Performance Comparison Between Multi-Core CPU and GPU","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"(2) Lamar University, Beaumont, Mudabir Qamar Ansari (2) ((1) The University of Toledo, Mufakir Qamar Ansari (1), OH, Toledo, TX, USA, USA)","submitted_at":"2025-07-26T00:43:12Z","abstract_excerpt":"Matrix multiplication is a foundational operation in scientific computing and machine learning, yet its computational complexity makes it a significant bottleneck for large-scale applications. The shift to parallel architectures, primarily multi-core CPUs and many-core GPUs, is the established solution, and these systems are now ubiquitous from datacenters to consumer laptops. This paper presents a direct, empirical performance analysis of matrix multiplication on a modern, consumer-grade heterogeneous platform. We implemented and benchmarked three versions of the algorithm: a baseline sequent"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2507.19723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-07-26T00:43:12Z","cross_cats_sorted":[],"title_canon_sha256":"750b51d8b50ae7d3e6e27ba2ee3b5dec63d479699ade788528802d7293aa7fb8","abstract_canon_sha256":"402f59a732c1c28212f6c1ba3aff94a1351d75d3463ccdc5fcbaa6dcb353d7de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:53.012042Z","signature_b64":"H+kERdUFL3OTISL1HhdziT5nvSsyrpLu4zIXwjQVt4aamxD2bSJrv8kFQFQ3XvP68Pfdb84xuayXxdfjBTZUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1319df25ec8fcd37669d788cf6b5d250f9d688f644a2b1565d4a7fe08a9dbcd3","last_reissued_at":"2026-07-05T11:44:53.011518Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:53.011518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Matrix Multiplication: A Performance Comparison Between Multi-Core CPU and GPU","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"(2) Lamar University, Beaumont, Mudabir Qamar Ansari (2) ((1) The University of Toledo, Mufakir Qamar Ansari (1), OH, Toledo, TX, USA, USA)","submitted_at":"2025-07-26T00:43:12Z","abstract_excerpt":"Matrix multiplication is a foundational operation in scientific computing and machine learning, yet its computational complexity makes it a significant bottleneck for large-scale applications. The shift to parallel architectures, primarily multi-core CPUs and many-core GPUs, is the established solution, and these systems are now ubiquitous from datacenters to consumer laptops. This paper presents a direct, empirical performance analysis of matrix multiplication on a modern, consumer-grade heterogeneous platform. We implemented and benchmarked three versions of the algorithm: a baseline sequent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.19723","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/2507.19723/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.19723","created_at":"2026-07-05T11:44:53.011578+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.19723v1","created_at":"2026-07-05T11:44:53.011578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19723","created_at":"2026-07-05T11:44:53.011578+00:00"},{"alias_kind":"pith_short_12","alias_value":"CMM56JPMR7GT","created_at":"2026-07-05T11:44:53.011578+00:00"},{"alias_kind":"pith_short_16","alias_value":"CMM56JPMR7GTOZU5","created_at":"2026-07-05T11:44:53.011578+00:00"},{"alias_kind":"pith_short_8","alias_value":"CMM56JPM","created_at":"2026-07-05T11:44:53.011578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01174","citing_title":"MAC Performance and Algorithmic Optimization in Matrix Multiplication Workloads","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CMM56JPMR7GTOZU5PCGPNNOSKD","json":"https://pith.science/pith/CMM56JPMR7GTOZU5PCGPNNOSKD.json","graph_json":"https://pith.science/api/pith-number/CMM56JPMR7GTOZU5PCGPNNOSKD/graph.json","events_json":"https://pith.science/api/pith-number/CMM56JPMR7GTOZU5PCGPNNOSKD/events.json","paper":"https://pith.science/paper/CMM56JPM"},"agent_actions":{"view_html":"https://pith.science/pith/CMM56JPMR7GTOZU5PCGPNNOSKD","download_json":"https://pith.science/pith/CMM56JPMR7GTOZU5PCGPNNOSKD.json","view_paper":"https://pith.science/paper/CMM56JPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.19723&json=true","fetch_graph":"https://pith.science/api/pith-number/CMM56JPMR7GTOZU5PCGPNNOSKD/graph.json","fetch_events":"https://pith.science/api/pith-number/CMM56JPMR7GTOZU5PCGPNNOSKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CMM56JPMR7GTOZU5PCGPNNOSKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CMM56JPMR7GTOZU5PCGPNNOSKD/action/storage_attestation","attest_author":"https://pith.science/pith/CMM56JPMR7GTOZU5PCGPNNOSKD/action/author_attestation","sign_citation":"https://pith.science/pith/CMM56JPMR7GTOZU5PCGPNNOSKD/action/citation_signature","submit_replication":"https://pith.science/pith/CMM56JPMR7GTOZU5PCGPNNOSKD/action/replication_record"}},"created_at":"2026-07-05T11:44:53.011578+00:00","updated_at":"2026-07-05T11:44:53.011578+00:00"}