{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:V3ORUWOBVCAV46IDQLG6BAK5JF","short_pith_number":"pith:V3ORUWOB","schema_version":"1.0","canonical_sha256":"aedd1a59c1a8815e790382cde0815d495ecba05855eaf4af7cc23e72ffe053f5","source":{"kind":"arxiv","id":"2506.10322","version":1},"attestation_state":"computed","paper":{"title":"Minimizing False Positives in Static Bug Detection via LLM-Enhanced Path Feasibility Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Chong Wang, Kai Yu, Lingming Zhang, Wentai Deng, Xin Peng, Xueying Du, Yiling Lou, Yi Zou, Zuoyu Ou","submitted_at":"2025-06-12T03:11:38Z","abstract_excerpt":"Static bug analyzers play a crucial role in ensuring software quality. However, existing analyzers for bug detection in large codebases often suffer from high false positive rates. This is primarily due to the limited capabilities of analyzers in path feasibility validation with multiple conditional branches and complex data dependencies. While current LLM-based approaches attempt to address this issue, their effectiveness remains limited due to insufficient constraint cascade analysis and scalability challenges in large projects. To address this challenge, we propose an iterative path feasibi"},"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":"2506.10322","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2025-06-12T03:11:38Z","cross_cats_sorted":[],"title_canon_sha256":"7343917022fb120a5f934d4f532d233dee7ab7f2ee394743d9227d9e9005c611","abstract_canon_sha256":"034ed54d97be6d46fd4feeea622e80fd776ea99f4ea729758ce40ae2d01f7c70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:21.459649Z","signature_b64":"sLO5GpLczcPei+Qy884HgedV8TtVQilP7KQbR80MkxamVeY8BRXXhNNsOhpi5c9018daEjbz6xFBZ4m7SmXSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aedd1a59c1a8815e790382cde0815d495ecba05855eaf4af7cc23e72ffe053f5","last_reissued_at":"2026-07-05T11:20:21.459138Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:21.459138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing False Positives in Static Bug Detection via LLM-Enhanced Path Feasibility Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Chong Wang, Kai Yu, Lingming Zhang, Wentai Deng, Xin Peng, Xueying Du, Yiling Lou, Yi Zou, Zuoyu Ou","submitted_at":"2025-06-12T03:11:38Z","abstract_excerpt":"Static bug analyzers play a crucial role in ensuring software quality. However, existing analyzers for bug detection in large codebases often suffer from high false positive rates. This is primarily due to the limited capabilities of analyzers in path feasibility validation with multiple conditional branches and complex data dependencies. While current LLM-based approaches attempt to address this issue, their effectiveness remains limited due to insufficient constraint cascade analysis and scalability challenges in large projects. To address this challenge, we propose an iterative path feasibi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.10322","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/2506.10322/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":"2506.10322","created_at":"2026-07-05T11:20:21.459197+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.10322v1","created_at":"2026-07-05T11:20:21.459197+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.10322","created_at":"2026-07-05T11:20:21.459197+00:00"},{"alias_kind":"pith_short_12","alias_value":"V3ORUWOBVCAV","created_at":"2026-07-05T11:20:21.459197+00:00"},{"alias_kind":"pith_short_16","alias_value":"V3ORUWOBVCAV46ID","created_at":"2026-07-05T11:20:21.459197+00:00"},{"alias_kind":"pith_short_8","alias_value":"V3ORUWOB","created_at":"2026-07-05T11:20:21.459197+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12875","citing_title":"Do Skill Descriptions Tell the Truth? Detecting Undisclosed Security Behaviors in Code-Backed LLM Skills","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V3ORUWOBVCAV46IDQLG6BAK5JF","json":"https://pith.science/pith/V3ORUWOBVCAV46IDQLG6BAK5JF.json","graph_json":"https://pith.science/api/pith-number/V3ORUWOBVCAV46IDQLG6BAK5JF/graph.json","events_json":"https://pith.science/api/pith-number/V3ORUWOBVCAV46IDQLG6BAK5JF/events.json","paper":"https://pith.science/paper/V3ORUWOB"},"agent_actions":{"view_html":"https://pith.science/pith/V3ORUWOBVCAV46IDQLG6BAK5JF","download_json":"https://pith.science/pith/V3ORUWOBVCAV46IDQLG6BAK5JF.json","view_paper":"https://pith.science/paper/V3ORUWOB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.10322&json=true","fetch_graph":"https://pith.science/api/pith-number/V3ORUWOBVCAV46IDQLG6BAK5JF/graph.json","fetch_events":"https://pith.science/api/pith-number/V3ORUWOBVCAV46IDQLG6BAK5JF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V3ORUWOBVCAV46IDQLG6BAK5JF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V3ORUWOBVCAV46IDQLG6BAK5JF/action/storage_attestation","attest_author":"https://pith.science/pith/V3ORUWOBVCAV46IDQLG6BAK5JF/action/author_attestation","sign_citation":"https://pith.science/pith/V3ORUWOBVCAV46IDQLG6BAK5JF/action/citation_signature","submit_replication":"https://pith.science/pith/V3ORUWOBVCAV46IDQLG6BAK5JF/action/replication_record"}},"created_at":"2026-07-05T11:20:21.459197+00:00","updated_at":"2026-07-05T11:20:21.459197+00:00"}