{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CKNHRMQPPV2XU6LKSVAGTTMAPD","short_pith_number":"pith:CKNHRMQP","schema_version":"1.0","canonical_sha256":"129a78b20f7d757a796a954069cd8078e040ee15a32f928cee23dc69404d30f9","source":{"kind":"arxiv","id":"2407.05202","version":1},"attestation_state":"computed","paper":{"title":"Harnessing the Power of LLMs: Automating Unit Test Generation for High-Performance Computing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Aftab Hussain, Lei Xu, Md Rafiqul Islam Rabin, Mohammad Amin Alipour, Rabimba Karanjai, Weidong Shi","submitted_at":"2024-07-06T22:45:55Z","abstract_excerpt":"Unit testing is crucial in software engineering for ensuring quality. However, it's not widely used in parallel and high-performance computing software, particularly scientific applications, due to their smaller, diverse user base and complex logic. These factors make unit testing challenging and expensive, as it requires specialized knowledge and existing automated tools are often ineffective.\n  To address this, we propose an automated method for generating unit tests for such software, considering their unique features like complex logic and parallel processing. Recently, large language mode"},"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":"2407.05202","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SE","submitted_at":"2024-07-06T22:45:55Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f96dfc08a44c7c281c29444784706fda092fd95c93a6aecfc5c42f924d8a28f4","abstract_canon_sha256":"cb476d1be58c6e7beaeb2a602bf5dae0f3adac4d99c7e9b37df79c0bd899ad63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:41:09.353552Z","signature_b64":"PCGEW4oNDWB5ci7M0lpVr59lmc8OCKk9Ajlsa593kck4XIY3PokvRr7TDnVaxyDisZ0pQuY+yX7lMqN55b8aCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"129a78b20f7d757a796a954069cd8078e040ee15a32f928cee23dc69404d30f9","last_reissued_at":"2026-07-05T08:41:09.353055Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:41:09.353055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Harnessing the Power of LLMs: Automating Unit Test Generation for High-Performance Computing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Aftab Hussain, Lei Xu, Md Rafiqul Islam Rabin, Mohammad Amin Alipour, Rabimba Karanjai, Weidong Shi","submitted_at":"2024-07-06T22:45:55Z","abstract_excerpt":"Unit testing is crucial in software engineering for ensuring quality. However, it's not widely used in parallel and high-performance computing software, particularly scientific applications, due to their smaller, diverse user base and complex logic. These factors make unit testing challenging and expensive, as it requires specialized knowledge and existing automated tools are often ineffective.\n  To address this, we propose an automated method for generating unit tests for such software, considering their unique features like complex logic and parallel processing. Recently, large language mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.05202","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/2407.05202/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":"2407.05202","created_at":"2026-07-05T08:41:09.353118+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.05202v1","created_at":"2026-07-05T08:41:09.353118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.05202","created_at":"2026-07-05T08:41:09.353118+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKNHRMQPPV2X","created_at":"2026-07-05T08:41:09.353118+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKNHRMQPPV2XU6LK","created_at":"2026-07-05T08:41:09.353118+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKNHRMQP","created_at":"2026-07-05T08:41:09.353118+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.02827","citing_title":"COFFE: A Code Efficiency Benchmark for Code Generation","ref_index":2024,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CKNHRMQPPV2XU6LKSVAGTTMAPD","json":"https://pith.science/pith/CKNHRMQPPV2XU6LKSVAGTTMAPD.json","graph_json":"https://pith.science/api/pith-number/CKNHRMQPPV2XU6LKSVAGTTMAPD/graph.json","events_json":"https://pith.science/api/pith-number/CKNHRMQPPV2XU6LKSVAGTTMAPD/events.json","paper":"https://pith.science/paper/CKNHRMQP"},"agent_actions":{"view_html":"https://pith.science/pith/CKNHRMQPPV2XU6LKSVAGTTMAPD","download_json":"https://pith.science/pith/CKNHRMQPPV2XU6LKSVAGTTMAPD.json","view_paper":"https://pith.science/paper/CKNHRMQP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.05202&json=true","fetch_graph":"https://pith.science/api/pith-number/CKNHRMQPPV2XU6LKSVAGTTMAPD/graph.json","fetch_events":"https://pith.science/api/pith-number/CKNHRMQPPV2XU6LKSVAGTTMAPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKNHRMQPPV2XU6LKSVAGTTMAPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKNHRMQPPV2XU6LKSVAGTTMAPD/action/storage_attestation","attest_author":"https://pith.science/pith/CKNHRMQPPV2XU6LKSVAGTTMAPD/action/author_attestation","sign_citation":"https://pith.science/pith/CKNHRMQPPV2XU6LKSVAGTTMAPD/action/citation_signature","submit_replication":"https://pith.science/pith/CKNHRMQPPV2XU6LKSVAGTTMAPD/action/replication_record"}},"created_at":"2026-07-05T08:41:09.353118+00:00","updated_at":"2026-07-05T08:41:09.353118+00:00"}