Pith. sign in

Paper Citation Record · LEDGER

Graph Learning for Planning: The Story Thus Far and Open Challenges

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2412.02136 v1

Coverage vector

measured 86 of 86 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-11T23:51:53.878489Z

measured 86 of 86 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

86 of 86 outbound references displayed

  • verified exact2
  • verified fuzzy71
  • unresolved13
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation b77d01aa-8d0a-457b-a0af-ca7812369474 · outbound

This paper cites , " * write output.state after.block = add.period write newline.

Graph Learning for Planning: The Story Thus Far and Open Challenges , " * write output.state after.block = add.period write newline

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-11T23:51:53.488380Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T23:51:53.488380Z digest=sha256:e629202d73d813b59ed594659b0b0d1dd94e80264b9333b772ec95ab1d70c89f

Observation f053cab6-ce2b-4e09-8f04-bf29dee87ee2 · outbound

This paper cites write newline.

Graph Learning for Planning: The Story Thus Far and Open Challenges write newline

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-11T23:51:53.494197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T23:51:53.494197Z digest=sha256:cfa3d3115dc2c02d4ea62aa304de73ffffa52ac5ffeeb3e56504619c12c42608

Observation d1a284e8-8a5b-4486-9513-288f7de6e697 · outbound

This paper cites The surprising power of graph neural networks with random node initialization.

Graph Learning for Planning: The Story Thus Far and Open Challenges The surprising power of graph neural networks with random node initialization

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-11T23:51:53.499619Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T23:51:53.499619Z digest=sha256:b79b0e3683fd0b1d51cc819811dc0a97c53174e33a256e24e74ef076f2acd839

Observation bb8c5996-2205-4991-93bd-477212909541 · outbound

This paper cites Improving subgraph-gnns via edge-level ego-network encodings.

Graph Learning for Planning: The Story Thus Far and Open Challenges Improving subgraph-gnns via edge-level ego-network encodings

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-11T23:51:53.504737Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T23:51:53.504737Z digest=sha256:8974041fab1f5e7a73fb230c4b8edc9c0e149433fd35134a55e0bb48b73fe322

Observation 9189ae7e-6883-47e9-b0b6-6f0f41e14c92 · outbound

This paper cites an unresolved cited work.

Graph Learning for Planning: The Story Thus Far and Open Challenges Unresolved cited work

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-11T23:51:53.509522Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T23:51:53.509522Z digest=sha256:904a441e7d257f4fe3a10c9b8f23bc8a36409ac2f19a56e34472ceec069e540e

Observation 32599f23-0eda-410f-bc27-3ed214eb8dc3 · outbound

This paper cites Bronstein.

Graph Learning for Planning: The Story Thus Far and Open Challenges Bronstein

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-11T23:51:53.514255Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T23:51:53.514255Z digest=sha256:cff9ac58c7aebf0a96c3a470cd1df869437cc9af8be0f982f00eb0df8406814b

Observation 0ead7d26-58f9-43c7-bb96-5d30123d88ea · outbound

This paper cites General policies, subgoal structure, and planning width.

Graph Learning for Planning: The Story Thus Far and Open Challenges General policies, subgoal structure, and planning width

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:55.172389Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.519024Z digest=sha256:2d1258c8e19135bfb8ec0c5952f26575596b55bb0b2f161122786ca509a0b02a

Observation b2fa3328-4787-4c4d-a551-5b46607a7091 · outbound

This paper cites Breaking the limits of message passing graph neural networks.

Graph Learning for Planning: The Story Thus Far and Open Challenges Breaking the limits of message passing graph neural networks

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:55.157698Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.523543Z digest=sha256:bec401af4aaeb0321348fd148d89f138388206617ca431eed247fe43e35fe53b

Observation 9c4c0ad8-d7f3-4b65-aa0f-38f2163fc320 · outbound

This paper cites Kostylev, Mika \" e l Monet, Jorge P \' e rez, Juan L.

Graph Learning for Planning: The Story Thus Far and Open Challenges Kostylev, Mika \" e l Monet, Jorge P \' e rez, Juan L

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:55.143465Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.528469Z digest=sha256:eb7d0aa819e247b9823e01e866bed8a5fa1ced4663c47ff49077b6b1bea05bf1

Observation 526dbacd-a2a0-4d87-bc1e-86ef18f97311 · outbound

This paper cites Bartlett and Shahar Mendelson.

Graph Learning for Planning: The Story Thus Far and Open Challenges Bartlett and Shahar Mendelson

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:55.129890Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.532846Z digest=sha256:b94d88e7b9ebda3222d53abce597899283fe28e22a6ea18f3c2633f7e4fa8a88

Observation 2743e0a1-709b-4e01-98b9-8bde717fd53a · outbound

This paper cites The computational complexity of propositional STRIPS planning.

