{"as_of":"2026-08-12T17:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:78665f1f8f5bc80e26eabf8ef6f0ada43f993368c64f4d1ab6a367805888830f","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T17:19:34.956523Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T11:24:30.932755Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"cited_work":{"arxiv_id":"2501.12339","doi":"10.48550/arxiv.2501.12339","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.12339","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Treefix: Enabling execution with a tree of prefixes","venue":"ArXiv.org","work_id":"8fe7caf2-225f-4b41-91e2-0aaac5b261ef","year":2025},"citing_paper":{"arxiv_id":"2605.15815","last_updated":"2026-05-15T10:09:59Z","snapshot_observed_at":"2026-08-01T21:40:05.316602Z","submitted_at":"2026-05-15T10:09:59Z","title":"BootstrapAgent: Distilling Repository Setup into Reusable Agent Knowledge","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-20T17:04:07.449733Z"},"links":{"cited_paper":"/paper/2501.12339","citing_paper":"/paper/2605.15815"},"observation_digest":"sha256:adb7b40375c844c392aa0f899d04b7b75cc05c6c7059eb5b0de594e76fba3d07","observation_id":"0ec50dbe-a7a5-4689-b533-ed82833a6b7a","resolution":{"observed_at":"2026-05-20T17:08:41.984190Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"cited_work":{"arxiv_id":"2501.12339","doi":"10.48550/arxiv.2501.12339","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.12339","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Treefix: Enabling execution with a tree of prefixes","venue":"ArXiv.org","work_id":"8fe7caf2-225f-4b41-91e2-0aaac5b261ef","year":2025},"citing_paper":{"arxiv_id":"2606.22247","last_updated":"2026-06-20T22:19:00Z","snapshot_observed_at":"2026-08-12T12:33:54.979427Z","submitted_at":"2026-06-20T22:19:00Z","title":"Natural Language-Focused Software Engineering via Code-Documentation Equivalence","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-26T11:24:30.932755Z"},"links":{"cited_paper":"/paper/2501.12339","citing_paper":"/paper/2606.22247"},"observation_digest":"sha256:2ee10958ab5bf2f5ff97838175d1563ead548fd319306c3a18f1deb9e8a90a46","observation_id":"8c3ac2d5-ff79-4cb5-97e9-011f08b8d246","resolution":{"observed_at":"2026-06-26T11:29:24.163234Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.12339/citation-record","integrity":"/paper/2501.12339/integrity","json":"/paper/2501.12339/citation-record.json","paper":"/paper/2501.12339"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.405170Z","title":"Selfpico: Self- guided partial code execution with llms,","venue":null,"work_id":"24b6d0e7-afda-4e4a-836d-4f6791f59ba0","year":2024},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.777670Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:e248b544dcc2057045b900654b367e544f83809e509c890a1b94d93ad040097d","observation_id":"1a78be82-70fb-43fa-8808-1cb90eb98a53","resolution":{"observed_at":"2026-08-10T17:19:36.409502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.392779Z","title":"Feedback-directed partial exe- cution,","venue":null,"work_id":"a7a0e81f-a47d-4e8f-817c-7048dd8eb7dc","year":2024},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.782480Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:fe96fbe27787f86d1cb7fcdaa05077a880957eb59aba2171eadad2e69af4e453","observation_id":"198602c6-ab9f-4a9c-80d2-953a58af45e5","resolution":{"observed_at":"2026-08-10T17:19:36.397583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16092","last_updated":"2025-02-22T07:07:32Z","snapshot_observed_at":"2026-07-06T19:37:07.379149Z","submitted_at":"2024-10-21T15:13:32Z","title":"ChangeGuard: Validating Code Changes via Pairwise Learning-Guided Execution","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16092","snapshot_observed_at":"2026-08-10T17:19:34.786921Z","title":"Changeguard: Validating code changes via pairwise learning-guided execution,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.786921Z"},"links":{"cited_paper":"/paper/2410.16092","citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:9e741637cdd118209ba9510ae55f9f5f49f490a1330ce3789a496c4ab5021a1c","observation_id":"6b4db454-890b-4129-8cde-de4c1dde48c4","resolution":{"observed_at":"2026-08-10T17:19:34.786921Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-08T11:58:24.516369Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-10T17:19:34.791512Z","title":"Evaluating large language models trained on code,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.791512Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:f44fd520610669e1ba05f73ddb28ebd22865c3969566207310148a101b36d889","observation_id":"70837a68-888f-4100-a65a-bdffcc6d7f12","resolution":{"observed_at":"2026-08-10T17:19:34.791512Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.381143Z","title":"Is your code generated by chatgpt really correct? rigorous evaluation of large language models for code generation,","venue":null,"work_id":"8f785de7-c2fb-4009-8596-fbb7eec2aeb8","year":2023},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.796072Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:ee01273de5967b4ef9c636e6c11dbcd75ce9f1b5f66bad3cff49be1215a8033a","observation_id":"3c1154cb-1508-499a-a47a-40276a600789","resolution":{"observed_at":"2026-08-10T17:19:36.385411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18584","last_updated":"2024-04-28T17:45:56Z","snapshot_observed_at":"2026-08-12T06:39:37.194032Z","submitted_at":"2023-05-29T19:57:36Z","title":"Coeditor: Leveraging Contextual Changes for Multi-round Code Auto-editing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.18584","snapshot_observed_at":"2026-08-10T17:19:34.804425Z","title":"Coeditor: Leveraging contex- tual changes for multi-round code auto-editing,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.804425Z"},"links":{"cited_paper":"/paper/2305.18584","citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:9c14b56f2b944bc81b85ad582754c19bddd938948adb724d8d9c17e7c9621844","observation_id":"31c41de7-435c-479a-a249-d04060b13eab","resolution":{"observed_at":"2026-08-10T17:19:34.804425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:34.808976Z","title":"Grace: Language models meet code edits,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.808976Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:35357521c63c7b49b1b9c9ec3f3e59d69ef031ce67382755bcc3af4daaa20232","observation_id":"c58ae571-b239-4eff-84a0-0c21d09b4f54","resolution":{"observed_at":"2026-08-10T17:19:34.808976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:34.812755Z","title":"Unprecedented code change automation: The fusion of llms and transformation by example,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.812755Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:68f5d50e6846801cac390e541e033777b52b064dd3d5cfcf3d09c5c6fc443ec9","observation_id":"45e44cf5-7bd4-49f8-ae6f-8b6d8329d792","resolution":{"observed_at":"2026-08-10T17:19:34.812755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:34.816657Z","title":"Type4py: practical deep similarity learning-based type inference for python,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.816657Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:29a7cd9b3054ea4d9a2d7a6366983a4d3173a953a85ea15d6d5a155e2e41817a","observation_id":"f15b5426-9502-4f0e-9455-0519955706da","resolution":{"observed_at":"2026-08-10T17:19:34.816657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-59762-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:03:20.376878Z","title":"Automated unit test generation for python,","venue":"Lecture notes in computer science","work_id":"2564fb66-bfc7-4fd8-bacd-9cd276c07bf5","year":2020},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.821078Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:b1c776d8cc3cd440d53c0f6490f75f4d20bfcbd2312fc26bf34beee75b0f5951","observation_id":"d62888cf-1225-40ac-9c04-e8fb9ca46f94","resolution":{"observed_at":"2026-08-10T17:19:35.022882Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.357771Z","title":"American fuzzy lop (afl),","venue":null,"work_id":"7a1265e5-3106-4fec-95c2-ae80e4f6e86f","year":2013},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.824939Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:7f385074b2b3d6a2f47781f86695b3be80ae35926129b536cbdf0f1463552ada","observation_id":"4019c7ca-4f72-4acd-99cd-e4d5bbd32238","resolution":{"observed_at":"2026-08-10T17:19:36.361232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:34.828871Z","title":"Coverage-based greybox fuzzing as markov chain,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.828871Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:bea6398c402d218c39e7cacd4193b2ed03a5c3716ad245ce5ad700b3230d7fec","observation_id":"ff43bc89-76a5-4a42-a9ae-02076f2ae1a7","resolution":{"observed_at":"2026-08-10T17:19:34.828871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:34.832986Z","title":"Fuzz4all: Universal fuzzing with large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.832986Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:b0ef095ad030df0f4e1ef929a443ac18cb1644d2cd925d640c7d21f06e4589ed","observation_id":"9c157d56-4531-4efc-9a89-7bb12b1d64b8","resolution":{"observed_at":"2026-08-10T17:19:34.832986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:34.836056Z","title":"Codamosa: Escaping coverage plateaus in test generation with pre-trained large language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.836056Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:fe0445780d75197d93b3bc10dca067cc0fa85014dc535320fb2705eadca81919","observation_id":"04c8a931-a98c-4506-b301-05da378ca30c","resolution":{"observed_at":"2026-08-10T17:19:34.836056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.346251Z","title":"Coverup: Coverage-guided llm-based test generation,","venue":null,"work_id":"52390ed5-2377-4deb-bf60-8c9f95b5b7fe","year":2024},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.839279Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:1502b4210c780fee6f14853120d8d111a54ef763a447b382f0f0aa3ee59a846e","observation_id":"4acb2846-fc60-4c6f-b92e-80c372fd7dce","resolution":{"observed_at":"2026-08-10T17:19:36.349908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.334508Z","title":"Micro execution,","venue":null,"work_id":"170b113e-8b26-4285-9ff1-936603afc111","year":2014},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.843213Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:01cbd53a34165d747bdef3b5a84dea353cc16959f4ef2cff34cd65d0a2b112bf","observation_id":"159aeebe-2d31-4dfd-860b-5fa141973b03","resolution":{"observed_at":"2026-08-10T17:19:36.338504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.322654Z","title":"Under-constrained symbolic execution: Correctness checking for real code,","venue":null,"work_id":"36f99609-3b34-4e6f-8190-8a2313f1255d","year":2015},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.846751Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:55f9e75a484b16ac902f0e904a2b77e5c48dcd91e24c1b6d4874c55ce03169e5","observation_id":"02df2a0f-1847-4253-a645-2cf992a1a7dd","resolution":{"observed_at":"2026-08-10T17:19:36.326904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:34.850461Z","title":"J-force: Forced execution on javascript,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.850461Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:cf75d75c30837a035f3ed70ce810d8611c37b6737aee09d938ef4bbd2dbd27a0","observation_id":"617b2738-fc65-41c1-97db-561802547a43","resolution":{"observed_at":"2026-08-10T17:19:34.850461Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.310113Z","title":"KLEE: Unassisted and automatic generation of high-coverage tests for complex systems pro- grams,","venue":null,"work_id":"a60233d1-e06d-4d62-b285-32d56bec1b4b","year":2008},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.854195Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:765787dca1ad16d75c5b5ace4b9fa32e5509d9ae73b2507ebb4fafada704fb8f","observation_id":"5dda358e-8b11-4923-a36c-06d07dcf2b70","resolution":{"observed_at":"2026-08-10T17:19:36.314606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.296672Z","title":"DART: directed automated random testing,","venue":null,"work_id":"006a9b3c-0f2f-4b02-ae48-966974233ba3","year":2005},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.858795Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:90702029a4fae315335716debc76b474de5e2b8b62ba163369b5f10134f99cc8","observation_id":"b9ffce1e-bfcf-48e6-957d-e6c29004896b","resolution":{"observed_at":"2026-08-10T17:19:36.301266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.282895Z","title":"CUTE: a concolic unit testing engine for C,","venue":null,"work_id":"745b9a65-029f-4592-8af8-8df6d777b9ab","year":2005},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.862942Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:55f230358dc94637e447358e57140bb361caec64ee7b6fc853437a68ffd71b49","observation_id":"57b16de2-55f3-4790-8a54-48a4fce1b8c9","resolution":{"observed_at":"2026-08-10T17:19:36.287363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.269905Z","title":"Evosuite: automatic test suite generation for object-oriented software,","venue":null,"work_id":"cd68e77b-1474-42e5-84da-2f0a7e196f3e","year":2011},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.866620Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:46b7dc2a8b7566afad484dea57fb9f610a0843809715c002cfa820775db2cb14","observation_id":"671db19e-dce0-43e6-9e19-4a2f36cef2b2","resolution":{"observed_at":"2026-08-10T17:19:36.274486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.257982Z","title":"Codamosa: Escaping coverage plateaus in test generation with pre-trained large language models,","venue":null,"work_id":"e58c8fd0-be90-4c02-be78-57a2bb6d5ae1","year":2023},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.870762Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:4cba1116ebaa5ea235e3b1e982b018e8636073075de4ced42fac574fe95df0a6","observation_id":"a1a75de4-5800-40b2-9216-22fefc633026","resolution":{"observed_at":"2026-08-10T17:19:36.261635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.245979Z","title":"Coverup: Coverage-guided llm-based test generation,","venue":null,"work_id":"c7e7fa0a-5592-488a-a485-92088b398c8e","year":2024},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.874701Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:3ce1de705eae63040538cd3c16f6bcb6a1e1bfe2c1d6ead973de3709025b4b25","observation_id":"b8dccaf0-695b-4cf1-8fbd-93806e0927ef","resolution":{"observed_at":"2026-08-10T17:19:36.250157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:34.878542Z","title":"Large language models are zero-shot fuzzers: Fuzzing deep-learning libraries via large language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.878542Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:1a9c07bb0c38ff94dce1f58652e38955fbe33a292cb4871080783a81d8117ded","observation_id":"3a93c220-4273-48de-b1e5-531796c91be7","resolution":{"observed_at":"2026-08-10T17:19:34.878542Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.13246","last_updated":"2023-01-30T19:22:36Z","snapshot_observed_at":"2026-07-06T14:46:19.313091Z","submitted_at":"2023-01-30T19:22:36Z","title":"Conversational Automated Program Repair","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.13246","snapshot_observed_at":"2026-08-10T17:19:34.882424Z","title":"Conversational automated program repair,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.882424Z"},"links":{"cited_paper":"/paper/2301.13246","citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:247ea3910bd2dfba8701de2b18db8d5ac3649519e34494dcfb700aa384c0fac4","observation_id":"c752c069-ffe8-4638-b080-d7549c2c3718","resolution":{"observed_at":"2026-08-10T17:19:34.882424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:34.886523Z","title":"Less training, more repairing please: revisiting automated program repair via zero-shot learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.886523Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:90d65fba102dbc9bc8b2efa02d13c5a2ae81e17a4adc4227fcb945c82187434b","observation_id":"e0cd250b-be13-4298-bee0-726bdc83d9b1","resolution":{"observed_at":"2026-08-10T17:19:34.886523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.234431Z","title":"RepairAgent: An autonomous, LLM-based agent for program repair,","venue":null,"work_id":"e91facdc-71c0-4323-a76b-e0d91251dade","year":2024},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.890165Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:fb81c2aef3fb13e866f417b0c6a57d14d1ed2d471d38b251277023e186a8e483","observation_id":"df62fa53-0ba4-4375-b490-4ad1c7d85b7e","resolution":{"observed_at":"2026-08-10T17:19:36.238594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:34.894074Z","title":"Neural software analysis,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.894074Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:c4475c02f42b9beae0c93bbf59ef9141b5833ecde61e132141330adbb3627d10","observation_id":"672a5460-6bd6-4c20-9e86-d1d89be1657e","resolution":{"observed_at":"2026-08-10T17:19:34.894074Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:34.897898Z","title":"Deep learning type inference,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.897898Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:9c6f4378c7e43705474bb4da0a9ddf41092edbda04aece69fd904b19a435c13c","observation_id":"6a7f2cce-3f38-4349-9f48-4617a3ef4e53","resolution":{"observed_at":"2026-08-10T17:19:34.897898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:34.901941Z","title":"NL2Type: Inferring JavaScript function types from natural language information,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.901941Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:cc15acbedc161696fef5619df9cee851e77311e3d4d1e783161b52557b010931","observation_id":"abb34c94-a8da-457e-827b-37e5d457b212","resolution":{"observed_at":"2026-08-10T17:19:34.901941Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:34.905878Z","title":"Typewriter: Neural type prediction with search-based validation,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.905878Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:801bab95cb52a94d0ebedd58deaea8c8df831902a907b26c73417036e75bc71e","observation_id":"76ff97f2-804b-4840-8713-7bfabf16ed48","resolution":{"observed_at":"2026-08-10T17:19:34.905878Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:34.909756Z","title":"Typilus: neural type hints,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.909756Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:49f6cdaae996c9189a7b23e5aec6445d4a4d1d895070e082f16e07d167509043","observation_id":"3d52c425-7d98-4f39-85b6-3401ad9be7d0","resolution":{"observed_at":"2026-08-10T17:19:34.909756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:34.913869Z","title":"An empirical evaluation of using large language models for automated unit test generation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.913869Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:4e89a8748038f1e7879ac93002f2eb67f5bcd83f9f36f19ed98fa2269268c45e","observation_id":"aabcf219-5d99-4979-a219-1b66e6aa97c0","resolution":{"observed_at":"2026-08-10T17:19:34.913869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:34.917672Z","title":"Code-aware prompting: A study of coverage guided test generation in regression setting using llm,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.917672Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:acd54d525a15cabd082b7ccd4bdd1435ec60a7a15b38214ffc2dfbf55e14f049","observation_id":"372f20a2-e1bc-4c1c-a015-226b9fce5c97","resolution":{"observed_at":"2026-08-10T17:19:34.917672Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.205207Z","title":"Learning deep semantics for test completion,","venue":null,"work_id":"478b4aff-7dcf-4d5a-8926-ecc3327d0f12","year":2023},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.922057Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:5ae17126045f491f564184ff4a7548d8e5a36b42252ed397cb5eb3b1bd4e8bf6","observation_id":"02163687-7672-4800-99ec-4c954ee4bc6c","resolution":{"observed_at":"2026-08-10T17:19:36.209546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.01701","last_updated":"2024-06-19T07:54:15Z","snapshot_observed_at":"2026-08-07T12:21:59.963411Z","submitted_at":"2024-01-03T12:09:43Z","title":"De-Hallucinator: Mitigating LLM Hallucinations in Code Generation Tasks via Iterative Grounding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.01701","snapshot_observed_at":"2026-08-10T17:19:34.925822Z","title":"De-hallucinator: Iterative grounding for llm-based code completion,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.925822Z"},"links":{"cited_paper":"/paper/2401.01701","citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:25281fa2d5cde2bb7b376f1ef3f762711247c5bc0453e75f1dca5821f414a6f8","observation_id":"2cc3652d-c418-496f-a449-032e0709a0c9","resolution":{"observed_at":"2026-08-10T17:19:34.925822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:34.930081Z","title":"SequenceR: Sequence-to-sequence learning for end-to-end program repair,","venue":null,"work_id":null,"year":1943},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.930081Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:3ed6e13268d58e1ce196da8be0dd8485a4a241fb4f03ec2768070d95d564ac93","observation_id":"4e0a9e33-5ae4-4fba-9764-438125f9fc12","resolution":{"observed_at":"2026-08-10T17:19:34.930081Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.191936Z","title":"Iter: Iterative neural repair for multi-location patches,","venue":null,"work_id":"780d011b-01b6-4512-b4fc-daf78e6bf465","year":2024},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.933882Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:859283b392380ecadf874494960feba793d926f2cd04b745cb4bef5c24ecf291","observation_id":"334f1c00-b216-44cd-aae8-0ef8cabcc3ca","resolution":{"observed_at":"2026-08-10T17:19:36.196433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.177748Z","title":"Repairllama: Efficient represen- tations and fine-tuned adapters for program repair,","venue":null,"work_id":"716d021b-e724-44dc-a4e1-5c5b0163c6fa","year":2024},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.937682Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:2ba1e2e88aa3f7172dc5d8caccf3de268144d47ce1293ad82f6aa3354bcfc237","observation_id":"33f92dd9-30c5-4ee9-80a7-8ba18f5ce9a7","resolution":{"observed_at":"2026-08-10T17:19:36.181965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.165197Z","title":"A deep dive into large language models for automated bug localization and repair,","venue":null,"work_id":"ad9c9535-bb76-4c6b-b4d5-e42200085635","year":2024},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.941802Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:db053834af9412a84db6f26c3a8c2a33a8edda6782f9463560aeb322a65db6c2","observation_id":"c13d2437-8497-4a65-a9b2-ec524436c50e","resolution":{"observed_at":"2026-08-10T17:19:36.169292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.152880Z","title":"Swe-agent: Agent-computer interfaces enable automated software engineering,","venue":null,"work_id":"79f5ef45-5db5-4e90-8a8e-dd47c42c8833","year":2024},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.945077Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:cd7aa9a3be336843d1bf91767857955ee3836cc0d44726d55801a1d02c5240f3","observation_id":"e7ce289e-4a99-4245-8442-b27672938150","resolution":{"observed_at":"2026-08-10T17:19:36.157212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.140269Z","title":"Autocoderover: Autonomous program improvement,","venue":null,"work_id":"ca624f8e-dcf3-42e5-8bb3-87a8619469d1","year":2024},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.948977Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:50f17c080072a3c951840d764ccc3737c88605fd07a33aee099bb3c02fc69f12","observation_id":"0f3a5ac1-998a-455d-9af6-0bd6d7c533e1","resolution":{"observed_at":"2026-08-10T17:19:36.144654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.17927","last_updated":"2024-06-27T12:40:12Z","snapshot_observed_at":"2026-08-01T14:58:25.947005Z","submitted_at":"2024-03-26T17:57:57Z","title":"MAGIS: LLM-Based Multi-Agent Framework for GitHub Issue Resolution","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.17927","snapshot_observed_at":"2026-08-10T17:19:34.952712Z","title":"Magis: Llm-based multi-agent framework for github issue resolution,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.952712Z"},"links":{"cited_paper":"/paper/2403.17927","citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:e8f170aaa7b5df707331642bfb369705930371391080973b7999bb1f99ba8dde","observation_id":"aaa50ea9-8c3d-430a-b23a-1cb5802165d7","resolution":{"observed_at":"2026-08-10T17:19:34.952712Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.128816Z","title":"Our replication package","venue":null,"work_id":"d83c5e3e-e227-45ee-95e9-1ad0ee530bcf","year":2024},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.956523Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:af02f3188d4566e412abdb8ecf7143d96ea7f15a74f8998270e558550a8e643a","observation_id":"b701e1f5-a108-447e-8493-c5a9305633d0","resolution":{"observed_at":"2026-08-10T17:19:36.132723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:19:36.368822Z","title":"Available: http://papers.nips.cc/paper files/paper/2023/ hash/43e9d647ccd3e4b7b5baab53f0368686-Abstract-Conference.html","venue":null,"work_id":"db718d42-84a2-4fb1-bfa7-33239984ebe8","year":2023},"citing_paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:34.800432Z"},"links":{"citing_paper":"/paper/2501.12339"},"observation_digest":"sha256:8d51184fa654adbe8a86b854be64531186b6662d7420c8c9eddd7b6df6e2033d","observation_id":"3435bca9-b45a-4ea8-b0e3-24edd51dafa3","resolution":{"observed_at":"2026-08-10T17:19:36.372987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.12339","last_updated":"2025-01-23T12:15:42Z","latest_version":2,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-12T15:55:21.943889Z","submitted_at":"2025-01-21T18:13:43Z","title":"Treefix: Enabling Execution with a Tree of Prefixes"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":1,"verified_fuzzy":22},"total_outbound_references":46},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 2 inbound Pith citation observations for arXiv:2501.12339."}