{"as_of":"2026-08-21T15:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:06c1e5eef292d1be603f770bd5474cdbdbc9b1245aa8170400beda743a824dad","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T02:29:39.697273Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2607.29658/citation-record","integrity":"/paper/2607.29658/integrity","json":"/paper/2607.29658/citation-record.json","paper":"/paper/2607.29658"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/359511","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T02:33:36.404855Z","title":"Characteristics of applications software maintenance,","venue":null,"work_id":"c2b7b1d4-b2da-449c-889b-9b7d8d163b1b","year":1978},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:36.445047Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:2d631617adc44e62e793cd7c24367ff3b16f82792f2d443748551314a37ef6a0","observation_id":"30a497f8-4d4b-47fc-8819-19986eaf6829","resolution":{"observed_at":"2026-08-03T02:33:36.543854Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-10T19:38:14.701302+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-10T19:38:14.701302+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/icse.2015.101","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An empirical study on real bug fixes,","venue":"2015 IEEE/ACM 37th IEEE International Conference on Software Engineering","work_id":"ea2825ec-ae69-40d6-b66f-03b72e5cc811","year":2015},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:36.553079Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:8fbe5240da691315bace3976ed5529cd2b51518d33a316fddf7c4cf66e0cad35","observation_id":"811b8858-b5cc-4738-856e-5297fef9b507","resolution":{"observed_at":"2026-08-03T02:33:36.394574Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-10T19:38:14.777265+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-10T19:38:14.777265+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+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-03T02:29:36.657331Z","title":"Stratified case-based reasoning in non-refinable abstraction hierarchies,","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:36.657331Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:b5713ad94a2aa77a5743ef45ff7c4c1103b990cc09981b71f5e2af20d82b8339","observation_id":"3df680ef-d4ce-479b-ac7d-338b81197d4d","resolution":{"observed_at":"2026-08-03T02:29:36.657331Z","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-03T02:29:36.840337Z","title":"Case-based reasoning: Foundational issues, methodological variations, and system approaches,","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:36.840337Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:788eea4615d53ac359236ef62cfc04b7c7dfe88ddabc04bb49635acff43e99dc","observation_id":"df052f77-529f-41ba-977b-fc9ade069cb2","resolution":{"observed_at":"2026-08-03T02:29:36.840337Z","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-03T02:29:36.921367Z","title":"Swe-agent: Agent-computer interfaces enable automated software engineering,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:36.921367Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:66bdf388ca3028f3135a2239a6ee050339889fbfeee6838adadbd243686520a0","observation_id":"9773d48a-0d2b-446a-8bbf-080051192de8","resolution":{"observed_at":"2026-08-03T02:29:36.921367Z","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-03T02:29:37.025162Z","title":"Autocoderover: Autonomous program improvement,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:37.025162Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:7006e9f09dc99846274ebb8d4887d044a541cfda0201494a7d0523b238fcd6d9","observation_id":"66e31bd1-3374-4536-ad91-5c6bc625c6ea","resolution":{"observed_at":"2026-08-03T02:29:37.025162Z","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-03T02:29:37.112529Z","title":"Live-swe-agent: Can software engineering agents self-evolve on the fly?","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:37.112529Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:82d6a7b1903b55143daab6e273e82fafc5f2ee6e043c9455324bc85dddcbc533","observation_id":"64a7abe0-76bf-4ff1-91f6-01ddcd30e1c7","resolution":{"observed_at":"2026-08-03T02:29:37.112529Z","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-03T02:29:37.194827Z","title":"Introducing sonar foundation agent,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:37.194827Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:23ff6b6bf9d3558b1ca5816cf1146c63824169994f139d7ad33339d12816be4e","observation_id":"59376271-a661-4b0b-a637-48955a009038","resolution":{"observed_at":"2026-08-03T02:29:37.194827Z","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-03T02:29:37.303812Z","title":"Swe-exp: Experience-driven software issue resolution,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:37.303812Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:eeb4a6dce28de45b4b4bc3276cb21ddd20632586842c43aa9a80d8418135b0db","observation_id":"939d2004-fd6a-47b3-bac4-fa31657528e8","resolution":{"observed_at":"2026-08-03T02:29:37.303812Z","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-03T02:29:37.387093Z","title":"Lingxi: Repository-level issue resolution framework enhanced by procedural knowledge guided scaling,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:37.387093Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:3770abff4aba465e4f02883940feaa5873fc60a86f68785858ece5cb9687db13","observation_id":"b762edac-9a17-4d08-b85a-40b5a34f818d","resolution":{"observed_at":"2026-08-03T02:29:37.387093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10484","last_updated":"2026-05-08T02:51:21Z","snapshot_observed_at":"2026-08-12T14:16:57.275344Z","submitted_at":"2025-06-12T08:39:27Z","title":"EXPEREPAIR: Dual-Memory Enhanced LLM-based Repository-Level Program Repair","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10484","snapshot_observed_at":"2026-08-03T02:29:37.587520Z","title":"EXPEREPAIR: dual-memory enhanced llm-based repository-level program repair,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:37.587520Z"},"links":{"cited_paper":"/paper/2506.10484","citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:600f2f0b8131f947ffdc41d586d2b4204db1c7075842e8e28ad3361d724dbe63","observation_id":"82f77e21-b977-4538-904e-7a92a4c18290","resolution":{"observed_at":"2026-08-03T02:29:37.587520Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0004-3702(74)90026-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Planning in a hierarchy of abstraction spaces,","venue":"Artificial Intelligence","work_id":"b2564bf1-50e9-4c52-9fa9-0821c93c50fc","year":1974},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:37.681117Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:bd6cb5882496d6910d8fe872cee49775904dd9abab0067eb3a793312a595fdcc","observation_id":"cbc295d8-7a28-4079-a11f-98abceee11be","resolution":{"observed_at":"2026-08-03T02:33:36.039140Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-10T19:38:14.961459+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-10T19:38:14.961459+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+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-03T02:29:37.778123Z","title":"SWE-bench: Can language models resolve real- world github issues?","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:37.778123Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:36de71bf75b24f103afceacfe7d8a6a5c262d1a520bd10ffb6f36ecdc03fa8e5","observation_id":"00ae0410-9807-4b13-9fef-7c6c737c162f","resolution":{"observed_at":"2026-08-03T02:29:37.778123Z","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-03T02:29:37.864415Z","title":"Demystifying llm-based software engineering agents,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:37.864415Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:f1c78314b6ae3ad33e1305e16f036e604f350053ad68426ebe1229a8661da100","observation_id":"6cf0f1e8-0fd3-4c5b-b4a1-469d9735fe95","resolution":{"observed_at":"2026-08-03T02:29:37.864415Z","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-03T02:29:37.951836Z","title":"Openhands: An open platform for AI software developers as generalist agents,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:37.951836Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:ce4d2f91eafbe326b74a2caa4204fc9da1ec216b5c6c10fc4549e3b8760faa60","observation_id":"ea059251-7ba3-481d-8408-8022dae9121e","resolution":{"observed_at":"2026-08-03T02:29:37.951836Z","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-03T02:29:38.047478Z","title":"Prometheus: Towards long-horizon codebase navigation for repository-level problem solving,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:38.047478Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:f5e7f605ed20896b55cc8b2ea200a01b9dd998705dd12ed45e33d095bfcd78b3","observation_id":"68c2765a-798e-435c-b9f9-57d499867435","resolution":{"observed_at":"2026-08-03T02:29:38.047478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-03T02:29:38.203799Z","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":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:38.203799Z"},"links":{"cited_paper":"/paper/2507.23370","citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:44b668b52f2e849e88cc00df258155314f49b3061a39f42b4f977d617a94479b","observation_id":"d38a749f-16b9-4d3b-89f0-2e651fb6b4c5","resolution":{"observed_at":"2026-08-03T02:29:38.203799Z","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-03T02:29:38.267878Z","title":"Expel: LLM agents are experiential learners,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:38.267878Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:149beab853c871779ae67d315a62469f38e0ac57893ad14953db34380164d414","observation_id":"d2244843-b3f2-4261-8982-ca5a90d7cd30","resolution":{"observed_at":"2026-08-03T02:29:38.267878Z","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-03T02:29:38.131549Z","title":"Available: https://arxiv.org/abs/2507.19942","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:38.131549Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:9d982817923663046f97896718d450cd6c792e39a0c3f5d07a47fb9288b33bdb","observation_id":"05a9839f-8771-4006-9ce9-21aa25e845c4","resolution":{"observed_at":"2026-08-03T02:29:38.131549Z","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-03T02:29:38.468788Z","title":"Autoguide: Automated generation and selection of context-aware guidelines for large language model agents,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:38.468788Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:409c7f79a6febd20c7e8e100865f630e14bb2c1d20338573cd2414662534f7dd","observation_id":"8214b1ee-f3db-415e-af89-e195d2de9b9c","resolution":{"observed_at":"2026-08-03T02:29:38.468788Z","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-03T02:29:38.623881Z","title":"Agent workflow memory,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:38.623881Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:7c0aceb76d353a0a378bc84bca3c5157e827dc44ac326ab485255eee60d574d0","observation_id":"2aed3ddf-42d8-4019-803c-5b2dccbbe6d0","resolution":{"observed_at":"2026-08-03T02:29:38.623881Z","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-03T02:29:38.318539Z","title":"Reflexion: language agents with verbal reinforcement learning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:38.318539Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:0df0bbacd237cb6b167d2089bc2fa73392a036c375e65f63c933c3a2351880c3","observation_id":"8de0cc27-9bbf-483d-9f59-b5b6d7b0240c","resolution":{"observed_at":"2026-08-03T02:29:38.318539Z","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-03T02:29:38.769262Z","title":"Se-agent: Self-evolution trajectory optimization in multi-step reasoning with llm- based agents,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:38.769262Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:1278acffcabd837c01b88186598e749cde8e547e2dea05d1161c97b8540747e4","observation_id":"ff5ae78a-010f-46ae-a1f8-ee6265f70fc0","resolution":{"observed_at":"2026-08-03T02:29:38.769262Z","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-03T02:29:38.833206Z","title":"When agents go astray: Course-correcting SWE agents with prms,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:38.833206Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:9fb85735dc0c4d249067fdd2616f22e2e076d40e6ea3115b0e3e925a79f90cf4","observation_id":"e5e82c54-e90f-4bbb-af3c-ae5676ef1ce8","resolution":{"observed_at":"2026-08-03T02:29:38.833206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bfb0020600","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the role of abstraction in case-based reasoning,","venue":"Lecture notes in computer science","work_id":"99079076-04e9-418e-8491-6a254a5dba74","year":1996},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:38.887093Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:c53c6dded1f1e818ce9379fc91d9849c779203d817ae16c7f2a215e8b080d464","observation_id":"d3b350c0-0cd3-40f5-a6a7-f743e88e7a50","resolution":{"observed_at":"2026-08-03T02:33:35.842972Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-10T19:38:15.14311+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-10T19:38:15.14311+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+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-03T02:29:38.994924Z","title":"A critical review on the evaluation of automated program repair systems,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:38.994924Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:cc958e8606c88dd0213bd43c27268ab74641d4b536c7a47700a165d49b1dae37","observation_id":"319d4fe3-0306-4fef-ae95-d58c8e1330e6","resolution":{"observed_at":"2026-08-03T02:29:38.994924Z","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-03T02:29:38.706232Z","title":"Self-abstraction from grounded experience for plan-guided policy refinement,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:38.706232Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:2de849ca2177de515ef94e213b34e4e75b4e84a8a98a87fd5c2fa5b8bd748ee5","observation_id":"ed0e8977-402a-4a54-b7b1-d3a99a1c1877","resolution":{"observed_at":"2026-08-03T02:29:38.706232Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.03267","last_updated":"2026-05-01T23:55:43Z","snapshot_observed_at":"2026-08-15T00:17:32.875866Z","submitted_at":"2025-12-19T07:05:38Z","title":"OpenAI GPT-5 System Card","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.03267","snapshot_observed_at":"2026-08-03T02:29:39.145331Z","title":"Openai GPT-5 system card,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:39.145331Z"},"links":{"cited_paper":"/paper/2601.03267","citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:bdc31adfca872a02cbabe4bb266736c4727208186045a8ac25dd5edaf00e3282","observation_id":"c096ae6c-db13-4914-bd14-40d500b31b9b","resolution":{"observed_at":"2026-08-03T02:29:39.145331Z","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-03T02:29:39.330793Z","title":"Minimax m2.5,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:39.330793Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:79ef4e407b891fbf79b91e50195765ab8f2e07ea3082741e7f2390465cf67599","observation_id":"e9e7090f-401f-464a-8f1e-825f78a44e32","resolution":{"observed_at":"2026-08-03T02:29:39.330793Z","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-03T02:29:39.411274Z","title":"Langgraph,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:39.411274Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:d706063c62d341eae910e3d2cc30f559ea3cb732872e28985c0a3697140ee327","observation_id":"baba811d-0ad3-4c63-81cd-757a296433d7","resolution":{"observed_at":"2026-08-03T02:29:39.411274Z","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-03T02:29:39.489353Z","title":"A coefficient of agreement for nominal scales,","venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:39.489353Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:9c12ded137290716a56d41f56f25bb3490e1ea75cb7bb9988eb02f7f1e0290b1","observation_id":"4a79b4ff-f835-4f92-b586-0cd8fc9c33b5","resolution":{"observed_at":"2026-08-03T02:29:39.489353Z","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-03T02:29:39.075974Z","title":"Automated program repair,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:39.075974Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:33d03701268c4f04d1b08b2e83442751d0e489aaf734ed72e2bfa71f5202a7b5","observation_id":"26aac629-477a-4d35-b742-486f10984f41","resolution":{"observed_at":"2026-08-03T02:29:39.075974Z","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-03T02:29:39.619605Z","title":"Is the cure worse than the disease? overfitting in automated program repair,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:39.619605Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:6dbabd66b985195c92be8c48f1a8ace959eeb4547b5d12b4b409a5f9063e358d","observation_id":"1e386b57-1686-4436-a813-86077c882858","resolution":{"observed_at":"2026-08-03T02:29:39.619605Z","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-03T02:29:39.697273Z","title":"Overfitting in semantics-based automated program repair,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:39.697273Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:63599eead5aebf3ef5d40ef0a1656109bc2dd43097c5eea972d174d9bd86eea5","observation_id":"51613736-f6e4-4c4f-a2ea-f3f2f49a4592","resolution":{"observed_at":"2026-08-03T02:29:39.697273Z","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-03T02:29:39.544915Z","title":"The strength of random search on automated program repair,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:39.544915Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:c548ee7f57bac247dd38231093e2a0b7ce7dd4640ddfc43fe6bc0f46c69e235a","observation_id":"e5291bce-8d73-4a48-89c4-06d36904cc03","resolution":{"observed_at":"2026-08-03T02:29:39.544915Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-63233-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Lecture notes in computer science","work_id":"70d5608e-ce07-4c96-a3ce-17e0f642a011","year":1997},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":1266,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:36.763229Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:bf21bceb6f64cd2d4b5d54839db36aef1e3cceb59d1a8b31591f143493e228ef","observation_id":"66e8f967-ecde-4c69-95c6-05ab8ed05fc6","resolution":{"observed_at":"2026-08-03T02:33:36.223665Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-10T19:38:15.310475+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-10T19:38:15.310475+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+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-03T02:29:38.374456Z","title":"Available: http://papers.nips.cc/paper files/paper/2023/ hash/1b44b878bb782e6954cd888628510e90-Abstract-Conference.html","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:38.374456Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:e1f82b64ec8b503c090a12e4328934f1a1ed842dc00e7f16edf6c6092398c3bf","observation_id":"928af614-f20e-4689-a783-af3bad496117","resolution":{"observed_at":"2026-08-03T02:29:38.374456Z","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-03T02:29:38.559631Z","title":"Available: http://papers.nips.cc/paper files/paper/2024/ hash/d8efbb5dd415974eb095c3f06bff1f48-Abstract-Conference.html","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:38.559631Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:df8848c95244ad9800869553f3f6f4e9c833a70aca7bbfb332bd118af3180358","observation_id":"fde7d6e9-bc32-43fb-924c-1e2c0e85fc27","resolution":{"observed_at":"2026-08-03T02:29:38.559631Z","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-03T02:29:37.486777Z","title":"Available: https://doi.org/10.48550/arXiv.2510.11838","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:37.486777Z"},"links":{"citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:9b6f1a45099baa5f351ad815ac1b5cb27f1f0a654af762df3697158253f6dfc1","observation_id":"e4fdae03-f097-4e1e-9bff-c187e040829f","resolution":{"observed_at":"2026-08-03T02:29:37.486777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.03267","last_updated":"2026-05-01T23:55:43Z","snapshot_observed_at":"2026-08-15T00:17:32.875866Z","submitted_at":"2025-12-19T07:05:38Z","title":"OpenAI GPT-5 System Card","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.03267","snapshot_observed_at":"2026-08-03T02:29:39.217300Z","title":"Available: https://doi.org/10.48550/arXiv.2601.03267","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-03T02:29:39.217300Z"},"links":{"cited_paper":"/paper/2601.03267","citing_paper":"/paper/2607.29658"},"observation_digest":"sha256:4f3c91333130555016e47bd7d47fdfd5e788a4891ede319d0a94ce7d4f18822f","observation_id":"64f20590-5d8d-46a1-9f81-3a6e53e8d14d","resolution":{"observed_at":"2026-08-03T02:29:39.217300Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.29658","last_updated":"2026-07-31T17:38:48Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-17T04:59:04.940780Z","submitted_at":"2026-07-31T17:38:48Z","title":"Reusing Past Repairs Through Hierarchical Trajectory Abstraction for Coding Agents"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":35,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":40},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2607.29658."}