Graph Learning for Planning: The Story Thus Far and Open Challenges The computational complexity of propositional STRIPS planning

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:55.115701Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.537289Z digest=sha256:1a88a4520a07159c6ef0465cb695509a36f92adf0f54caa7dd2cfa99927acb45

Observation 5b0d0889-47b4-4a4e-9d82-8f6ad3d4be9e · outbound

This paper cites A review of generalized planning.

Graph Learning for Planning: The Story Thus Far and Open Challenges A review of generalized planning

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:55.101688Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.542195Z digest=sha256:441ecdab69de8a0b260d6fe66637bf4dd5bd54fd971b1bc09e8552dd4b7bbcfc

Observation c6630175-06b4-4d1e-87f9-fd62b4ccb2e7 · outbound

This paper cites Muggleton.

Graph Learning for Planning: The Story Thus Far and Open Challenges Muggleton

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:55.087305Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.546927Z digest=sha256:762e3e513e7e188f92c92efc7376a1f58e84bdba794b00e18666b38c02ddfe28

Observation 7226eb69-bc4e-4071-87e6-0aae0fd605a4 · outbound

This paper cites A review of machine learning for automated planning.

Graph Learning for Planning: The Story Thus Far and Open Challenges A review of machine learning for automated planning

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:55.072265Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.551559Z digest=sha256:fe18565185ffeedd059bc67f8326ffb4cbff9f6310a686193cc789ba18e45afe

Observation 55566b87-98f9-46ab-af17-600ab7271f2a · outbound

This paper cites Optimize planning heuristics to rank, not to estimate cost-to-goal.

Graph Learning for Planning: The Story Thus Far and Open Challenges Optimize planning heuristics to rank, not to estimate cost-to-goal

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:55.057882Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.556270Z digest=sha256:93b68e9cdd7ed677fc763536dbd6322e9bf866e47a46eaaa4d3628994791d333

Observation 79262619-dc72-4257-96a4-16b86bcd094c · outbound

This paper cites Deep Learning for Generalised Planning with Background Knowledge.

Graph Learning for Planning: The Story Thus Far and Open Challenges Deep Learning for Generalised Planning with Background Knowledge

Reference 16

Resolution
verified exact
local_arxiv, observed 2026-08-11T23:51:54.113880Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.560803Z digest=sha256:00f621662778481c1696d9223bc5666ff119674be087e7e825cfc6e5560a290d

Observation b74f7f40-b8d1-4268-947a-fee75a2e7ed1 · outbound

This paper cites Chen and Sylvie Thi \' e baux.

Graph Learning for Planning: The Story Thus Far and Open Challenges Chen and Sylvie Thi \' e baux

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:55.044019Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.565761Z digest=sha256:c0cda71211d6246fb2ceea034fc3ec9a05ca96f69216d327ec224b5e99e646bf

Observation 3df97589-4f6a-4305-90f9-0a7023417ca2 · outbound

This paper cites Chen and Sylvie Thi \' e baux.

Graph Learning for Planning: The Story Thus Far and Open Challenges Chen and Sylvie Thi \' e baux

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:55.030461Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.570300Z digest=sha256:6d21e92ef9a97fad279416836e361b19a3b5e02752c2f9e92cfc1da9d62da256

Observation a8fd917f-1459-4b0d-ba19-1bbb365a47a3 · outbound

This paper cites Chen, Sylvie Thi \' e baux, and Felipe Trevizan.

Graph Learning for Planning: The Story Thus Far and Open Challenges Chen, Sylvie Thi \' e baux, and Felipe Trevizan

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:55.016768Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.574909Z digest=sha256:21fdce423e2b1e366bede57684f3aeda66021a41e8a609e1cee93996f9d297bd

Observation 2fe99b2c-6047-46cc-b229-85fa9aa29317 · outbound

This paper cites Chen, Felipe Trevizan, and Sylvie Thi \' e baux.

Graph Learning for Planning: The Story Thus Far and Open Challenges Chen, Felipe Trevizan, and Sylvie Thi \' e baux

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:55.000560Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.579610Z digest=sha256:66ab09985ab79356024c94d9e00af9c36097b61ea9e83cbf11b434c7131a218b

Observation 6956f207-9680-42cb-b2f8-b55d9e4fc32b · outbound

This paper cites Higher-dimensional potential heuristics: Lower bound criterion and connection to correlation complexity.

Graph Learning for Planning: The Story Thus Far and Open Challenges Higher-dimensional potential heuristics: Lower bound criterion and connection to correlation complexity

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.984613Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.583958Z digest=sha256:2824c5a0c108f8182ba060e573705331161a214b5c1da10fa447fbc4ab5c1c88

Observation 3594806e-0fc1-470d-af71-1d9be4ceb8d5 · outbound

This paper cites Novelty vs.

