{"as_of":"2026-08-08T09:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6e0ee0a224644a6bd05dd63423a2d5b0544c48c7b0856b77913cd582c935ae35","coverage":[{"denominator":81,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":81,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T17:43:24.820773Z","state":"measured"},{"denominator":81,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":81,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2606.00981/citation-record","integrity":"/paper/2606.00981/integrity","json":"/paper/2606.00981/citation-record.json","paper":"/paper/2606.00981"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"In2025 IEEE International Conference on Robotics and Automation (ICRA), pages 11957– 11964","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:c0a5de73a58039bff74569abe76b3d051e2c88d617cc1ed058a48c0cc6570783","observation_id":"65ff925b-56e0-4490-9f1b-e49c80d5c7ef","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2505.14763","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T19:30:07.000619Z","title":"Unifying inference-time planning language generation","venue":null,"work_id":"c61a3b58-b3a9-4971-ad93-e63633b12389","year":2025},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:24882475e81844974990eef0a8acf6e86cf27b7c9e1045014264736c05564403","observation_id":"626a0cb5-42ca-430b-a518-efe721156951","resolution":{"observed_at":"2026-07-01T20:46:14.063919Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"InProceedings of the IEEE conference on computer vision and pattern recognition, pages 8494–8502","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:9bc66b12aee494f229775e790dccf84b1568149ce0eed5f81d6da5cc61367752","observation_id":"63c87881-8d7d-4a6c-9008-22325f0d085f","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"Tom Silver, Soham Dan, Kavitha Srinivas, Joshua B Tenenbaum, Leslie Kaelbling, and Michael Katz","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:a16d0b1247a92b6d18811725951c9a3c2d7a032b2a34ebaced55db080a3b1a76","observation_id":"ce415fc9-e08f-49ad-9d1c-6ce912da4735","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"InProceedings of the AAAI Conference on Artificial Intelligence, volume 38, pages 20256–20264","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:9d07b178b4e9a3f41af62ad64ab94326a1b88074163fa8740ca07dd85b1e3856","observation_id":"e7a785a5-06b7-4210-b2fb-3ef780883544","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.13373","last_updated":"2024-09-20T10:20:46Z","snapshot_observed_at":"2026-07-06T19:18:41.002837Z","submitted_at":"2024-09-20T10:20:46Z","title":"LLMs Still Can't Plan; Can LRMs? A Preliminary Evaluation of OpenAI's o1 on PlanBench","version":1},"cited_work":{"arxiv_id":"2409.13373","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.13373","snapshot_observed_at":"2026-07-01T20:46:14.059699Z","title":"Valmeekam, K","venue":null,"work_id":"dd0d63fa-1380-4370-84f6-17c2dbe3c3ac","year":2025},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"cited_paper":"/paper/2409.13373","citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:0da3c1f38e32b9c5074e29b2b2a2a4f1a71a1de9b4f27544c473522eff62451e","observation_id":"d62170c4-c495-43ea-99d1-c0f787ed6409","resolution":{"observed_at":"2026-07-01T20:46:14.061633Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.01539","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-01T20:46:14.065089Z","title":"Executable counterfactuals: Improving llms’ causal reasoning through code","venue":null,"work_id":"f596d86b-c447-4c4f-af58-f8c106aee189","year":2024},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:b8140c18b0405ab81cb40681a229b006ffe7d8803f31885c8f7221158633388d","observation_id":"b9457933-5242-4dbf-a97d-1447ab97d110","resolution":{"observed_at":"2026-07-01T20:46:14.066932Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.11608","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-01T20:46:14.062738Z","title":"actions\": [..., {","venue":null,"work_id":"2a3b8fe3-4ac7-4751-b9d6-a156aad67756","year":2025},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:696ce774d07509405b5e1352ad9b1bb2d3d1569a38f5bb9fc9ee521cbe6a6441","observation_id":"ec137dfe-63e9-498b-9b0b-85f173cb9d25","resolution":{"observed_at":"2026-07-01T20:46:14.064080Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:309b035e0791250eef44d87235dbae0eb7892b2d5b662e7d5b7bdf65db239d03","observation_id":"b2f8fe9e-2764-4083-a105-eb536cb0dbb0","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"step1\",\"step2","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:f6dcd05f7ae3ed1e5ab2adfeefab20886fd208094208131d4f02e48737de8f7d","observation_id":"0471dd33-a2cc-446a-95b8-4e8cf12abe18","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:498f18bb12afbc4303681d9b03612ae45d675eae716938396c8cd566acc0988e","observation_id":"96738a8a-eab4-424a-aa2f-5d17ef0bfcb4","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"before\"is the step that must finish first","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:a67820d962899746c40f77b3cd34f2681cfa4eba333e0af35d367ec24b7ce87d","observation_id":"8be6f4ca-f392-4bc5-9869-5d22b7186531","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"Figure 8: Prompt template for Planner on AsyncHow and AsyncPlan-XXL","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:f223bf40d6522855903d755a5976ae70b00333a93743cdd939935e6f78c9ca16","observation_id":"eade1d26-0c3b-459f-87fc-664fdc81cd35","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:db271738d3b9a540f6bbcfbd263260d800cad432573d44ed42576a8c2962ec42","observation_id":"38b7de31-2870-46d5-a359-cf5125cd8647","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"Use positive _pending predicates in conditions, and delete them only in effects","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:0d7d7de18c0d585b3fd25608c6b28bb8a04054cb27d072191363c3c6ca96c6e7","observation_id":"b8715bb6-2e00-4832-a975-cf8347f6d1a1","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"Do not include:typesor:objects; actions take no parameters","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:f9cab7629bba9915f0b41f11778d4e51f2af92506f7776b7ddcb7b6d16e7428f","observation_id":"43dfebcb-f34c-4140-b779-0e4aaa991137","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:e6cd1ff9cc9939b002e25c8194451725a98e0487daae9023c3a896f386a098d7","observation_id":"38cdaced-c37d-48c5-b72c-a28c3342bc0b","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:7222b78289f003d5c5183bdfbbbf656a3489e0202200c9ca2ea2e82484d3186d","observation_id":"438870a5-b398-42b7-a011-de21b259c07d","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"Semantic rules","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:b9bf4dfca25ace49f6d1e8878a29823f6107d375d8aab8e1efb8d8172a3b7175","observation_id":"cb508e6d-5628-4d14-a9ee-33c20d215451","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:2a741ba125be8345ca93088180096e24ddec2dc96257ce3c6e5a6fcaeb3800ee","observation_id":"9fd630f7-ff71-480a-ab5e-702b4d5f7750","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:4369ed07d8616840097562e8f0aecf9bf2db36b7ee47d75bedccf5f7d2e9707e","observation_id":"ae911fb4-e35b-4b6a-b989-29fd998a6722","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:a325a46aa51c33cb65f451a783784fe0effd0ef3e74a04d529dbd8cb17d08ded","observation_id":"10819ff9-e6a7-4aaf-bac7-622d9dc7f29e","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"Do not introduce one-second placeholder actions","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:b4c00b7ea9e516879e002b6f704b8689c3e3f7fba2056f8358fe78f2d059a990","observation_id":"bbca81c2-7f3b-4e70-92d3-16887c683b7f","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"after”, “once","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:2030b52b116a980abfbc92b4603204aba1d5ab53337174a755cc9e86dcf9b76d","observation_id":"814c9b2f-2f3c-419a-8109-21a99a16d2be","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:6356c960d7e46881233e9b69b074f604b2fd9d5f37cb9e6af04ce0933807a7f0","observation_id":"dc2fd95c-29e4-4875-8f92-1a03db5ac341","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:297e1f6fb0e3b3f3407a32f19513fdd7d9dfe8122667e8cdd8706ed2182f4843","observation_id":"bebdde29-cca0-444e-bca3-e1074e969c66","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":",stepNbased on the step numbers in the problem text","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:7d597e8a3f37e0afc8a0f1c6644226df68d1a9f358fe12ea8118a177cc156152","observation_id":"efd5ab8b-2315-4c48-90d6-230e15da7a08","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:e04989585d24c96649f7b9b288e08e3680e046d2177ccc565bafa73ebf914d15","observation_id":"eb5e11b2-c308-426d-9c9a-8848e8928a52","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:76fd80a1cb6da28c65e46ed89760f9fc5d8edcd595348b856142fa248b63cc2f","observation_id":"77d8dd76-3729-47bd-95b7-47c277864009","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"Do not add extra dependencies","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:c48bcb34e30094566a07e259f7cd45e943afcc0e608baac7df99b1dba5a5f1b8","observation_id":"59f51548-d477-43ab-b528-cf8b617eea2d","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:d0abe24dffdf2e1df05fd2eafe0f73144912e9b725bf953506b4cc92c516928d","observation_id":"d4a3f1fb-f322-4348-8da5-b9e976ff52fe","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:a47cd0e4e284dedfa6e54a1774472976eeb4951bb504f7df9cb6a6036db3d734","observation_id":"22dc0e47-7489-4950-bcff-4d237a2e213f","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"User prompt: Translate this planning problem into a CP-SAT scheduling JSON spec","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:0b186639f63a67890d7e484db1d5f76c7d2c501aa3b353e08df02d2325b0c431","observation_id":"68468ebe-edef-4a58-b699-9275d5c43bd8","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:dfaa8bb5a64ff298a9c179d387adbd416b39d361bb0a98a6cc8791a8fd3f8571","observation_id":"a368313e-75ce-489a-8dd5-0e4b522d9330","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:8294aca17e2f21d3705066d35027f194d74b2315cc605154c5060b8019197710","observation_id":"75838c8d-b74b-4ab3-9738-57e14a85b9ff","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"Figure 11: Syntax retry prompt for the PDDL2.1 Formalizer","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:9f0c109bdebba361adfb9428f7e7aa4f68e4b2385d4f85057574af28484ae452","observation_id":"bb9aec63-e71c-4ee5-9ae8-ba4b22977f04","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:8588936a8aff6713ea38a854f75bd297b9a4ad675a769890be8c05992b203ee6","observation_id":"e81de61e-5b61-4655-bbb7-0b2c9fc45246","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:55940fe2efc2d99e260fdad002c088555fea23810fa372d8f9bdd494a6c1e2c1","observation_id":"2df5e672-8769-4699-853c-cfe1c06dee09","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:f00d41877a9b339f5200f8974a33b426f87299d1a025766b554d95e909790219","observation_id":"551eb310-884f-4e45-896c-7f484686f44a","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:f9d81f23171ab54ddfebaed24f456000d247c00474698941969105d4ccb1930f","observation_id":"a4371538-8400-4d23-b7c3-642375a81f75","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:fc458b7d48385d948fd297520c750c301b266b261c339497d8013c0cd5779ac6","observation_id":"1cfe5f23-c743-4c18-bab8-ffbcc2cc41e9","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:398e68c6b01e4bcef188596d394852b5c817f01c28e0ef80a617a2c45c959325","observation_id":"8d7e0b9b-777f-4c78-a8d9-608d0a6bd66e","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:d085bac24da25d530d1b3ebaa55357bbe9a6ed377d366fb87883dd68fe42f08d","observation_id":"b53d6783-9b26-4fd3-bcf9-e2af1546fe67","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:784001a514c088e8d51aa991fd14a0137397439ad7d2aa4167199f2821521f9d","observation_id":"42c57476-92c0-409e-9006-eb9824fa02e1","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"No commentary, markdown fences, or extra text","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:e5be2795fccc72c45e4c271c167d0dbbd7e3212669a93e4d7f108b952c15991f","observation_id":"5a908cbf-45b3-4c7d-aa95-b14f9bdb64a2","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:e43e1cec07b59e71f7536963f047979e399a19ae4d6246e1f096b11c4a379caa","observation_id":"286eeb1a-3b2b-4228-a719-a5ac59428daa","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:ddc7d3d5438da89d7b42c40e32560b99fe157beed8a6fdd23bd62423065decf6","observation_id":"5b9cf399-bf3f-4aa3-ab99-48e7035032e5","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:a093c313e50eee61cc4305fcd7fe86f18d8f9aef1855ef8984179f84e07368e4","observation_id":"0bdd01db-7cd0-42ec-9933-5b8c67a08456","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:6e6d25ce83a24035f86d172dbb1d7078bca457dedce6a1797162c4d2d83a22b8","observation_id":"5a7eb49d-ef4d-4347-8ac2-1f7168d98429","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:0d22847170ee674e3c3b48f414aceef6b8f0e69c98edca6de81fb821f58d45c1","observation_id":"355d5598-36e4-4393-bfb6-24f33f3a15ff","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:ecab2a0af595272b7494705f3a2c643946a23069957288511c068e965ebc4594","observation_id":"f285ee7c-af65-4ef2-8aa9-b38f3c51f43b","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:2f9f8c8c7bd4d2f25299b668592bcefe5e84b2a023729d95406f7206a3619c2e","observation_id":"7050e007-efff-4254-8941-b0b5f509bca8","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"User prompt: Produce a temporal plan for the following cooking task","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:467baac8e8fbe099a6d38f3c9826da9dc3b1f7b26a5e7f201a50662912f79e1d","observation_id":"56a4f83d-46aa-43b3-8109-81fbebaff48e","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:ae24ecd7c046f3647413bb7a8b202dada28f124d47e64a24478ff1f5c6234cb6","observation_id":"5fac3e8a-90fb-4c19-b114-dce0ced709f5","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:eb9eb5ac189b6d9191723f975f91f00f81c4e1757a2d6f08016b474b72f9a1a3","observation_id":"c02a0ad0-58e9-42ac-b35f-02a849808d34","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"Interface contract","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:f3ed9abe78fa0113fe5c0fd78cd8430c7f8fd14ed6a6f410d6cd07af4fb5a14e","observation_id":"cecccd49-b115-4d85-aa4e-199cd33339dd","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:b56c1b8a8652c69990991a36da4c07f11832426a0e8a5da34c82e46a5b3a5f17","observation_id":"515c8370-dd81-4942-8b35-f949ee776c22","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:17544d38237a3a799bfc2daa6f64de43d131d474eed5f100fde8e66330065781","observation_id":"43003b9e-d50c-4dde-94ad-9f8c1880b1e2","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:f6c14ac5dcbfbc6cb5a602612f84b1b78bddc7991b8fdc36e309ded55afa4e45","observation_id":"45ae421b-6f75-49ed-b205-6b4759e96fec","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"PDDL rules","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:225b46e75c27ea472d3eae6776e9df957dbbb154d75633951921a0426b41975a","observation_id":"590b5bfb-63af-4141-a301-67bf51142a1c","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:c74bd326b34018e74b3dbdf4ff5c5b212c1bdf8ad778fb6924d51279e650fc63","observation_id":"065dec19-9fd7-4689-b212-b880c41b64fa","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:591c601cc39e915b9f497b70e4af66b55239aba67b83d8693c5e3e5bcffcc9be","observation_id":"f78b74f9-6612-4b1f-b354-ff99e79cdc74","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:6efe80d3ef092236901bf0b815b0dfa90fb01d50fb6a8a9f4c0be07e07516ef3","observation_id":"7f338f97-018c-48c0-8f67-b453bb2dd451","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:8126be266df0899053d68a603ff6c25cbe6260a2ad76f0a537e1d86348320197","observation_id":"47d7a51e-c5bb-4ebd-960d-6ba208e6e912","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:8f6f1e096c98a477f243d556d6eb407ff9179e7b021af74bb90525fc934b90e6","observation_id":"85589265-5b65-4836-aa43-dc3c863c2930","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:86726b459b92e207c7518d309ccf4fce3b97858065647a88f3da987c5b5f917f","observation_id":"7da0683f-6c21-48ed-9d63-619555c6cb7a","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"domain_pddl","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:3edbfce2aee6df9ea41051954400115247c438ef3dbe0210bd63814c575ecacd","observation_id":"66153174-b7b6-4523-8971-ab4462c0d9db","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:6e5cdd70a985b8d3a52179448913988d98c3ea60df3f9204fee3a32f19639d6e","observation_id":"d2bccaec-7e7e-489e-a05a-57a4786a6e07","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:a887b66e220d9fdd798d5376c036576af9c6ab95a0d9155a5e78edff6e062034","observation_id":"307e9776-be49-4a43-ba98-1470c69387cd","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"Each action id must be <action>_<item>; dependency endpoints must use existing action ids","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:a34df279d74ac60380748b7bd8dc9d4849a8b4532482cda2c3d03fead611cdf8","observation_id":"a6f85b81-f280-4c4d-b96c-d4c5d388ff9e","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:2f5d9eb413bcfad51e9fd4f68d550432caa72b126e6c41a6bfb1b6ff7cb40e92","observation_id":"5b035816-db0a-4449-a5fb-08e4ed9b1b54","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:76335c12c8ad43b65f555a31e82ae553b25e3eb6bd68829905ec2bbe4468f0fc","observation_id":"5515dd98-1ba0-4a11-a767-21f8843b5241","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:82e92404b278e93158a36736a767b6acd08a578f9602074f10788189fb7f6f82","observation_id":"307d470c-d230-472e-9476-c4010e620d6c","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:cc565cfdd6dec0cc6a6d6986e11290da578b75a6ec182bc60302371f480d70cd","observation_id":"0703c820-e104-401f-9421-0275f199279a","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"mode\": \"schedule","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:e6d430fb45cc527019887f435ccc927a3a2c78281b37d9e2676e68182dc53444","observation_id":"e6f9f95b-dc84-406d-86b7-5a26f0a669e7","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:84ca444e73b1b2ed584bbaca8e4666b9e0f1261e964297a6d4c32f644cfa55d5","observation_id":"ecd97a4c-52ca-4b75-9765-e60f80fe9318","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:babbc42ed83850c9bb48e9fe1f74a90a9e8c5b46a10166d0eaf9dcccc2b2157c","observation_id":"0385dc89-8027-4179-8ef9-1603c5b03cfe","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:f1383434b53dc37d890bbca5b9aa32da9bd0f127723b3daa86d8c5fab353c466","observation_id":"1b07c8d0-5b80-4645-b195-3f7361e84b3f","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:188d55fb41137078c37f48455fad5d697955a4975b9e508c01b109d838e9e68e","observation_id":"3bbc636b-bcb8-4e54-b3f4-eaf404f133d2","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:5ddb06860470c3371179fb0d1ab3e815fcd8c5cf84f0bcaad4a387da71e257c4","observation_id":"fe0476c6-d695-4749-96db-154831592bc3","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T17:43:24.820773Z","title":"delta\": {","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:24.820773Z"},"links":{"citing_paper":"/paper/2606.00981"},"observation_digest":"sha256:6be4cb7c997b5f9e7dedd1388cf8981710b995d3672912c6c317b4c109da1e60","observation_id":"e4ffbb43-09a4-481c-90d5-f6aab86b5780","resolution":{"observed_at":"2026-06-28T17:43:24.820773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.00981","last_updated":"2026-05-31T03:28:42Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-02T22:30:31.804131Z","submitted_at":"2026-05-31T03:28:42Z","title":"Robust Asynchronous Planning via Auto-Formalization"},"reference_resolution":{"displayed":81,"state_counts":{"malformed_identifier":1,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":77,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":81},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 81 of 81 outbound references and 0 inbound Pith citation observations for arXiv:2606.00981."}