{"as_of":"2026-08-07T15:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f5dd1af8a7d6c26a3e36c4ba03ac6e1376472c87826e1d9bed2ac21a99df686c","coverage":[{"denominator":64,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":64,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-19T14:46:37.166185Z","state":"measured"},{"denominator":64,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":64,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2605.15425/citation-record","integrity":"/paper/2605.15425/integrity","json":"/paper/2605.15425/citation-record.json","paper":"/paper/2605.15425"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"30th USENIX Security Symposium (USENIX Security 21) , pages=","venue":null,"work_id":"23f94b87-69cd-4613-96c4-8d02e8ad6cce","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:287e5e5a588e089db7aeae2d81eb0508d907f40eb5f91c1409d67716e64c044d","observation_id":"64116748-fce0-4590-a5bb-e0587e866649","resolution":{"observed_at":"2026-05-19T14:47:36.543186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07646","last_updated":"2023-03-06T06:28:18Z","snapshot_observed_at":"2026-08-03T19:51:05.627063Z","submitted_at":"2022-02-15T18:48:31Z","title":"Quantifying Memorization Across Neural Language Models","version":3},"cited_work":{"arxiv_id":"2202.07646","doi":"10.48550/arxiv.2202.07646","metadata_source":"pith","pith_arxiv_id":"2202.07646","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantifying Memorization Across Neural Language Models","venue":"cs.LG","work_id":"35487ec1-b90b-4ace-95bd-1bce30064b2e","year":2022},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2202.07646","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:cd450b9c1d391004e335490b88cb2d03baca818499f50ed6cb04bc67e0f62918","observation_id":"18fb7783-e018-4bdd-939b-ca11a6ea271b","resolution":{"observed_at":"2026-05-19T14:47:36.190309Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.13382","last_updated":"2024-02-02T18:20:03Z","snapshot_observed_at":"2026-08-06T09:21:36.482811Z","submitted_at":"2023-12-20T19:13:26Z","title":"DSPy Assertions: Computational Constraints for Self-Refining Language Model Pipelines","version":2},"cited_work":{"arxiv_id":"2312.13382","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.13382","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"2312.13382 , archivePrefix=","venue":null,"work_id":"8e363b98-7d95-4d00-90a3-fc7e43376fa3","year":2024},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2312.13382","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:08de7de6d5dd427771150403581bc5ffaa08114b7eeaa79c7e43f31faf5796c4","observation_id":"0dda536c-49c3-4a63-a201-b40c62b5fee5","resolution":{"observed_at":"2026-05-19T14:47:36.132939Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"AIDev: A Large-Scale Dataset of Real-World","venue":null,"work_id":"857a80b8-3ad6-4d05-83f2-5bbc11e97ade","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:c4d712f479b6e80b5c0238ddcb8fd65c66dfe370cc59d83ca6851b0d11ada905","observation_id":"4da7f4aa-a441-4d78-bbf2-c8e03cb53e42","resolution":{"observed_at":"2026-05-19T14:47:36.466936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f4ef9998-570a-4251-8e51-d770fcb65a6a","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:b98124e04ccf2e40a93eb4d27dd2c2ea76c4a1640950cec1d9e7361167db26bf","observation_id":"adcb75cb-179b-4ce3-994d-82059c05bab1","resolution":{"observed_at":"2026-05-19T14:47:36.505173Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-08T15:05:03.675986Z","title":"Advances in Neural Information Processing Systems , year=","venue":null,"work_id":"06ece605-5cd2-4e88-b36a-f90069e7d7d6","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:397ae0444a4faea1f299831667f0388423ea848d0bb5768a4b3ea4c0f8393253","observation_id":"182d4cc8-0ed5-4874-be8c-acf19c051307","resolution":{"observed_at":"2026-05-19T14:47:36.491929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.08155","last_updated":"2023-10-03T20:47:10Z","snapshot_observed_at":"2026-07-31T19:03:03.494918Z","submitted_at":"2023-08-16T05:57:52Z","title":"AutoGen: Enabling Next-Gen LLM Applications via Multi-Agent Conversation","version":2},"cited_work":{"arxiv_id":"2308.08155","doi":"10.48550/arxiv.2308.08155","metadata_source":"pith","pith_arxiv_id":"2308.08155","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"AutoGen: Enabling Next-Gen LLM Applications via Multi-Agent Conversation","venue":"cs.AI","work_id":"92b7eb9c-c3d8-4518-a376-06fa15dd895b","year":2023},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2308.08155","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:eee5d254bd5b9a0dc0d5c3a6ed5aaa2710004cd81f2441ddaedfd90a87be734a","observation_id":"ab545314-a973-4270-9dc2-32160dcf0afa","resolution":{"observed_at":"2026-05-19T14:47:36.196689Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-07-14T18:20:20.607676+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T18:20:20.607676+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"2024 , howpublished=","venue":null,"work_id":"afabdfff-4633-4a34-8d87-6de21e6f15bb","year":2024},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:e1bd943e5e82fc504cfa4cbae5a4470b3fe76978ae4c9c116b52537a7826d0ff","observation_id":"754a4559-d235-43d1-b3bd-d8c2590aa465","resolution":{"observed_at":"2026-05-19T14:47:36.517987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06770","last_updated":"2024-11-11T23:05:04Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T16:47:29Z","title":"SWE-bench: Can Language Models Resolve Real-World GitHub Issues?","version":3},"cited_work":{"arxiv_id":"2310.06770","doi":"10.1145/512927.512945","metadata_source":"pith","pith_arxiv_id":"2310.06770","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"SWE-bench: Can Language Models Resolve Real-World GitHub Issues?","venue":"cs.CL","work_id":"d0effe15-a689-441a-8e3f-ea35f1c4e4b1","year":2023},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2310.06770","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:0b8aff5ff313c3466de672313099bc61312b453c15367dad5036160264404488","observation_id":"260c1077-c922-4e33-b465-1402865f8182","resolution":{"observed_at":"2026-05-19T14:47:36.151872Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"bd622bfc-3e79-49b3-9e8c-24923e2005ff","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:cf0fce3dd322ed904a8a50a97803518ee283c23271064cc9ea6aaabadc59d2e4","observation_id":"8708d0de-d2d6-4665-9c5e-0135c9bb02b5","resolution":{"observed_at":"2026-05-19T14:47:36.516241Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"488609ff-f200-47a6-921d-3c999590f131","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:2bea966170e8f76cf297dbeba5cf13441fd0ed8d0a20a384ea3048c0c28f6232","observation_id":"d68aa620-4899-480c-a535-37477eb28bce","resolution":{"observed_at":"2026-05-19T14:47:36.524009Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Advances in Neural Information Processing Systems , year =","venue":null,"work_id":"43693236-4e68-44bf-8dd0-22fc218e2f7a","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:0ab0cf60514aff17cc6ab598b33229bb3457950c16f2f3a824158d12c0b8cf56","observation_id":"b110fdd2-3817-4353-a118-cf83da80621a","resolution":{"observed_at":"2026-05-19T14:47:36.476659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.03688","last_updated":"2025-10-04T03:54:18Z","snapshot_observed_at":"2026-08-06T20:36:41.418114Z","submitted_at":"2023-08-07T16:08:11Z","title":"AgentBench: Evaluating LLMs as Agents","version":3},"cited_work":{"arxiv_id":"2308.03688","doi":"10.1109/fllm63129.2024.10852426","metadata_source":"pith","pith_arxiv_id":"2308.03688","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"AgentBench: Evaluating LLMs as Agents","venue":"cs.AI","work_id":"a37549b4-4c94-412d-acc4-4efeb08509be","year":2023},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2308.03688","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:ff3bfb984988ae5c0095c9a9020877bdc2c76daba566074b9505881a5a965b48","observation_id":"444ed167-8260-4ef8-a1b5-2a5f68ef1d04","resolution":{"observed_at":"2026-05-19T14:47:36.136528Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.13854","last_updated":"2024-04-16T15:13:18Z","snapshot_observed_at":"2026-08-06T12:47:01.809185Z","submitted_at":"2023-07-25T22:59:32Z","title":"WebArena: A Realistic Web Environment for Building Autonomous Agents","version":4},"cited_work":{"arxiv_id":"2307.13854","doi":"10.48550/arxiv.2307.13854","metadata_source":"pith","pith_arxiv_id":"2307.13854","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"WebArena: A Realistic Web Environment for Building Autonomous Agents","venue":"cs.AI","work_id":"7058ffd2-a339-4102-89eb-248eeb074652","year":2023},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2307.13854","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:98a18d6ae13c1e8f061df0d6f4672829838c369bad3d4cb983b93b48f672c7c1","observation_id":"58b1cb12-9b17-4a4a-8e26-0e8fd408a322","resolution":{"observed_at":"2026-05-19T14:47:36.159032Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-05-20T18:52:18.85917+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-20T18:52:18.85917+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.12983","last_updated":"2023-11-21T20:34:47Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-11-21T20:34:47Z","title":"GAIA: a benchmark for General AI Assistants","version":1},"cited_work":{"arxiv_id":"2311.12983","doi":"10.48550/arxiv.2311.12983","metadata_source":"pith","pith_arxiv_id":"2311.12983","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"GAIA: a benchmark for General AI Assistants","venue":"cs.CL","work_id":"cf222b33-f7a3-4044-a570-ecfe25edb3f8","year":2023},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2311.12983","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:502ceebf84be51c97bf3b3e9f2134ddfbd831004379f8b4c3ca18a33f1aab3b4","observation_id":"2991aa4e-5e90-47c2-81da-a7c2de94b070","resolution":{"observed_at":"2026-05-19T14:47:36.162241Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-05-20T18:52:17.222295+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-20T18:52:17.222295+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.04091","last_updated":"2023-05-26T07:06:48Z","snapshot_observed_at":"2026-07-06T15:24:07.662207Z","submitted_at":"2023-05-06T16:34:37Z","title":"Plan-and-Solve Prompting: Improving Zero-Shot Chain-of-Thought Reasoning by Large Language Models","version":3},"cited_work":{"arxiv_id":"2305.04091","doi":"10.48550/arxiv.2305.04091","metadata_source":"pith","pith_arxiv_id":"2305.04091","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Plan-and-Solve Prompting: Improving Zero-Shot Chain-of-Thought Reasoning by Large Language Models","venue":"cs.CL","work_id":"077c8bd4-de74-49bd-be87-4cb72bac1b73","year":2023},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2305.04091","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:f208fe3e128c123b3a3e58b47dc61e9afb0e6221bc6a00094a143ba7665717e2","observation_id":"0c65103c-87a6-4e30-925e-fe5a9429ce27","resolution":{"observed_at":"2026-05-19T14:47:36.199909Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.10625","last_updated":"2023-04-16T22:08:08Z","snapshot_observed_at":"2026-08-06T09:00:42.886249Z","submitted_at":"2022-05-21T15:34:53Z","title":"Least-to-Most Prompting Enables Complex Reasoning in Large Language Models","version":3},"cited_work":{"arxiv_id":"2205.10625","doi":"10.48550/arxiv.2205.10625","metadata_source":"pith","pith_arxiv_id":"2205.10625","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Least-to-Most Prompting Enables Complex Reasoning in Large Language Models","venue":"cs.AI","work_id":"7e58c111-4666-4996-b5ad-1c8efd433083","year":2022},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2205.10625","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:53c93a413ca2a6fde4df90b15e55b3110bf8df020786339fd163f68de6d10edc","observation_id":"747386b9-9d97-4efa-abe3-c0e212f1ef03","resolution":{"observed_at":"2026-05-19T14:47:36.148476Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.10601","last_updated":"2023-12-03T22:50:35Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-17T23:16:17Z","title":"Tree of Thoughts: Deliberate Problem Solving with Large Language Models","version":2},"cited_work":{"arxiv_id":"2305.10601","doi":"10.48550/arxiv.2305.10601","metadata_source":"pith","pith_arxiv_id":"2305.10601","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tree of Thoughts: Deliberate Problem Solving with Large Language Models","venue":"cs.CL","work_id":"07adb06e-4ed5-4ec5-a7ae-ff288fd214fb","year":2023},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2305.10601","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:d06a924cd4731301ae14bef5ae4339fa0b8c4df01e647ea490cdc320feff3eb7","observation_id":"d90c745e-d671-4bed-8e53-9bbb88f681ae","resolution":{"observed_at":"2026-05-19T14:47:36.205747Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-04T01:08:14.037057+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-04T01:08:14.037057+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":"2308.09687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-10T13:57:06.971993Z","title":"Besta, N","venue":"cs.CL","work_id":"34ed66c5-13ac-4799-b958-8e57d3de4705","year":2023},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:30ce3a10f312081c50c962a7192aab49c80025ae39cd165009c7434895070d61","observation_id":"090baeea-5d54-43bf-be3c-9f8658b97d03","resolution":{"observed_at":"2026-05-19T14:47:36.139789Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Findings of the Association for Computational Linguistics: NAACL 2024 , pages=","venue":null,"work_id":"05057dfa-2044-4de5-844f-c8350861060d","year":2024},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:d8075c1786e46b748b32db96c80eccc0cbc70d0e5d3ff4e8a3f41c549e5f3735","observation_id":"ab6b1d20-b19d-4e8d-a5c8-c8db5c5008ba","resolution":{"observed_at":"2026-05-19T14:47:36.531569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-10T07:06:52.912035Z","title":null,"venue":null,"work_id":"73874361-a387-4b1c-b96b-3d5ef79428a9","year":2024},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:27e3661aeb882b9e9d6697bef3a47200e4a1cdfcdec4fa83c87c6305f5506ac0","observation_id":"e439c0d1-3b6b-4beb-bd8a-13d1ce1edee9","resolution":{"observed_at":"2026-05-19T14:47:36.472907Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05352","last_updated":"2025-02-07T21:46:52Z","snapshot_observed_at":"2026-08-07T14:36:12.957209Z","submitted_at":"2025-02-07T21:46:52Z","title":"ITBench: Evaluating AI Agents across Diverse Real-World IT Automation Tasks","version":1},"cited_work":{"arxiv_id":"2502.05352","doi":"10.48550/arxiv.2502.05352","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.05352","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2502.05352 , year=","venue":"ArXiv.org","work_id":"cbb806e9-e9cb-466c-9a99-aaccc8617172","year":2025},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2502.05352","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:61585cf8d7bf9761bbbd0e9a0ccf3861969b9aa4e1a8ff185bc4b20d40509219","observation_id":"df8a5b55-37bf-49a0-8ef3-7ecabce42b99","resolution":{"observed_at":"2026-05-19T14:47:36.175763Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"2021 IEEE International Conference on Intelligence and Security Informatics (ISI) , pages=","venue":null,"work_id":"224c8fd9-0087-440f-92a0-dd1f771f431a","year":2021},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:da99a3d8c7546b11eb009ac762826f0ed33857a54b93b601047dc3e88c922f41","observation_id":"718ddf31-0fe3-4bfb-a466-45ba7f16f7f5","resolution":{"observed_at":"2026-05-19T14:47:36.497896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"2023 , note =","venue":null,"work_id":"d4a6fa0d-1fde-4221-a1d5-302078465a87","year":2023},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:586ebc15acdc0d27d6e4cdda5563705b9843bcad43664dcae466d36a62996a02","observation_id":"2431b84e-62d2-4f80-984a-36a918705bdc","resolution":{"observed_at":"2026-05-19T14:47:36.484172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":"6699cd07-44be-463c-bed6-bd9ce2be1a0a","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:2fd566f11ae7afef4c4b7564285ad3ca71c1f8f9d6d69d8d8f12accdd9d9febf","observation_id":"64d8a1cf-7949-4c5c-a6b6-0853383d0f79","resolution":{"observed_at":"2026-05-19T14:47:36.499685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"IJCAI 2001 workshop on empirical methods in artificial intelligence , volume=","venue":null,"work_id":"831f4374-21b1-4558-ae48-a48b23762ba4","year":2001},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:53e91c0e6413edbff31c4c5a40c4872f55ae82d923f042752168e2d5bffc3bd4","observation_id":"2241e1ae-8aa3-43a0-8050-ce0bf9dafab2","resolution":{"observed_at":"2026-05-19T14:47:36.537729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"2002 , publisher=","venue":null,"work_id":"fd4ed0ac-fc47-42a1-9f89-c90317e6463b","year":2002},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:519bcd5464563e6cc426f7e2954ad8322721e82fe9c2b98663d3d82e98a48935","observation_id":"fb39ccf7-9510-4e00-a2a0-d63c08c0c7db","resolution":{"observed_at":"2026-05-19T14:47:36.527700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"The Semantic Web--ISWC 2016: 15th International Semantic Web Conference, Kobe, Japan, October 17--21, 2016, Proceedings, Part II 15 , pages=","venue":null,"work_id":"45d514e2-9a8c-4f9c-896f-c06bb3f6841a","year":2016},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:72dabc1468f05e1ca14f0ea74b227b5f32b4bf3377d23da9ccfd2093f3829703","observation_id":"0c7331ed-3f21-4ea9-a3b5-ad51b2d5b068","resolution":{"observed_at":"2026-05-19T14:47:36.514495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Journal of big Data , volume=","venue":null,"work_id":"f20b3e0d-ce88-48f4-86c0-c30a7e281668","year":2021},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:45168114d88b8e27f476f2ed0cd6a103b329da4f00d4723aef68744488b49333","observation_id":"3e3e0a50-8f7c-4bb7-b729-eff36039f5d2","resolution":{"observed_at":"2026-05-19T14:47:36.510957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2601.17915","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2601.17915 , year=","venue":null,"work_id":"cff02fc3-17bf-4d14-8474-0dcf25c60cc1","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:fa2d63974509d14a3891df392ef8f2380100fd270d782a164cf1ede503563223","observation_id":"33edfcaf-3359-4e6f-be39-1e9653a74884","resolution":{"observed_at":"2026-05-19T14:47:36.178613Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Machine learning models and algorithms for big data classification: thinking with examples for effective learning , pages=","venue":null,"work_id":"a099bc30-0a43-41cb-8847-4a1b18101667","year":2016},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:957385329a2313d2caf48b3419c4dd3ee91c9bb29e2d1fe735a5e9e554711bb1","observation_id":"4152185c-abe4-4996-9925-59d9b4142397","resolution":{"observed_at":"2026-05-19T14:47:36.520201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Proceedings of the 16th ACM Workshop on Artificial Intelligence and Security , pages=","venue":null,"work_id":"1bad67fd-494b-4fab-9d62-3426193c7d49","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:48ec2d73ef311e13e399d140351912f8bcfc0765852e4db51754b49e4c1e383a","observation_id":"d94d639a-fbdc-4d83-bb80-240c8f4755bf","resolution":{"observed_at":"2026-05-19T14:47:36.509009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers) , pages=","venue":null,"work_id":"3a16be80-8827-472e-bc30-828ed6f5e93e","year":2024},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:3eea68c734f1434f6a58ccc4ce759d542e42c7692d9bec3b6bb2e66f833a5666","observation_id":"89bf85d9-50df-4172-8b48-4be9cb8716bc","resolution":{"observed_at":"2026-05-19T14:47:36.545916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14965","last_updated":"2024-03-27T04:38:44Z","snapshot_observed_at":"2026-08-07T01:32:47.981682Z","submitted_at":"2023-05-24T09:57:37Z","title":"Tricking LLMs into Disobedience: Formalizing, Analyzing, and Detecting Jailbreaks","version":4},"cited_work":{"arxiv_id":"2305.14965","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.14965","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2305.14965 , year=","venue":null,"work_id":"2bbac0d6-1cdb-49c9-a176-4492a57910f7","year":2023},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2305.14965","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:fb2379392e8a3b92788ee5d956089aa687f9f47a9c8efa111d94e97912179625","observation_id":"2bc40bfc-1f66-47cd-8be2-7cc9e127de8f","resolution":{"observed_at":"2026-05-19T14:47:36.166070Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"International Conference on Detection of Intrusions and Malware, and Vulnerability Assessment , pages=","venue":null,"work_id":"2faef9c1-b7d4-48b2-b1ae-0435b3aee7bc","year":2023},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:3640c77aac09e89868a6e9337d230db1ef21079b427ec2c31dfe5f3b22ae22b7","observation_id":"eb7000f6-4370-4cea-8046-afeac17556c1","resolution":{"observed_at":"2026-05-19T14:47:36.493832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"2023 , note =","venue":null,"work_id":"577b21a6-4e98-46d2-bf45-cbf8cd96bbb1","year":2023},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:86972ed4527d77b1e67b2418a3c515ea033fa2a3616286e20a38778f7f13b97d","observation_id":"88bc2486-cd0d-4fc7-9128-b446acd04235","resolution":{"observed_at":"2026-05-19T14:47:36.470468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.16382","last_updated":"2024-04-15T22:34:22Z","snapshot_observed_at":"2026-08-06T16:59:42.471139Z","submitted_at":"2023-07-31T03:17:51Z","title":"Does fine-tuning GPT-3 with the OpenAI API leak personally-identifiable information?","version":3},"cited_work":{"arxiv_id":"2307.16382","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.16382","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2307.16382 , year=","venue":null,"work_id":"da5b34ad-ffc9-4941-98a0-043a26eac99c","year":2023},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2307.16382","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:dd1db2c6d292508d597676c1d6a3bc25a9893c2ed5c8f55db032612293a50891","observation_id":"0f542835-346a-4405-8a74-d29911d05d6a","resolution":{"observed_at":"2026-05-19T14:47:36.155604Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.08079","last_updated":"2023-06-08T18:33:01Z","snapshot_observed_at":"2026-07-06T11:48:27.995805Z","submitted_at":"2021-09-16T16:10:05Z","title":"Context-NER : Contextual Phrase Generation at Scale","version":4},"cited_work":{"arxiv_id":"2109.08079","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2109.08079","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2109.08079 , year=","venue":null,"work_id":"0d40e2e8-0c46-4361-a1cd-2cfb860d4b0e","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2109.08079","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:cd179795502c4997080f188f59942b4e067e15e4bfd507c8bf669e6f32bc8dcf","observation_id":"044b2491-4481-46b1-8f5b-460f475ce78e","resolution":{"observed_at":"2026-05-19T14:47:36.172572Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.11038","last_updated":"2023-05-26T05:44:00Z","snapshot_observed_at":"2026-08-04T01:24:21.120688Z","submitted_at":"2023-05-18T15:31:34Z","title":"Learning In-context Learning for Named Entity Recognition","version":3},"cited_work":{"arxiv_id":"2305.11038","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.11038","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2305.11038 , year=","venue":null,"work_id":"1ab04738-b525-4389-9bac-16e8e9f7b858","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2305.11038","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:e8d7aa8e68882418dbb1744178e57e39ad779cd6a2b76af961bb976af37907ed","observation_id":"62c63dcd-75d7-4eb8-a15e-822cc6e6e336","resolution":{"observed_at":"2026-05-19T14:47:36.184234Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.05624","last_updated":"2024-04-08T15:54:02Z","snapshot_observed_at":"2026-07-06T17:57:14.899058Z","submitted_at":"2024-04-08T15:54:02Z","title":"LTNER: Large Language Model Tagging for Named Entity Recognition with Contextualized Entity Marking","version":1},"cited_work":{"arxiv_id":"2404.05624","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.05624","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2404.05624 , year=","venue":null,"work_id":"886756e1-d382-4e73-9161-badb376e0fcb","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2404.05624","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:02c5eda13423ab4be5c0eabebf831b256c01621248559b4b8a0cbdc53c54ce13","observation_id":"7ecf00b8-b17c-4609-a6d5-c8483769e2f9","resolution":{"observed_at":"2026-05-19T14:47:36.187131Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.00388","last_updated":"2023-12-31T03:51:31Z","snapshot_observed_at":"2026-07-06T17:10:16.873073Z","submitted_at":"2023-12-31T03:51:31Z","title":"FusionMind -- Improving question and answering with external context fusion","version":1},"cited_work":{"arxiv_id":"2401.00388","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.00388","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2401.00388 , year=","venue":null,"work_id":"8d63e74d-4db0-4235-a613-7696ad91b9b3","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2401.00388","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:d748e0a9f3c0538fc6cf2fee9edc078cbdef15ed8fcdabf01f33834143fcd7bc","observation_id":"bfe3805a-5798-4a1c-947a-a50205d25d23","resolution":{"observed_at":"2026-05-19T14:47:36.181487Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Findings of the Association for Computational Linguistics: EMNLP 2023 , pages=","venue":null,"work_id":"6decaced-a510-49e5-97a0-fff5e425db01","year":2023},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:5a7248b6d28a8d1714d21983ec9c4805bee0492d9fd42bba556cf5320cc50cd4","observation_id":"a9617be4-080c-429a-b018-75154f7768bc","resolution":{"observed_at":"2026-05-19T14:47:36.512680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"2013 , organization=","venue":null,"work_id":"3d5dfbf6-ca68-46e0-b59f-464427bbf14d","year":2013},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:6f963a46553820723b2ab88128619b76ec61ae8cadad2b3c1f87e94975b39ede","observation_id":"d3d64422-a107-40ec-97fb-5b2b56a2e3a5","resolution":{"observed_at":"2026-05-19T14:47:36.535472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"87f63172-cc4a-437d-bbd4-e77c34333c3d","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:50b494b5e6ea014063b68c94f28c2d471c8c4f1c853da143ac49169388e558df","observation_id":"32ad0a05-0488-4eba-9fd2-b632451336f8","resolution":{"observed_at":"2026-05-19T14:47:36.489692Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9753aea9-0a07-4bdc-bbaa-e096d008afea","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:7d3943b018bb0e74472f2534e1156d73845820d4319d61b2d147c552616dbe98","observation_id":"031e6251-97d5-4f77-bfff-4772e8a34f99","resolution":{"observed_at":"2026-05-19T14:47:36.468724Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"fa98a451-cfd6-4264-971f-9fdf299d41bc","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:837281642bbb074e745af5ef67a4d29db2fba3981021231f217c16ca610c6bf8","observation_id":"0dd4181b-30ce-4c81-bf7d-8dfadfa72fc5","resolution":{"observed_at":"2026-05-19T14:47:36.485926Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"bf2d8790-6b2a-40a1-9c9f-d8cb2439f147","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:82d37c71552f8c0cb595aec93c989061f1170b1c0ffd1ad48ad5e81ab3080bab","observation_id":"3b49406b-5774-4736-a063-8e0d953de1b7","resolution":{"observed_at":"2026-05-19T14:47:36.525879Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f65bd87f-709a-4aec-8752-b85ce79cd277","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:0b289794350ba22cca65252ccc8ae297c84237581cda147c1699feb03015c49e","observation_id":"2e205559-070a-442c-b833-50a3c628000a","resolution":{"observed_at":"2026-05-19T14:47:36.506929Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"435a77f6-6f75-4111-8bad-8b8ec6bb06ea","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:e7fd895b3efa3421ed1d919b2d1c1fb6a7db3f49bdfcb923d6d6d0f4d2e59f45","observation_id":"c45743de-978c-4b57-bd4b-fa1b312f0bb9","resolution":{"observed_at":"2026-05-19T14:47:36.480212Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b603a448-1ac5-4d94-ac97-575cea6917e9","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:d4d12c84149c91aa9d524f2497ba9092dbc34f84d4729527f704768cb4a6f140","observation_id":"3c2f0461-ff4b-4f8b-b91b-54094e31957b","resolution":{"observed_at":"2026-05-19T14:47:36.496005Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d8a4c06f-18cf-40fb-8b67-0683d1432e27","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:a9212e881f4754d0b8fb4cb3f9250b7e6ce832017fead596177ea73376fe6817","observation_id":"dafaf6b2-1a2c-4067-82e1-033f946b8c91","resolution":{"observed_at":"2026-05-19T14:47:36.482385Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03329","last_updated":"2024-06-11T15:47:39Z","snapshot_observed_at":"2026-08-06T08:07:03.925239Z","submitted_at":"2024-03-05T21:19:06Z","title":"Guardrail Baselines for Unlearning in LLMs","version":3},"cited_work":{"arxiv_id":"2403.03329","doi":"10.48550/arxiv.2403.03329","metadata_source":"pith","pith_arxiv_id":"2403.03329","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Pratiksha Thaker, Yash Maurya, Shengyuan Hu, Zhiwei Steven Wu, and Virginia Smith","venue":"cs.CL","work_id":"5d4ea0c1-80ea-4135-abd2-a9b77f7d88fb","year":2024},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2403.03329","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:9035e4bdde23445ab6260fc0c0c92234cc0857983fe1a1c8491b0fb256a193ee","observation_id":"72259392-843a-4cdc-97c9-71e46027f285","resolution":{"observed_at":"2026-05-19T14:47:36.169649Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-05T07:10:46.907850Z","title":"2023 IEEE Symposium on Security and Privacy (SP) , pages=","venue":null,"work_id":"8297c1d4-194e-461a-983a-49ccb377e44e","year":2023},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:c59c59b6f0342a294a6fddb165ce4fc03aafeb56042a481af51708fe501f6854","observation_id":"0d521214-0f33-4fb3-805b-9a77cff88932","resolution":{"observed_at":"2026-05-19T14:47:36.478456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9a6c2ceb-748b-4a7e-a5df-06d8bebcfc37","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:332f96c96a396aa4296d99043282e4b7b28d93c7e2a23d7d06d6ab99ec77c114","observation_id":"03af7427-d41b-493d-b8ec-20dd75eb118a","resolution":{"observed_at":"2026-05-19T14:47:36.540896Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"NeurIPS , year=","venue":null,"work_id":"89e746c4-47c8-4422-99f9-48b206b154d0","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:1d87fabd2352b820f4b5dce6ca6884b9c1833cd3427a6e420e436569991197d7","observation_id":"1d573d08-a09b-4005-8e94-c591ac1cc3bb","resolution":{"observed_at":"2026-05-19T14:47:36.501664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"ICLR , year=","venue":null,"work_id":"62c05c00-005c-4194-8dbd-869bf94845f4","year":null},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:1449bcbe5bc8223fd462cda4a87f8f80075d5af7414d141bb905fe0b18015409","observation_id":"9fcc76f2-c754-48ee-9065-9d34dd25ca7d","resolution":{"observed_at":"2026-05-19T14:47:36.503410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"2024 , howpublished=","venue":null,"work_id":"ca79c9ae-724b-4f27-ae25-d14bc4555390","year":2024},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:54ac7eb9f10ed037954eec98b3fb6552bfbc8f695778217191ab8eff9ed81c77","observation_id":"2dcc9d0a-2784-4b1e-8425-0b1d96d9e098","resolution":{"observed_at":"2026-05-19T14:47:36.533343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"2024 , howpublished=","venue":null,"work_id":"0b730478-b6df-444a-8c6c-57624e0b7a7d","year":2024},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:4b8925b3d2b01a255158edbe577b1abf153a37c90fc2275c5027d88d0bd16649","observation_id":"9255ebaa-d57f-4c0d-aa05-d6e4d87b632d","resolution":{"observed_at":"2026-05-19T14:47:36.487860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"2024 , howpublished=","venue":null,"work_id":"5bff742a-1a63-4605-9873-3a73e56e6a66","year":2024},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:68908160846111d62f71afd3ade2c803fee1e89e27dcf21c5af5ca0a3f0cee74","observation_id":"c38130fd-d63e-4a73-8d4d-34acc9bc5843","resolution":{"observed_at":"2026-05-19T14:47:36.474719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03714","last_updated":"2023-10-05T17:37:25Z","snapshot_observed_at":"2026-08-04T05:21:05.846165Z","submitted_at":"2023-10-05T17:37:25Z","title":"DSPy: Compiling Declarative Language Model Calls into Self-Improving Pipelines","version":1},"cited_work":{"arxiv_id":"2310.03714","doi":"10.48550/arxiv.2310.03714","metadata_source":"pith","pith_arxiv_id":"2310.03714","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DSPy: Compiling Declarative Language Model Calls into Self-Improving Pipelines","venue":"cs.CL","work_id":"d490f594-f5fc-47b0-ae6a-6550e50fe095","year":2023},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2310.03714","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:89eb1132de4b25c308ea50a6d35f322f0742d00d83516167a564e9f1ba9ae2c8","observation_id":"09caea6b-479e-40c7-afe8-50af8b95c32d","resolution":{"observed_at":"2026-05-19T14:47:36.193620Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"2024 , howpublished=","venue":null,"work_id":"b0b1195b-9a5f-4f27-9f05-a96655edc09e","year":2024},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:4956d641b3492607530dc0186000e1db7428dc16a235deeb34687abe83c43447","observation_id":"60588c33-5622-4375-aab7-930cc992c784","resolution":{"observed_at":"2026-05-19T14:47:36.529780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"2025 , howpublished=","venue":null,"work_id":"5a816149-ff6a-4e37-aa30-562302b9c035","year":2025},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:36e4a4bf8416e0fd0555307ba94151687d4a4ae0ebd96fa3d4decadadaa79e68","observation_id":"1d8f27e0-ddd5-49d7-ad10-0669d6ba49a1","resolution":{"observed_at":"2026-05-19T14:47:36.521898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.11903","last_updated":"2023-01-10T23:07:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-01-28T02:33:07Z","title":"Chain-of-Thought Prompting Elicits Reasoning in Large Language Models","version":6},"cited_work":{"arxiv_id":"2201.11903","doi":"10.48550/arxiv.2201.11903","metadata_source":"pith","pith_arxiv_id":"2201.11903","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Chain-of-Thought Prompting Elicits Reasoning in Large Language Models","venue":"cs.CL","work_id":"d1cf6693-a082-403c-ada9-dac7b96341f9","year":2022},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2201.11903","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:2f725be50c957b2131a27e51c1f4d0eaa6766830dc454e56ca68ef8f1e3c6875","observation_id":"0dd0843d-2971-49d6-9c95-c4d36d50bf0a","resolution":{"observed_at":"2026-05-19T14:47:36.142963Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-04T01:08:13.648188+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-04T01:08:13.648188+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.03629","last_updated":"2023-03-10T01:00:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-10-06T01:00:32Z","title":"ReAct: Synergizing Reasoning and Acting in Language Models","version":3},"cited_work":{"arxiv_id":"2210.03629","doi":"10.48550/arxiv.2210.03629","metadata_source":"pith","pith_arxiv_id":"2210.03629","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ReAct: Synergizing Reasoning and Acting in Language Models","venue":"cs.CL","work_id":"407a2351-25f1-497d-b611-f77d0292a8e6","year":2022},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2210.03629","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:082d3fc500a68cce453e8a3cd0ca93f51f65127d544c7ce26f015561067db597","observation_id":"17ccc214-6280-4ce3-92c1-84003fc6bd84","resolution":{"observed_at":"2026-05-19T14:47:36.202879Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-07-12T03:19:36.897515+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T03:19:36.897515+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems"},"reference_resolution":{"displayed":64,"state_counts":{"malformed_identifier":0,"metadata_mismatch":14,"parse_uncertain":1,"unresolved":12,"verified_exact":9,"verified_fuzzy":28},"total_outbound_references":64},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 64 of 64 outbound references and 0 inbound Pith citation observations for arXiv:2605.15425."}