Graph Learning for Planning: The Story Thus Far and Open Challenges Novelty vs

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.968535Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.587836Z digest=sha256:09a005d53d8604fcffea00db15d99d904fd82428039eac609495db56efdec410

Observation d4438763-55e7-4c49-b3f1-0f89531ee675 · outbound

This paper cites Neural logic machines.

Graph Learning for Planning: The Story Thus Far and Open Challenges Neural logic machines

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.952687Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.591727Z digest=sha256:13c838042c1aee019e6a6459c2885455efd4eddad8b4fc8cbfb16d4ae6212b83

Observation dfa3b3b3-e098-4496-8a90-ffb1d3ff60ea · outbound

This paper cites Equivalence-based abstractions for learning general policies.

Graph Learning for Planning: The Story Thus Far and Open Challenges Equivalence-based abstractions for learning general policies

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.938889Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.595536Z digest=sha256:830bb99caa1f19cdc8fa73d285f529731c1c015756718a0dfbbd49d4251aa269

Observation 6bbeaa41-aa93-41fb-8363-a5f626ed9e3c · outbound

This paper cites Expressing and exploiting subgoal structure in classical planning using sketches.

Graph Learning for Planning: The Story Thus Far and Open Challenges Expressing and exploiting subgoal structure in classical planning using sketches

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.924925Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.599306Z digest=sha256:a6a3a7555278470f041dae3bc5c063272fc58835e004e15f4ef7b6b17b53f0b0

Observation 4bd9419e-c429-458e-a925-1a68ad4ef5d9 · outbound

This paper cites How powerful are k-hop message passing graph neural networks.

Graph Learning for Planning: The Story Thus Far and Open Challenges How powerful are k-hop message passing graph neural networks

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.911229Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.603004Z digest=sha256:2a25397a9275076ce41bd1d14e7bea58fa5f1dcf16ca9431b9f19b7dc043c784

Observation d4e68786-571a-463e-9f0f-2f48d4ad9a4f · outbound

This paper cites Neural network heuristic functions for classical planning: Bootstrapping and comparison to other methods.

Graph Learning for Planning: The Story Thus Far and Open Challenges Neural network heuristic functions for classical planning: Bootstrapping and comparison to other methods

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.896517Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.606657Z digest=sha256:80865e243c4e2f2ce3cd3901c525fae34814238fb7e66d0734a09cc6ba2ffdc7

Observation 74d44cb6-0473-4c01-831c-b9f76ed930ad · outbound

This paper cites PDDL2.1: an extension to PDDL for expressing temporal planning domains.

Graph Learning for Planning: The Story Thus Far and Open Challenges PDDL2.1: an extension to PDDL for expressing temporal planning domains

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.881140Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.610577Z digest=sha256:a824c4b76238613fe8e035199bc9b60041b98f909cb2e0ec81808d4f530d3e9b

Observation 00b120a2-b9a8-44fe-8879-3b5db18905fb · outbound

This paper cites A Concise Introduction to Models and Methods for Automated Planning.

Graph Learning for Planning: The Story Thus Far and Open Challenges A Concise Introduction to Models and Methods for Automated Planning

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.865769Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.614353Z digest=sha256:0db44ca36fcea2a3f506147adb9351bc16fd12053a2a0d633939d3a3e4288b55

Observation 5af29866-3f6f-40ce-a527-edb2e051d9a2 · outbound

This paper cites Learning to rank for synthesizing planning heuristics.

Graph Learning for Planning: The Story Thus Far and Open Challenges Learning to rank for synthesizing planning heuristics

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.851781Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.618021Z digest=sha256:a52a7e8a41038b0b15c6bc1a8cd64720fb837bbea525800a8b4047e3eb93761b

Observation 1f1fd96e-a686-4de1-bc27-908da75c1fe4 · outbound

This paper cites Formal representations of classical planning domains.

Graph Learning for Planning: The Story Thus Far and Open Challenges Formal representations of classical planning domains

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.838946Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.622726Z digest=sha256:23d56390e1ccddac3748cc1948de0c3c8d29a61f2c14c2dee94bfb879ae85f67

Observation 97550d1c-f2d9-4c3e-806f-596a85d91913 · outbound

This paper cites The logic of graph neural networks.

Graph Learning for Planning: The Story Thus Far and Open Challenges The logic of graph neural networks

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.824892Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.627077Z digest=sha256:5641b1d81c35a688c920af0a1927388cafc6d1d25e26a32e2e6dc4dfbb94c939

Observation 8a943637-105d-4886-ab5d-38b3af8b1bb7 · outbound

This paper cites LPG: A planner based on local search for planning graphs with action costs.

Graph Learning for Planning: The Story Thus Far and Open Challenges LPG: A planner based on local search for planning graphs with action costs

Reference 33

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.811279Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.631480Z digest=sha256:a2b8ddbfc25a0bea612f62285d67c2340ebccef8c237ac375cc4849b4ae97abb

