{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UU6WFNTCHRZTJBEM2AFHSMDF5A","short_pith_number":"pith:UU6WFNTC","schema_version":"1.0","canonical_sha256":"a53d62b6623c7334848cd00a793065e83f27ca880ad7472fd3455433a09dd129","source":{"kind":"arxiv","id":"2607.04582","version":1},"attestation_state":"computed","paper":{"title":"Finetuning Lightweight LLMs for Control Flow Graph Generation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Hanyu Zhang, Tomoji Kishi","submitted_at":"2026-07-06T01:19:34Z","abstract_excerpt":"Control Flow Graph (CFG) is an important program representations for software analysis, code understanding, and software maintenance. Traditional CFG generation techniques mainly rely on bytecode or abstract syntax trees. However, these approaches usually require complete, compilable, and syntax error-free code, which limits their applicability to incomplete or erroneous code. Furthermore, they often depend on language specific tools, making it difficult to support multiple programming languages in a unified manner. To address these limitations, this paper investigates the use of fine-tuned li"},"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":"2607.04582","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SE","submitted_at":"2026-07-06T01:19:34Z","cross_cats_sorted":[],"title_canon_sha256":"5a49b2dae3a7e783d0a85d5ba68b8860cbd79b745dc0cef6755ac7b9917db737","abstract_canon_sha256":"9c93f5b82ff30c8d944296035a2a88ea3059fe2072ab4dcfca302ecb1d10ffd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:19:25.779264Z","signature_b64":"fqrSvJYljGnDRAi8qtEfUz6/FppCuxnTNXlxNO9kudTrJCzF1ADX5Fnnj4Fq6EW9SswLDQyWsuIJ+A7D2mrLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a53d62b6623c7334848cd00a793065e83f27ca880ad7472fd3455433a09dd129","last_reissued_at":"2026-07-07T02:19:25.778623Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:19:25.778623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finetuning Lightweight LLMs for Control Flow Graph Generation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Hanyu Zhang, Tomoji Kishi","submitted_at":"2026-07-06T01:19:34Z","abstract_excerpt":"Control Flow Graph (CFG) is an important program representations for software analysis, code understanding, and software maintenance. Traditional CFG generation techniques mainly rely on bytecode or abstract syntax trees. However, these approaches usually require complete, compilable, and syntax error-free code, which limits their applicability to incomplete or erroneous code. Furthermore, they often depend on language specific tools, making it difficult to support multiple programming languages in a unified manner. To address these limitations, this paper investigates the use of fine-tuned li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04582","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/2607.04582/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":"2607.04582","created_at":"2026-07-07T02:19:25.778733+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.04582v1","created_at":"2026-07-07T02:19:25.778733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04582","created_at":"2026-07-07T02:19:25.778733+00:00"},{"alias_kind":"pith_short_12","alias_value":"UU6WFNTCHRZT","created_at":"2026-07-07T02:19:25.778733+00:00"},{"alias_kind":"pith_short_16","alias_value":"UU6WFNTCHRZTJBEM","created_at":"2026-07-07T02:19:25.778733+00:00"},{"alias_kind":"pith_short_8","alias_value":"UU6WFNTC","created_at":"2026-07-07T02:19:25.778733+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UU6WFNTCHRZTJBEM2AFHSMDF5A","json":"https://pith.science/pith/UU6WFNTCHRZTJBEM2AFHSMDF5A.json","graph_json":"https://pith.science/api/pith-number/UU6WFNTCHRZTJBEM2AFHSMDF5A/graph.json","events_json":"https://pith.science/api/pith-number/UU6WFNTCHRZTJBEM2AFHSMDF5A/events.json","paper":"https://pith.science/paper/UU6WFNTC"},"agent_actions":{"view_html":"https://pith.science/pith/UU6WFNTCHRZTJBEM2AFHSMDF5A","download_json":"https://pith.science/pith/UU6WFNTCHRZTJBEM2AFHSMDF5A.json","view_paper":"https://pith.science/paper/UU6WFNTC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.04582&json=true","fetch_graph":"https://pith.science/api/pith-number/UU6WFNTCHRZTJBEM2AFHSMDF5A/graph.json","fetch_events":"https://pith.science/api/pith-number/UU6WFNTCHRZTJBEM2AFHSMDF5A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UU6WFNTCHRZTJBEM2AFHSMDF5A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UU6WFNTCHRZTJBEM2AFHSMDF5A/action/storage_attestation","attest_author":"https://pith.science/pith/UU6WFNTCHRZTJBEM2AFHSMDF5A/action/author_attestation","sign_citation":"https://pith.science/pith/UU6WFNTCHRZTJBEM2AFHSMDF5A/action/citation_signature","submit_replication":"https://pith.science/pith/UU6WFNTCHRZTJBEM2AFHSMDF5A/action/replication_record"}},"created_at":"2026-07-07T02:19:25.778733+00:00","updated_at":"2026-07-07T02:19:25.778733+00:00"}