{"as_of":"2026-08-08T20:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3b697ed4344a9891553abf67307866aaad5bc7937dbf4040b2c9eddc759ee878","coverage":[{"denominator":121,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:32:33.000846Z","state":"measured"},{"denominator":101,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":101,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-21T19:41:09.050612Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-21T19:44:19.714402Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"cited_work":{"arxiv_id":"2505.21674","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.21674","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Make planning research rigorous again! arXiv:2505.21674 [cs.CL]","venue":null,"work_id":"348ab278-3074-4527-ab6e-65074e982a8d","year":2025},"citing_paper":{"arxiv_id":"2511.09378","last_updated":"2026-05-15T14:16:27Z","snapshot_observed_at":"2026-08-02T09:33:59.385680Z","submitted_at":"2025-11-12T14:45:07Z","title":"Frontier Large Language Models Rival State-of-the-Art Planners","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-21T19:41:09.050612Z"},"links":{"cited_paper":"/paper/2505.21674","citing_paper":"/paper/2511.09378"},"observation_digest":"sha256:a0c169c3cde3c433da3b1f1eb0de6bb9a5e7045a67d65c3bf2552a71f4eec51e","observation_id":"13736187-77dc-4bfd-b21f-f2df21cb7c8a","resolution":{"observed_at":"2026-05-21T19:44:19.716474Z","resolver_source":"arxiv_id","status":"verified_exact"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2505.21674/citation-record","integrity":"/paper/2505.21674/integrity","json":"/paper/2505.21674/citation-record.json","paper":"/paper/2505.21674"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:24.210592Z","title":"Oversubscription planning: Complexity and compilabil- ity","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:24.210592Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:d26126dacd3b7b119e59811e5c0c95f5de3c6c9f327dfbbec688b937433e25d4","observation_id":"93e3571b-2f77-40f2-b13f-29fb5d6b30e8","resolution":{"observed_at":"2026-08-07T13:32:24.210592Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:24.250042Z","title":"Translating HTNs to PDDL: A small amount of domain knowledge can go a long way","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:24.250042Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:a2dd0e7cf81c17f04e1960b21635896873a7240372e4a9713f24c2ede809219a","observation_id":"d1d34f55-410e-4f79-a4d6-546da2258afb","resolution":{"observed_at":"2026-08-07T13:32:24.250042Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:24.314613Z","title":"The AIPS’00 planning competition.AI Magazine, 22(3):47–56, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:24.314613Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:412df905cb4b7b7903a5f5592dea8cbd38a7fa0f60d5b99a3f84df5ec938a961","observation_id":"0975c732-3778-4a3a-bd1c-d9cc6ad06688","resolution":{"observed_at":"2026-08-07T13:32:24.314613Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:24.374210Z","title":"Planning for temporally extended goals.Annals of Mathematics and Artificial Intelligence, 22(1,1):5–27, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:24.374210Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:cfa78a39e8efa9a72869711ba55e3bad8c5565c98acdd69d7dbeb1ec07bf0e54","observation_id":"fb00cfd8-4133-495d-89f5-5bd622543a73","resolution":{"observed_at":"2026-08-07T13:32:24.374210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:24.422644Z","title":"Planning in polynomial time: the SAS-PUBS class","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:24.422644Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:6b89533d0dc799e89fd1debdc5d1790d4b6dd50d88b6657c9b21a716ac90d7c8","observation_id":"a52552b7-d360-42fd-9384-df747eabb5b2","resolution":{"observed_at":"2026-08-07T13:32:24.422644Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:24.468960Z","title":"Complexity results for SAS + planning.Computa- tional Intelligence, 11(4):625–655, 1995","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:24.468960Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:ed313c06e7ca6f66e60d5f782c9180757d376150bcdfaae9abc26ec5ab636f54","observation_id":"2275ee2c-8c7d-4118-9372-04fdea943504","resolution":{"observed_at":"2026-08-07T13:32:24.468960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:24.543757Z","title":"Baier and Sheila A","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:24.543757Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:090aef5507ed8e026316dba5daacfca51cedd5363d927ac35af4148ba39a1f28","observation_id":"57733c53-5f45-4509-a5a1-865cbdde9ef3","resolution":{"observed_at":"2026-08-07T13:32:24.543757Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:24.618110Z","title":"Baier and Sheila A","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:24.618110Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:c1e4b01d382669e819c0f5166f9d8e026a2fb5cfc208a975b0c84f3a843f58a9","observation_id":"489edc52-cc1d-443e-93b2-9b3baae1f0ec","resolution":{"observed_at":"2026-08-07T13:32:24.618110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:24.688607Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:24.688607Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:5977dc72f2e5a734b2cac63432e12fd310013571b6d71e677e7661e2c67d65ec","observation_id":"d12649ff-3648-4805-8f46-f6f320541be4","resolution":{"observed_at":"2026-08-07T13:32:24.688607Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:24.802852Z","title":"Planning with incomplete information as heuristic search in belief space","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:24.802852Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:d0d72e05aeb21355a472dffe1e831c7618bcfa401ff4911e24ddf9eb20ba3498","observation_id":"9ef94480-26a4-42c5-8e51-691d232c3bd3","resolution":{"observed_at":"2026-08-07T13:32:24.802852Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:24.896185Z","title":"Benchagents: Automated benchmark creation with agent interaction.arXiv preprint arXiv:2410.22584, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:24.896185Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:1b494a2b1f9be99f94b8ffc624c2b3cc7ca280b4bb35d886a929c7f1509d79ba","observation_id":"024eb2e0-dc61-4abd-9bf3-7aa6cee35083","resolution":{"observed_at":"2026-08-07T13:32:24.896185Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:25.014935Z","title":"The computational complexity of propositional STRIPS planning.Artificial Intelligence, 69(1–2):165–204, 1994","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:25.014935Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:77fb9556c77459b27b955a45bc0b56ab622790acf34fcd9918a0b43182758343","observation_id":"9458b4dc-22dc-4cd1-87d6-6eefedb17db7","resolution":{"observed_at":"2026-08-07T13:32:25.014935Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:25.181385Z","title":"Act local, think global: Width notions for tractable planning","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:25.181385Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:875247a5bfd031b8569d8a3fd4c50d3e7b307d5b8dc7824fbb14eca6a2310f19","observation_id":"77c57375-0004-42b8-af8d-f58727378e4e","resolution":{"observed_at":"2026-08-07T13:32:25.181385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:25.312273Z","title":"Completeness and optimality preserving reduction for planning","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:25.312273Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:7967c550e74a6a4e90f6e27a01473d284306c82963ec8f4374d4364f2bee5ce7","observation_id":"b0af2800-d45a-466e-8483-1a1f728a9d28","resolution":{"observed_at":"2026-08-07T13:32:25.312273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:25.427294Z","title":"Planning via model checking: A decision procedure forAR","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:25.427294Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:0b1783c47e5af3a2aaca7df6f16249223c3d45cd113dcbda35769ce9170ab1c7","observation_id":"b2e54da6-d07e-401a-a9bc-9f10aa74a4d7","resolution":{"observed_at":"2026-08-07T13:32:25.427294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:25.568276Z","title":null,"venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:25.568276Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:ce1ccd04a64ce0c607e88c9f83fa694630ade5e0c5a5eb7bc326c5bbf3acf34e","observation_id":"386b4e97-17a8-44bc-a022-e9d81524669e","resolution":{"observed_at":"2026-08-07T13:32:25.568276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:25.737029Z","title":"Textworld: A learning environment for text-based games","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:25.737029Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:484315f1b24935b765c53610a489984d36e59d0dd54aa10ac31e3a26fc63665b","observation_id":"f0169d87-1d01-4c2e-bd49-542c822501ea","resolution":{"observed_at":"2026-08-07T13:32:25.737029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:25.836234Z","title":"Culberson","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:25.836234Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:c17551bc283f809e26f28e32725cb0285eb0c76b2014894191106e1af43af7bc","observation_id":"753c3a79-05cf-426a-81c6-4aa47fa31da8","resolution":{"observed_at":"2026-08-07T13:32:25.836234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:25.973297Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:25.973297Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:ad8cebb1ae6267d4b988ace32318513f8bbae4af83df2784b033be8ec640a9d5","observation_id":"cce26515-39aa-4f03-83d1-2d48163b757c","resolution":{"observed_at":"2026-08-07T13:32:25.973297Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:26.143262Z","title":"Generalized best-first search strategies and the optimality of A∗.Journal of the ACM, 32(3):505–536, 1985","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:26.143262Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:a046536b0a5eeb98c3bb7586e030667e18fae385c1007d040a68f49327dd0313","observation_id":"3b160270-3c3f-4b54-bcdc-1996e7a3fe3d","resolution":{"observed_at":"2026-08-07T13:32:26.143262Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:26.280630Z","title":"Planning as a service","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:26.280630Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:5ac79627896b40187a6f54ebbc48793458164daa918480b2dcfc619da7db61fb","observation_id":"ac81aa05-1c24-45b2-be83-939b56ddb8dc","resolution":{"observed_at":"2026-08-07T13:32:26.280630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:26.401715Z","title":"Novelty vs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:26.401715Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:c6f0c9fe0cad5ba1311873bc6e267bf3efa7b0bd2c6dff1fd7419a898137fc81","observation_id":"5abce7b9-ffaa-4a59-9ec2-ea59bc5419d7","resolution":{"observed_at":"2026-08-07T13:32:26.401715Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:26.533223Z","title":"Probabilistic planning via heuristic forward search and weighted model counting.Journal of Artificial Intelligence Research, 30:565–620, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:26.533223Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:9366cb7f7d8812bc744b2bdd4b87492fe3fffc81dcd4610502e14bd70d5db930","observation_id":"1dca8014-1df5-45c2-907c-297cf46675ea","resolution":{"observed_at":"2026-08-07T13:32:26.533223Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:26.713996Z","title":"Deterministic oversubscription planning as heuristic search: Abstractions and reformulations.Journal of Artificial Intelligence Research, 52: 97–169, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:26.713996Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:2a4027b332103753203f49fb25511636d2203b261909fd113f7372640571b862","observation_id":"1591aa81-e8e9-4278-9d05-d9343c4315d0","resolution":{"observed_at":"2026-08-07T13:32:26.713996Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:26.896689Z","title":"Red-black planning: A new systematic approach to partial delete relaxation.Artificial Intelligence, 221:73–114, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:26.896689Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:5c178e458a1859afdc8dffc9cdead66ca821cc60350ed1b5f9608f99c2b1e51d","observation_id":"6343c02e-7c90-4f78-a99f-35fc7f164517","resolution":{"observed_at":"2026-08-07T13:32:26.896689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:27.029037Z","title":"SOKOBAN and other motion planning problems.Computational Geometry, 13:215–228, 1999","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:27.029037Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:86c95c949f893b297e5f9f5807fab704108d53ea346e4ac56cc93007ff1bcebe","observation_id":"a975a709-5ce6-4219-a14f-aba148acadbb","resolution":{"observed_at":"2026-08-07T13:32:27.029037Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:27.167383Z","title":"Planning with pattern databases","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:27.167383Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:37a9756d5acd42a61ab168b2823561137c819bef3e0decff64fe4c0945e6ac91","observation_id":"edf31885-f830-4728-897a-e3b539cd6c2a","resolution":{"observed_at":"2026-08-07T13:32:27.167383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:27.297976Z","title":"PDDL2.2: The language for the classical part of the 4th International Planning Competition","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:27.297976Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:955da0402b73b14879ad6e2d744e0e9917675f0e1c80442e0faa18ffebd9578f","observation_id":"cc1061ad-fac3-47de-a489-9580a3cd37cf","resolution":{"observed_at":"2026-08-07T13:32:27.297976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:27.465863Z","title":"Hendler, and Dana S","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:27.465863Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:e91d28cd71ac3c6e53f56c5ed3a8b3d25ed34186c7c886a6ed683f5d61054128","observation_id":"421c550d-4067-4c08-b59f-921b4e91a791","resolution":{"observed_at":"2026-08-07T13:32:27.465863Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:27.581812Z","title":"Fikes and Nils J","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:27.581812Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:7eac7a0cdd95ab8a382cfdb3bc386afb63366b79a63210bc140c6702ea61b871","observation_id":"5218147d-b578-488c-9ca6-4f4c2ffb2947","resolution":{"observed_at":"2026-08-07T13:32:27.581812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:27.687272Z","title":"The detection and exploitation of symmetry in planning problems","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:27.687272Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:0e29061bdc3f31408979d6d65d301ff3cb3da7e8059f3e5e6c9967031c5a8618","observation_id":"f6108705-134a-4d61-8673-4e8b24659d7a","resolution":{"observed_at":"2026-08-07T13:32:27.687272Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:27.850052Z","title":"PDDL2.1: An extension to PDDL for expressing temporal planning domains.Journal of Artificial Intelligence Research, 20:61–124, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:27.850052Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:1a39bf01f752316bb337ea9cb4ebb27798776a9c6af44d8506f53a63542397c5","observation_id":"c0e6e4c5-9641-48af-ac8b-7204ca8cc42f","resolution":{"observed_at":"2026-08-07T13:32:27.850052Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:27.962612Z","title":"Tarski: An AI planning modeling framework.https://github.com/aig-upf/tarski, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:27.962612Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:b76740befa2d7e6b57c46c6171ad8b2b1e9771f1b8e7bac8e8614ac896f99bcd","observation_id":"9d4cad18-8996-4b3e-81e9-00ef3027400e","resolution":{"observed_at":"2026-08-07T13:32:27.962612Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.03683","last_updated":"2024-04-01T06:50:52Z","snapshot_observed_at":"2026-08-06T11:34:00.528900Z","submitted_at":"2024-04-01T06:50:52Z","title":"Stream of Search (SoS): Learning to Search in Language","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.03683","snapshot_observed_at":"2026-08-07T13:32:28.070915Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:28.070915Z"},"links":{"cited_paper":"/paper/2404.03683","citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:8287251c09a2e66b3e00de6ec3fd82cecd9eb888813c28c98abf8ce231901fe8","observation_id":"68b6b18a-d3e6-44a3-9631-28a24a70f2bc","resolution":{"observed_at":"2026-08-07T13:32:28.070915Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:28.254896Z","title":"Functional Strips: A more flexible language for planning and problem solving","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:28.254896Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:0453fa45ad0a7cee1ef6680d876073cfd1cd04a663b4fe8c09946605c49c1158","observation_id":"bbf0f58a-b1cb-4077-ade1-15ce93f12e46","resolution":{"observed_at":"2026-08-07T13:32:28.254896Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:28.413260Z","title":"Gerevini, Patrik Haslum, Derek Long, Alessandro Saetti, and Yannis Dimopou- los","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:28.413260Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:1b9a4c3f189efc5eb299c34f5b7a44ccc04f1dbc813a02fc950e043370a3c305","observation_id":"f0b4fdb0-be4f-48cc-acd7-5b29b84855a0","resolution":{"observed_at":"2026-08-07T13:32:28.413260Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:28.567811Z","title":"Gerevini, Alessandro Saetti, and Ivan Serina","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:28.567811Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:a1ce40119a7436b4edc3dc590b70fffe55fd16d4df99e60614f933474b713458","observation_id":"d1623ba9-21e4-4e94-997f-e500d2989a07","resolution":{"observed_at":"2026-08-07T13:32:28.567811Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:28.710159Z","title":"NL2Plan: Robust LLM-driven planning from minimal text descriptions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:28.710159Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:9aa9c9c8725cd16efdf53cedd0c2e8192501fe6a5b60954caa24463cefedfcf8","observation_id":"08f16aad-ebbb-49a8-b9df-049589afbde9","resolution":{"observed_at":"2026-08-07T13:32:28.710159Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:28.831625Z","title":"Nau, and Paolo Traverso.Automated planning - theory and practice","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:28.831625Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:2192cbff3b8e7024a195f39372795652dd7c6730513b979148e8aedec4607356","observation_id":"e57612de-c68f-446d-9907-4ebce460c1b0","resolution":{"observed_at":"2026-08-07T13:32:28.831625Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:28.965343Z","title":"Nau, and Paolo Traverso.Automated Planning and Acting","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:28.965343Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:2e99a4172cadf5961201dbffc3f17e70cbacfc0cf1f846dbb866b76a4b8bdbe0","observation_id":"d67de6ac-a6c3-413a-81fb-a87012eca6ed","resolution":{"observed_at":"2026-08-07T13:32:28.965343Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:29.072497Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:29.072497Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:ab0920114145a7dacd4e24e1cbd1f01e5438cce474432aede6a9dad66bf32df4","observation_id":"f8a5c8af-bc02-45b6-bef5-54b08c3b6edb","resolution":{"observed_at":"2026-08-07T13:32:29.072497Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:29.158470Z","title":"Actionrea- soningbench: Reasoning about actions with and without ramification constraints","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:29.158470Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:742cacd3e12203713169d07d93c0d27c221a23b7aa83ee78ea5a54342581b489","observation_id":"a35460b7-47f7-4540-8843-f59fe05bc737","resolution":{"observed_at":"2026-08-07T13:32:29.158470Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:29.266225Z","title":"Hart, Nils J","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:29.266225Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:68245c7d63aed606a2fb8b1b3c80689a3632f7051895635cf07072f8ed726d80","observation_id":"165cf9b8-042b-4257-9087-1d9f47613c31","resolution":{"observed_at":"2026-08-07T13:32:29.266225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:45.747942Z","title":"INV AL: the Independent PDDL plan Validator.https://github.com/ patrikhaslum/INVAL, 2016","venue":null,"work_id":"1137b05a-a5a4-4ba5-9974-7635494ecb7d","year":2016},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:29.373346Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:4c900ba7d20175b43fc121d343aa7f30368112ff5cd3a95af4e7830a00371c65","observation_id":"cbf1aa97-2058-4ba7-92da-e04f390d07e4","resolution":{"observed_at":"2026-08-07T13:32:45.800271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-07T13:32:29.472654Z","title":"Morgan & Claypool, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:29.472654Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:e587640b48049ad00f4aba3bbeb958d436fc9072d48c7dcf9dad4bc2c7506599","observation_id":"b0f565b0-bf02-4d9d-b376-7b59d7dad49d","resolution":{"observed_at":"2026-08-07T13:32:29.472654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:45.606273Z","title":"Exploring the capacity of pretrained language models for reasoning about actions and change","venue":null,"work_id":"b994f745-aadf-4192-9531-caa4d6c00c1a","year":2023},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:29.570806Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:f6704dc2bd909269472e26ddfa1567771fa2197aa47130e8af8ccd042dec822e","observation_id":"f11772be-80c9-4eb1-a5dd-d6e1764b8f6c","resolution":{"observed_at":"2026-08-07T13:32:45.648486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:45.485712Z","title":"Hearn and Erik D","venue":null,"work_id":"ff87770e-3727-4d44-8fd3-4d39b5e43a0f","year":2005},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:29.649091Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:da462cd576a347b3e1a810c55eaac6d3db88b25fc79743120a303ce3dfac8b01","observation_id":"58f42ec6-813f-438a-bfae-e36f814d26cc","resolution":{"observed_at":"2026-08-07T13:32:45.520651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:45.375150Z","title":"Decidability and undecidability results for planning with numerical state variables","venue":null,"work_id":"66b1d02f-62e4-4db6-a2cb-258fd1c70222","year":2002},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:29.725521Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:dd64dc7300410de68bc6294d946b0160b8d51a7b1f6a3f81cfca32ef0f0d930b","observation_id":"4daba5cc-f806-424b-89ca-60e28d36c40a","resolution":{"observed_at":"2026-08-07T13:32:45.410212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:45.271989Z","title":"Complexity results for standard benchmark domains in planning.Artificial Intelligence, 143(2):219–262, 2003","venue":null,"work_id":"9282c631-6432-48c2-96e7-e0c7a57f2f37","year":2003},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:29.809882Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:53f34528b18406159d89b529c11bb923a30f2ee753da2db9e81646f181306555","observation_id":"3c8ae418-955b-42da-929b-6ea43de2948b","resolution":{"observed_at":"2026-08-07T13:32:45.312861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:45.166917Z","title":"New complexity results for classical planning benchmarks","venue":null,"work_id":"8b49576c-c198-4d47-9e43-1911f59f5b3b","year":2006},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:29.927338Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:9018b6562dc87a0c8903f84c27cd93f4b3b66f7affd756d9755475932e9f9182","observation_id":"7a875af9-bd79-4d49-a632-6690bfedc8de","resolution":{"observed_at":"2026-08-07T13:32:45.212378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-07T13:32:29.986579Z","title":"The Fast Downward planning system.Journal of Artificial Intelligence Research, 26:191–246, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:29.986579Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:ebe7a33c64c2b2d4ef0d804b014a78d92c4956fdfdafb05b4864db02ad82f2e4","observation_id":"b09b1cd0-8634-4d2f-8070-b76fb9574623","resolution":{"observed_at":"2026-08-07T13:32:29.986579Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:44.998711Z","title":"Concise finite-domain representations for PDDL planning tasks.Artificial Intelligence, 173:503–535, 2009","venue":null,"work_id":"b47b8aa7-20ed-4e26-8744-821fe6ab92ed","year":2009},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:30.082203Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:17dee4e7ddb4b0db29ee7dd76de7e8e343c02e7b6362e8e4fbaa824d2576d89e","observation_id":"0a776d9f-e788-4dc2-a3d3-244c574934be","resolution":{"observed_at":"2026-08-07T13:32:45.054858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-07T13:32:30.171544Z","title":"The FF planning system: Fast plan generation through heuristic search.Journal of Artificial Intelligence Research, 14:253–302, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:30.171544Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:fec0db853c1617d5ff4415f68a3145273b5b5645d6f27c2d5613eee0847bb028","observation_id":"687c3020-94b6-4dc2-981f-57ef4e2ba92c","resolution":{"observed_at":"2026-08-07T13:32:30.171544Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:30.261588Z","title":"HTN-MAKER: Learning HTNs with minimal additional knowledge engineering required","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:30.261588Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:889e2edbb4c3f32e0e9a4e27e5dacc0961688a6cac3341b2bcb5588899560d87","observation_id":"f7ed8b80-e2ff-4688-93f1-4e042125c971","resolution":{"observed_at":"2026-08-07T13:32:30.261588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:44.817110Z","title":"Learning hierarchical task networks for nondeterministic planning domains","venue":null,"work_id":"cbeff0d7-b6c1-4588-a437-4af7fadb7e6d","year":2009},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:30.321902Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:a4a0ba080b6083be88199240299e5154737b9ddbb1e405e03a40d2f32334bb3f","observation_id":"8fe8149d-d2fe-496c-b1ad-8b61edfdbc9a","resolution":{"observed_at":"2026-08-07T13:32:44.879052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:44.657072Z","title":"Learning methods to generate good plans: Integrating HTN learning and reinforcement learning","venue":null,"work_id":"ef363ac6-5ffe-4eba-8533-860243d0dbda","year":2010},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:30.391032Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:98baf6163a3efe60b3157289d65b1a0b804782a9cdc77bf9fe90356c0e1a036f","observation_id":"177225b9-5d2b-4168-8e37-174972be9071","resolution":{"observed_at":"2026-08-07T13:32:44.689656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:44.453034Z","title":"V AL’s progress: The automatic validation tool for PDDL2.1 used in the International Planning Competition","venue":null,"work_id":"8c07ea16-10c3-441e-b7e7-d5a4a5fe549b","year":2003},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:30.463372Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:ca950988a1cdcaf83a6a6e591a57dcb99bd18cca9fabea3eb4ec5741a1d1003e","observation_id":"e347926d-e371-4b91-90d9-e874d777744d","resolution":{"observed_at":"2026-08-07T13:32:44.531943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2502.13092","last_updated":"2025-02-24T15:59:04Z","snapshot_observed_at":"2026-08-07T18:07:39.164110Z","submitted_at":"2025-02-18T17:59:48Z","title":"Text2World: Benchmarking Large Language Models for Symbolic World Model Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13092","snapshot_observed_at":"2026-08-07T13:32:30.525231Z","title":"Text2world: Benchmarking large language models for symbolic world model generation, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:30.525231Z"},"links":{"cited_paper":"/paper/2502.13092","citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:6687111974aab4cc584833b52c818f040d2a0f11620c4b9be70794e62895f74d","observation_id":"75cb04e7-e86e-48a1-a087-e94fae70b20d","resolution":{"observed_at":"2026-08-07T13:32:30.525231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:44.246610Z","title":"Tractable plan existence does not imply tractable plan generation.Annals of Mathematics and Artificial Intelligence, 22(3,4):281–296, 1998","venue":null,"work_id":"a64cd5ac-951e-4f15-9b8d-c7b048948666","year":1998},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:30.621478Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:c6aba2116978da7630be8fa16f4ebf8c9fdb4b8deedfe7be4826166a82f0d5c1","observation_id":"ffdbf38c-09dc-4e1c-9e33-9758a7939460","resolution":{"observed_at":"2026-08-07T13:32:44.328003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:44.106364Z","title":"Corrêa, Florian Pommerening, and Gabriele Röger","venue":null,"work_id":"03346f16-f367-4aac-a0dd-bfce00cbc9e9","year":2022},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:30.684268Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:1f0538fd7d8c5bdebc72e8d5ea35301218a72c05055f935e1140d6d5189d34f7","observation_id":"fae9d095-5d16-4f23-b750-30794bb25e4c","resolution":{"observed_at":"2026-08-07T13:32:44.158227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:43.925194Z","title":"New islands of tractability of cost-optimal planning","venue":null,"work_id":"89bfb619-b9eb-4451-bea4-7791b3b15e58","year":2008},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:30.714090Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:4d29b534b51bedeb525843351ef28b2e4a0f1c44e1787865f6c5029aba078be9","observation_id":"8971fedd-b28e-4704-bb6e-7c5cad24fad9","resolution":{"observed_at":"2026-08-07T13:32:44.007093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:43.760354Z","title":"Implicit abstraction heuristics.Journal of Artificial Intelligence Research, 39:51–126, 2010","venue":null,"work_id":"b99a9194-edb6-4863-8fc7-608701dde3a9","year":2010},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:30.761510Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:1c3ae8f0ccd96fdbad3d5340769f4526bcae902c98e9661752969ee232c04ab3","observation_id":"64064a7c-c542-49ac-94a0-42ab99a10a75","resolution":{"observed_at":"2026-08-07T13:32:43.824844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:43.570483Z","title":"In search of tractability for partial satisfaction planning","venue":null,"work_id":"8470b21b-3454-4bd5-8ca8-0b8e5517ed02","year":2016},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:30.790313Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:f4755d964fc6dcb385d26c099a4f242308d052387e69e2ead5efc05b6a92d37a","observation_id":"c224e3c0-3e85-40c4-b11c-74aeeb771531","resolution":{"observed_at":"2026-08-07T13:32:43.645533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:43.444930Z","title":"Thought of search: Planning with language models through the lens of efficiency","venue":null,"work_id":"c573bb3e-207f-43de-94a7-e40ed10134c9","year":2024},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:30.832225Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:8b528ca1bf6ec9b190b14272d13b37fb7085082d9fea91002058b937f7a1cbc8","observation_id":"eb7dc9ba-7d6a-4a8f-bd24-1e6ce8813339","resolution":{"observed_at":"2026-08-07T13:32:43.512263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:43.281630Z","title":"Pushing the envelope: Planning, propositional logic, and stochastic search","venue":null,"work_id":"3ab26bb6-3f3b-4211-a76f-77c053fcbbe3","year":1996},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:30.880633Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:9e6a5b3a5e400f5f10da738d1a69cd9bd0838bedc198169546796edb8b56dabc","observation_id":"4fd5f7a6-11e6-45f4-b9d2-1a1f8a37b1d1","resolution":{"observed_at":"2026-08-07T13:32:43.339674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:43.150700Z","title":"Soft goals can be compiled away.Journal of Artificial Intelligence Research, 36:547–556, 2009","venue":null,"work_id":"bb9ad699-92af-46bd-b1ec-e8c3e5235b84","year":2009},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:30.917202Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:947c214cf9b49051ffefcae831a1b527db138ea9b2f11b9b08290b3030ba930d","observation_id":"0f9a0e1d-441e-4cb0-a3f4-ef6db580a635","resolution":{"observed_at":"2026-08-07T13:32:43.217739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:42.978485Z","title":"ACPBench: Reasoning about action, change, and planning","venue":null,"work_id":"4c918ba2-588d-474a-b529-0be51801f008","year":2025},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:30.930966Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:ad85447ba82db00380bd509570cc8678f0dffcad8dc0785e14efce1f4f371e70","observation_id":"d72ce042-0e38-48b1-9cf1-93d8a85fefd6","resolution":{"observed_at":"2026-08-07T13:32:43.043588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:42.842032Z","title":"Nau, Elnatan Reisner, and Robert P","venue":null,"work_id":"88eca2d1-9d35-46cf-af53-0c830f1f5649","year":2008},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:30.940222Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:3dfd0f3a57e8d33821fc1176f978f2992b3a0a3f43005c35d642909bb9621d7c","observation_id":"3fdb6758-22ad-4c6c-999d-c7d28754e18d","resolution":{"observed_at":"2026-08-07T13:32:42.904107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:42.642698Z","title":"Beyond a ∗: Better planning with transformers via search dynamics bootstrapping","venue":null,"work_id":"ee8a805c-bb9a-49a6-bc28-125638a1a74f","year":2024},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:30.965314Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:80e6a4222eb6f4b75b45c250602b1fa754d834522d10068567a9b1e75e92af3e","observation_id":"bbbafe7b-8ed2-4aef-ba8f-5bd5f7afcf15","resolution":{"observed_at":"2026-08-07T13:32:42.719460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:42.529916Z","title":"The deterministic part of the seventh international planning competition.Artificial Intelligence, 223:82–119, 2015","venue":null,"work_id":"429b62bb-c9ac-4e8a-b939-7766c8386a02","year":2015},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:30.982287Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:5502ddab09941add4fa6ab72398b237877bf80f2d8ef38ee2a550507f659ac8a","observation_id":"85153633-71cd-44a9-8f4d-20656b140c7e","resolution":{"observed_at":"2026-08-07T13:32:42.581052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:42.375891Z","title":"Width and serialization of classical planning problems","venue":null,"work_id":"92b205ad-dc84-4344-bbb5-41921e13706e","year":2012},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:31.002312Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:b2cd962702f1e69fc85048acce3b404879a1b91aedc4d8660a2eaab34a3b57b0","observation_id":"977cac94-e426-41ea-8dfc-75d1d79ee0c4","resolution":{"observed_at":"2026-08-07T13:32:42.443069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:42.289073Z","title":null,"venue":null,"work_id":"f5038bb2-8108-4fc9-a388-836cf1aa5b30","year":1997},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:31.035724Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:0db0feadb2bee7258bbfabd1f66ce389420aa728968afb142ab3075dab99c9fb","observation_id":"acb94c59-3a09-4d8e-80a1-0a260812a1bf","resolution":{"observed_at":"2026-08-07T13:32:42.326776Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"2304.11477","last_updated":"2023-09-27T07:29:44Z","snapshot_observed_at":"2026-08-01T15:58:01.346044Z","submitted_at":"2023-04-22T20:34:03Z","title":"LLM+P: Empowering Large Language Models with Optimal Planning Proficiency","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.11477","snapshot_observed_at":"2026-08-07T13:32:31.055187Z","title":"LLM+P: empowering large language models with optimal planning proficiency.CoRR, abs/2304.11477, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:31.055187Z"},"links":{"cited_paper":"/paper/2304.11477","citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:813a6efd7c5f5821e3906f1b638ef742910083c819bfbf924c27bc05d70c9286","observation_id":"4824b6e4-386d-41ca-a3ae-3efc9fc7374f","resolution":{"observed_at":"2026-08-07T13:32:31.055187Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.03688","snapshot_observed_at":"2026-08-07T13:32:31.075094Z","title":"Agentbench: Evaluating llms as agents.CoRR, abs/2308.03688, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:31.075094Z"},"links":{"cited_paper":"/paper/2308.03688","citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:a2c3573c429b0609663a2e674ca2f4001a0f0cc9e5918e1010d07c6c4bf246b1","observation_id":"6497273a-82e0-4684-b0cb-315d5d1ab8ee","resolution":{"observed_at":"2026-08-07T13:32:31.075094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:42.122782Z","title":"Exploiting a graphplan framework in temporal planning","venue":null,"work_id":"ef654f3e-26cd-42f9-b51c-46f0d4da5ac0","year":2003},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:31.097777Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:a8f0e67ebae1dab31a8d656452fee5588c543fe97fe6bcda27d389ad23eea892","observation_id":"22ab6745-4046-412c-89f9-9229be7a8838","resolution":{"observed_at":"2026-08-07T13:32:42.197002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:41.953844Z","title":"Anderson, Daniel S","venue":null,"work_id":"299f6da3-bb30-49f5-9585-293a64adf4a7","year":2000},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:31.160079Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:e679567bf2928c74ec97a19e755aa1c8d1964a77b175d4c56eb953ea323441b9","observation_id":"90cd7094-4708-43e0-b013-0c0565cf441d","resolution":{"observed_at":"2026-08-07T13:32:42.037973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-07T13:32:31.186034Z","title":"Sudoku as a sat problem","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:31.186034Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:2a7fa331dd4678bfa770622e397344c192bc7ad91c09a0485640eb7342e12208","observation_id":"cc77b2fa-126e-4303-a006-06c4d0ce0a8d","resolution":{"observed_at":"2026-08-07T13:32:31.186034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.13178","last_updated":"2024-12-23T20:12:48Z","snapshot_observed_at":"2026-07-06T17:19:44.130417Z","submitted_at":"2024-01-24T01:51:00Z","title":"AgentBoard: An Analytical Evaluation Board of Multi-turn LLM Agents","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.13178","snapshot_observed_at":"2026-08-07T13:32:31.241598Z","title":"Agentboard: An analytical evaluation board of multi-turn LLM agents.CoRR, abs/2401.13178, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:31.241598Z"},"links":{"cited_paper":"/paper/2401.13178","citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:753d6fc1a25f544d28e43afb3d7f26e127d6714e8f84d435e5d393ecf1024b56","observation_id":"78642a46-cfb1-4bda-b33f-2afb0c9e06cf","resolution":{"observed_at":"2026-08-07T13:32:31.241598Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:41.750772Z","title":"Tenenbaum, and Leslie Pack Kaelbing","venue":null,"work_id":"389546ac-4839-4f8d-af92-cb4cc0a574ce","year":2023},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:31.280429Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:f9f789e2c0cc545febb210b238873496a7e24316c6d7dbf9ec5c82f1c093b812","observation_id":"a574e5e3-428c-4a80-b063-c0344c44cf2f","resolution":{"observed_at":"2026-08-07T13:32:41.830962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:41.560405Z","title":"Pattern database heuristics for fully observable nondeterministic planning","venue":null,"work_id":"286fad2e-773a-4f2b-a19e-f7a5253414f4","year":2010},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:31.325240Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:c80a03b7fe01579cbdf2354da5d92fc56ba682c1cb5c95a199d3522b4856f3fe","observation_id":"8a760062-476d-4f70-90f3-790fb1e39c2c","resolution":{"observed_at":"2026-08-07T13:32:41.668965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:41.477016Z","title":"Synthesis Lectures on Artificial Intelligence and Machine Learning","venue":null,"work_id":"bda9d473-6995-44a2-837d-ea4e134f964c","year":2012},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:31.387096Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:3534855edb1ace661e1dca0f3890fc080dc82d3bcf316eeb7e09747673b73212","observation_id":"b48aeffa-8760-4096-aa95-69df8f515caf","resolution":{"observed_at":"2026-08-07T13:32:41.505624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:41.339689Z","title":"PDDL – The Planning Domain Definition Language – Version 1.2","venue":null,"work_id":"d9805278-3ffe-4445-8b5b-1546e704f658","year":1998},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:31.429481Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:8819aaf011069a413a6db67e577fd10855ad7b30239189a1b5c43c30403993f3","observation_id":"45ca76ef-f152-4e98-9b1d-c1ee5c5b411e","resolution":{"observed_at":"2026-08-07T13:32:41.418366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:41.227413Z","title":"Planning.Domains","venue":null,"work_id":"6f9687ad-aefb-4d67-8772-416265c196b7","year":2016},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:31.477058Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:9e3647ba30076a9d471e5391d8cf6ce19f2e8ad678dac65abe06eb944ae95660","observation_id":"52ae54ae-2c9c-4987-8062-c39bf3a8d9e5","resolution":{"observed_at":"2026-08-07T13:32:41.265072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:40.978655Z","title":"Planutils: Bringing planning to the masses","venue":null,"work_id":"b1b16a87-b30b-4227-8caf-e12e0004ba1b","year":2022},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:31.701460Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:300f732bfddc3210cce1aa1246bdd9c976c5e7d75444f39d21a155529452f709","observation_id":"f1f20170-a434-417d-8d2d-3d3a0e9d704a","resolution":{"observed_at":"2026-08-07T13:32:41.008357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:40.831271Z","title":"Muise, Sheila A","venue":null,"work_id":"4f611dff-a030-46bd-9463-cb0eb3991854","year":2012},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:31.814008Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:69487e94dc92c0b58981fffbac0ef6778c811ba71f7dd84d2ed80b1cee0c0b4c","observation_id":"d730b6f1-ba2e-4844-b9f8-0a029a58b342","resolution":{"observed_at":"2026-08-07T13:32:40.923853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:40.647387Z","title":"Muise, Sheila A","venue":null,"work_id":"a43bf9e3-cfc8-48b8-9e3e-043496e98559","year":2014},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:31.888798Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:c9b2df2f473276791240e69f85b9a81684b16487e762124fec8a5e9131ad9ab5","observation_id":"4fb8bfbf-560c-413a-8149-8ee713fd4b39","resolution":{"observed_at":"2026-08-07T13:32:40.711642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-07T13:32:31.930187Z","title":"Nau, Tsz-Chiu Au, Okhtay Ilghami, Ugur Kuter, J","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:31.930187Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:3f8f03162f71b54bc2f7def9cfd547a271a76a74efd54e094dbd74ede5fec811","observation_id":"14b4ff11-8f32-471f-8aad-1f8d17edb136","resolution":{"observed_at":"2026-08-07T13:32:31.930187Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:40.464630Z","title":"Large language models as planning domain generators","venue":null,"work_id":"626bda87-7a93-4809-9dbb-558477705062","year":2024},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:31.999507Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:b659c3f76258efab3aa09f650641274732bd9d8d7be75237a497001cd5834475","observation_id":"14f545ea-0dd6-4dd8-985f-a98d602521ec","resolution":{"observed_at":"2026-08-07T13:32:40.552468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:40.326985Z","title":"Compiling uncertainty away in conformant planning problems with bounded width.Journal of Artificial Intelligence Research, 35:623–675, 2009","venue":null,"work_id":"151b1e32-f8e6-44c9-afca-61e67768ccda","year":2009},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:32.094047Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:610bf73297da34b0fadad380fd833a4957bd285b24eb3b496b5fdb0d0b332940","observation_id":"d0d8101c-2321-4c14-a487-cdd5f8997f66","resolution":{"observed_at":"2026-08-07T13:32:40.380875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:40.073204Z","title":"Planning with numeric timed initial fluents","venue":null,"work_id":"0f7b4073-3332-4d30-aefa-5c7e992d5174","year":2015},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:32.140253Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:b923ac3323ecce6c26d0869ea2baf14237c44891a1e45dae4cf43fb020e35403","observation_id":"32ea7410-4352-4e01-a8d0-d0e2e71c8da6","resolution":{"observed_at":"2026-08-07T13:32:40.182754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:39.943762Z","title":"Rosenschein","venue":null,"work_id":"02f613fc-eaa0-4f3c-8c71-c42a916b8d35","year":2011},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:32.192362Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:58ac0375209384bf5c0b88efddad218bd2a7d4460e8d07a695c8eaf9f9bd48b1","observation_id":"4af91f66-89d5-49f2-ac26-fb0f75430ad7","resolution":{"observed_at":"2026-08-07T13:32:40.009784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-07T13:32:32.267967Z","title":"MIT Press, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:32.267967Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:6103199a71c45abd2e9359701d283597c559e45eb21b4480f4f0fd98c4b6eed0","observation_id":"51197954-c96b-4662-a749-6a955d672187","resolution":{"observed_at":"2026-08-07T13:32:32.267967Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:39.731705Z","title":"System 1.x: Learning to balance fast and slow planning with language models","venue":null,"work_id":"461f996c-7679-43a8-a4c7-c83aad7f2659","year":2025},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:32.365610Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:9bfde47071f33f52ea34a28e37a251cde149c2cef4dc2f150eacf1830e392359","observation_id":"1f4ed307-70b5-4fa0-bdac-6064b858ab26","resolution":{"observed_at":"2026-08-07T13:32:39.815832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:39.600887Z","title":"Relational dynamic influence diagram language (RDDL): Language description, 2010","venue":null,"work_id":"c1e7cbf1-19f9-46cf-bbd7-d9d703a8a872","year":2010},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:32.444096Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:e289dcffefe43d880260bcf5f151e615f5312edf2d028145e48e0b8052660d79","observation_id":"e45375cb-8d80-4df1-96db-ed573f3fe98a","resolution":{"observed_at":"2026-08-07T13:32:39.652973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-07T13:32:32.525740Z","title":"PDDL generators","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:32.525740Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:b7435a79a2c77913461e04efc73d18a1a101271dd2b4775b4057f100f7c57f15","observation_id":"dcd8d5be-7c6c-449d-a680-85cd8dee413d","resolution":{"observed_at":"2026-08-07T13:32:32.525740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.10379","last_updated":"2024-06-02T16:01:35Z","snapshot_observed_at":"2026-07-06T16:08:17.076884Z","submitted_at":"2023-08-20T22:36:23Z","title":"Algorithm of Thoughts: Enhancing Exploration of Ideas in Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.10379","snapshot_observed_at":"2026-08-07T13:32:32.584449Z","title":"Al- gorithm of thoughts: Enhancing exploration of ideas in large language models.CoRR, abs/2308.10379, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:32.584449Z"},"links":{"cited_paper":"/paper/2308.10379","citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:16c1aebbb0bbf57ff07515e9f9bdcd9e9dd23e16bb9202f29c74a80cfa161b7e","observation_id":"5b71bad0-7113-475d-9baa-4fc12edc5231","resolution":{"observed_at":"2026-08-07T13:32:32.584449Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:39.436612Z","title":"Alfworld: Aligning text and embodied environments for interactive learning","venue":null,"work_id":"03b54907-dcb4-4f1a-a3bb-c3b9024f0994","year":2021},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:32.712837Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:485f5cadbe2e6eb2811b6e9e916ea7b14d8b86ec44795c175c17377d99de3011","observation_id":"f9db5074-80f2-4446-9052-1bf48522d53d","resolution":{"observed_at":"2026-08-07T13:32:39.525356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:39.270697Z","title":"Generalized planning in PDDL domains with pretrained large language mod- els","venue":null,"work_id":"0c3302e8-32b2-4f3f-9f4a-34a7584f51cc","year":2024},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:32.811457Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:53e78e4b52c3ed415c00e8cc3e1795678eaf5b39aaeb0f9d11c872bd5f0cbe6b","observation_id":"e4f853c6-7ba4-40cb-bc49-1f6d96a9b29a","resolution":{"observed_at":"2026-08-07T13:32:39.328344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:39.079423Z","title":"Sudoku as a constraint problem","venue":null,"work_id":"ab5a36d0-ea45-4c3a-b91f-3250b618d8e7","year":2005},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:32.889666Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:eb2c0ac3b742873a8c86910b0525cf959e458c098c1578cc1892d77b2ea11d25","observation_id":"e1305527-b57d-44cd-ac57-6106970337ee","resolution":{"observed_at":"2026-08-07T13:32:39.167334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:32:38.898683Z","title":"The complexity of propositional linear temporal logics.Journal of the ACM, 32(3):733–749, 1985","venue":null,"work_id":"31f2054e-c26f-4d4b-be69-43f80de6a2c0","year":1985},"citing_paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:33.000846Z"},"links":{"citing_paper":"/paper/2505.21674"},"observation_digest":"sha256:bb0e684e4d76f52b1c7e13a9171186ee452bc2ebd6dceb1ca4360009512605ae","observation_id":"623c2ded-c44d-4b53-ba50-052aec7e97f3","resolution":{"observed_at":"2026-08-07T13:32:38.972402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2505.21674","last_updated":"2025-05-27T18:51:06Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T23:39:33.909297Z","submitted_at":"2025-05-27T18:51:06Z","title":"Make Planning Research Rigorous Again!"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":57,"verified_exact":0,"verified_fuzzy":43},"total_outbound_references":121},"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 100 of 121 outbound references and 1 inbound Pith citation observation for arXiv:2505.21674."}