Observation 84d1f23e-7f94-4546-a620-c5a4a94be0a5 · outbound

This paper cites Schoenholz, Patrick F.

Graph Learning for Planning: The Story Thus Far and Open Challenges Schoenholz, Patrick F

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.796517Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.635926Z digest=sha256:efda2b9adb0937cbb217c071f255645e6133fc8bc327517d787b96e072458909

Observation a5291af4-b505-4fa0-ac3a-84c812d988cf · outbound

This paper cites Exploiting first-order regression in inductive policy selection.

Graph Learning for Planning: The Story Thus Far and Open Challenges Exploiting first-order regression in inductive policy selection

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.782628Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.640761Z digest=sha256:15e95c0ca2bc19496de497878008c3788e81b477c6aa09867bd2df9538b07f1e

Observation fa9cbf8a-2d6d-4be3-9894-b897701b60b8 · outbound

This paper cites Landmarks, critical paths and abstractions: What's the difference anyway? In ICAPS , 2009.

Graph Learning for Planning: The Story Thus Far and Open Challenges Landmarks, critical paths and abstractions: What's the difference anyway? In ICAPS , 2009

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.768791Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.645622Z digest=sha256:cfd6628cfaa7e57a9b2770631fe66c8552005f5d562eca61307e49facf615554

Observation 83226b97-3155-49f7-97a2-05d7cc792fbf · outbound

This paper cites A planning heuristic based on causal graph analysis.

Graph Learning for Planning: The Story Thus Far and Open Challenges A planning heuristic based on causal graph analysis

Reference 37

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.755070Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.650335Z digest=sha256:c36ac6dcb1e4c9d31358ad8277acea40f8d2c0a3cd5e4be176ad1fbe12325875

Observation 060ced00-a0bd-47c2-8847-757a88b732c1 · outbound

This paper cites The FF planning system: Fast plan generation through heuristic search.

Graph Learning for Planning: The Story Thus Far and Open Challenges The FF planning system: Fast plan generation through heuristic search

Reference 38

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.740682Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.654599Z digest=sha256:d140aec7bffbe49630539894c843f1bdf3ec9677c42dbb713fe8517989b4c11e

Observation 568ca063-2cf1-4a55-98e2-8af45b02d5b0 · outbound

This paper cites Expressiveness of graph neural networks in planning domains.

Graph Learning for Planning: The Story Thus Far and Open Challenges Expressiveness of graph neural networks in planning domains

Reference 39

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.727228Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.659203Z digest=sha256:9bd97cdc886a6235b572b19f4d0d4d33aa0ca424aed4f55fdc89eed950eb99cc

Observation 54f28665-b3f6-431d-9877-367027b71b24 · outbound

This paper cites Guiding GBFS through learned pairwise rankings.

Graph Learning for Planning: The Story Thus Far and Open Challenges Guiding GBFS through learned pairwise rankings

Reference 40

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.714289Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.663688Z digest=sha256:ef73776064f50ee5a668fb3bf02584ec704072efb8bbf23c227fb0016ef6e62e

Observation 9c675a06-53f5-4066-a28a-97b0701c90e7 · outbound

This paper cites McIlraith.

Graph Learning for Planning: The Story Thus Far and Open Challenges McIlraith

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.701642Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.668236Z digest=sha256:0c0177bd2fae6e01ceada5c7dd03e94d9aef24c6930c703077258c5b491e467d

Observation a5aa5651-ac31-4675-b8ab-52970f21fbe9 · outbound

This paper cites Relational queries computable in polynomial time (extended abstract).

Graph Learning for Planning: The Story Thus Far and Open Challenges Relational queries computable in polynomial time (extended abstract)

Reference 42

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.689060Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.672783Z digest=sha256:c1fff38c2b1e03ee603cd1fc98322a065ba908f0f301cc8a611be6e04a2cef8a

Observation fa09742e-b0f7-4eb5-b58d-79229d5eb24f · outbound

This paper cites Learning action strategies for planning domains.

Graph Learning for Planning: The Story Thus Far and Open Challenges Learning action strategies for planning domains

Reference 43

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.675341Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.677461Z digest=sha256:85b56d3eb80374cd6216514177a5b92c62595317e5e6d11a237bb4af231192ae

Observation 694f0bc6-9154-4bff-87d8-a7d8a6b80ed9 · outbound

This paper cites Kriege, Fredrik D.

Graph Learning for Planning: The Story Thus Far and Open Challenges Kriege, Fredrik D

Reference 44

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.661600Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.682352Z digest=sha256:530b4785718a5b9729657c8a067484312dd1d34babf997ff411929c237a09cd1

Observation 0b3a48cd-97b1-43eb-a94a-6bb66e0422b7 · outbound

