{"as_of":"2026-08-14T13:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cdf285aac4e8106546db2bd7da851f366308d83b710e5f57466d164de4e1d48d","coverage":[{"denominator":86,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":86,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T23:51:53.878489Z","state":"measured"},{"denominator":86,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":86,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.02136/citation-record","integrity":"/paper/2412.02136/integrity","json":"/paper/2412.02136/citation-record.json","paper":"/paper/2412.02136"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:51:53.488380Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.488380Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:e629202d73d813b59ed594659b0b0d1dd94e80264b9333b772ec95ab1d70c89f","observation_id":"b77d01aa-8d0a-457b-a0af-ca7812369474","resolution":{"observed_at":"2026-08-11T23:51:53.488380Z","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-11T23:51:53.494197Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.494197Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:cfa3d3115dc2c02d4ea62aa304de73ffffa52ac5ffeeb3e56504619c12c42608","observation_id":"f053cab6-ce2b-4e09-8f04-bf29dee87ee2","resolution":{"observed_at":"2026-08-11T23:51:53.494197Z","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-11T23:51:53.499619Z","title":"The surprising power of graph neural networks with random node initialization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.499619Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:b79b0e3683fd0b1d51cc819811dc0a97c53174e33a256e24e74ef076f2acd839","observation_id":"d1a284e8-8a5b-4486-9513-288f7de6e697","resolution":{"observed_at":"2026-08-11T23:51:53.499619Z","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-11T23:51:53.504737Z","title":"Improving subgraph-gnns via edge-level ego-network encodings","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.504737Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:8974041fab1f5e7a73fb230c4b8edc9c0e149433fd35134a55e0bb48b73fe322","observation_id":"bb8c5996-2205-4991-93bd-477212909541","resolution":{"observed_at":"2026-08-11T23:51:53.504737Z","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-11T23:51:53.509522Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.509522Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:904a441e7d257f4fe3a10c9b8f23bc8a36409ac2f19a56e34472ceec069e540e","observation_id":"9189ae7e-6883-47e9-b0b6-6f0f41e14c92","resolution":{"observed_at":"2026-08-11T23:51:53.509522Z","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-11T23:51:53.514255Z","title":"Bronstein","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.514255Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:cff9ac58c7aebf0a96c3a470cd1df869437cc9af8be0f982f00eb0df8406814b","observation_id":"32599f23-0eda-410f-bc27-3ed214eb8dc3","resolution":{"observed_at":"2026-08-11T23:51:53.514255Z","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-11T23:51:55.167529Z","title":"General policies, subgoal structure, and planning width","venue":null,"work_id":"c8eabfc8-4b76-4fb4-98a5-0abd2653b2e4","year":2024},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.519024Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:2d1258c8e19135bfb8ec0c5952f26575596b55bb0b2f161122786ca509a0b02a","observation_id":"0ead7d26-58f9-43c7-bb96-5d30123d88ea","resolution":{"observed_at":"2026-08-11T23:51:55.172389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:55.152846Z","title":"Breaking the limits of message passing graph neural networks","venue":null,"work_id":"81dd2bdb-6a88-4978-9c65-2bc9c6493e59","year":2021},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.523543Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:bec401af4aaeb0321348fd148d89f138388206617ca431eed247fe43e35fe53b","observation_id":"b2fa3328-4787-4c4d-a551-5b46607a7091","resolution":{"observed_at":"2026-08-11T23:51:55.157698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:55.138968Z","title":"Kostylev, Mika \\\" e l Monet, Jorge P \\' e rez, Juan L","venue":null,"work_id":"c4b713ce-8158-4723-9830-ef906a6c45f6","year":2020},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.528469Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:eb7d0aa819e247b9823e01e866bed8a5fa1ced4663c47ff49077b6b1bea05bf1","observation_id":"9c4c0ad8-d7f3-4b65-aa0f-38f2163fc320","resolution":{"observed_at":"2026-08-11T23:51:55.143465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:55.124990Z","title":"Bartlett and Shahar Mendelson","venue":null,"work_id":"c8281280-694c-4f81-a109-ccf11d140f64","year":2001},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.532846Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:b94d88e7b9ebda3222d53abce597899283fe28e22a6ea18f3c2633f7e4fa8a88","observation_id":"526dbacd-a2a0-4d87-bc1e-86ef18f97311","resolution":{"observed_at":"2026-08-11T23:51:55.129890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:55.111132Z","title":"The computational complexity of propositional STRIPS planning","venue":null,"work_id":"40816923-1d36-4f7e-add0-aed1810e3774","year":1994},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.537289Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:1a88a4520a07159c6ef0465cb695509a36f92adf0f54caa7dd2cfa99927acb45","observation_id":"2743e0a1-709b-4e01-98b9-8bde717fd53a","resolution":{"observed_at":"2026-08-11T23:51:55.115701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:55.096823Z","title":"A review of generalized planning","venue":null,"work_id":"12bf513c-2c89-46fa-9526-4ed1efbd5fa6","year":2019},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.542195Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:441ecdab69de8a0b260d6fe66637bf4dd5bd54fd971b1bc09e8552dd4b7bbcfc","observation_id":"5b0d0889-47b4-4a4e-9d82-8f6ad3d4be9e","resolution":{"observed_at":"2026-08-11T23:51:55.101688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:55.082302Z","title":"Muggleton","venue":null,"work_id":"cde21cd4-bc81-42e5-a9e2-7d67eb22d836","year":2022},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.546927Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:762e3e513e7e188f92c92efc7376a1f58e84bdba794b00e18666b38c02ddfe28","observation_id":"c6630175-06b4-4d1e-87f9-fd62b4ccb2e7","resolution":{"observed_at":"2026-08-11T23:51:55.087305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:55.067568Z","title":"A review of machine learning for automated planning","venue":null,"work_id":"22097c71-9482-45d6-b88c-2001d6e7edfd","year":2012},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.551559Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:fe18565185ffeedd059bc67f8326ffb4cbff9f6310a686193cc789ba18e45afe","observation_id":"7226eb69-bc4e-4071-87e6-0aae0fd605a4","resolution":{"observed_at":"2026-08-11T23:51:55.072265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:55.053496Z","title":"Optimize planning heuristics to rank, not to estimate cost-to-goal","venue":null,"work_id":"fc1f1cea-fb5a-4876-8587-66344d541076","year":2023},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.556270Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:93b68e9cdd7ed677fc763536dbd6322e9bf866e47a46eaaa4d3628994791d333","observation_id":"55566b87-98f9-46ab-af17-600ab7271f2a","resolution":{"observed_at":"2026-08-11T23:51:55.057882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.07923","last_updated":"2024-10-10T13:49:05Z","snapshot_observed_at":"2026-08-12T22:26:18.810404Z","submitted_at":"2024-10-10T13:49:05Z","title":"Deep Learning for Generalised Planning with Background Knowledge","version":1},"cited_work":{"arxiv_id":"2410.07923","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.07923","snapshot_observed_at":"2026-08-11T23:51:54.108853Z","title":"Deep Learning for Generalised Planning with Background Knowledge","venue":"cs.AI","work_id":"0345bd23-632e-4b30-81df-97acba79e85f","year":2024},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.560803Z"},"links":{"cited_paper":"/paper/2410.07923","citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:00f621662778481c1696d9223bc5666ff119674be087e7e825cfc6e5560a290d","observation_id":"79262619-dc72-4257-96a4-16b86bcd094c","resolution":{"observed_at":"2026-08-11T23:51:54.113880Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:55.040113Z","title":"Chen and Sylvie Thi \\' e baux","venue":null,"work_id":"999d0062-90e5-4a23-a1fc-3945fd7b8903","year":2024},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.565761Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:c0cda71211d6246fb2ceea034fc3ec9a05ca96f69216d327ec224b5e99e646bf","observation_id":"b74f7f40-b8d1-4268-947a-fee75a2e7ed1","resolution":{"observed_at":"2026-08-11T23:51:55.044019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:55.026476Z","title":"Chen and Sylvie Thi \\' e baux","venue":null,"work_id":"1a39178c-78b0-4e0f-a2ca-f2fe09f0ed1e","year":2024},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.570300Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:6d21e92ef9a97fad279416836e361b19a3b5e02752c2f9e92cfc1da9d62da256","observation_id":"3df97589-4f6a-4305-90f9-0a7023417ca2","resolution":{"observed_at":"2026-08-11T23:51:55.030461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:55.011550Z","title":"Chen, Sylvie Thi \\' e baux, and Felipe Trevizan","venue":null,"work_id":"5412f185-fb0c-4e12-bd05-0c48b8122866","year":2024},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.574909Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:21fdce423e2b1e366bede57684f3aeda66021a41e8a609e1cee93996f9d297bd","observation_id":"a8fd917f-1459-4b0d-ba19-1bbb365a47a3","resolution":{"observed_at":"2026-08-11T23:51:55.016768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.995338Z","title":"Chen, Felipe Trevizan, and Sylvie Thi \\' e baux","venue":null,"work_id":"9a0da6c7-fe72-4d4b-9ff2-541095a03d05","year":2024},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.579610Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:66ab09985ab79356024c94d9e00af9c36097b61ea9e83cbf11b434c7131a218b","observation_id":"2fe99b2c-6047-46cc-b229-85fa9aa29317","resolution":{"observed_at":"2026-08-11T23:51:55.000560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.979375Z","title":"Higher-dimensional potential heuristics: Lower bound criterion and connection to correlation complexity","venue":null,"work_id":"872d1a8e-49e6-4e94-9587-b730023f2fa4","year":2024},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.583958Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:2824c5a0c108f8182ba060e573705331161a214b5c1da10fa447fbc4ab5c1c88","observation_id":"6956f207-9680-42cb-b2f8-b55d9e4fc32b","resolution":{"observed_at":"2026-08-11T23:51:54.984613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.963284Z","title":"Novelty vs","venue":null,"work_id":"1a9ce82a-381d-4ff1-9f9d-efbac54502d0","year":2024},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.587836Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:09a005d53d8604fcffea00db15d99d904fd82428039eac609495db56efdec410","observation_id":"3594806e-0fc1-470d-af71-1d9be4ceb8d5","resolution":{"observed_at":"2026-08-11T23:51:54.968535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.948190Z","title":"Neural logic machines","venue":null,"work_id":"80c9c41b-7398-4299-abdb-daa1d6379165","year":2019},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.591727Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:13c838042c1aee019e6a6459c2885455efd4eddad8b4fc8cbfb16d4ae6212b83","observation_id":"d4438763-55e7-4c49-b3f1-0f89531ee675","resolution":{"observed_at":"2026-08-11T23:51:54.952687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.934129Z","title":"Equivalence-based abstractions for learning general policies","venue":null,"work_id":"2359ead5-b0ac-42b1-a569-3b3377a79059","year":2024},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.595536Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:830bb99caa1f19cdc8fa73d285f529731c1c015756718a0dfbbd49d4251aa269","observation_id":"dfa3b3b3-e098-4496-8a90-ffb1d3ff60ea","resolution":{"observed_at":"2026-08-11T23:51:54.938889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.920317Z","title":"Expressing and exploiting subgoal structure in classical planning using sketches","venue":null,"work_id":"693a4277-2450-4392-b998-25a94b6efdc3","year":2024},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.599306Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:a6a3a7555278470f041dae3bc5c063272fc58835e004e15f4ef7b6b17b53f0b0","observation_id":"6bbeaa41-aa93-41fb-8363-a5f626ed9e3c","resolution":{"observed_at":"2026-08-11T23:51:54.924925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.906636Z","title":"How powerful are k-hop message passing graph neural networks","venue":null,"work_id":"9abdfb74-1f56-4acd-b318-95c5ce5ae6cd","year":2022},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.603004Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:2a25397a9275076ce41bd1d14e7bea58fa5f1dcf16ca9431b9f19b7dc043c784","observation_id":"4bd9419e-c429-458e-a925-1a68ad4ef5d9","resolution":{"observed_at":"2026-08-11T23:51:54.911229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.891199Z","title":"Neural network heuristic functions for classical planning: Bootstrapping and comparison to other methods","venue":null,"work_id":"6dcbe013-2941-489a-8727-f4d1c9a6f902","year":2022},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.606657Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:80865e243c4e2f2ce3cd3901c525fae34814238fb7e66d0734a09cc6ba2ffdc7","observation_id":"d4e68786-571a-463e-9f0f-2f48d4ad9a4f","resolution":{"observed_at":"2026-08-11T23:51:54.896517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.876132Z","title":"PDDL2.1: an extension to PDDL for expressing temporal planning domains","venue":null,"work_id":"b63e2fd4-e4c0-4db9-bc82-264418c42279","year":2003},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.610577Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:a824c4b76238613fe8e035199bc9b60041b98f909cb2e0ec81808d4f530d3e9b","observation_id":"74d44cb6-0473-4c01-831c-b9f76ed930ad","resolution":{"observed_at":"2026-08-11T23:51:54.881140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.861340Z","title":"A Concise Introduction to Models and Methods for Automated Planning","venue":null,"work_id":"f73101ef-3c7e-4c52-b92d-88ae485f3963","year":2013},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.614353Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:0db44ca36fcea2a3f506147adb9351bc16fd12053a2a0d633939d3a3e4288b55","observation_id":"00b120a2-b9a8-44fe-8879-3b5db18905fb","resolution":{"observed_at":"2026-08-11T23:51:54.865769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.847950Z","title":"Learning to rank for synthesizing planning heuristics","venue":null,"work_id":"cbf18eec-1680-4142-8a50-8b50eadd0872","year":2016},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.618021Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:a52a7e8a41038b0b15c6bc1a8cd64720fb837bbea525800a8b4047e3eb93761b","observation_id":"5af29866-3f6f-40ce-a527-edb2e051d9a2","resolution":{"observed_at":"2026-08-11T23:51:54.851781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.834119Z","title":"Formal representations of classical planning domains","venue":null,"work_id":"3567a583-be59-45f7-b942-68bf1fba6ec6","year":2024},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.622726Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:23d56390e1ccddac3748cc1948de0c3c8d29a61f2c14c2dee94bfb879ae85f67","observation_id":"1f1fd96e-a686-4de1-bc27-908da75c1fe4","resolution":{"observed_at":"2026-08-11T23:51:54.838946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.820348Z","title":"The logic of graph neural networks","venue":null,"work_id":"93c95ac9-3e20-4604-b375-a97ab0e4509d","year":2021},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.627077Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:5641b1d81c35a688c920af0a1927388cafc6d1d25e26a32e2e6dc4dfbb94c939","observation_id":"97550d1c-f2d9-4c3e-806f-596a85d91913","resolution":{"observed_at":"2026-08-11T23:51:54.824892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.806773Z","title":"LPG: A planner based on local search for planning graphs with action costs","venue":null,"work_id":"76b813bb-6b21-4cdd-afdd-5b42be19cc56","year":2002},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.631480Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:a2b8ddbfc25a0bea612f62285d67c2340ebccef8c237ac375cc4849b4ae97abb","observation_id":"8a943637-105d-4886-ab5d-38b3af8b1bb7","resolution":{"observed_at":"2026-08-11T23:51:54.811279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.791866Z","title":"Schoenholz, Patrick F","venue":null,"work_id":"866cad40-7ddd-4ba2-84d7-a852b7cb10f1","year":2017},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.635926Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:efda2b9adb0937cbb217c071f255645e6133fc8bc327517d787b96e072458909","observation_id":"84d1f23e-7f94-4546-a620-c5a4a94be0a5","resolution":{"observed_at":"2026-08-11T23:51:54.796517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.777911Z","title":"Exploiting first-order regression in inductive policy selection","venue":null,"work_id":"f6319bcb-3d5b-4b78-88ab-87cd7063424d","year":2004},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.640761Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:15e95c0ca2bc19496de497878008c3788e81b477c6aa09867bd2df9538b07f1e","observation_id":"a5291af4-b505-4fa0-ac3a-84c812d988cf","resolution":{"observed_at":"2026-08-11T23:51:54.782628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.764243Z","title":"Landmarks, critical paths and abstractions: What's the difference anyway? In ICAPS , 2009","venue":null,"work_id":"3508a175-a13a-4625-b2fa-a04746f9666f","year":2009},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.645622Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:cfd6628cfaa7e57a9b2770631fe66c8552005f5d562eca61307e49facf615554","observation_id":"fa9cbf8a-2d6d-4be3-9894-b897701b60b8","resolution":{"observed_at":"2026-08-11T23:51:54.768791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.750424Z","title":"A planning heuristic based on causal graph analysis","venue":null,"work_id":"c3bfbe76-a106-44af-8205-d120e3112983","year":2004},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.650335Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:c36ac6dcb1e4c9d31358ad8277acea40f8d2c0a3cd5e4be176ad1fbe12325875","observation_id":"83226b97-3155-49f7-97a2-05d7cc792fbf","resolution":{"observed_at":"2026-08-11T23:51:54.755070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.736008Z","title":"The FF planning system: Fast plan generation through heuristic search","venue":null,"work_id":"b7debc59-60fb-4b92-afe6-8404b11a4378","year":2001},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.654599Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:d140aec7bffbe49630539894c843f1bdf3ec9677c42dbb713fe8517989b4c11e","observation_id":"060ced00-a0bd-47c2-8847-757a88b732c1","resolution":{"observed_at":"2026-08-11T23:51:54.740682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.722861Z","title":"Expressiveness of graph neural networks in planning domains","venue":null,"work_id":"ab438dac-5664-437c-aa29-24b774770f69","year":2024},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.659203Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:9bd97cdc886a6235b572b19f4d0d4d33aa0ca424aed4f55fdc89eed950eb99cc","observation_id":"568ca063-2cf1-4a55-98e2-8af45b02d5b0","resolution":{"observed_at":"2026-08-11T23:51:54.727228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.710249Z","title":"Guiding GBFS through learned pairwise rankings","venue":null,"work_id":"731d8281-dfbe-43c2-9b1e-cae051329416","year":2024},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.663688Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:ef73776064f50ee5a668fb3bf02584ec704072efb8bbf23c227fb0016ef6e62e","observation_id":"54f28665-b3f6-431d-9877-367027b71b24","resolution":{"observed_at":"2026-08-11T23:51:54.714289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.697782Z","title":"McIlraith","venue":null,"work_id":"1f8299bd-869e-482b-9e3e-1f2c3480343b","year":2019},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.668236Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:0c0177bd2fae6e01ceada5c7dd03e94d9aef24c6930c703077258c5b491e467d","observation_id":"9c675a06-53f5-4066-a28a-97b0701c90e7","resolution":{"observed_at":"2026-08-11T23:51:54.701642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.684339Z","title":"Relational queries computable in polynomial time (extended abstract)","venue":null,"work_id":"016062e5-3c3e-417f-ace8-197f0120ef82","year":1982},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.672783Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:c1fff38c2b1e03ee603cd1fc98322a065ba908f0f301cc8a611be6e04a2cef8a","observation_id":"a5aa5651-ac31-4675-b8ab-52970f21fbe9","resolution":{"observed_at":"2026-08-11T23:51:54.689060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.670588Z","title":"Learning action strategies for planning domains","venue":null,"work_id":"bc8d42a3-1e62-4be3-b3ae-e714b219a784","year":1999},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.677461Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:85b56d3eb80374cd6216514177a5b92c62595317e5e6d11a237bb4af231192ae","observation_id":"fa09742e-b0f7-4eb5-b58d-79229d5eb24f","resolution":{"observed_at":"2026-08-11T23:51:54.675341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.657272Z","title":"Kriege, Fredrik D","venue":null,"work_id":"b49f74ef-9168-43c8-a832-0e759bd0c93d","year":2020},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.682352Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:530b4785718a5b9729657c8a067484312dd1d34babf997ff411929c237a09cd1","observation_id":"694f0bc6-9154-4bff-87d8-a7d8a6b80ed9","resolution":{"observed_at":"2026-08-11T23:51:54.661600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.643139Z","title":"Learning generalized relational heuristic networks for model-agnostic planning","venue":null,"work_id":"160886b3-5599-4d00-9cf0-d47e2734acbc","year":2021},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.686790Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:0b4ff141a40e5a8292bdfb420601f336751346e13e9448d639a279e82b839f4d","observation_id":"0b3a48cd-97b1-43eb-a94a-6bb66e0422b7","resolution":{"observed_at":"2026-08-11T23:51:54.647937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.629313Z","title":null,"venue":null,"work_id":"8c783512-e9a6-430b-adc2-277ee8515edb","year":2015},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.691372Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:44d1f61757b6193245870860a601e5ea66e2ba6fd3684025d5d7e764588f32de","observation_id":"1930e028-5622-4500-a520-0bf65579a04f","resolution":{"observed_at":"2026-08-11T23:51:54.633424Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.615741Z","title":"Width and serialization of classical planning problems","venue":null,"work_id":"dce468ba-2c03-4b41-8a36-bf37416967e7","year":2012},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.696013Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:be7f4e23e779c311a355a482373a8c7e3fcc2f7031d0f97058690dea9f888c75","observation_id":"b8c4b488-ef1b-4e4b-884e-19aab506f435","resolution":{"observed_at":"2026-08-11T23:51:54.620181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.601531Z","title":"Bronstein, Martin Grohe, and Stefanie Jegelka","venue":null,"work_id":"5284a46e-7885-4e4b-8691-62435b39fb3c","year":2024},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.700476Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:9f36e4559d2a6142c7d09b36e7fdf3b8b921244d1cab3ae058c0f7a4faeefb7d","observation_id":"6d18af38-1107-4e56-a8d5-125d60b041d7","resolution":{"observed_at":"2026-08-11T23:51:54.606182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.587753Z","title":"Online planner selection with graph neural networks and adaptive scheduling","venue":null,"work_id":"ab1c5480-7173-416f-86bd-844bd4b674b1","year":2020},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.705119Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:4746e6144ba085356dd7405a29a3d8bb3e8f854cad124f3ea002857a7c8aa15f","observation_id":"0fe7dbdb-581e-48c7-84c4-7e99c7a9c667","resolution":{"observed_at":"2026-08-11T23:51:54.592125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.574686Z","title":"Tenenbaum, and Leslie Pack Kaelbling","venue":null,"work_id":"747fab21-f85a-4020-92b1-76c3646dc7b5","year":2023},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.709746Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:718df67773f3e534b9d930c0a1ec5da7fc347f933f1055a8937c9d34b97bf294","observation_id":"c5b060f5-1f7a-437e-911d-a1b1d2aaf7a7","resolution":{"observed_at":"2026-08-11T23:51:54.578967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.561218Z","title":"Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe","venue":null,"work_id":"9dcf4de0-acd9-478c-bc9e-ffe02c2bb05b","year":2019},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.714291Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:b2cef4d7d89a3bd55606dfe6e93789257895af00f3376d137abaeb01650fc200","observation_id":"eb4c4d2a-af4e-498a-bccf-9251e2825eac","resolution":{"observed_at":"2026-08-11T23:51:54.565885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.548265Z","title":"Speqnets: Sparsity-aware permutation-equivariant graph networks","venue":null,"work_id":"b6c86c7d-98d5-4038-83bb-dabc07f81c8f","year":2022},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.719129Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:9abbe4fe922c4f52b10c82eba8a6a85226fb356576834ab257f0e15eb83d8fc2","observation_id":"71ce1b13-97b4-4311-b3d1-ee871692971b","resolution":{"observed_at":"2026-08-11T23:51:54.552244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.535253Z","title":"Weisfeiler and leman go sparse: Towards scalable higher-order graph embeddings","venue":null,"work_id":"aecc0e27-3729-469b-872d-e37013eb0fc9","year":2020},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.723630Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:9b95aa1c4b1265a1d39aa5a89d28bd6c56ca5f7b63f565cd192f638e5aabaedc","observation_id":"867e1478-1b98-495f-b4bf-c051839fb7ad","resolution":{"observed_at":"2026-08-11T23:51:54.539553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.522624Z","title":"On using admissible bounds for learning forward search heuristics","venue":null,"work_id":"132275de-2f9a-4d33-b1f2-de47edfe69d7","year":2024},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.728078Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:ec10a8ee82e487b7e3c2f1e52eff5c55a1da5c116eba9e51dbba358748f2e894","observation_id":"171dcc89-45c9-4061-8327-b183a169f70f","resolution":{"observed_at":"2026-08-11T23:51:54.526649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.508894Z","title":null,"venue":null,"work_id":"089c0af8-8ca0-4b77-9d7c-30045c3ddf50","year":2021},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.732663Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:013e9e1160c7ac71017924cb2a20b8b64cc063f29458342218f54b15e394c174","observation_id":"a2f39247-9f0d-4ff5-aed2-587582ed1977","resolution":{"observed_at":"2026-08-11T23:51:54.513446Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.494981Z","title":"Rosenschein","venue":null,"work_id":"b2b8bf45-dd5e-418d-b8fd-ac73133cd205","year":2011},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.736703Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:1e754f29165ac81c2aa8bef13e4c700af4e1b23668e27f81a8d59215f940d05c","observation_id":"26f6b282-1850-441e-98e6-f00889b2d9da","resolution":{"observed_at":"2026-08-11T23:51:54.499762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.480912Z","title":"The LAMA planner: Guiding cost-based anytime planning with landmarks","venue":null,"work_id":"b90b5f33-a854-47a0-88db-7afc39e5a885","year":2010},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.740893Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:f2c69883c9931aabcc434817c961aa0e0bf6a7590e6a635fd019f3127f402927","observation_id":"9a41b8d8-de3a-44bb-9f15-40ecd1f7a519","resolution":{"observed_at":"2026-08-11T23:51:54.485470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.467232Z","title":"Sutton and Andrew G","venue":null,"work_id":"8c36a314-bf40-4469-a4ce-8bf525438f99","year":1998},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.744922Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:2e199181456ddc1a0855291648e160f7b5089046d52e5e5c2d4be5e9ae0d82dd","observation_id":"7f24979a-6da8-4bb1-b67e-1b382829999a","resolution":{"observed_at":"2026-08-11T23:51:54.471570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.452136Z","title":"Learning general optimal policies with graph neural networks: Expressive power, transparency, and limits","venue":null,"work_id":"1083d092-e912-481f-b847-82567c14bbe5","year":2022},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.748967Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:9fb47a8be378fcbbc70beb02d9bbb92b4f965df2960b20fd48075b7dc51db2c8","observation_id":"e6174186-7d98-4e81-8785-8f4f7062eb49","resolution":{"observed_at":"2026-08-11T23:51:54.457642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.437844Z","title":"Learning general policies with policy gradient methods","venue":null,"work_id":"522d8637-8589-48f9-a828-60be91bf2f45","year":2023},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.752959Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:16f54fe04d0dd609a1372ba2ce62d2b2cb232b0ed4a3e758d3f93ef877eb9dc1","observation_id":"a7ad2c37-bb21-4a16-8f9d-da823c32bc04","resolution":{"observed_at":"2026-08-11T23:51:54.442669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.11734","last_updated":"2025-02-18T14:42:02Z","snapshot_observed_at":"2026-08-13T00:51:57.165442Z","submitted_at":"2024-03-18T12:42:53Z","title":"Learning More Expressive General Policies for Classical Planning Domains","version":2},"cited_work":{"arxiv_id":"2403.11734","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.11734","snapshot_observed_at":"2026-08-11T23:51:54.084906Z","title":"Learning More Expressive General Policies for Classical Planning Domains","venue":"cs.AI","work_id":"0a2a4d72-5883-48f3-8aa3-6f20591d1b92","year":2024},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.757492Z"},"links":{"cited_paper":"/paper/2403.11734","citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:640a9d84c09e59916cf6cd593b6605fb0ccc80cc7ab14555e3c5772d92be224c","observation_id":"f9ddce6b-ac4c-4aae-bd01-4e2d7121dd03","resolution":{"observed_at":"2026-08-11T23:51:54.092472Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.423838Z","title":"Tenenbaum, Tom \\' a s Lozano - P \\' e rez, and Leslie Pack Kaelbling","venue":null,"work_id":"d51bb4b3-c347-46af-82a7-a02111c91747","year":2021},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.762984Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:bfc27ec2744f30a759f2684d5ac39e7ff6a433bcbc1f209acb24b96560d9f449","observation_id":"a27bcfbb-cb3d-44dd-9bdb-9975ea899b6b","resolution":{"observed_at":"2026-08-11T23:51:54.428400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.409512Z","title":"Heuristics and symmetries in classical planning","venue":null,"work_id":"9a914f6a-3a57-4ab8-b262-89096e66c49c","year":2015},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.767609Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:d2f1e2eb0b6c7a03e59a1203335f9f4d1dfb28db4ed5e6f612af1fe2c4d974a1","observation_id":"5f1f7862-3099-4568-a93b-3fd0b213d489","resolution":{"observed_at":"2026-08-11T23:51:54.414290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.395388Z","title":"Correlation complexity of classical planning domains","venue":null,"work_id":"0d690857-6a92-4702-b4df-5107b3a6c119","year":2016},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.772308Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:ee10cf7f4c9d98bfbd1c1359937880686f096c73304ec24615d7cc422d03d480","observation_id":"9b3a0967-cc54-4bd6-a576-53e1a46f9ce1","resolution":{"observed_at":"2026-08-11T23:51:54.399963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.381539Z","title":"Foundations and Applications of Generalized Planning","venue":null,"work_id":"dfd094f6-f60a-4ddf-b096-d31a41c24af3","year":2010},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.777714Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:6b53fcbaecb6b1f713b2f44c7fc174cc4f9a3383c02ee8644b8c76d6d6cc7fad","observation_id":"8b4bf9c9-0ef8-44ba-9da8-2a677c316920","resolution":{"observed_at":"2026-08-11T23:51:54.386382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.368598Z","title":"Theoretical foundations for structural symmetries of lifted PDDL tasks","venue":null,"work_id":"549bc946-6f72-45be-9b12-e8c846e8430c","year":2019},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.782600Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:5f1ad86334f3861e76c8bf4399cd022317052da62aefbbff1cae8fe0781ca91a","observation_id":"64b36de2-e236-49c7-a919-d56282276393","resolution":{"observed_at":"2026-08-11T23:51:54.372587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.355313Z","title":"Search-guidance mechanisms for numeric planning through subgoaling relaxation","venue":null,"work_id":"c50133e7-6471-4983-b231-69ae2a4cf416","year":2020},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.787367Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:8e0d0104681e89f1426436e812f127b6d84223c0335e86931e1a14d352655732","observation_id":"297dc406-f174-4d7c-996f-a5facd528df9","resolution":{"observed_at":"2026-08-11T23:51:54.359496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.341728Z","title":"Weisfeiler-lehman graph kernels","venue":null,"work_id":"c6dbe6d8-364a-4aa0-ae23-08969d07592f","year":2011},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.792765Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:639245522081cea91a0c1c3d36c226b51c46cf7fe42407d685ddd2575367a751","observation_id":"cff8ba9d-3ccf-423a-858e-69c7d2eed5d6","resolution":{"observed_at":"2026-08-11T23:51:54.346613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.328076Z","title":"Trevizan, Sam Toyer, Sylvie Thi \\' e baux, and Lexing Xie","venue":null,"work_id":"2b5a4fb0-bbaf-48f5-a938-320698feddd9","year":2019},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.797317Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:c9fb87e8b4b4fb59808f6b15340bad55f63a424433e870eff7e2814ef14bd3c0","observation_id":"ef2f40ad-9b27-485e-985a-771518ffa654","resolution":{"observed_at":"2026-08-11T23:51:54.332595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.314210Z","title":"L earning D omain- I ndependent P lanning H euristics with H ypergraph N etworks","venue":null,"work_id":"53e91df6-ba08-4313-b309-b26fde4c65ba","year":2020},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.801936Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:34df838344a3b71514ca348a3665d6fa5b9d53b7a967d15b5bb3b4d2f967503d","observation_id":"4e6b1829-0adc-46c4-97af-0436025db062","resolution":{"observed_at":"2026-08-11T23:51:54.318966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.300551Z","title":"The 2023 international planning competition","venue":null,"work_id":"6b90d829-43f4-43df-94a0-224f3776d78a","year":2023},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.806812Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:92a4bfc7b5940d3d5460cef4537c9b4af296c16891d01e300a887088019f4abf","observation_id":"86232810-9c2a-433c-b67e-5e48a21af95a","resolution":{"observed_at":"2026-08-11T23:51:54.305099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.287027Z","title":"Trevizan, Sylvie Thi \\' e baux, and Lexing Xie","venue":null,"work_id":"d32e18b6-c210-48f1-9d85-636fe7c6fa79","year":2018},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.811265Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:40e5a8f03b5f3d363e10cd91e2ed23ad8dc814b019324167187979e193e0dec7","observation_id":"36c20dbc-fe75-4dd2-902e-38913e89dab7","resolution":{"observed_at":"2026-08-11T23:51:54.291497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.272913Z","title":"Asnets: Deep learning for generalised planning","venue":null,"work_id":"22a6eeba-dc4e-4201-986a-0628280b9ff3","year":2020},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.815890Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:d44943a7ad807f72b91cc6b4bb3ede7b6055b027be74224b3d0cec7a087d9da8","observation_id":"bfae8466-9ef3-4095-8a6c-3aac4351a885","resolution":{"observed_at":"2026-08-11T23:51:54.277552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.258696Z","title":"Statistical learning theory","venue":null,"work_id":"07d6ee04-2317-4f1c-a7f2-e4528fcf9729","year":1998},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.820366Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:151916909ef94e697c96abd1936798af50963e59b05e32992e9dae11ae6f9b32","observation_id":"61a40a98-ce05-41a9-a976-1ca3b2acaf79","resolution":{"observed_at":"2026-08-11T23:51:54.263289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.243912Z","title":null,"venue":null,"work_id":"f23930b9-35ab-42a7-812f-fc135dd3ef8f","year":1982},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.824832Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:d4076227654391860bbaa1a82e3c1c71cc9a153256b6b9875dab4f141822fa70","observation_id":"5a78491f-6ccd-41ad-83d7-650e595b6202","resolution":{"observed_at":"2026-08-11T23:51:54.248674Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.228881Z","title":"Planbench: An extensible benchmark for evaluating large language models on planning and reasoning about change","venue":null,"work_id":"9b23199c-7f43-4162-a8e1-860c65c4d71c","year":2023},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.829552Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:1761539143036de094a27405c29a980003b131b47d3bb23da5dc735f5a63d8a8","observation_id":"7c690d73-4b86-491d-8e23-1ec64e9eb0b1","resolution":{"observed_at":"2026-08-11T23:51:54.233836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.213107Z","title":"On the planning abilities of large language models - A critical investigation","venue":null,"work_id":"663289e9-369f-494c-9d88-788e2be077c3","year":2023},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.834381Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:78cf700d795cd3f1bcfe7c9eabf3bbfc129f439dd6dff6a9999bc3f3acac4e23","observation_id":"2f53a060-2001-4fb0-9b3c-3e1c2d3dd8bd","resolution":{"observed_at":"2026-08-11T23:51:54.218803Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.13373","last_updated":"2024-09-20T10:20:46Z","snapshot_observed_at":"2026-08-12T22:41:07.948524Z","submitted_at":"2024-09-20T10:20:46Z","title":"LLMs Still Can't Plan; Can LRMs? A Preliminary Evaluation of OpenAI's o1 on PlanBench","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.13373","snapshot_observed_at":"2026-08-11T23:51:53.839149Z","title":"Llms still can't plan; can lrms? A preliminary evaluation of openai's o1 on planbench","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.839149Z"},"links":{"cited_paper":"/paper/2409.13373","citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:9ae30eafab9013ccf5005ddeeb6170c17374fb8ccc0caf3ecea1cfda394cace5","observation_id":"35243b79-c6c3-4935-b2ed-79fec76bb65d","resolution":{"observed_at":"2026-08-11T23:51:53.839149Z","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-11T23:51:54.198814Z","title":"N -wl: A new hierarchy of expressivity for graph neural networks","venue":null,"work_id":"3ff5206f-95cc-4759-893b-0b2cce5fc9d3","year":2023},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.844103Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:1b9f9a8f0d22d70771ef9dca0d0fea2dcbdb51449e5d076a557966e3ae9f759c","observation_id":"9cba6df6-99a0-4b63-a460-b2c6efe8f610","resolution":{"observed_at":"2026-08-11T23:51:54.202966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.185766Z","title":"Wang and Sylvie Thi \\' e baux","venue":null,"work_id":"6cda5b6b-1c7b-4e73-956c-c4c4d4a333fd","year":2024},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.848759Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:e162f254debda718ec908ac2abee31954f3145c60d972a4241aac78e644cb2f1","observation_id":"255188d1-e018-4791-b111-a18e0765c08e","resolution":{"observed_at":"2026-08-11T23:51:54.189655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.172805Z","title":"How powerful are graph neural networks? In ICLR , 2019","venue":null,"work_id":"d4d50145-5a28-408b-98b4-f80ccc22876a","year":2019},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.853199Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:ad031bcf4b15b32668d90cab8f27916825a7b64ef941fdaeddf60d3f5edb9f5c","observation_id":"64123d33-8b49-43fd-bb0e-db9639cf15ff","resolution":{"observed_at":"2026-08-11T23:51:54.176830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.157577Z","title":"From stars to subgraphs: Uplifting any GNN with local structure awareness","venue":null,"work_id":"215ba181-8d91-4321-9f4d-d9bf0e69e9da","year":2022},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.858057Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:eb8f98da66491fa71f0e112867afb8ac1106ee533140aa5e64e86e5c98cb9082","observation_id":"1587f8b5-0e21-4fe4-bc2a-c9e3d690a60a","resolution":{"observed_at":"2026-08-11T23:51:54.162602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:54.142350Z","title":"A practical, progressively-expressive GNN","venue":null,"work_id":"6a7a378f-31e0-4ee9-b7ec-fc635abfe79a","year":2022},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.862967Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:a71627cd930ff04344938d872044599d424e483f38264547445d755497d4745f","observation_id":"fd81bb87-f2da-444a-b01b-a3444dad58ab","resolution":{"observed_at":"2026-08-11T23:51:54.147224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T23:51:53.868235Z","title":"@esa ( ) , n @biblabelnum##1 ##1","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.868235Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:8193b0fe5355a9702fa02a33d989a5d50d865f1b5836473e49b2757e90d761c9","observation_id":"15fc9636-e73e-4a6b-837a-0b8bb7a69b15","resolution":{"observed_at":"2026-08-11T23:51:53.868235Z","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-11T23:51:53.873564Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.873564Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:9d951bd04ec74ecc629f0c2a46afeff31eec57a55777a24718329949d6230f04","observation_id":"1b80f381-c5fd-44e2-af58-6dbab4b9d915","resolution":{"observed_at":"2026-08-11T23:51:53.873564Z","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-11T23:51:53.878489Z","title":"THr_v e 1G :۲Q;;Z ^׎ h&@i pWzf D p@cgYd >i 3 )b!VJV 6i@ '1`v0 :x 3 7_#:G['z ;/` Yf97' Pd VU`T r#. 2/BP ùĵC0ҼC b78 @SK","venue":null,"work_id":null,"year":1952},"citing_paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-11T23:51:53.878489Z"},"links":{"citing_paper":"/paper/2412.02136"},"observation_digest":"sha256:b6580134524e2a3e78bc215af11dc51ae87fa768113d407e535082fa5cdc95a4","observation_id":"0aa6c394-050c-4f2f-8a9b-0241dddb8591","resolution":{"observed_at":"2026-08-11T23:51:53.878489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.02136","last_updated":"2024-12-03T03:49:27Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-14T02:23:50.906402Z","submitted_at":"2024-12-03T03:49:27Z","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges"},"reference_resolution":{"displayed":86,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":2,"verified_fuzzy":71},"total_outbound_references":86},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 86 of 86 outbound references and 0 inbound Pith citation observations for arXiv:2412.02136."}