{"as_of":"2026-08-20T16:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:485f26ccc4e71af28b5cda6a0bb2682825960187bf6637c10ba7a0ec4563d325","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T11:19:19.139802Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:47:40.928624Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-18T00:05:31.585413Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.22853","snapshot_observed_at":"2026-08-06T20:47:40.928624Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.01827","last_updated":"2026-07-06T16:39:03Z","snapshot_observed_at":"2026-08-18T09:35:39.018775Z","submitted_at":"2025-07-02T15:44:12Z","title":"PSearch: Search-based Patch Generation in the Era of LLM-based Automated Program Repair","version":5},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T20:47:40.928624Z"},"links":{"cited_paper":"/paper/2507.22853","citing_paper":"/paper/2507.01827"},"observation_digest":"sha256:66b1f32e631ac525e7e496544ac1b1fa37144b40d0042c482c045a590bdefc81","observation_id":"e0975b49-1dbc-4440-89df-0b80ec4e932f","resolution":{"observed_at":"2026-08-06T20:47:40.928624Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"cited_work":{"arxiv_id":"2507.22853","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.22853","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Repair-r1: Better test before repair","venue":null,"work_id":"6f6e6db7-5788-4129-93b4-91fa2b76245b","year":2025},"citing_paper":{"arxiv_id":"2509.08827","last_updated":"2025-10-09T17:08:52Z","snapshot_observed_at":"2026-08-06T15:38:05.011922Z","submitted_at":"2025-09-10T17:59:43Z","title":"A Survey of Reinforcement Learning for Large Reasoning Models","version":3},"reference_index":199,"source":"arxiv_source","source_observed_at":"2026-05-18T00:02:24.352947Z"},"links":{"cited_paper":"/paper/2507.22853","citing_paper":"/paper/2509.08827"},"observation_digest":"sha256:d22283e5e984e4a298011c59fd4c466bfa9e1acd9d20fb39b270813bc91730d1","observation_id":"6488f2bb-2f49-421e-a211-61a1c7ae36ea","resolution":{"observed_at":"2026-05-18T00:05:31.587380Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.22853","snapshot_observed_at":"2026-08-02T20:17:26.833019Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.23647","last_updated":"2026-05-25T07:42:24Z","snapshot_observed_at":"2026-08-19T02:30:10.705997Z","submitted_at":"2026-02-27T03:32:47Z","title":"SGAgent: Suggestion-Guided LLM-Based Multi-Agent Framework for Repository-Level Software Repair","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T20:17:26.833019Z"},"links":{"cited_paper":"/paper/2507.22853","citing_paper":"/paper/2602.23647"},"observation_digest":"sha256:9c6cfe4fadac4346d58c37b3b3b1d1804832e3fa6a28e0c1c9747a46b4c175e8","observation_id":"c1a4049f-eeb9-4df3-a03b-df58b37ca190","resolution":{"observed_at":"2026-08-02T20:17:26.833019Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.22853","snapshot_observed_at":"2026-08-01T12:46:59.497253Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26591","last_updated":"2026-07-29T08:13:12Z","snapshot_observed_at":"2026-08-18T15:31:03.052468Z","submitted_at":"2026-07-29T08:13:12Z","title":"MultiFixer: A Coordinator-Proposer Based Multi-Agent Framework For Fixing Multi-Hunk Bugs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T12:46:59.497253Z"},"links":{"cited_paper":"/paper/2507.22853","citing_paper":"/paper/2607.26591"},"observation_digest":"sha256:7d26b5bee17c733738fd5e738dde30d5b3c55bc2d2bfa11e5a3d4fa9a8ee13cc","observation_id":"2be00d61-008c-4440-9e57-f39c29251233","resolution":{"observed_at":"2026-08-01T12:46:59.497253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.22853/citation-record","integrity":"/paper/2507.22853/integrity","json":"/paper/2507.22853/citation-record.json","paper":"/paper/2507.22853"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:19:22.828739Z","title":"Genprog: A generic method for automatic software repair,","venue":null,"work_id":"b237c5c4-d145-4210-86bc-54289a1b6732","year":2011},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:16.781704Z"},"links":{"citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:d83c01c3f74012eb530c7ad096e89bd249c2bb34aae1006db16fbc581a8c52f1","observation_id":"a199c762-cbb9-415a-a7e5-ad6d87f0a7f3","resolution":{"observed_at":"2026-08-06T11:19:22.902874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06T11:19:22.652362Z","title":"Astor: A program repair library for java,","venue":null,"work_id":"4a510d26-a333-41b6-9bba-d3c1a015b8cb","year":2016},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:16.842108Z"},"links":{"citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:58e779aaa11fde4ee6db38e47db8b26103adb9d20d86455065feb84239c2b415","observation_id":"8a89affe-4ae9-4fe6-84e1-000484dfc2d4","resolution":{"observed_at":"2026-08-06T11:19:22.752348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06T11:19:22.482946Z","title":"Arja: Automated repair of java programs via multi-objective genetic programming,","venue":null,"work_id":"4ded8dd2-467b-4574-a495-b508444c77a5","year":2018},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:16.919366Z"},"links":{"citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:de62116b4aafdb6c3541181515ec762a1f512ef01c6c31066c007757ce46c062","observation_id":"cd77bafd-c042-42cd-893d-c363dd936ffd","resolution":{"observed_at":"2026-08-06T11:19:22.570796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06T11:19:22.318745Z","title":"Dynamoth: dynamic code synthesis for automatic program repair,","venue":null,"work_id":"6165595e-3c36-45dc-9ace-893d1ceaaacf","year":2016},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:16.977604Z"},"links":{"citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:ee191ea27368b84407545cd58fac1b2c9b949fa3778e72bb3a2d49c4842db5a4","observation_id":"5c7b7a9e-4785-4103-9aa6-c38054b85c3f","resolution":{"observed_at":"2026-08-06T11:19:22.394565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06T11:19:22.095090Z","title":"Ultra-large repair search space with automatically mined templates: The cardumen mode of astor,","venue":null,"work_id":"3fd24be3-b68c-481d-a21e-79cc584d95e7","year":2018},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:17.060925Z"},"links":{"citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:d17fc446c0fda75b4970996a6d583228ffe3ccfca611989cd243f6872f86968b","observation_id":"52f7d33a-70c9-451e-bca5-c7cffe0786ff","resolution":{"observed_at":"2026-08-06T11:19:22.231044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06T11:19:21.887850Z","title":"Angelix: Scalable multiline program patch synthesis via symbolic analysis,","venue":null,"work_id":"9c91f9e5-dda4-4469-bbd4-f6a7d8a19f58","year":2016},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:17.161015Z"},"links":{"citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:c8adc60549e18f38de84684e6b120342828c17c176c5b210c4bccda084bb2fbe","observation_id":"e17b5622-e857-4fd6-b89f-5cd298482c29","resolution":{"observed_at":"2026-08-06T11:19:21.982657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06T11:19:21.685261Z","title":"Tbar: Revisiting template-based automated program repair,","venue":null,"work_id":"628b1e3b-9f3c-4dc6-9fc3-188790c2278d","year":2019},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:17.270580Z"},"links":{"citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:d53264285b68867f631122be542a65ba7f006e50f1730bc7c638719aedd071be","observation_id":"75b7781d-1b11-4ed6-beaa-8a611fae3d8e","resolution":{"observed_at":"2026-08-06T11:19:21.770665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06T11:19:21.437402Z","title":"Gamma: Revisiting template-based automated program repair via mask prediction,","venue":null,"work_id":"f528d30b-b5a6-44df-809d-831aadb6b7f3","year":2023},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:17.371655Z"},"links":{"citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:a7bc2cdcce55d2947c96e0b5b5fd1882e3ab8d41c7a4e50d1b69aa867dea05ee","observation_id":"4ba31a51-807d-41aa-a828-5b089cd65ad9","resolution":{"observed_at":"2026-08-06T11:19:21.551897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06T11:19:21.218975Z","title":"Template-based neural program repair,","venue":null,"work_id":"d874696b-091d-477b-8810-bbaaf5af3095","year":2023},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:17.483582Z"},"links":{"citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:af8d9fd9d43dcd4e7aa5de0619179f157e52809cfd5cf06ac885577487a775ac","observation_id":"8e7fc963-78e3-4212-8d88-32aa447a074e","resolution":{"observed_at":"2026-08-06T11:19:21.324113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06T11:19:21.053406Z","title":"Tare: Type-aware neural program repair,","venue":null,"work_id":"0a7a49f1-a013-44bc-8ed8-cbb9d01e3407","year":2023},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:17.589558Z"},"links":{"citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:ff79b5ccdcadb6e65a039d0aeaf32b5ba5c596a9b2ccb562cc2986c7c55b7b04","observation_id":"3a104a01-6e83-4310-8a02-5024dab3c42d","resolution":{"observed_at":"2026-08-06T11:19:21.147690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06T11:19:20.873454Z","title":"Selfapr: Self-supervised program repair with test execution diagnostics,","venue":null,"work_id":"376f8189-b09d-4602-ac05-32ac4cb32c8d","year":2022},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:17.737146Z"},"links":{"citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:967ebed938ef25dd5d64d1455ba2a6a1246eab98192a167a4de743e905f4d36d","observation_id":"5af3a147-6957-4832-ba23-142fa7f41c25","resolution":{"observed_at":"2026-08-06T11:19:20.972858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06T11:19:20.657509Z","title":"Neural program repair with execution-based backpropagation,","venue":null,"work_id":"209a0022-321c-4ac3-822e-71b66dbc93d8","year":2022},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:17.824070Z"},"links":{"citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:88683e5af0f5471c3d0af2815bfa9c6c31163196fd7397a8c6ff2ba396a6d963","observation_id":"5523367c-609d-48e6-adef-e678af738614","resolution":{"observed_at":"2026-08-06T11:19:20.761600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.17134","last_updated":"2024-10-28T17:33:27Z","snapshot_observed_at":"2026-08-14T17:55:53.344746Z","submitted_at":"2024-03-25T19:17:43Z","title":"RepairAgent: An Autonomous, LLM-Based Agent for Program Repair","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.17134","snapshot_observed_at":"2026-08-06T11:19:17.886917Z","title":"Repairagent: An autonomous, llm-based agent for program repair,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:17.886917Z"},"links":{"cited_paper":"/paper/2403.17134","citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:9a831ba8fbab1e345b3bfca749311e015a4508243672035538ab5ca038575a70","observation_id":"05b55e0d-9509-4c61-a7c0-7db25fad3349","resolution":{"observed_at":"2026-08-06T11:19:17.886917Z","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-06T11:19:20.446437Z","title":"The use of large language models for program repair,","venue":null,"work_id":"bac8236d-a3ca-45d4-a270-aa070be729c2","year":2025},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:17.983437Z"},"links":{"citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:eb3481a03c3cb0726119ffc51c120d02ae05843c4f115ca95fe4189c3bbafe3c","observation_id":"ac0b0b6d-669e-4251-8db4-e91efea47c84","resolution":{"observed_at":"2026-08-06T11:19:20.549273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06T11:19:20.249340Z","title":"Cref: An llm-based conversational software repair framework for programming tutors,","venue":null,"work_id":"a59ae87b-b081-45a2-a44c-e3e9b64fac6a","year":2024},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:18.090662Z"},"links":{"citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:2c5a6d653a517ca8a1e52b68532188e1546bdcb42cd98464dd86d66e2174ad77","observation_id":"44658d79-2803-4cc2-8529-98d548be9d53","resolution":{"observed_at":"2026-08-06T11:19:20.332747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06T11:19:18.206344Z","title":"Proximal policy optimization algorithms,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:18.206344Z"},"links":{"citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:a9d2ecffa6aa1e55dd55f57057864280019ecb423db5875102a2dc9fc383159b","observation_id":"345891d4-5b6e-4e84-9b42-561f881be336","resolution":{"observed_at":"2026-08-06T11:19:18.206344Z","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-06T11:19:20.028917Z","title":"Direct preference optimization: Your language model is secretly a reward model,","venue":null,"work_id":"e3e4d57d-a6a3-4eb1-8ff0-8909d47c76b0","year":2023},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:18.432840Z"},"links":{"citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:2f8841b8d169dafedfb760017bf498891cfced79cc0718162b829487560cf30d","observation_id":"490067f7-478e-400d-9ca6-001c3d75108b","resolution":{"observed_at":"2026-08-06T11:19:20.121446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06T11:19:19.805356Z","title":"Ipo: Interior-point policy optimization under constraints,","venue":null,"work_id":"af130b97-7c3b-43f1-b14d-0b1eef0e6c45","year":2020},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:18.542598Z"},"links":{"citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:bac5b2b9b1ecd11647d447429cd9ab3705ba9213e3d855b19274f2badc7000c8","observation_id":"0d6bb3ca-6cc4-4c4b-800c-ffd9954d2817","resolution":{"observed_at":"2026-08-06T11:19:19.910010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19320","last_updated":"2025-02-19T00:51:58Z","snapshot_observed_at":"2026-08-16T13:48:04.333875Z","submitted_at":"2024-05-29T17:51:42Z","title":"Value-Incentivized Preference Optimization: A Unified Approach to Online and Offline RLHF","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19320","snapshot_observed_at":"2026-08-06T11:19:18.634929Z","title":"Value-incentivized preference optimization: A unified approach to online and offline rlhf,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:18.634929Z"},"links":{"cited_paper":"/paper/2405.19320","citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:b4903fe8b0d235012c4095de11da9a3b0a433cde8dd33e40183c6f0743f807b0","observation_id":"f9f262f0-58d7-494c-8200-72c7355dd70b","resolution":{"observed_at":"2026-08-06T11:19:18.634929Z","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-06T11:19:19.592075Z","title":"Simpo: Simple preference optimization with a reference-free reward,","venue":null,"work_id":"5863e222-2450-4c52-b2b1-245cbaf09f40","year":2024},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:18.751118Z"},"links":{"citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:c9f881c2c4a48756ee06a5d648ca941e02f9c86a10cf5fcdb9289caebe7753bf","observation_id":"f298e7cd-cd69-4925-9312-484e11b308dc","resolution":{"observed_at":"2026-08-06T11:19:19.697371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-06T11:19:18.825129Z","title":"Deepseekmath: Pushing the limits of mathematical reasoning in open language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:18.825129Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:bbbfde9100bdd55f7f0fe26bd80f172479e13ef7b7971283c3c357b811792d13","observation_id":"18fa8a76-57e0-42cc-82dc-49c10b145e9e","resolution":{"observed_at":"2026-08-06T11:19:18.825129Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-08-15T12:33:55.451951Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-06T11:19:18.936618Z","title":"Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:18.936618Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:90124e8c030913ffa28e4ad66d0dae87b4bdc10a1349f282fdcf5f22883f11c4","observation_id":"e5fc9624-2c72-4fad-a813-8f70d0691d16","resolution":{"observed_at":"2026-08-06T11:19:18.936618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01391","last_updated":"2024-02-05T13:28:23Z","snapshot_observed_at":"2026-08-17T14:37:36.214810Z","submitted_at":"2024-02-02T13:14:31Z","title":"StepCoder: Improve Code Generation with Reinforcement Learning from Compiler Feedback","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01391","snapshot_observed_at":"2026-08-06T11:19:19.040967Z","title":"Stepcoder: Improve code generation with reinforcement learning from compiler feedback,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:19.040967Z"},"links":{"cited_paper":"/paper/2402.01391","citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:217bd43458f55d5eb539ca90aea62c053649b2c7de06711c75511d2bdf544b2a","observation_id":"1182d1ba-ef9a-4b20-a296-7ae0aea84ed5","resolution":{"observed_at":"2026-08-06T11:19:19.040967Z","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-06T11:19:19.380379Z","title":"Acecoder: An effective prompting technique specialized in code generation,","venue":null,"work_id":"7dc33fce-1592-4e2a-8dda-630c83badb4b","year":2024},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:19.139802Z"},"links":{"citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:7d8805a08cf23ec6a369b9a09535d4693cde7a538ba7761c1d831ff93ebc2498","observation_id":"1a8a03fd-b400-4cea-8f6a-0001cbb12cca","resolution":{"observed_at":"2026-08-06T11:19:19.483018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-20T07:04:06.309989Z","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-06T11:19:18.304877Z","title":"Available: https://arxiv.org/abs/1707.06347","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:18.304877Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2507.22853"},"observation_digest":"sha256:06387ca121ab77ecbeb3a7e2c4f364a9d17e94ea66f836554790287248450d80","observation_id":"9be744dc-8a31-4b23-9d8c-ec712b3a0824","resolution":{"observed_at":"2026-08-06T11:19:18.304877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.22853","last_updated":"2025-07-30T17:24:05Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-17T19:15:32.678870Z","submitted_at":"2025-07-30T17:24:05Z","title":"Repair-R1: Better Test Before Repair"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":18},"total_outbound_references":25},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 4 inbound Pith citation observations for arXiv:2507.22853."}