This paper cites Learning generalized relational heuristic networks for model-agnostic planning.

Graph Learning for Planning: The Story Thus Far and Open Challenges Learning generalized relational heuristic networks for model-agnostic planning

Reference 45

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.647937Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.686790Z digest=sha256:0b4ff141a40e5a8292bdfb420601f336751346e13e9448d639a279e82b839f4d

Observation 1930e028-5622-4500-a520-0bf65579a04f · outbound

This paper cites an unresolved cited work.

Graph Learning for Planning: The Story Thus Far and Open Challenges Unresolved cited work

Reference 46

Resolution
unresolved
raw_fallback, observed 2026-08-11T23:51:54.633424Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.691372Z digest=sha256:44d1f61757b6193245870860a601e5ea66e2ba6fd3684025d5d7e764588f32de

Observation b8c4b488-ef1b-4e4b-884e-19aab506f435 · outbound

This paper cites Width and serialization of classical planning problems.

Graph Learning for Planning: The Story Thus Far and Open Challenges Width and serialization of classical planning problems

Reference 47

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.620181Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.696013Z digest=sha256:be7f4e23e779c311a355a482373a8c7e3fcc2f7031d0f97058690dea9f888c75

Observation 6d18af38-1107-4e56-a8d5-125d60b041d7 · outbound

This paper cites Bronstein, Martin Grohe, and Stefanie Jegelka.

Graph Learning for Planning: The Story Thus Far and Open Challenges Bronstein, Martin Grohe, and Stefanie Jegelka

Reference 48

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.606182Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.700476Z digest=sha256:9f36e4559d2a6142c7d09b36e7fdf3b8b921244d1cab3ae058c0f7a4faeefb7d

Observation 0fe7dbdb-581e-48c7-84c4-7e99c7a9c667 · outbound

This paper cites Online planner selection with graph neural networks and adaptive scheduling.

Graph Learning for Planning: The Story Thus Far and Open Challenges Online planner selection with graph neural networks and adaptive scheduling

Reference 49

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.592125Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.705119Z digest=sha256:4746e6144ba085356dd7405a29a3d8bb3e8f854cad124f3ea002857a7c8aa15f

Observation c5b060f5-1f7a-437e-911d-a1b1d2aaf7a7 · outbound

This paper cites Tenenbaum, and Leslie Pack Kaelbling.

Graph Learning for Planning: The Story Thus Far and Open Challenges Tenenbaum, and Leslie Pack Kaelbling

Reference 50

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.578967Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.709746Z digest=sha256:718df67773f3e534b9d930c0a1ec5da7fc347f933f1055a8937c9d34b97bf294

Observation eb4c4d2a-af4e-498a-bccf-9251e2825eac · outbound

This paper cites Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe.

Graph Learning for Planning: The Story Thus Far and Open Challenges Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe

Reference 51

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.565885Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.714291Z digest=sha256:b2cef4d7d89a3bd55606dfe6e93789257895af00f3376d137abaeb01650fc200

Observation 71ce1b13-97b4-4311-b3d1-ee871692971b · outbound

This paper cites Speqnets: Sparsity-aware permutation-equivariant graph networks.

Graph Learning for Planning: The Story Thus Far and Open Challenges Speqnets: Sparsity-aware permutation-equivariant graph networks

Reference 52

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.552244Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.719129Z digest=sha256:9abbe4fe922c4f52b10c82eba8a6a85226fb356576834ab257f0e15eb83d8fc2

Observation 867e1478-1b98-495f-b4bf-c051839fb7ad · outbound

This paper cites Weisfeiler and leman go sparse: Towards scalable higher-order graph embeddings.

Graph Learning for Planning: The Story Thus Far and Open Challenges Weisfeiler and leman go sparse: Towards scalable higher-order graph embeddings

Reference 53

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.539553Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.723630Z digest=sha256:9b95aa1c4b1265a1d39aa5a89d28bd6c56ca5f7b63f565cd192f638e5aabaedc

Observation 171dcc89-45c9-4061-8327-b183a169f70f · outbound

This paper cites On using admissible bounds for learning forward search heuristics.

Graph Learning for Planning: The Story Thus Far and Open Challenges On using admissible bounds for learning forward search heuristics

Reference 54

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.526649Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.728078Z digest=sha256:ec10a8ee82e487b7e3c2f1e52eff5c55a1da5c116eba9e51dbba358748f2e894

Observation a2f39247-9f0d-4ff5-aed2-587582ed1977 · outbound

This paper cites an unresolved cited work.

Graph Learning for Planning: The Story Thus Far and Open Challenges Unresolved cited work

Reference 55

Resolution
unresolved
raw_fallback, observed 2026-08-11T23:51:54.513446Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.732663Z digest=sha256:013e9e1160c7ac71017924cb2a20b8b64cc063f29458342218f54b15e394c174

