{"as_of":"2026-08-10T20:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:99fad04f5c3e2c31137e42e2ad579f64a87f95160eefbd590438f1c43ac197a0","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T22:34:42.315863Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-30T23:16:16.756079Z","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-07-04T06:59:38.197684Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"cited_work":{"arxiv_id":"2501.18784","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.18784","snapshot_observed_at":"2026-07-09T02:19:35.843911Z","title":"Tuisov, Y","venue":null,"work_id":"f6fc1092-2f8d-47cb-b035-b27b270d2d65","year":2025},"citing_paper":{"arxiv_id":"2605.07707","last_updated":"2026-05-28T05:19:42Z","snapshot_observed_at":"2026-07-06T23:20:01.856093Z","submitted_at":"2026-05-08T13:14:31Z","title":"Hierarchical Task Network Planning with LLM-Generated Heuristics","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-11T01:53:03.098641Z"},"links":{"cited_paper":"/paper/2501.18784","citing_paper":"/paper/2605.07707"},"observation_digest":"sha256:8184deb722c86355f30ac422f7b4d4e227aca1bb29e61b8b513270b8c0bdb946","observation_id":"142bf18c-93e5-4b80-8ed9-77714f63e54f","resolution":{"observed_at":"2026-07-09T02:19:35.843911Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"cited_work":{"arxiv_id":"2501.18784","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.18784","snapshot_observed_at":"2026-07-09T02:19:35.843911Z","title":"Tuisov, Y","venue":null,"work_id":"f6fc1092-2f8d-47cb-b035-b27b270d2d65","year":2025},"citing_paper":{"arxiv_id":"2605.07707","last_updated":"2026-05-28T05:19:42Z","snapshot_observed_at":"2026-07-06T23:20:01.856093Z","submitted_at":"2026-05-08T13:14:31Z","title":"Hierarchical Task Network Planning with LLM-Generated Heuristics","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-30T23:16:16.756079Z"},"links":{"cited_paper":"/paper/2501.18784","citing_paper":"/paper/2605.07707"},"observation_digest":"sha256:5f81362d4c26231cd8a07363c878ed2858c3d91518e0f24d97796643c575b2a6","observation_id":"8e67c0e7-93c0-4f75-a92e-1c3e52ed1105","resolution":{"observed_at":"2026-07-09T02:19:35.843911Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"cited_work":{"arxiv_id":"2501.18784","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.18784","snapshot_observed_at":"2026-07-09T02:19:35.843911Z","title":"Tuisov, Y","venue":null,"work_id":"f6fc1092-2f8d-47cb-b035-b27b270d2d65","year":2025},"citing_paper":{"arxiv_id":"2605.21902","last_updated":"2026-05-21T02:24:33Z","snapshot_observed_at":"2026-08-02T17:41:19.479546Z","submitted_at":"2026-05-21T02:24:33Z","title":"Planning in the LLM Era: Building for Reliability and Efficiency","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-22T06:52:40.063610Z"},"links":{"cited_paper":"/paper/2501.18784","citing_paper":"/paper/2605.21902"},"observation_digest":"sha256:db808f8d3d447f0cc90fe0bc94c96114c4bbd5adce60923efc9a023b9454c346","observation_id":"6de21813-d448-4bc2-8891-484d9679599c","resolution":{"observed_at":"2026-07-09T02:19:35.843911Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"cited_work":{"arxiv_id":"2501.18784","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.18784","snapshot_observed_at":"2026-07-09T02:19:35.843911Z","title":"Tuisov, Y","venue":null,"work_id":"f6fc1092-2f8d-47cb-b035-b27b270d2d65","year":2025},"citing_paper":{"arxiv_id":"2605.29649","last_updated":"2026-06-17T09:39:26Z","snapshot_observed_at":"2026-07-06T23:39:01.234601Z","submitted_at":"2026-05-28T09:14:39Z","title":"LLM-Evolved Domain-Independent Heuristics for Symbolic AI Planning","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-06-29T07:27:38.641720Z"},"links":{"cited_paper":"/paper/2501.18784","citing_paper":"/paper/2605.29649"},"observation_digest":"sha256:62e5b2c2fd5ca49dd7c7ffe9cc13204b091314c3906c5762037cc0861caef6bf","observation_id":"12337b23-d1df-4ff8-ba23-49609e65ef8b","resolution":{"observed_at":"2026-07-09T02:19:35.843911Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"cited_work":{"arxiv_id":"2501.18784","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.18784","snapshot_observed_at":"2026-07-09T02:19:35.843911Z","title":"Tuisov, Y","venue":null,"work_id":"f6fc1092-2f8d-47cb-b035-b27b270d2d65","year":2025},"citing_paper":{"arxiv_id":"2606.21740","last_updated":"2026-06-19T20:53:10Z","snapshot_observed_at":"2026-08-01T23:24:43.869329Z","submitted_at":"2026-06-19T20:53:10Z","title":"Training the Orchestrator: A Supervised Approach to End-to-End PDDL Planning with LLM Agents","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-06-26T13:56:51.914966Z"},"links":{"cited_paper":"/paper/2501.18784","citing_paper":"/paper/2606.21740"},"observation_digest":"sha256:1afa9d02d836dac7d9b25b7161e8bffaa4f6977452c519ad21d11a089c484d66","observation_id":"2a4b70e7-5c26-4d0b-8421-45eb3b0ba792","resolution":{"observed_at":"2026-07-09T02:19:35.843911Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.18784/citation-record","integrity":"/paper/2501.18784/integrity","json":"/paper/2501.18784/citation-record.json","paper":"/paper/2501.18784"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T22:34:42.131219Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.131219Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:f5a84ddebb52c4374584efaf3604547566f37f101c11b2a2ab9cbee177519193","observation_id":"5c82e2ed-8c4d-4e31-a910-ada36c0dfea7","resolution":{"observed_at":"2026-08-09T22:34:42.131219Z","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-09T22:34:42.136635Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.136635Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:577ccebea5c258949cd31349cade57d83a48c7d9c71bf014de01e9dc571f6bb5","observation_id":"f2d76b14-1e1b-48be-846f-83a580812918","resolution":{"observed_at":"2026-08-09T22:34:42.136635Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12435","last_updated":"2025-02-18T02:11:03Z","snapshot_observed_at":"2026-08-10T12:11:06.174062Z","submitted_at":"2025-02-18T02:11:03Z","title":"A Survey on Large Language Models for Automated Planning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.12435","snapshot_observed_at":"2026-08-09T22:34:42.141676Z","title":"J.; and Yao, Z","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.141676Z"},"links":{"cited_paper":"/paper/2502.12435","citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:5e31bd3115d100b6d7318899fb779ed80b14f449c5eaae6afeb564e0e2201b79","observation_id":"cdc61e0e-89b7-49eb-bbd3-9fe439f970fd","resolution":{"observed_at":"2026-08-09T22:34:42.141676Z","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-09T22:34:42.957821Z","title":null,"venue":null,"work_id":"86947a9d-7af4-44c4-8def-d5ebd613554c","year":2017},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.146725Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:78843ba102c7fbc14aad7f276f30d0c8f1cc3ffac6d106f5d0b0cf192ddce3b5","observation_id":"5cd5e2f8-c954-49a8-a947-ef3c8952b91c","resolution":{"observed_at":"2026-08-09T22:34:42.961351Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.947765Z","title":null,"venue":null,"work_id":"377b3ec7-ad37-4265-a15f-b00d4ce33539","year":2024},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.151223Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:eb9b05ec9c54840e3b6b24e642e6debc01e68da85d62819d2bed2e6fd166a11d","observation_id":"48b9c2ab-cc49-4496-adbc-394159734101","resolution":{"observed_at":"2026-08-09T22:34:42.951229Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.937032Z","title":null,"venue":null,"work_id":"8c1e7e97-bb4b-43d4-8cd8-1fa82992793b","year":2001},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.155945Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:5431e131301610537fce83f36a40a8c6214d3c69911d341373be669b60498301","observation_id":"7eb4def3-a92f-4709-8d71-fe111068cad7","resolution":{"observed_at":"2026-08-09T22:34:42.941254Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.926630Z","title":"Z.; and Thi \\' e baux, S","venue":null,"work_id":"a1033400-e9c4-48f8-9219-1787a81400ae","year":2024},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.160710Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:41ad27be51b6c5464f51b38a27ccc38156d1682b3dcfd5f4810d32220856020f","observation_id":"62c339aa-b8c7-4cb1-bc08-47af932daee4","resolution":{"observed_at":"2026-08-09T22:34:42.930116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.916241Z","title":"Z.; Thi \\' e baux, S.; and Trevizan, F","venue":null,"work_id":"fab57724-3d77-426e-b479-252b8a6be028","year":2024},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.165083Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:b9cda447c8969920a014c71d7266214d8fe584d5a7d330c6e787719715e944d2","observation_id":"f45e572e-e985-4689-a877-107ee0a5271c","resolution":{"observed_at":"2026-08-09T22:34:42.919779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.905838Z","title":null,"venue":null,"work_id":"84a01ca2-bdc9-448c-9f06-bd8b884aca9c","year":2024},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.169734Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:0c1fe769367f16364568bcee1a09641454b6ebfdbfe4feb74ccc044dbaf127f6","observation_id":"126b2155-c0f0-437a-8050-693f660f26a5","resolution":{"observed_at":"2026-08-09T22:34:42.909321Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.173996Z","title":"B.; Pereira, A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.173996Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:97e9ea2952cd92040d2b0bc4842d9457f5332a83f7bf2b5690361b03b900cdb7","observation_id":"03fb3de9-a284-4fbf-bad3-b9fb3df2e7de","resolution":{"observed_at":"2026-08-09T22:34:42.173996Z","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-09T22:34:42.895591Z","title":"a t Freiburg, Institut f \\","venue":null,"work_id":"8444e55c-c9d7-49cf-91f4-336b92fb747f","year":2004},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.178171Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:84383cfdeb227b09f5e091dfc656e7c81d56fba7152785fef3d0b4935eff9166","observation_id":"150ab013-8051-4312-955b-895f7a1cb3d7","resolution":{"observed_at":"2026-08-09T22:34:42.899192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.885142Z","title":null,"venue":null,"work_id":"b5e18217-9cd4-4229-b2d9-07a7aee6ff47","year":2003},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.182654Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:4e1d496bcdfafa691e905668feba837e9318b40851bc2630475bebad8f47f7e9","observation_id":"9d63a65e-0e8c-4789-af23-999f7df81218","resolution":{"observed_at":"2026-08-09T22:34:42.889107Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.874827Z","title":null,"venue":null,"work_id":"0bcb3de0-38c5-4b19-bbb6-8dc919ce3067","year":2005},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.186639Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:758c41c8328aa82611f6ab30f67adb4e20a49eca355d6756e1da0a0fa2525b45","observation_id":"11d0d4bb-6703-49a4-94f5-87a7f2c3653d","resolution":{"observed_at":"2026-08-09T22:34:42.878284Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.864739Z","title":null,"venue":null,"work_id":"515fcad7-44f4-4a2d-ae8a-f12c5335bc50","year":2023},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.190730Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:5a7b431a7bf1266fbac5b2cbe7c60de9ae2fdb3f5d879ef204de9d637aa4bfb1","observation_id":"15ba99c6-77e0-4334-895e-1eca27300e75","resolution":{"observed_at":"2026-08-09T22:34:42.868238Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.853839Z","title":null,"venue":null,"work_id":"5228a6e7-dd15-4295-b245-d63f1a760a4f","year":2023},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.194846Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:b81c9bd0656b23056625ef1339f012f0d6fb197c4ec9266f14a638f553f2661a","observation_id":"c5468986-d955-41be-aa78-7cceb70e2e82","resolution":{"observed_at":"2026-08-09T22:34:42.857668Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.843456Z","title":"J.; Wang, Z.; Wang, D","venue":null,"work_id":"a76ae044-6d15-4402-a525-17bf777db98a","year":2023},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.198870Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:bb973fec7dcef09b21dc1e2567a8ee8b36dd8450c014111eecd257e9729073ac","observation_id":"a57b52fc-88bb-4b64-8783-8936bc3eed15","resolution":{"observed_at":"2026-08-09T22:34:42.847104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.832506Z","title":"E.; Nilsson, N","venue":null,"work_id":"66afee75-0dd4-4f6d-b13c-b7ac56b8b989","year":1968},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.202806Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:1a71ce43c75e1ad112b7edca595826ad5382a2b4c00ded003499753102b8ea4f","observation_id":"0ffe92eb-f215-4894-81e6-7bc4e7772146","resolution":{"observed_at":"2026-08-09T22:34:42.836194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.821549Z","title":null,"venue":null,"work_id":"ad4fb2cf-c0f9-4e5d-87fe-321310691d14","year":2003},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.206801Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:c344f6513cd9a8cdf1fa2efdb9dafe6419e10216b3498f182ea19a2401dd9179","observation_id":"526af588-39c9-4e8e-b8dd-089da6861c1c","resolution":{"observed_at":"2026-08-09T22:34:42.825379Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.809692Z","title":null,"venue":null,"work_id":"9c562069-9361-4491-a097-eaa9f53e4893","year":2004},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.211013Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:485c636f5bb890605647c8946c2b166dd3092e8080ecd59c00f5c0fa5fa0d72a","observation_id":"ba83d2bf-36b7-4c33-9640-8c4c58960bdf","resolution":{"observed_at":"2026-08-09T22:34:42.813576Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.797626Z","title":null,"venue":null,"work_id":"611fc34b-7814-4445-8e1f-8812dcaa40fb","year":2025},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.215293Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:40d10ef259870ebd66f214b58b7d307ff010d682557212b4ea0b400967c30951","observation_id":"98bd2fbf-9fdf-45f1-bd32-cd3226cd5b05","resolution":{"observed_at":"2026-08-09T22:34:42.801721Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.785320Z","title":null,"venue":null,"work_id":"48f62329-08de-4ee5-b8c2-2fe540e3ebf5","year":2024},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.219389Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:63cf44f4365b1368f31cc4f90a02fa331487221bece7d67476f3b1059f29699f","observation_id":"840fe82f-02ee-4331-91a2-f3a4ac773fb3","resolution":{"observed_at":"2026-08-09T22:34:42.789309Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.773559Z","title":null,"venue":null,"work_id":"67b6fda4-fa37-47d3-969f-329808b8f577","year":2022},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.223522Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:06b8424ea75bfa358a0d8c08602be5e11400519a7f9e26d417a89244d6ff79c1","observation_id":"c6f75eab-82ae-4800-9a7a-4efdaced296a","resolution":{"observed_at":"2026-08-09T22:34:42.777170Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.227575Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.227575Z"},"links":{"cited_paper":"/paper/2304.11477","citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:9813333eef5582bb07509e0b4a05f0ed3488f9c4fccac22b5a61803c768f511c","observation_id":"0e13006f-c15e-4be6-b300-63f4c22e32bd","resolution":{"observed_at":"2026-08-09T22:34:42.227575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02051","last_updated":"2024-06-01T16:48:37Z","snapshot_observed_at":"2026-08-10T02:50:45.341878Z","submitted_at":"2024-01-04T04:11:59Z","title":"Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02051","snapshot_observed_at":"2026-08-09T22:34:42.231821Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.231821Z"},"links":{"cited_paper":"/paper/2401.02051","citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:7742575737b56d47886cc5b411eb7ebb85b9ddc3857de9b8d0c74bd5031c2f92","observation_id":"9755eca8-772a-406c-9b0f-59f0edb1fa5f","resolution":{"observed_at":"2026-08-09T22:34:42.231821Z","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-09T22:34:42.762136Z","title":"P.; Hermann, K.; Welleck, S.; Yazdanbakhsh, A.; and Clark, P","venue":null,"work_id":"c0317487-6939-4289-a4ea-d476dc988518","year":2023},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.236429Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:ac9f54c0c9e75b44036776f6c4618d58935424e66f0040c1aa677668aa1ee908","observation_id":"22b21f6d-e45f-4e04-8af3-13b15ad6a117","resolution":{"observed_at":"2026-08-09T22:34:42.766375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.751369Z","title":"R.; Zheng, Q.; Hui, B.; Zhuo, T","venue":null,"work_id":"70d6239a-1ab8-4d2e-aeea-74d91c393f2e","year":2024},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.240562Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:55c1e5538b2a77e822523071c7e6a899ceb074c8d54f95a756413871ac16c26c","observation_id":"36a2ea33-0897-46f1-a7c9-94212f32235a","resolution":{"observed_at":"2026-08-09T22:34:42.755028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.739737Z","title":"T.; Srinivas, K.; Kokel, H.; Lee, J.; Katz, M.; and Sohrabi, S","venue":null,"work_id":"bc789872-5d57-4a2c-8e47-1315e75f5321","year":2024},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.244545Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:26489aa0bb77f317460d2c7869d1321beedda8e25e11cd04c32f4287863a3eba","observation_id":"083b573c-db08-478f-9b09-17615f0442e1","resolution":{"observed_at":"2026-08-09T22:34:42.744469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.727763Z","title":null,"venue":null,"work_id":"e2562ce5-ae2e-4838-b000-5a53bb332c83","year":1984},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.249009Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:d6b91f5934663071c644dc130cd70491cf2fd429afe466675b76513e4ed65fb4","observation_id":"8075451d-37df-405a-a1c5-69b8ac3cff98","resolution":{"observed_at":"2026-08-09T22:34:42.731965Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.714754Z","title":null,"venue":null,"work_id":"3a58fcf9-3c7b-4cf5-b639-06260db6fe0f","year":2020},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.253080Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:efa7747bdc4daea38cd3b6dd4ec95482d9b49ff199723e11bd548582af1d4c1b","observation_id":"cc12100a-6f12-4e8b-a816-7008933cf0e3","resolution":{"observed_at":"2026-08-09T22:34:42.718741Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.702304Z","title":null,"venue":null,"work_id":"3c1ac941-44ac-4bf0-9a94-fe4f7356715a","year":2024},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.257049Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:fd473633873e195b0fdac40fb19587f7cd6d4d03bb0bfc3863eae76a8bdd526f","observation_id":"1d547134-d8cd-4a2e-8830-271d252b8a85","resolution":{"observed_at":"2026-08-09T22:34:42.706269Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.689030Z","title":null,"venue":null,"work_id":"f342bf9f-d57a-49fe-b38f-683c2c7446c7","year":2023},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.261113Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:e53d6e89c450ea5ad32feb5ae9910f6d798df9a3da3577bf2694c70ba7059384","observation_id":"3271cf43-5c3e-44a9-9e69-edc0225c057b","resolution":{"observed_at":"2026-08-09T22:34:42.693237Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.676823Z","title":"B.; Kaelbling, L","venue":null,"work_id":"af227554-80f8-49af-965b-4bee6815b1ec","year":2024},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.265486Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:103130ffb4678d5928fa0efe2235a6eedb0c9c9a62edb4b371851a43831c0ca3","observation_id":"6f57329f-1a4a-4c08-9497-5912180f396e","resolution":{"observed_at":"2026-08-09T22:34:42.680631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.20306","last_updated":"2024-03-29T17:22:48Z","snapshot_observed_at":"2026-08-10T13:32:41.965262Z","submitted_at":"2024-03-29T17:22:48Z","title":"Towards Greener LLMs: Bringing Energy-Efficiency to the Forefront of LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.20306","snapshot_observed_at":"2026-08-09T22:34:42.269528Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.269528Z"},"links":{"cited_paper":"/paper/2403.20306","citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:6d70d37f8b442bfb0fd8d40d86b3d77adb7a60a747152cb57ccacbc258f1ce6d","observation_id":"133476d5-b601-45a9-b2d1-99c35d28e984","resolution":{"observed_at":"2026-08-09T22:34:42.269528Z","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-09T22:34:42.664469Z","title":null,"venue":null,"work_id":"5698fde1-463e-4148-b44f-7d5b6c6cd72d","year":2024},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.274036Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:8cef842259018dc9fa2b19c02e2fa78adf532ad8125f95d67b38903c893af593","observation_id":"5568fcf5-865d-4886-8550-f817260e302d","resolution":{"observed_at":"2026-08-09T22:34:42.668752Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.278050Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.278050Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:f95d042f6752ff458cef18a8eed9ae9c0fb4433dacda047363564dc47d437847","observation_id":"7b28fb54-7aa1-4e19-87ef-4e06707607f7","resolution":{"observed_at":"2026-08-09T22:34:42.278050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.10498","last_updated":"2023-11-26T01:15:41Z","snapshot_observed_at":"2026-07-06T13:23:11.566484Z","submitted_at":"2022-06-21T16:15:27Z","title":"PlanBench: An Extensible Benchmark for Evaluating Large Language Models on Planning and Reasoning about Change","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.10498","snapshot_observed_at":"2026-08-09T22:34:42.282181Z","title":"O.; Sreedharan, S.; and Kambhampati, S","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.282181Z"},"links":{"cited_paper":"/paper/2206.10498","citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:718185bd659ed090dc424d6d14699373c6acd47a13dae5cb71aa335d0d56be93","observation_id":"fafff5a4-8a2a-4493-9f1c-9db9facc9e43","resolution":{"observed_at":"2026-08-09T22:34:42.282181Z","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-09T22:34:42.286632Z","title":"V.; Zhou, D.; et al","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.286632Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:6e513786fa7f2d22d5749abc3e44446d34c0e01b32ac4c560b562f0b87d6b14b","observation_id":"2aaa9a94-0ee3-47f8-b0e8-f67df7afc938","resolution":{"observed_at":"2026-08-09T22:34:42.286632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18323","last_updated":"2023-05-23T00:16:48Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-23T00:16:48Z","title":"ReWOO: Decoupling Reasoning from Observations for Efficient Augmented Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.18323","snapshot_observed_at":"2026-08-09T22:34:42.290761Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.290761Z"},"links":{"cited_paper":"/paper/2305.18323","citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:b5dea7a0b11d749dc40fbfb91231cf24e5b1825de6153152c822d227725ef4e9","observation_id":"9e645ef6-a160-4448-846e-a279b871b1e9","resolution":{"observed_at":"2026-08-09T22:34:42.290761Z","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-09T22:34:42.646165Z","title":null,"venue":null,"work_id":"ca2af51c-15f5-407e-99d5-4a7bbc956f73","year":2023},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.295271Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:15d60f7faa80a9e3259d6f85439f44cdb5d7e7243ef7e8b76d01ff4880b9fd39","observation_id":"3c7c209e-989d-4b75-aaf7-e90d07c63011","resolution":{"observed_at":"2026-08-09T22:34:42.649898Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.634377Z","title":"R.; and Cao, Y","venue":null,"work_id":"07443a88-48ce-4d0c-aaf9-7cd3837be34f","year":2023},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.299322Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:99e086714b592afeb8d1620d7641bb9b013a94bbce5c293e3bd32b6fd711f51b","observation_id":"4a02ffa8-82c2-43dc-9acd-f67d04532131","resolution":{"observed_at":"2026-08-09T22:34:42.638328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.303803Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.303803Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:badc5720c8b35bc350f86f781873a9e5b0b267ccc75c527f2a0fdd75461174ea","observation_id":"413030e9-a77a-4e17-bc0b-74b69e6f7413","resolution":{"observed_at":"2026-08-09T22:34:42.303803Z","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-09T22:34:42.613823Z","title":null,"venue":null,"work_id":"6fc888fa-958f-4792-86dd-05e81cd7e2aa","year":2023},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.307655Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:f1dd759c194d4936c16218df253f7c6cb81ef69cb03d1f43417e4a0a484573bb","observation_id":"f0ff98ad-5a9a-481b-8a7e-fd68a08b5bae","resolution":{"observed_at":"2026-08-09T22:34:42.617901Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.600316Z","title":null,"venue":null,"work_id":"fbfe0030-109a-446d-bfd5-90184e4720e5","year":2024},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.311763Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:dd89cd4e8770f3b73c52affe8e2f6c6bc15c9be03914759c68334a1a9fda601a","observation_id":"62374ef8-e4fb-423b-8f7c-27ce88d902b5","resolution":{"observed_at":"2026-08-09T22:34:42.604520Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T22:34:42.584796Z","title":null,"venue":null,"work_id":"b7d55194-fed7-4a97-8f28-a926ff62f847","year":2024},"citing_paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics","version":5},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-09T22:34:42.315863Z"},"links":{"citing_paper":"/paper/2501.18784"},"observation_digest":"sha256:e8cedbdbd6fa8340ca18453a4b9a5615584f91c1e11d5a17128acc82d8897f30","observation_id":"893e5a50-09c9-4beb-879c-4f9600be5a7a","resolution":{"observed_at":"2026-08-09T22:34:42.590086Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.18784","last_updated":"2026-07-08T10:18:17Z","latest_version":5,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-10T19:25:10.940162Z","submitted_at":"2025-01-30T22:21:12Z","title":"Successor-Generator Planning with LLM-generated Heuristics"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":34,"verified_exact":0,"verified_fuzzy":10},"total_outbound_references":44},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 5 inbound Pith citation observations for arXiv:2501.18784."}