{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:R5MLYV5CUOUF7LMGEA6MRDOJEH","short_pith_number":"pith:R5MLYV5C","schema_version":"1.0","canonical_sha256":"8f58bc57a2a3a85fad86203cc88dc921f4ff57f90ee43731043340edbe2e3ce0","source":{"kind":"arxiv","id":"2501.12339","version":2},"attestation_state":"computed","paper":{"title":"Treefix: Enabling Execution with a Tree of Prefixes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Beatriz Souza, Michael Pradel","submitted_at":"2025-01-21T18:13:43Z","abstract_excerpt":"The ability to execute code is a prerequisite for various dynamic program analyses. Learning-guided execution has been proposed as an approach to enable the execution of arbitrary code snippets by letting a neural model predict likely values for any missing variables. Although state-of-the-art learning-guided execution approaches, such as LExecutor, can enable the execution of a relative high amount of code, they are limited to predicting a restricted set of possible values and do not use any feedback from previous executions to execute even more code. This paper presents Treefix, a novel lear"},"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":"2501.12339","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2025-01-21T18:13:43Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c25f280e514a560f31994f46623bf0b2561f483b8ded01dcc0c2a77f5f4a38d8","abstract_canon_sha256":"049b5ab119e8a0ed2c0f19f4720e3b2174b63c47eb07363f3d2ffc5548f33de1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:04:23.052588Z","signature_b64":"sbaSBAy8kx6xUGc+KpT8X15kMOdQStajin32K54wC3sFBaJOtedTItKdrQFlrPbg2AkkqLAhufzrRLWkPyctAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f58bc57a2a3a85fad86203cc88dc921f4ff57f90ee43731043340edbe2e3ce0","last_reissued_at":"2026-07-05T10:04:23.052104Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:04:23.052104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Treefix: Enabling Execution with a Tree of Prefixes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Beatriz Souza, Michael Pradel","submitted_at":"2025-01-21T18:13:43Z","abstract_excerpt":"The ability to execute code is a prerequisite for various dynamic program analyses. Learning-guided execution has been proposed as an approach to enable the execution of arbitrary code snippets by letting a neural model predict likely values for any missing variables. Although state-of-the-art learning-guided execution approaches, such as LExecutor, can enable the execution of a relative high amount of code, they are limited to predicting a restricted set of possible values and do not use any feedback from previous executions to execute even more code. This paper presents Treefix, a novel lear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.12339","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/2501.12339/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":"2501.12339","created_at":"2026-07-05T10:04:23.052155+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.12339v2","created_at":"2026-07-05T10:04:23.052155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12339","created_at":"2026-07-05T10:04:23.052155+00:00"},{"alias_kind":"pith_short_12","alias_value":"R5MLYV5CUOUF","created_at":"2026-07-05T10:04:23.052155+00:00"},{"alias_kind":"pith_short_16","alias_value":"R5MLYV5CUOUF7LMG","created_at":"2026-07-05T10:04:23.052155+00:00"},{"alias_kind":"pith_short_8","alias_value":"R5MLYV5C","created_at":"2026-07-05T10:04:23.052155+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22247","citing_title":"Natural Language-Focused Software Engineering via Code-Documentation Equivalence","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15815","citing_title":"BootstrapAgent: Distilling Repository Setup into Reusable Agent Knowledge","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R5MLYV5CUOUF7LMGEA6MRDOJEH","json":"https://pith.science/pith/R5MLYV5CUOUF7LMGEA6MRDOJEH.json","graph_json":"https://pith.science/api/pith-number/R5MLYV5CUOUF7LMGEA6MRDOJEH/graph.json","events_json":"https://pith.science/api/pith-number/R5MLYV5CUOUF7LMGEA6MRDOJEH/events.json","paper":"https://pith.science/paper/R5MLYV5C"},"agent_actions":{"view_html":"https://pith.science/pith/R5MLYV5CUOUF7LMGEA6MRDOJEH","download_json":"https://pith.science/pith/R5MLYV5CUOUF7LMGEA6MRDOJEH.json","view_paper":"https://pith.science/paper/R5MLYV5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.12339&json=true","fetch_graph":"https://pith.science/api/pith-number/R5MLYV5CUOUF7LMGEA6MRDOJEH/graph.json","fetch_events":"https://pith.science/api/pith-number/R5MLYV5CUOUF7LMGEA6MRDOJEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R5MLYV5CUOUF7LMGEA6MRDOJEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R5MLYV5CUOUF7LMGEA6MRDOJEH/action/storage_attestation","attest_author":"https://pith.science/pith/R5MLYV5CUOUF7LMGEA6MRDOJEH/action/author_attestation","sign_citation":"https://pith.science/pith/R5MLYV5CUOUF7LMGEA6MRDOJEH/action/citation_signature","submit_replication":"https://pith.science/pith/R5MLYV5CUOUF7LMGEA6MRDOJEH/action/replication_record"}},"created_at":"2026-07-05T10:04:23.052155+00:00","updated_at":"2026-07-05T10:04:23.052155+00:00"}