{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IUFPXSSAE4TIYGHQLVI7YAP7SB","short_pith_number":"pith:IUFPXSSA","schema_version":"1.0","canonical_sha256":"450afbca4027268c18f05d51fc01ff90777eb0f37419fc7fc6f7d58a8c46378d","source":{"kind":"arxiv","id":"2404.04966","version":2},"attestation_state":"computed","paper":{"title":"Advancing Code Coverage: Incorporating Program Analysis with Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Bin Lin, Chen Yang, Jianyi Zhou, Junjie Chen, Ziqi Wang","submitted_at":"2024-04-07T14:08:28Z","abstract_excerpt":"Automatic test generation plays a critical role in software quality assurance. While the recent advances in Search-Based Software Testing (SBST) and Large Language Models (LLMs) have shown promise in generating useful tests, these techniques still struggle to cover certain branches. Reaching these hard-to-cover branches usually requires constructing complex objects and resolving intricate inter-procedural dependencies in branch conditions, which poses significant challenges for existing test generation techniques. In this work, we propose TELPA, a novel technique aimed at addressing these chal"},"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":"2404.04966","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2024-04-07T14:08:28Z","cross_cats_sorted":[],"title_canon_sha256":"1b5e302b556208b0eb8755dcf19e71de4aefe33e45b490aceac9dc424aabcc86","abstract_canon_sha256":"e141bb1109b9c4628d701229975f5431bf34ecc7ebfeafbfc28223ebfe0a8353"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:08.925383Z","signature_b64":"LrvIOJm991Ra0rv7cexZxVad6UDhKvGgmixwwJqUBeAUtuiGSe0joFfgFRdyUOaI69eKVww+n2aii+6QWMcbBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"450afbca4027268c18f05d51fc01ff90777eb0f37419fc7fc6f7d58a8c46378d","last_reissued_at":"2026-07-05T11:37:08.924884Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:08.924884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Advancing Code Coverage: Incorporating Program Analysis with Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Bin Lin, Chen Yang, Jianyi Zhou, Junjie Chen, Ziqi Wang","submitted_at":"2024-04-07T14:08:28Z","abstract_excerpt":"Automatic test generation plays a critical role in software quality assurance. While the recent advances in Search-Based Software Testing (SBST) and Large Language Models (LLMs) have shown promise in generating useful tests, these techniques still struggle to cover certain branches. Reaching these hard-to-cover branches usually requires constructing complex objects and resolving intricate inter-procedural dependencies in branch conditions, which poses significant challenges for existing test generation techniques. In this work, we propose TELPA, a novel technique aimed at addressing these chal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.04966","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/2404.04966/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":"2404.04966","created_at":"2026-07-05T11:37:08.924940+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.04966v2","created_at":"2026-07-05T11:37:08.924940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.04966","created_at":"2026-07-05T11:37:08.924940+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUFPXSSAE4TI","created_at":"2026-07-05T11:37:08.924940+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUFPXSSAE4TIYGHQ","created_at":"2026-07-05T11:37:08.924940+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUFPXSSA","created_at":"2026-07-05T11:37:08.924940+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00511","citing_title":"Large Language Models for Multi-Lingual Equivalent Mutant Detection: An Extended Empirical Study","ref_index":110,"is_internal_anchor":false},{"citing_arxiv_id":"2408.15815","citing_title":"MR-Adopt: Automatic Deduction of Input Transformation Function for Metamorphic Testing","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19265","citing_title":"MuMuTestUp: Mutation-based Multi-Agent Test Case Update","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2409.02977","citing_title":"Large Language Model-Based Agents for Software Engineering: A Survey","ref_index":158,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06125","citing_title":"Breaking, Stale, or Missing? Benchmarking Coding Agents on Project-Level Test Evolution","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21771","citing_title":"Generalizing Test Cases for Comprehensive Test Scenario Coverage","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IUFPXSSAE4TIYGHQLVI7YAP7SB","json":"https://pith.science/pith/IUFPXSSAE4TIYGHQLVI7YAP7SB.json","graph_json":"https://pith.science/api/pith-number/IUFPXSSAE4TIYGHQLVI7YAP7SB/graph.json","events_json":"https://pith.science/api/pith-number/IUFPXSSAE4TIYGHQLVI7YAP7SB/events.json","paper":"https://pith.science/paper/IUFPXSSA"},"agent_actions":{"view_html":"https://pith.science/pith/IUFPXSSAE4TIYGHQLVI7YAP7SB","download_json":"https://pith.science/pith/IUFPXSSAE4TIYGHQLVI7YAP7SB.json","view_paper":"https://pith.science/paper/IUFPXSSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.04966&json=true","fetch_graph":"https://pith.science/api/pith-number/IUFPXSSAE4TIYGHQLVI7YAP7SB/graph.json","fetch_events":"https://pith.science/api/pith-number/IUFPXSSAE4TIYGHQLVI7YAP7SB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUFPXSSAE4TIYGHQLVI7YAP7SB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUFPXSSAE4TIYGHQLVI7YAP7SB/action/storage_attestation","attest_author":"https://pith.science/pith/IUFPXSSAE4TIYGHQLVI7YAP7SB/action/author_attestation","sign_citation":"https://pith.science/pith/IUFPXSSAE4TIYGHQLVI7YAP7SB/action/citation_signature","submit_replication":"https://pith.science/pith/IUFPXSSAE4TIYGHQLVI7YAP7SB/action/replication_record"}},"created_at":"2026-07-05T11:37:08.924940+00:00","updated_at":"2026-07-05T11:37:08.924940+00:00"}