{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GO2CUACFPDJZYBBOH5UAAEPR77","short_pith_number":"pith:GO2CUACF","schema_version":"1.0","canonical_sha256":"33b42a004578d39c042e3f680011f1ffe5d53037e56fbf2e9ab06f396b086a76","source":{"kind":"arxiv","id":"2505.03988","version":1},"attestation_state":"computed","paper":{"title":"Can Large Language Models Predict Parallel Code Performance?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.PF"],"primary_cat":"cs.DC","authors_text":"Gal Oren, Giorgis Georgakoudis, Gregory Bolet, Harshitha Menon, Hayden Estes, Kirk W. Cameron, Konstantinos Parasyris, Niranjan Hasabnis","submitted_at":"2025-05-06T21:41:20Z","abstract_excerpt":"Accurate determination of the performance of parallel GPU code typically requires execution-time profiling on target hardware -- an increasingly prohibitive step due to limited access to high-end GPUs. This paper explores whether Large Language Models (LLMs) can offer an alternative approach for GPU performance prediction without relying on hardware. We frame the problem as a roofline classification task: given the source code of a GPU kernel and the hardware specifications of a target GPU, can an LLM predict whether the GPU kernel is compute-bound or bandwidth-bound?\n  For this study, we buil"},"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":"2505.03988","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-06T21:41:20Z","cross_cats_sorted":["cs.AI","cs.PF"],"title_canon_sha256":"7fe93a1921e13756b9a272dfcc714cb1e0d38a4371a7322e9412042a2c0b99fc","abstract_canon_sha256":"a2c28231cc44cc89f66362bc106dfece42a50bed4a22aa772c8f928536f7b92d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:34.692645Z","signature_b64":"D3+HA5UkON+/NxyAkjjuRfDhXxx8+lPqHt1cuIJzDkZF+6NGx4xMdJHFaNs04Qnnc9NUL+HK5qBCMM3SyBf2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33b42a004578d39c042e3f680011f1ffe5d53037e56fbf2e9ab06f396b086a76","last_reissued_at":"2026-07-05T10:59:34.692133Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:34.692133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can Large Language Models Predict Parallel Code Performance?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.PF"],"primary_cat":"cs.DC","authors_text":"Gal Oren, Giorgis Georgakoudis, Gregory Bolet, Harshitha Menon, Hayden Estes, Kirk W. Cameron, Konstantinos Parasyris, Niranjan Hasabnis","submitted_at":"2025-05-06T21:41:20Z","abstract_excerpt":"Accurate determination of the performance of parallel GPU code typically requires execution-time profiling on target hardware -- an increasingly prohibitive step due to limited access to high-end GPUs. This paper explores whether Large Language Models (LLMs) can offer an alternative approach for GPU performance prediction without relying on hardware. We frame the problem as a roofline classification task: given the source code of a GPU kernel and the hardware specifications of a target GPU, can an LLM predict whether the GPU kernel is compute-bound or bandwidth-bound?\n  For this study, we buil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.03988","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/2505.03988/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":"2505.03988","created_at":"2026-07-05T10:59:34.692195+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.03988v1","created_at":"2026-07-05T10:59:34.692195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.03988","created_at":"2026-07-05T10:59:34.692195+00:00"},{"alias_kind":"pith_short_12","alias_value":"GO2CUACFPDJZ","created_at":"2026-07-05T10:59:34.692195+00:00"},{"alias_kind":"pith_short_16","alias_value":"GO2CUACFPDJZYBBO","created_at":"2026-07-05T10:59:34.692195+00:00"},{"alias_kind":"pith_short_8","alias_value":"GO2CUACF","created_at":"2026-07-05T10:59:34.692195+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26383","citing_title":"SOLAR: AI-Powered Speed-of-Light Performance Analysis","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GO2CUACFPDJZYBBOH5UAAEPR77","json":"https://pith.science/pith/GO2CUACFPDJZYBBOH5UAAEPR77.json","graph_json":"https://pith.science/api/pith-number/GO2CUACFPDJZYBBOH5UAAEPR77/graph.json","events_json":"https://pith.science/api/pith-number/GO2CUACFPDJZYBBOH5UAAEPR77/events.json","paper":"https://pith.science/paper/GO2CUACF"},"agent_actions":{"view_html":"https://pith.science/pith/GO2CUACFPDJZYBBOH5UAAEPR77","download_json":"https://pith.science/pith/GO2CUACFPDJZYBBOH5UAAEPR77.json","view_paper":"https://pith.science/paper/GO2CUACF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.03988&json=true","fetch_graph":"https://pith.science/api/pith-number/GO2CUACFPDJZYBBOH5UAAEPR77/graph.json","fetch_events":"https://pith.science/api/pith-number/GO2CUACFPDJZYBBOH5UAAEPR77/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GO2CUACFPDJZYBBOH5UAAEPR77/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GO2CUACFPDJZYBBOH5UAAEPR77/action/storage_attestation","attest_author":"https://pith.science/pith/GO2CUACFPDJZYBBOH5UAAEPR77/action/author_attestation","sign_citation":"https://pith.science/pith/GO2CUACFPDJZYBBOH5UAAEPR77/action/citation_signature","submit_replication":"https://pith.science/pith/GO2CUACFPDJZYBBOH5UAAEPR77/action/replication_record"}},"created_at":"2026-07-05T10:59:34.692195+00:00","updated_at":"2026-07-05T10:59:34.692195+00:00"}