Observation 26f6b282-1850-441e-98e6-f00889b2d9da · outbound

This paper cites Rosenschein.

Graph Learning for Planning: The Story Thus Far and Open Challenges Rosenschein

Reference 56

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.499762Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.736703Z digest=sha256:1e754f29165ac81c2aa8bef13e4c700af4e1b23668e27f81a8d59215f940d05c

Observation 9a41b8d8-de3a-44bb-9f15-40ecd1f7a519 · outbound

This paper cites The LAMA planner: Guiding cost-based anytime planning with landmarks.

Graph Learning for Planning: The Story Thus Far and Open Challenges The LAMA planner: Guiding cost-based anytime planning with landmarks

Reference 57

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.485470Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.740893Z digest=sha256:f2c69883c9931aabcc434817c961aa0e0bf6a7590e6a635fd019f3127f402927

Observation 7f24979a-6da8-4bb1-b67e-1b382829999a · outbound

This paper cites Sutton and Andrew G.

Graph Learning for Planning: The Story Thus Far and Open Challenges Sutton and Andrew G

Reference 58

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.471570Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.744922Z digest=sha256:2e199181456ddc1a0855291648e160f7b5089046d52e5e5c2d4be5e9ae0d82dd

Observation e6174186-7d98-4e81-8785-8f4f7062eb49 · outbound

This paper cites Learning general optimal policies with graph neural networks: Expressive power, transparency, and limits.

Graph Learning for Planning: The Story Thus Far and Open Challenges Learning general optimal policies with graph neural networks: Expressive power, transparency, and limits

Reference 59

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.457642Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.748967Z digest=sha256:9fb47a8be378fcbbc70beb02d9bbb92b4f965df2960b20fd48075b7dc51db2c8

Observation a7ad2c37-bb21-4a16-8f9d-da823c32bc04 · outbound

This paper cites Learning general policies with policy gradient methods.

Graph Learning for Planning: The Story Thus Far and Open Challenges Learning general policies with policy gradient methods

Reference 60

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.442669Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.752959Z digest=sha256:16f54fe04d0dd609a1372ba2ce62d2b2cb232b0ed4a3e758d3f93ef877eb9dc1

Observation f9ddce6b-ac4c-4aae-bd01-4e2d7121dd03 · outbound

This paper cites Learning More Expressive General Policies for Classical Planning Domains.

Graph Learning for Planning: The Story Thus Far and Open Challenges Learning More Expressive General Policies for Classical Planning Domains

Reference 61

Resolution
verified exact
local_arxiv, observed 2026-08-11T23:51:54.092472Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.757492Z digest=sha256:640a9d84c09e59916cf6cd593b6605fb0ccc80cc7ab14555e3c5772d92be224c

Observation a27bcfbb-cb3d-44dd-9bdb-9975ea899b6b · outbound

This paper cites Tenenbaum, Tom \' a s Lozano - P \' e rez, and Leslie Pack Kaelbling.

Graph Learning for Planning: The Story Thus Far and Open Challenges Tenenbaum, Tom \' a s Lozano - P \' e rez, and Leslie Pack Kaelbling

Reference 62

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.428400Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.762984Z digest=sha256:bfc27ec2744f30a759f2684d5ac39e7ff6a433bcbc1f209acb24b96560d9f449

Observation 5f1f7862-3099-4568-a93b-3fd0b213d489 · outbound

This paper cites Heuristics and symmetries in classical planning.

Graph Learning for Planning: The Story Thus Far and Open Challenges Heuristics and symmetries in classical planning

Reference 63

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.414290Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.767609Z digest=sha256:d2f1e2eb0b6c7a03e59a1203335f9f4d1dfb28db4ed5e6f612af1fe2c4d974a1

Observation 9b3a0967-cc54-4bd6-a576-53e1a46f9ce1 · outbound

This paper cites Correlation complexity of classical planning domains.

Graph Learning for Planning: The Story Thus Far and Open Challenges Correlation complexity of classical planning domains

Reference 64

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.399963Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.772308Z digest=sha256:ee10cf7f4c9d98bfbd1c1359937880686f096c73304ec24615d7cc422d03d480

Observation 8b4bf9c9-0ef8-44ba-9da8-2a677c316920 · outbound

This paper cites Foundations and Applications of Generalized Planning.

Graph Learning for Planning: The Story Thus Far and Open Challenges Foundations and Applications of Generalized Planning

Reference 65

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.386382Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.777714Z digest=sha256:6b53fcbaecb6b1f713b2f44c7fc174cc4f9a3383c02ee8644b8c76d6d6cc7fad

Observation 64b36de2-e236-49c7-a919-d56282276393 · outbound

This paper cites Theoretical foundations for structural symmetries of lifted PDDL tasks.

Graph Learning for Planning: The Story Thus Far and Open Challenges Theoretical foundations for structural symmetries of lifted PDDL tasks

