{"as_of":"2026-08-19T04:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5bf7a7d2338806f8fe8c2d9daf6f23f4349207518ecd425fb923e3057a777b6a","coverage":[{"denominator":89,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":89,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:32:16.925122Z","state":"measured"},{"denominator":89,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":89,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.13292/citation-record","integrity":"/paper/2608.13292/integrity","json":"/paper/2608.13292/citation-record.json","paper":"/paper/2608.13292"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:16.418190Z","title":"A systematic literature review on large language models applications in computer programming teaching evaluation process,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.418190Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:c7479a8e44aebb704ba9a56fdaa7de1345ce0854aabfd1148b8d092f8aaa9f66","observation_id":"60898b98-d0e2-4d9e-a54c-dc09f1beb06c","resolution":{"observed_at":"2026-08-14T14:32:16.418190Z","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-14T14:32:16.423581Z","title":"Patch generation in apr: A survey from the perspectives of utilizing llms and using apr-specific information,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.423581Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:4e7e373cecde25a6028bef8b8941b60a31f3c91d55dda48dadfd3a49dc966a44","observation_id":"38949910-c647-48e8-8fdf-a23ed06ddae8","resolution":{"observed_at":"2026-08-14T14:32:16.423581Z","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-14T14:32:16.428497Z","title":"A survey of llm-based automated program repair: Taxonomies, design paradigms, and applications,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.428497Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:280f216331140127ea63960f1c5619b2f35aa3c3b6db8d27aede886e93832545","observation_id":"76a799e9-c3ca-43c3-9be3-3829fbf89a0f","resolution":{"observed_at":"2026-08-14T14:32:16.428497Z","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-14T14:32:16.433446Z","title":"When large language models confront repository-level automatic program repair: How well they done?","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.433446Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:10d53e3ac92e3d42f3ca1f1d5b4320ccc53934335e996e9d2c1bce2c0c713bf1","observation_id":"8c03ac06-0308-4941-9a7e-4b665837650f","resolution":{"observed_at":"2026-08-14T14:32:16.433446Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.22256","last_updated":"2026-08-06T05:17:26Z","snapshot_observed_at":"2026-08-18T18:10:05.810270Z","submitted_at":"2025-12-24T08:05:10Z","title":"Agentic Software Issue Resolution with Large Language Models: A Survey","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.22256","snapshot_observed_at":"2026-08-14T14:32:16.438271Z","title":"Agentic software issue resolution with large language models: A survey,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.438271Z"},"links":{"cited_paper":"/paper/2512.22256","citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:d53bc93ce8b316c8b2a919425298d6a0b8b819e51d29688f27151f35bddd6697","observation_id":"02de1283-2d4f-4b0e-b5f0-c5861a17db2e","resolution":{"observed_at":"2026-08-14T14:32:16.438271Z","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-14T14:32:16.443483Z","title":"Swe-bench: Can language models resolve real-world github issues?","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.443483Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:0e85ed155c6ed716ec7545042e46813a60c7f5cc5035f6ea0d115cb647c7995e","observation_id":"6a74e9c4-b142-45c4-ae26-68828e32fb37","resolution":{"observed_at":"2026-08-14T14:32:16.443483Z","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-14T14:32:16.448717Z","title":"Automated program repair,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.448717Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:e1e6401fda07dc917e0862708d389f327f24528296e9f48aa9d4ecaaf005837b","observation_id":"87240126-946d-484c-aa6a-765ee6d6654b","resolution":{"observed_at":"2026-08-14T14:32:16.448717Z","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-14T14:32:16.453303Z","title":"Small patches get in!","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.453303Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:1a61d01c43ead6501d8ff89aa4afc57150199e8fd8d1d22d50194ee2e2a8dc1c","observation_id":"d2903e52-bc2b-4dd4-8e49-d73d6ac9ed22","resolution":{"observed_at":"2026-08-14T14:32:16.453303Z","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-14T14:32:16.457935Z","title":"Evaluating agent-based program repair at google,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.457935Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:75f6cefc244bc4d17f6372d748669f84dfd2ae69743f098340a9073e571438e5","observation_id":"bb0ec8ce-52a4-48b4-bbe7-520cdf6a1dc5","resolution":{"observed_at":"2026-08-14T14:32:16.457935Z","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-14T14:32:16.462803Z","title":"Writing acceptable patches: An empirical study of open source project patches,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.462803Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:02d1dd1378509c4a4c11486750a569bf0382b509cb4741e7bd9702ca0a6b1760","observation_id":"3d6c707d-9fc0-4f21-8965-96b118598c87","resolution":{"observed_at":"2026-08-14T14:32:16.462803Z","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-14T14:32:16.467254Z","title":"An exploratory study on confusion in code reviews,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.467254Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:5f17667cc45dc13aa1ec5e9834c0fa536c289e580208db1d9336f1fb6c902b12","observation_id":"4c40b90a-32f5-4d24-a4ed-51b5e93bc6a8","resolution":{"observed_at":"2026-08-14T14:32:16.467254Z","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-14T14:32:19.864052Z","title":"Toward understanding the rhetoric of small source code changes,","venue":null,"work_id":"f82e7632-55eb-4ff7-8aae-5d8f14923426","year":2005},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.472061Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:bc1cd7e0be564ba68598012baceb2f3fb5af586b61d4f36a33f231428a20c874","observation_id":"bbc95751-2c67-4e7d-8944-02ed782db134","resolution":{"observed_at":"2026-08-14T14:32:19.869432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.848454Z","title":"Directfix: Looking for simple program repairs,","venue":null,"work_id":"d5307dd2-edab-4198-9e46-5c17f0bbd0c1","year":2015},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.477011Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:e1ffdf691a9688a5518e2b446830e782655530aa50a4816aae9dba4ace7daaaa","observation_id":"6c7dd60a-8f94-42b9-8c30-e432021f745a","resolution":{"observed_at":"2026-08-14T14:32:19.853127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.833371Z","title":"Aligning llms to fully utilize the cross-file context in repository-level code completion,","venue":null,"work_id":"75179f3f-6ef7-4639-bf7f-eac5e64fcf0c","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.481509Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:52e3bce4f1c4950713c2929f8ba252465c60866974d8c280749940b073870fd4","observation_id":"ada09f4c-9962-40a9-a961-4326fb28feca","resolution":{"observed_at":"2026-08-14T14:32:19.838743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.817809Z","title":"Evaluating representation learning of code changes for predicting patch correctness in program repair,","venue":null,"work_id":"b1f6c880-6993-4216-9c0a-74c07bac583a","year":2020},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.486140Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:2f843e9eb5eb3f3b2bc8e91cf428eaa27a73f76b6cdf4412b092c9a4b55bd7b4","observation_id":"28fa61f8-f085-4019-a8f0-aaebe775ba32","resolution":{"observed_at":"2026-08-14T14:32:19.822959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.802112Z","title":"Utango: untangling commits with context-aware, graph-based, code change clustering learning model,","venue":null,"work_id":"605a34c2-9ec1-4f23-8a2e-b4e4164af011","year":2022},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.490753Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:11b142accb9a908ae796803be27f5e82b2d5c8341358adc10b9d25e24b87f1b3","observation_id":"23c55963-3bc5-48d8-877b-90e9ec4cfadf","resolution":{"observed_at":"2026-08-14T14:32:19.807041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:16.495036Z","title":"Atomizer: An llm-based collaborative multi-agent framework for intent-driven commit untangling,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.495036Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:a24fb0f0a170d1bbf0c59f7a62cb4ac792cc33f27ced9d08ac0e80b8e677f3c3","observation_id":"661b32a0-6c52-4cc9-9aa8-5758fb463908","resolution":{"observed_at":"2026-08-14T14:32:16.495036Z","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-14T14:32:19.787425Z","title":"Toward a better understanding of probabilistic delta debugging,","venue":null,"work_id":"22d96d86-df0f-4d3b-a753-9ea6d95fc55d","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.499682Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:bdfcad403ebd19141a6c1510282a5119a0471c1adcfdfc466f17ae9d4482ccc2","observation_id":"f16efd86-5a0e-465b-9b30-961bee1593e0","resolution":{"observed_at":"2026-08-14T14:32:19.792145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.772609Z","title":"Wdd: Weighted delta debugging,","venue":null,"work_id":"b0a6d44d-714b-4380-8fe9-3e9b40b98764","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.504258Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:54ef76838be66d06d565690751f354304e80fb784c0ca743de80b8b2977fda64","observation_id":"212d6f8d-a0fd-429f-85ab-699aaf30b0bf","resolution":{"observed_at":"2026-08-14T14:32:19.777106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.757637Z","title":"Less is more: Adaptive program repair with bug localization and preference learning,","venue":null,"work_id":"bb6b002e-8768-4246-962a-17ded4895388","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.508833Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:c9b3c3d6347184c5df5496bfdc9d31dc4c10308fdb1a21c30c6a9c0009ee8e24","observation_id":"b2df0586-f15a-4fd7-aba2-fe75ffbde698","resolution":{"observed_at":"2026-08-14T14:32:19.762393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.05963","last_updated":"2026-04-07T14:56:38Z","snapshot_observed_at":"2026-08-11T05:10:57.828287Z","submitted_at":"2026-04-07T14:56:38Z","title":"QiMeng-PRepair: Precise Code Repair via Edit-Aware Reward Optimization","version":1},"cited_work":{"arxiv_id":"2604.05963","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.05963","snapshot_observed_at":"2026-08-14T14:32:18.953928Z","title":"QiMeng-PRepair: Precise Code Repair via Edit-Aware Reward Optimization","venue":"cs.SE","work_id":"df209df7-bcb0-46dd-a617-f4a9628a863b","year":2026},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.513102Z"},"links":{"cited_paper":"/paper/2604.05963","citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:844d5fde2ef98a6dfc3da0362677ce1d5db9cc319567bc0e39bd03b0198f0c32","observation_id":"29bbcf8b-a509-41af-b437-de45938b554a","resolution":{"observed_at":"2026-08-14T14:32:18.959295Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.742364Z","title":"Swe-bench leaderboards,","venue":null,"work_id":"a5c00dbb-240e-4515-b082-465d93383e68","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.517688Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:bf4aca77db3fd14d0a8c8e8bf30439319dd9299a776717c5bb84710cace6255d","observation_id":"2ea5c85d-49e6-407d-9e8c-ce585c9d06f0","resolution":{"observed_at":"2026-08-14T14:32:19.746834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:16.521880Z","title":"Direct preference optimization: Your language model is secretly a reward model,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.521880Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:1ca859f1e553bfb77838d5ea9d11bdd41b6474d0b1c8c62219f245584b6de339","observation_id":"bc2f0e24-b44c-424e-8120-efc80602165e","resolution":{"observed_at":"2026-08-14T14:32:16.521880Z","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":"2603.20100","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:18.930173Z","title":"An empirical study of sft-dpo interac- tion and parameterization in small language models,","venue":null,"work_id":"0bf23c51-bbb9-4a5e-b763-4f3ac02918f8","year":2026},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.525756Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:7464aa5a100ce27e957e8fa3c4b619dab97a25150538ace1fde956f176e68d64","observation_id":"6fa1a24e-8f6f-44bb-8984-37ff079c626c","resolution":{"observed_at":"2026-08-14T14:32:18.937905Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:16.529906Z","title":"Chain-of-thought prompting elicits reasoning in large language models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.529906Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:9b5f1384fe6070a1f289f7aa09058786236e1fb5087921dac9b20a1150fb7903","observation_id":"eacbe801-02b4-45c2-bfb1-a933ead69976","resolution":{"observed_at":"2026-08-14T14:32:16.529906Z","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-14T14:32:19.708992Z","title":"Unicott: A unified framework for structural chain-of-thought distillation,","venue":null,"work_id":"de03d4f3-bcb6-452b-9541-307b8bb376ac","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.533987Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:2f592aec776b81327abe1999d92870f55dab1e0b3aa92b1bfbd7fb5aa17a0d7d","observation_id":"57c0d5a4-c807-4dbf-b2d7-c92151b74876","resolution":{"observed_at":"2026-08-14T14:32:19.713897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23751","last_updated":"2025-09-03T14:36:00Z","snapshot_observed_at":"2026-08-13T23:27:17.014262Z","submitted_at":"2025-07-31T17:38:50Z","title":"CoT-Self-Instruct: Building high-quality synthetic prompts for reasoning and non-reasoning tasks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.23751","snapshot_observed_at":"2026-08-14T14:32:16.538145Z","title":"Cot-self-instruct: Building high- quality synthetic prompts for reasoning and non-reasoning tasks,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.538145Z"},"links":{"cited_paper":"/paper/2507.23751","citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:83d2d61ff1569d962776493b8dc2df0ed0e673be748a273e5448bbeb0b91515c","observation_id":"06f09f0f-c884-4c3c-ba22-9251cfdaa6ac","resolution":{"observed_at":"2026-08-14T14:32:16.538145Z","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-14T14:32:16.542926Z","title":"Swe-agent: Agent-computer interfaces enable automated soft- ware engineering,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.542926Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:d85ef433ca984a310e53f090bbf468553b0a14683a44c9866e799de5e5a37fd8","observation_id":"ef679b2d-de45-43f9-8195-bb92174350a7","resolution":{"observed_at":"2026-08-14T14:32:16.542926Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2511.03690","last_updated":"2026-04-22T13:47:42Z","snapshot_observed_at":"2026-07-06T22:34:58.108904Z","submitted_at":"2025-11-05T18:16:44Z","title":"The OpenHands Software Agent SDK: A Composable and Extensible Foundation for Production Agents","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2511.03690","snapshot_observed_at":"2026-08-14T14:32:16.547527Z","title":"The openhands software agent sdk: A composable and extensible foundation for pro- duction agents,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.547527Z"},"links":{"cited_paper":"/paper/2511.03690","citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:0e5cfeaffeb8b97b5e0b4a9bb94fdd387750ba61144cb40bb84a16bfb0de15a2","observation_id":"7d8f3c6f-818e-416e-9e38-0db901ba276a","resolution":{"observed_at":"2026-08-14T14:32:16.547527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01489","last_updated":"2024-10-29T17:29:27Z","snapshot_observed_at":"2026-08-17T17:32:59.508600Z","submitted_at":"2024-07-01T17:24:45Z","title":"Agentless: Demystifying LLM-based Software Engineering Agents","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01489","snapshot_observed_at":"2026-08-14T14:32:16.552333Z","title":"Agentless: De- mystifying llm-based software engineering agents,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.552333Z"},"links":{"cited_paper":"/paper/2407.01489","citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:3d13b990c6191f14dfa111033aa815a7039b78b8dc0be727d1d6be96e4f60b88","observation_id":"3017552c-bc29-42a6-b7d0-45350374861c","resolution":{"observed_at":"2026-08-14T14:32:16.552333Z","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-14T14:32:16.557290Z","title":"Autocoderover: Autonomous program improvement,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.557290Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:3b12a9802163eb746e3ab1e3c79e046e3c8e9cfbad4272a82d03c3e79c4bfc6e","observation_id":"89d0ec04-9b71-4577-8fc6-1e45c25c56a1","resolution":{"observed_at":"2026-08-14T14:32:16.557290Z","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-14T14:32:19.674756Z","title":"Swe-search: Enhancing software agents with monte carlo tree search and iterative refinement,","venue":null,"work_id":"1ff2f942-4dbc-4fe1-835e-9b1df9fdc262","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.561718Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:8855f5563224f835867db2f2a9be4a13d70e0c73c8a6e2a6e6bfd4d7fccc341f","observation_id":"a133a20d-6149-40e3-9b4b-e1fa565be24a","resolution":{"observed_at":"2026-08-14T14:32:19.679580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.660448Z","title":"Alibaba lingmaagent: Improving automated issue resolution via comprehensive repository exploration,","venue":null,"work_id":"a66968d4-c373-4c9e-96fe-c3d6d136294a","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.566125Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:170b31a18607c6eab6971fcb7e1abc0fa8297a70ee51abf1cbb324c21bef85db","observation_id":"fe595eac-a2bd-4b99-a710-57aeb2971090","resolution":{"observed_at":"2026-08-14T14:32:19.665114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.05040","last_updated":"2025-05-07T04:06:41Z","snapshot_observed_at":"2026-08-15T15:19:40.400284Z","submitted_at":"2025-01-09T07:54:24Z","title":"SWE-Fixer: Training Open-Source LLMs for Effective and Efficient GitHub Issue Resolution","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.05040","snapshot_observed_at":"2026-08-14T14:32:16.570975Z","title":"Swe- fixer: Training open-source llms for effective and efficient github issue resolution, 2025,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.570975Z"},"links":{"cited_paper":"/paper/2501.05040","citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:85483b44f7f5c209f361a74c2e2d220e773b8430af334ec2af36014fd10e9836","observation_id":"ddb7fe82-01e1-4b6e-854d-2ec6c2b3a3a8","resolution":{"observed_at":"2026-08-14T14:32:16.570975Z","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-14T14:32:19.644910Z","title":"Deepswe: Training a state-of-the-art coding agent from scratch by scaling rl,","venue":null,"work_id":"bcc2d747-46bb-47c4-87e8-4787bf115937","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.575701Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:5fe2a29f97e7d7ce5045a4ee41bd2646736953bfcf6f2b82b42047f959670ddf","observation_id":"a9596295-9c73-4771-8a20-d6202538a010","resolution":{"observed_at":"2026-08-14T14:32:19.649883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:16.579956Z","title":"Swe-exp: Experience-driven software issue resolution,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.579956Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:b30860197dc2ae446a681d31d95e200bc1360bca5e5eee98cd81d875b3b98c65","observation_id":"649ec6ec-bf91-4c6b-86ab-2075f63c78da","resolution":{"observed_at":"2026-08-14T14:32:16.579956Z","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-14T14:32:16.583898Z","title":"Lingxi: Repository-level issue resolution framework enhanced by procedural knowledge guided scaling,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.583898Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:3f68c45ee6fbb46bfb1c64574eb4df33c7a9a9147fc4a802cf886a82af3cb9be","observation_id":"6f86661a-0347-4295-b680-94ef1ebfbcc5","resolution":{"observed_at":"2026-08-14T14:32:16.583898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.19290","last_updated":"2025-06-24T03:53:36Z","snapshot_observed_at":"2026-08-15T15:20:24.522107Z","submitted_at":"2025-06-24T03:53:36Z","title":"Skywork-SWE: Unveiling Data Scaling Laws for Software Engineering in LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.19290","snapshot_observed_at":"2026-08-14T14:32:16.588172Z","title":"Skywork-swe: Unveiling data scaling laws for software engineering in llms,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.588172Z"},"links":{"cited_paper":"/paper/2506.19290","citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:a68ab9b6b87b9696d7f48ffd856960b45e3dff4b186cd4dc906ae691dc87d113","observation_id":"bee6e3b8-1c55-475e-9d96-2627f84c99aa","resolution":{"observed_at":"2026-08-14T14:32:16.588172Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02747","last_updated":"2025-06-10T18:19:40Z","snapshot_observed_at":"2026-08-18T03:13:40.178854Z","submitted_at":"2025-02-04T22:30:02Z","title":"PatchPilot: A Cost-Efficient Software Engineering Agent with Early Attempts on Formal Verification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02747","snapshot_observed_at":"2026-08-14T14:32:16.592973Z","title":"Patchpilot: A cost-efficient software engineering agent with early attempts on formal verification,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.592973Z"},"links":{"cited_paper":"/paper/2502.02747","citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:9cf297746ee62dec4cf560f6bbe3d054ae31189d683f567ec30e8dab7fe8b42f","observation_id":"5026dd48-8a57-4a04-9189-a2ada7872a2c","resolution":{"observed_at":"2026-08-14T14:32:16.592973Z","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-14T14:32:16.597661Z","title":"Flexeme: Untangling commits using lexical flows,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.597661Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:2f15f64e806790e1370e899d91715570dce7b81cb570deca08173b43a23a9928","observation_id":"da1a9e29-b9ea-4489-b7e9-d54a214ef726","resolution":{"observed_at":"2026-08-14T14:32:16.597661Z","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-14T14:32:19.628457Z","title":"Perses: Syntax-guided program reduction,","venue":null,"work_id":"f65ff731-a4d2-4b58-b56f-997d84c67327","year":2018},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.602137Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:f1d108eaa3fceffe9ea694efcf000b2760396483e6a8aefd5bad4da75d9ea803","observation_id":"87a22a58-c8c1-48db-af91-d873db0deaf0","resolution":{"observed_at":"2026-08-14T14:32:19.633810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:18.295780Z","title":"C2d2: Extracting critical changes for real-world bugs with dependency-sensitive delta debugging,","venue":null,"work_id":"f07dda9d-3582-43ea-8db6-fbdfdbcd837e","year":2024},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.606948Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:f536dbc7f027fadd8377ef381840d0d847b3ab2cda3780e2a6180752c44e12c7","observation_id":"1abe32b6-3a4d-4f86-b8d8-104350c8d254","resolution":{"observed_at":"2026-08-14T14:32:18.301109Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2601.21298","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:18.063930Z","title":"Detecting multiple semantic concerns in tangled code commits,","venue":null,"work_id":"618db172-3e76-4a11-824a-42ed5a2dab7e","year":2026},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.611430Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:bfe560ff19a1b3f7e7752f865880432cbbe0881d8140323cf2c47e6f2fe3568c","observation_id":"5bf5d7d5-21af-4221-b5ab-535a6243f1fc","resolution":{"observed_at":"2026-08-14T14:32:18.072594Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.611973Z","title":"A first look at conventional commits classification,","venue":null,"work_id":"7c4f1900-5a94-4c86-931b-0400d52754a0","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.615825Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:d101da9b03bc6a66db350cada8d72ac721af673839fa5fe3dde56bd1a68273e3","observation_id":"223fdf7e-56d3-4257-b9ed-9e06ecb3e02e","resolution":{"observed_at":"2026-08-14T14:32:19.617038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.595754Z","title":"Nemotron-cortexa: Enhancing llm agents for software engineering tasks via improved localization and solution diversity,","venue":null,"work_id":"097df042-921d-45a2-96fa-3745ccf61e88","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.620585Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:98b4a8987b135609e61cf77243e54d43bee6e66289f3bde6d1fd1fb133351336","observation_id":"994f828f-afbf-464b-8ff2-c9afc06c2775","resolution":{"observed_at":"2026-08-14T14:32:19.601264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.05579","last_updated":"2024-12-10T05:49:12Z","snapshot_observed_at":"2026-08-17T10:18:05.650518Z","submitted_at":"2024-12-07T08:07:24Z","title":"LLMs-as-Judges: A Comprehensive Survey on LLM-based Evaluation Methods","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.05579","snapshot_observed_at":"2026-08-14T14:32:16.624965Z","title":"Llms- as-judges: a comprehensive survey on llm-based evaluation methods,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.624965Z"},"links":{"cited_paper":"/paper/2412.05579","citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:98f4dd1c56a36b204c15fcc4244f4414a51ce32f42231157bd62d0b38c0afcdb","observation_id":"3e9b40fe-a6c0-4977-bb50-e0fd94613ee0","resolution":{"observed_at":"2026-08-14T14:32:16.624965Z","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-14T14:32:19.579476Z","title":"Hybrid automated program repair by combining large language models and program analysis,","venue":null,"work_id":"62e0e43d-1186-412a-9fa8-b6d97e1f0e03","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.629894Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:57c9ffdbb96c95a52682c4c094dfed8120a852a4a43f564623bd968fd7fc6a47","observation_id":"32359d31-0292-43ee-b680-3799160f3eeb","resolution":{"observed_at":"2026-08-14T14:32:19.584862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:16.634869Z","title":"An empirical study on failures in automated issue solving,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.634869Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:ab00424f760342899e16575b3fd1c36829fd37ec9f92c6dddd84316379af7f64","observation_id":"5725c584-dd7f-4b07-a7b5-4f591e83133c","resolution":{"observed_at":"2026-08-14T14:32:16.634869Z","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-14T14:32:19.563000Z","title":"Chatgpt for code refactoring: Analyzing topics, interaction, and effective prompts,","venue":null,"work_id":"35d8512f-e1d1-46e3-9484-8e258189e8fd","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.639474Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:00f3c2112707c9e4f042448ce8633084092cea176446f266bbca229445f7b529","observation_id":"61a0d38a-9730-4713-9d70-7caea79cae79","resolution":{"observed_at":"2026-08-14T14:32:19.568484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.547601Z","title":"Aligning the objective of llm-based program repair,","venue":null,"work_id":"5f1e03ea-75ff-4c55-a1a0-0bab0298bda3","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.643695Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:90dab9c1b364074ed534b1accc887ffa0fa8db2d03458b9e9c4c813d15f608a7","observation_id":"391f2329-3f33-4701-8926-5f78bac4e864","resolution":{"observed_at":"2026-08-14T14:32:19.552582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:16.647764Z","title":"Empirical eval- uation of generalizable automated program repair with large language models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.647764Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:e26ebb0fa74d9a38b1dd75890ddbfbcfad5fb676208ffcf001a38b909e44fba5","observation_id":"6f131be6-5428-4507-8448-c442056287e3","resolution":{"observed_at":"2026-08-14T14:32:16.647764Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.08693","last_updated":"2025-03-06T19:29:03Z","snapshot_observed_at":"2026-08-07T02:44:43.738657Z","submitted_at":"2024-07-11T17:31:01Z","title":"Robotic Control via Embodied Chain-of-Thought Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.08693","snapshot_observed_at":"2026-08-14T14:32:16.651899Z","title":"Robotic control via embodied chain-of-thought reasoning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.651899Z"},"links":{"cited_paper":"/paper/2407.08693","citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:89f83980c52722b692c1e32e8a4d67f7d422ad102f8584aead606cd4b22e5335","observation_id":"a6d924de-fad3-4e5c-8e75-ecb8a952a9e2","resolution":{"observed_at":"2026-08-14T14:32:16.651899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.07374","last_updated":"2025-02-18T05:20:33Z","snapshot_observed_at":"2026-08-18T17:37:54.742716Z","submitted_at":"2025-02-11T08:48:48Z","title":"LLMs Can Easily Learn to Reason from Demonstrations Structure, not content, is what matters!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.07374","snapshot_observed_at":"2026-08-14T14:32:16.657008Z","title":"Llms can easily learn to reason from demonstrations structure, not content, is what matters!","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.657008Z"},"links":{"cited_paper":"/paper/2502.07374","citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:e8b08429058ec9d469c99404c416524c64f3ee773430b4763f8beb1b020fc76e","observation_id":"0eb90253-3686-45b2-80c8-d5fe74a795fa","resolution":{"observed_at":"2026-08-14T14:32:16.657008Z","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-14T14:32:16.661720Z","title":"Mind the gap: Bridging thought leap for improved chain-of-thought tuning,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.661720Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:64823f167868b28ee75b26d962569f58e2838ff4fe22a649f34da3e4d11788ef","observation_id":"50d5b58c-521b-4474-b0e2-14808f7d42b0","resolution":{"observed_at":"2026-08-14T14:32:16.661720Z","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-14T14:32:16.666397Z","title":"Semantics-aligned, curriculum-driven, and reasoning-enhanced vulnerability repair framework,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.666397Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:c1cf85aae6bc55efdabcaddfe3549e627e2e44f7f81a939eed355f56e1812ead","observation_id":"24517e4f-41e1-49f5-9a27-6a049cc08bab","resolution":{"observed_at":"2026-08-14T14:32:16.666397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.00433","last_updated":"2026-05-01T06:10:03Z","snapshot_observed_at":"2026-08-15T09:11:18.857763Z","submitted_at":"2026-05-01T06:10:03Z","title":"Improving LLM Code Generation via Requirement-Aware Curriculum Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2605.00433","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.00433","snapshot_observed_at":"2026-08-14T14:32:17.234300Z","title":"Improving LLM Code Generation via Requirement-Aware Curriculum Reinforcement Learning","venue":"cs.SE","work_id":"f292d1b3-75e7-4b91-9d89-2700f9797407","year":2026},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.671249Z"},"links":{"cited_paper":"/paper/2605.00433","citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:f7d8b507dee7eada61bab18742affb4c0bff589fd7198d5218531daae205d260","observation_id":"5803634c-56cc-4c97-a888-1ebca974c3d6","resolution":{"observed_at":"2026-08-14T14:32:17.240408Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-08-15T20:26:32.102285Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-14T14:32:16.676513Z","title":"Prox- imal policy optimization algorithms,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.676513Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:f44aec7bcab51d3fcd69335318d7cf6c3ef6aeccbe702915bdb8f1ccea2217c1","observation_id":"9b759f6d-4a08-4a18-95e2-3dbfcb3bff62","resolution":{"observed_at":"2026-08-14T14:32:16.676513Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-08-06T14:58:42.911363Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-14T14:32:16.681931Z","title":"Deepseekmath: Pushing the limits of mathematical reasoning in open language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.681931Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:b211be044074c33a5a235face2414d73714d67732ffc15cd6b7f8f029a1d7e8b","observation_id":"b21d6937-2fec-49eb-9b03-1476acf417ca","resolution":{"observed_at":"2026-08-14T14:32:16.681931Z","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-14T14:32:19.520733Z","title":"Introducing gpt-5.2 — openai,","venue":null,"work_id":"3d77659d-9c7e-4fee-ac13-f054d3b4c6ba","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.686986Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:43d788f4c7ec2dc52adcd3bf593d71e752000c19fc0d445454aec2b6c3cd3468","observation_id":"1920d1fa-19d6-474a-9bf0-9a86c5955331","resolution":{"observed_at":"2026-08-14T14:32:19.525794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.504210Z","title":"Introducing our most intelligent model yet. with state-of-the-art reasoning to help you learn, build, and plan anything","venue":null,"work_id":"5f863709-2773-4f1a-8e6a-89384b8e7ec5","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.691573Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:74f6815ec7676b66159d95bfd76a8abbdae5d49b9849dc302bc8492ac9672f61","observation_id":"6346ce63-ca78-498b-8b2f-078e314a57cf","resolution":{"observed_at":"2026-08-14T14:32:19.509798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:16.696354Z","title":"Qwen3.5: Towards native multimodal agents,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.696354Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:4a32354700671b95f1489ee75a76c9e6c38d57674b31c256b79417d8024be0eb","observation_id":"49984020-8523-4655-8cac-1f4caf012019","resolution":{"observed_at":"2026-08-14T14:32:16.696354Z","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-14T14:32:16.707032Z","title":"Introducing claude sonnet 4.5,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.707032Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:f16808ec109e3495b49db7c787208a7e0b8c85ba39ea93599c891b8d8621efd0","observation_id":"f9b9836a-a1e2-4950-a567-654840886c05","resolution":{"observed_at":"2026-08-14T14:32:16.707032Z","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-14T14:32:19.455692Z","title":"Our most intelligent open models, built from gemini 3 research and technology to maximize intelligence-per-parameter,","venue":null,"work_id":"42808983-9e42-4032-929f-23f527b00f26","year":2026},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.712213Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:bbbb764caa41d072bb98281eec59ee6f9258e8cd373ec23e6f25e28115fcbadd","observation_id":"ffd09030-dd07-4521-bac4-b2d774c5067b","resolution":{"observed_at":"2026-08-14T14:32:19.461196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.439952Z","title":"Introducing mistral 3 — mistral ai,","venue":null,"work_id":"79e0afb6-f56e-4d0a-b98b-ff12f359c1bb","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.717556Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:183571fe9b4cbd27f16fe1dd058784ef5139a7f81f6e8709a2f527d76d58be33","observation_id":"83648643-85e5-4ebe-af76-d2de80dced6e","resolution":{"observed_at":"2026-08-14T14:32:19.444694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.424157Z","title":"Interactive code review for systematic changes,","venue":null,"work_id":"aa50d77a-fddf-4994-8c4b-9c1170b2ca63","year":2015},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.818664Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:af29df608d9134edcc788dce007efa3d03a0c169919db554163458cfb325650a","observation_id":"2dcdbbed-f08c-4c00-a785-fa907d6c655b","resolution":{"observed_at":"2026-08-14T14:32:19.428741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.409258Z","title":"Automated patch transplantation,","venue":null,"work_id":"e700fce0-1b8f-4fd0-8302-f859234a1198","year":2020},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.823525Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:02ffa24dbe3019fe29d59314622b046f1669d22f93d048057e2a0ce2dc1e8268","observation_id":"a0bd6a64-b4c0-4cb0-b2e3-a78c613beccf","resolution":{"observed_at":"2026-08-14T14:32:19.413900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.393650Z","title":"Review participation in modern code review: An empirical study of the android, qt, and openstack projects,","venue":null,"work_id":"35e860fe-407e-4a1d-aa8c-107ac8d9fe60","year":2017},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.828267Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:3296ff5ccf53662405a715156f043335c30054f7098b830cc3c60d2cad338246","observation_id":"3ef562be-f757-4eba-9da5-31f328ddee16","resolution":{"observed_at":"2026-08-14T14:32:19.398790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.378359Z","title":"Investigating technical and non-technical factors influencing modern code review,","venue":null,"work_id":"14b37014-b8ae-4b0f-9a9d-8bde4378fc6e","year":2016},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.832926Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:7fff3a1fa46c40a76f2c8c68a5eb4d163bb4dfe9ffe69d1a0c37ce4d6615a937","observation_id":"fedc45a6-93d6-44ff-831d-0f4f7a98ae01","resolution":{"observed_at":"2026-08-14T14:32:19.383340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.362451Z","title":"Git - git-diff documentation,","venue":null,"work_id":"efc15deb-c92d-4ebb-825a-b5a507be25b1","year":2026},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.837961Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:1f46e3e2d9941640835dbdc63c8777f6efff948bfd4cd7b987a7522da47b5ec3","observation_id":"a91f10bc-bc44-4734-ac69-9a701654b705","resolution":{"observed_at":"2026-08-14T14:32:19.367356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23370","last_updated":"2025-07-31T09:37:22Z","snapshot_observed_at":"2026-08-17T14:31:14.268621Z","submitted_at":"2025-07-31T09:37:22Z","title":"Trae Agent: An LLM-based Agent for Software Engineering with Test-time Scaling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.23370","snapshot_observed_at":"2026-08-14T14:32:16.843398Z","title":"Trae agent: An llm-based agent for software engineering with test-time scaling,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.843398Z"},"links":{"cited_paper":"/paper/2507.23370","citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:744eb702fe2cf5c23c1f67ab7fcafba6397a506744b9c59ac76131a86b3e7cc8","observation_id":"60509ecb-b01c-4c03-b21b-15aa30af514b","resolution":{"observed_at":"2026-08-14T14:32:16.843398Z","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-14T14:32:19.347118Z","title":"Swe-rizzo - software engineering on bittensor - a team rizzo subnet,","venue":null,"work_id":"ac5572e5-0d07-404b-b83d-520d1d64c10d","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.848106Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:b58c90c33848596e59acd83c32e5cea4ecefb13a58db3c524e8492d682ecc9fc","observation_id":"4e1f1298-fcc7-424e-a8ef-91eb6abc3708","resolution":{"observed_at":"2026-08-14T14:32:19.352187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.331691Z","title":"Codesweep - autopilot for enterprise software mainte- nance,","venue":null,"work_id":"558f8c8d-521f-46dc-9e20-59e2f94817b1","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.852615Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:1ec06dd9358fff2a699b75918b409530ff0ec87940c7b82ab5122bc88077eca3","observation_id":"4786a6a6-c02f-4e0e-b945-0f7ee16f587b","resolution":{"observed_at":"2026-08-14T14:32:19.336894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.316020Z","title":"Joycode swe-bench agent pipeline,","venue":null,"work_id":"2eb331ad-12d5-4bae-bbe0-65cef86d9c17","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.857332Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:6440d7af9055707d97eea004278436039fbcf3f2e2d0f00219686e916eefa1ee","observation_id":"043ecd7e-b30d-47a6-893c-20d6abdd2f49","resolution":{"observed_at":"2026-08-14T14:32:19.321266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.299948Z","title":null,"venue":null,"work_id":"7822823f-dc98-4c5d-ad63-18c038efa862","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.861720Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:454d3887c0ce4d97f46c730bdfe41ab217db3c2e2060545ee8b5d44d5f9bdeb6","observation_id":"c33dd120-63fa-4d7e-a164-88c92e5e31c6","resolution":{"observed_at":"2026-08-14T14:32:19.305088Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.282897Z","title":"Composio sdk,","venue":null,"work_id":"c8e54731-93b6-47d4-96e9-020269f9ef6a","year":2024},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.866094Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:6c7ca7e275d466d2524212be5aaeef79efc8f03765f7b86afeb5445ba169704a","observation_id":"4dafc9a0-3fdc-4ef0-9311-a0129ac2fb73","resolution":{"observed_at":"2026-08-14T14:32:19.288405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.264853Z","title":"Appmap navie,","venue":null,"work_id":"7e001bba-9774-49f2-8497-8abc3513547f","year":2024},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.871465Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:05c7c99c3bf992d34ed4b4fe4ae271887817b68ae4ab4682cdba0f8ac3cb4b4f","observation_id":"a9fdf94e-7c73-40c8-b645-f2487c07251c","resolution":{"observed_at":"2026-08-14T14:32:19.270553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.248006Z","title":"Augment swe-bench verified agent,","venue":null,"work_id":"da07ea1d-1540-4a3e-883f-3c1d92c26a87","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.876165Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:61878e4f0ba9f262a4949281f6a70c72564056d88e2b8869638b1d4c64418064","observation_id":"83a52891-30f3-409f-923d-696ec01f49a9","resolution":{"observed_at":"2026-08-14T14:32:19.253241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.232898Z","title":"Z.ai: Free ai chatbot,","venue":null,"work_id":"a47b3e67-c315-4935-b4b2-d27c607907bd","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.881022Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:293fb05d8cf4d8b8f5f6a9c139ebf598e8b09e3ab5c6d612bab3817c32b0eba3","observation_id":"3c94741f-719f-4eef-b466-d657d666a869","resolution":{"observed_at":"2026-08-14T14:32:19.237668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.218203Z","title":"Gru ai - your agi assistant,","venue":null,"work_id":"1d8e77a3-592c-46c1-8c68-ae7e410d6ce5","year":2024},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.885483Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:bf70716fd615feeeb41c62775dde2a71f94d4216b107cf328c391ac6fe5cba11","observation_id":"6a776b56-5384-4e51-bd40-f5f8b7115f07","resolution":{"observed_at":"2026-08-14T14:32:19.222934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2509.12434","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:17.159701Z","title":"Building coding agents via entropy-enhanced multi-turn preference optimization,","venue":null,"work_id":"dda0c381-fd19-43b0-8667-72a85aec31b0","year":2025},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.889911Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:a4b05e161e7705d464d155510ff6d4a3f76a48d305e99d1fd7d3bc4d16d479f5","observation_id":"8e7756ba-905f-44ec-97db-676cb0e0ab5e","resolution":{"observed_at":"2026-08-14T14:32:17.170707Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:19.202702Z","title":null,"venue":null,"work_id":"212d5c3d-8584-4f85-80c2-2a747ef0830e","year":1977},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.894318Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:b2ecbdffeff3af7c97d9db6ad3b2213a32151f9ea7e155a89a162e69ff52960a","observation_id":"2302944a-a3be-4ddb-8445-da7ffbfe41c1","resolution":{"observed_at":"2026-08-14T14:32:19.207993Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:16.898812Z","title":"Cyclomatic complexity,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.898812Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:e4668a41bb4038782c5262883220d198d6b4b3fb309430588b4a9f083ab9d6bf","observation_id":"4b7ddd60-f2db-4c6a-a5e4-4b3cc34e8f77","resolution":{"observed_at":"2026-08-14T14:32:16.898812Z","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-14T14:32:19.178028Z","title":"Automated clustering and pro- gram repair for introductory programming assignments,","venue":null,"work_id":"7d263417-906d-4239-9567-b9fd093d59af","year":2018},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.902959Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:963524bb16e88078c8039bd67ff78461261d47d170a939707811f4abb1e1b640","observation_id":"0248fbdd-f9fe-4db5-afc1-dfc47a1be154","resolution":{"observed_at":"2026-08-14T14:32:19.182830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:16.907277Z","title":"On a test of whether one of two random variables is stochastically larger than the other,","venue":null,"work_id":null,"year":1947},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.907277Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:5dad39786a7a045ac40ed80f3b3b10da91d583bd42e4e2e0eaeb00b68b8f3c0a","observation_id":"37971ccf-dc16-41dd-a168-8236ed8981a0","resolution":{"observed_at":"2026-08-14T14:32:16.907277Z","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-14T14:32:16.911515Z","title":"Individual comparisons by ranking methods,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.911515Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:ae39ec8ead690d65dba55db4162401571c93c19c9b231a3b312ba2bdc9caf537","observation_id":"d75bea64-7124-46c3-8c5b-8ee57fb2a894","resolution":{"observed_at":"2026-08-14T14:32:16.911515Z","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-14T14:32:19.143081Z","title":"Methodology and application of the kruskal-wallis test,","venue":null,"work_id":"9d174992-2de6-419c-a0fa-5c3e9b1d4a47","year":2014},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.915867Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:5c237ecf534a4b201c1166713edad978cfd19916c0d8bd90dab9eeaf45bd2da6","observation_id":"1a7bfbe5-ce63-4d65-b209-3f0a5d3ff9e7","resolution":{"observed_at":"2026-08-14T14:32:19.148303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T14:32:16.920386Z","title":"A simple sequentially rejective multiple test procedure,","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.920386Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:45abfdd96f57b4c4e845ee14d042cda721dbde713020ab3fcec1d7543a1b1c51","observation_id":"fac66548-1d97-44ef-a854-4daeca321d7a","resolution":{"observed_at":"2026-08-14T14:32:16.920386Z","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-14T14:32:16.925122Z","title":"Dominance statistics: Ordinal analyses to answer ordinal questions","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.925122Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:54dc2effad1c21977a4650845643da4518653277e473ee87001d468140cbc11f","observation_id":"05ead59c-65db-4556-828f-f0ae6a75cf55","resolution":{"observed_at":"2026-08-14T14:32:16.925122Z","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-14T14:32:16.701730Z","title":"Available: https://qwen.ai/blog?id=qwen3.5","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:16.701730Z"},"links":{"citing_paper":"/paper/2608.13292"},"observation_digest":"sha256:833df4905b680721ba22c8b5bb50ee17bda788c21e86666e25dc3badd0e67e05","observation_id":"4dfd00df-aecd-4d51-b2fe-e2117273386a","resolution":{"observed_at":"2026-08-14T14:32:16.701730Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.13292","last_updated":"2026-08-13T14:25:50Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-16T23:12:43.034161Z","submitted_at":"2026-08-13T14:25:50Z","title":"Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair"},"reference_resolution":{"displayed":89,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":45,"verified_exact":6,"verified_fuzzy":38},"total_outbound_references":89},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 89 of 89 outbound references and 0 inbound Pith citation observations for arXiv:2608.13292."}