{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TNKEVX24PQEIQTSVYC3NDCWEIE","short_pith_number":"pith:TNKEVX24","schema_version":"1.0","canonical_sha256":"9b544adf5c7c08884e55c0b6d18ac44107d4fbdf3ae008483d56cb9ea83893c5","source":{"kind":"arxiv","id":"2503.13580","version":2},"attestation_state":"computed","paper":{"title":"LLM Test Generation via Iterative Hybrid Program Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Ali Mesbah, Noor Nashid, Sijia Gu","submitted_at":"2025-03-17T16:10:38Z","abstract_excerpt":"Automating unit test generation remains a significant challenge, particularly for complex methods in real-world projects. While Large Language Models (LLMs) have made strides in code generation, they struggle to achieve high branch coverage due to their limited ability to reason about intricate control flow structures. To address this limitation, we introduce Panta, a technique that emulates the iterative process human developers follow when analyzing code and constructing test cases. Panta integrates static control flow analysis and dynamic code coverage analysis to systematically guide LLMs "},"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":"2503.13580","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2025-03-17T16:10:38Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a2d34d2934b70495600e7809cbadea6d361c4563cc5340c8b35ad49dccf212d8","abstract_canon_sha256":"f50303a149a763ff84b557c62121ad95b6213e3d5b53cfaf7fdf3abb3670f1e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:01:21.301280Z","signature_b64":"FkJczSbb5OwBMwjRdJZeSIW88/hvtgkhqZYV5p+iYodC5Eacnmi080jWvPwtkPIfEBZ/Foc676RTW5fDiVYFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b544adf5c7c08884e55c0b6d18ac44107d4fbdf3ae008483d56cb9ea83893c5","last_reissued_at":"2026-07-05T12:01:21.300745Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:01:21.300745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLM Test Generation via Iterative Hybrid Program Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Ali Mesbah, Noor Nashid, Sijia Gu","submitted_at":"2025-03-17T16:10:38Z","abstract_excerpt":"Automating unit test generation remains a significant challenge, particularly for complex methods in real-world projects. While Large Language Models (LLMs) have made strides in code generation, they struggle to achieve high branch coverage due to their limited ability to reason about intricate control flow structures. To address this limitation, we introduce Panta, a technique that emulates the iterative process human developers follow when analyzing code and constructing test cases. Panta integrates static control flow analysis and dynamic code coverage analysis to systematically guide LLMs "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.13580","kind":"arxiv","version":2},"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/2503.13580/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":"2503.13580","created_at":"2026-07-05T12:01:21.300806+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.13580v2","created_at":"2026-07-05T12:01:21.300806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.13580","created_at":"2026-07-05T12:01:21.300806+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNKEVX24PQEI","created_at":"2026-07-05T12:01:21.300806+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNKEVX24PQEIQTSV","created_at":"2026-07-05T12:01:21.300806+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNKEVX24","created_at":"2026-07-05T12:01:21.300806+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.02333","citing_title":"Guiding Human Validation of LLM-Generated Code via Verifiable Literate Programming","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2605.26851","citing_title":"LLM-based Mockless Unit Test Generation for Java","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2506.02954","citing_title":"Mutation-Guided Unit Test Generation with a Large Language Model","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2604.01799","citing_title":"TestDecision: Sequential Test Suite Generation via Greedy Optimization and Reinforcement Learning","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22046","citing_title":"Call-Chain-Aware LLM-Based Test Generation for Java Projects","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TNKEVX24PQEIQTSVYC3NDCWEIE","json":"https://pith.science/pith/TNKEVX24PQEIQTSVYC3NDCWEIE.json","graph_json":"https://pith.science/api/pith-number/TNKEVX24PQEIQTSVYC3NDCWEIE/graph.json","events_json":"https://pith.science/api/pith-number/TNKEVX24PQEIQTSVYC3NDCWEIE/events.json","paper":"https://pith.science/paper/TNKEVX24"},"agent_actions":{"view_html":"https://pith.science/pith/TNKEVX24PQEIQTSVYC3NDCWEIE","download_json":"https://pith.science/pith/TNKEVX24PQEIQTSVYC3NDCWEIE.json","view_paper":"https://pith.science/paper/TNKEVX24","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.13580&json=true","fetch_graph":"https://pith.science/api/pith-number/TNKEVX24PQEIQTSVYC3NDCWEIE/graph.json","fetch_events":"https://pith.science/api/pith-number/TNKEVX24PQEIQTSVYC3NDCWEIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNKEVX24PQEIQTSVYC3NDCWEIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNKEVX24PQEIQTSVYC3NDCWEIE/action/storage_attestation","attest_author":"https://pith.science/pith/TNKEVX24PQEIQTSVYC3NDCWEIE/action/author_attestation","sign_citation":"https://pith.science/pith/TNKEVX24PQEIQTSVYC3NDCWEIE/action/citation_signature","submit_replication":"https://pith.science/pith/TNKEVX24PQEIQTSVYC3NDCWEIE/action/replication_record"}},"created_at":"2026-07-05T12:01:21.300806+00:00","updated_at":"2026-07-05T12:01:21.300806+00:00"}