Reference 66

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.372587Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.782600Z digest=sha256:5f1ad86334f3861e76c8bf4399cd022317052da62aefbbff1cae8fe0781ca91a

Observation 297dc406-f174-4d7c-996f-a5facd528df9 · outbound

This paper cites Search-guidance mechanisms for numeric planning through subgoaling relaxation.

Graph Learning for Planning: The Story Thus Far and Open Challenges Search-guidance mechanisms for numeric planning through subgoaling relaxation

Reference 67

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.359496Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.787367Z digest=sha256:8e0d0104681e89f1426436e812f127b6d84223c0335e86931e1a14d352655732

Observation cff8ba9d-3ccf-423a-858e-69c7d2eed5d6 · outbound

This paper cites Weisfeiler-lehman graph kernels.

Graph Learning for Planning: The Story Thus Far and Open Challenges Weisfeiler-lehman graph kernels

Reference 68

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.346613Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.792765Z digest=sha256:639245522081cea91a0c1c3d36c226b51c46cf7fe42407d685ddd2575367a751

Observation ef2f40ad-9b27-485e-985a-771518ffa654 · outbound

This paper cites Trevizan, Sam Toyer, Sylvie Thi \' e baux, and Lexing Xie.

Graph Learning for Planning: The Story Thus Far and Open Challenges Trevizan, Sam Toyer, Sylvie Thi \' e baux, and Lexing Xie

Reference 69

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.332595Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.797317Z digest=sha256:c9fb87e8b4b4fb59808f6b15340bad55f63a424433e870eff7e2814ef14bd3c0

Observation 4e6b1829-0adc-46c4-97af-0436025db062 · outbound

This paper cites L earning D omain- I ndependent P lanning H euristics with H ypergraph N etworks.

Graph Learning for Planning: The Story Thus Far and Open Challenges L earning D omain- I ndependent P lanning H euristics with H ypergraph N etworks

Reference 70

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.318966Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.801936Z digest=sha256:34df838344a3b71514ca348a3665d6fa5b9d53b7a967d15b5bb3b4d2f967503d

Observation 86232810-9c2a-433c-b67e-5e48a21af95a · outbound

This paper cites The 2023 international planning competition.

Graph Learning for Planning: The Story Thus Far and Open Challenges The 2023 international planning competition

Reference 71

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.305099Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.806812Z digest=sha256:92a4bfc7b5940d3d5460cef4537c9b4af296c16891d01e300a887088019f4abf

Observation 36c20dbc-fe75-4dd2-902e-38913e89dab7 · outbound

This paper cites Trevizan, Sylvie Thi \' e baux, and Lexing Xie.

Graph Learning for Planning: The Story Thus Far and Open Challenges Trevizan, Sylvie Thi \' e baux, and Lexing Xie

Reference 72

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.291497Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.811265Z digest=sha256:40e5a8f03b5f3d363e10cd91e2ed23ad8dc814b019324167187979e193e0dec7

Observation bfae8466-9ef3-4095-8a6c-3aac4351a885 · outbound

This paper cites Asnets: Deep learning for generalised planning.

Graph Learning for Planning: The Story Thus Far and Open Challenges Asnets: Deep learning for generalised planning

Reference 73

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.277552Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.815890Z digest=sha256:d44943a7ad807f72b91cc6b4bb3ede7b6055b027be74224b3d0cec7a087d9da8

Observation 61a40a98-ce05-41a9-a976-1ca3b2acaf79 · outbound

This paper cites Statistical learning theory.

Graph Learning for Planning: The Story Thus Far and Open Challenges Statistical learning theory

Reference 74

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.263289Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.820366Z digest=sha256:151916909ef94e697c96abd1936798af50963e59b05e32992e9dae11ae6f9b32

Observation 5a78491f-6ccd-41ad-83d7-650e595b6202 · outbound

This paper cites an unresolved cited work.

Graph Learning for Planning: The Story Thus Far and Open Challenges Unresolved cited work

Reference 75

Resolution
unresolved
raw_fallback, observed 2026-08-11T23:51:54.248674Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.824832Z digest=sha256:d4076227654391860bbaa1a82e3c1c71cc9a153256b6b9875dab4f141822fa70

Observation 7c690d73-4b86-491d-8e23-1ec64e9eb0b1 · outbound

This paper cites Planbench: An extensible benchmark for evaluating large language models on planning and reasoning about change.

Graph Learning for Planning: The Story Thus Far and Open Challenges Planbench: An extensible benchmark for evaluating large language models on planning and reasoning about change

Reference 76

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.233836Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.829552Z digest=sha256:1761539143036de094a27405c29a980003b131b47d3bb23da5dc735f5a63d8a8

Observation 2f53a060-2001-4fb0-9b3c-3e1c2d3dd8bd · outbound

