{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ABEVPRQ32CRURQYGQHF3OVHIM7","short_pith_number":"pith:ABEVPRQ3","schema_version":"1.0","canonical_sha256":"004957c61bd0a348c30681cbb754e867e5b927db07cdcb264a919971a9ce8648","source":{"kind":"arxiv","id":"2409.12369","version":1},"attestation_state":"computed","paper":{"title":"Program Slicing in the Era of Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Alvine Boaye Belle, Hadi Hemmati, Kimya Khakzad Shahandashti, Mohammad Mahdi Mohajer, Song Wang","submitted_at":"2024-09-19T00:07:56Z","abstract_excerpt":"Program slicing is a critical technique in software engineering, enabling developers to isolate relevant portions of code for tasks such as bug detection, code comprehension, and debugging. In this study, we investigate the application of large language models (LLMs) to both static and dynamic program slicing, with a focus on Java programs. We evaluate the performance of four state-of-the-art LLMs- GPT-4o, GPT-3.5 Turbo, Llama-2, and Gemma-7B leveraging advanced prompting techniques, including few-shot learning and chain-of-thought reasoning. Using a dataset of 100 Java programs derived from L"},"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":"2409.12369","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2024-09-19T00:07:56Z","cross_cats_sorted":[],"title_canon_sha256":"ef1e6507e87922a5418062b09ac959077b8c939a3dc58e2ad4d2c409b19ce3c8","abstract_canon_sha256":"9c42324dd2eed2dd629086f217d0627e8e90f4222b3beb4e05a8a5097fb535a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:08:52.833691Z","signature_b64":"DY40sRWrt4JsuBIjmTwAAm6QO7Onqh0NgH2OhyRQHpGlylNvGXCthRarrwNciTVPXfBWW0tjSdbGFxZ2yaL3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"004957c61bd0a348c30681cbb754e867e5b927db07cdcb264a919971a9ce8648","last_reissued_at":"2026-07-05T09:08:52.833255Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:08:52.833255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Program Slicing in the Era of Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Alvine Boaye Belle, Hadi Hemmati, Kimya Khakzad Shahandashti, Mohammad Mahdi Mohajer, Song Wang","submitted_at":"2024-09-19T00:07:56Z","abstract_excerpt":"Program slicing is a critical technique in software engineering, enabling developers to isolate relevant portions of code for tasks such as bug detection, code comprehension, and debugging. In this study, we investigate the application of large language models (LLMs) to both static and dynamic program slicing, with a focus on Java programs. We evaluate the performance of four state-of-the-art LLMs- GPT-4o, GPT-3.5 Turbo, Llama-2, and Gemma-7B leveraging advanced prompting techniques, including few-shot learning and chain-of-thought reasoning. Using a dataset of 100 Java programs derived from L"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.12369","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/2409.12369/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":"2409.12369","created_at":"2026-07-05T09:08:52.833325+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.12369v1","created_at":"2026-07-05T09:08:52.833325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.12369","created_at":"2026-07-05T09:08:52.833325+00:00"},{"alias_kind":"pith_short_12","alias_value":"ABEVPRQ32CRU","created_at":"2026-07-05T09:08:52.833325+00:00"},{"alias_kind":"pith_short_16","alias_value":"ABEVPRQ32CRURQYG","created_at":"2026-07-05T09:08:52.833325+00:00"},{"alias_kind":"pith_short_8","alias_value":"ABEVPRQ3","created_at":"2026-07-05T09:08:52.833325+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.18721","citing_title":"LLM as an Execution Estimator: Recovering Missing Dependency for Practical Time-travelling Debugging","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ABEVPRQ32CRURQYGQHF3OVHIM7","json":"https://pith.science/pith/ABEVPRQ32CRURQYGQHF3OVHIM7.json","graph_json":"https://pith.science/api/pith-number/ABEVPRQ32CRURQYGQHF3OVHIM7/graph.json","events_json":"https://pith.science/api/pith-number/ABEVPRQ32CRURQYGQHF3OVHIM7/events.json","paper":"https://pith.science/paper/ABEVPRQ3"},"agent_actions":{"view_html":"https://pith.science/pith/ABEVPRQ32CRURQYGQHF3OVHIM7","download_json":"https://pith.science/pith/ABEVPRQ32CRURQYGQHF3OVHIM7.json","view_paper":"https://pith.science/paper/ABEVPRQ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.12369&json=true","fetch_graph":"https://pith.science/api/pith-number/ABEVPRQ32CRURQYGQHF3OVHIM7/graph.json","fetch_events":"https://pith.science/api/pith-number/ABEVPRQ32CRURQYGQHF3OVHIM7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ABEVPRQ32CRURQYGQHF3OVHIM7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ABEVPRQ32CRURQYGQHF3OVHIM7/action/storage_attestation","attest_author":"https://pith.science/pith/ABEVPRQ32CRURQYGQHF3OVHIM7/action/author_attestation","sign_citation":"https://pith.science/pith/ABEVPRQ32CRURQYGQHF3OVHIM7/action/citation_signature","submit_replication":"https://pith.science/pith/ABEVPRQ32CRURQYGQHF3OVHIM7/action/replication_record"}},"created_at":"2026-07-05T09:08:52.833325+00:00","updated_at":"2026-07-05T09:08:52.833325+00:00"}