This paper cites On the planning abilities of large language models - A critical investigation.

Graph Learning for Planning: The Story Thus Far and Open Challenges On the planning abilities of large language models - A critical investigation

Reference 77

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.218803Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.834381Z digest=sha256:78cf700d795cd3f1bcfe7c9eabf3bbfc129f439dd6dff6a9999bc3f3acac4e23

Observation 35243b79-c6c3-4935-b2ed-79fec76bb65d · outbound

This paper cites LLMs Still Can't Plan; Can LRMs? A Preliminary Evaluation of OpenAI's o1 on PlanBench.

Graph Learning for Planning: The Story Thus Far and Open Challenges LLMs Still Can't Plan; Can LRMs? A Preliminary Evaluation of OpenAI's o1 on PlanBench

Reference 78

Resolution
unresolved
no resolver link, observed 2026-08-11T23:51:53.839149Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T23:51:53.839149Z digest=sha256:9ae30eafab9013ccf5005ddeeb6170c17374fb8ccc0caf3ecea1cfda394cace5

Observation 9cba6df6-99a0-4b63-a460-b2c6efe8f610 · outbound

This paper cites N -wl: A new hierarchy of expressivity for graph neural networks.

Graph Learning for Planning: The Story Thus Far and Open Challenges N -wl: A new hierarchy of expressivity for graph neural networks

Reference 79

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.202966Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.844103Z digest=sha256:1b9f9a8f0d22d70771ef9dca0d0fea2dcbdb51449e5d076a557966e3ae9f759c

Observation 255188d1-e018-4791-b111-a18e0765c08e · outbound

This paper cites Wang and Sylvie Thi \' e baux.

Graph Learning for Planning: The Story Thus Far and Open Challenges Wang and Sylvie Thi \' e baux

Reference 80

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.189655Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.848759Z digest=sha256:e162f254debda718ec908ac2abee31954f3145c60d972a4241aac78e644cb2f1

Observation 64123d33-8b49-43fd-bb0e-db9639cf15ff · outbound

This paper cites How powerful are graph neural networks? In ICLR , 2019.

Graph Learning for Planning: The Story Thus Far and Open Challenges How powerful are graph neural networks? In ICLR , 2019

Reference 81

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.176830Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.853199Z digest=sha256:ad031bcf4b15b32668d90cab8f27916825a7b64ef941fdaeddf60d3f5edb9f5c

Observation 1587f8b5-0e21-4fe4-bc2a-c9e3d690a60a · outbound

This paper cites From stars to subgraphs: Uplifting any GNN with local structure awareness.

Graph Learning for Planning: The Story Thus Far and Open Challenges From stars to subgraphs: Uplifting any GNN with local structure awareness

Reference 82

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.162602Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.858057Z digest=sha256:eb8f98da66491fa71f0e112867afb8ac1106ee533140aa5e64e86e5c98cb9082

Observation fd81bb87-f2da-444a-b01b-a3444dad58ab · outbound

This paper cites A practical, progressively-expressive GNN.

Graph Learning for Planning: The Story Thus Far and Open Challenges A practical, progressively-expressive GNN

Reference 83

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T23:51:54.147224Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-11T23:51:53.862967Z digest=sha256:a71627cd930ff04344938d872044599d424e483f38264547445d755497d4745f

Observation 15fc9636-e73e-4a6b-837a-0b8bb7a69b15 · outbound

This paper cites @esa ( ) , n @biblabelnum##1 ##1.

Graph Learning for Planning: The Story Thus Far and Open Challenges @esa ( ) , n @biblabelnum##1 ##1

Reference 84

Resolution
unresolved
no resolver link, observed 2026-08-11T23:51:53.868235Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T23:51:53.868235Z digest=sha256:8193b0fe5355a9702fa02a33d989a5d50d865f1b5836473e49b2757e90d761c9

Observation 1b80f381-c5fd-44e2-af58-6dbab4b9d915 · outbound

This paper cites an unresolved cited work.

Graph Learning for Planning: The Story Thus Far and Open Challenges Unresolved cited work

Reference 85

Resolution
unresolved
no resolver link, observed 2026-08-11T23:51:53.873564Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T23:51:53.873564Z digest=sha256:9d951bd04ec74ecc629f0c2a46afeff31eec57a55777a24718329949d6230f04

Observation 0aa6c394-050c-4f2f-8a9b-0241dddb8591 · outbound

This paper cites 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.

Graph Learning for Planning: The Story Thus Far and Open Challenges 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

Reference 86

Resolution
unresolved
no resolver link, observed 2026-08-11T23:51:53.878489Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T23:51:53.878489Z digest=sha256:b6580134524e2a3e78bc215af11dc51ae87fa768113d407e535082fa5cdc95a4

Pith citing papers

No inbound Pith citation observations are available.