{"as_of":"2026-08-07T04:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c1c4572f6eccf058e7152f05062a328775ad3c107610fc22378628b23a533cc1","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T12:43:08.592390Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T21:27:50.941166Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T19:37:18.965886Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"cited_work":{"arxiv_id":"2509.01381","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.01381","snapshot_observed_at":"2026-07-02T19:37:18.965886Z","title":null,"venue":null,"work_id":"7d211510-8e1b-4343-a62c-b71facfc973e","year":2025},"citing_paper":{"arxiv_id":"2606.07327","last_updated":"2026-06-10T08:53:54Z","snapshot_observed_at":"2026-07-06T23:47:00.425715Z","submitted_at":"2026-06-05T14:45:06Z","title":"Six Open Questions in Machine-Learned Interatomic Potential Foundation Models","version":2},"reference_index":136,"source":"pdf_text","source_observed_at":"2026-06-27T21:27:50.941166Z"},"links":{"cited_paper":"/paper/2509.01381","citing_paper":"/paper/2606.07327"},"observation_digest":"sha256:8ee0eb1ff084477364a72636cae6c79cef98edc084a280145b7dc68c844499d6","observation_id":"f4f168e6-2ab1-43e4-a126-2edaf178fde7","resolution":{"observed_at":"2026-07-02T19:37:18.967153Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2509.01381/citation-record","integrity":"/paper/2509.01381/integrity","json":"/paper/2509.01381/citation-record.json","paper":"/paper/2509.01381"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T12:43:08.988893Z","title":"A gentle introduction to deep learning for graphs,","venue":null,"work_id":"f46ba125-fd9d-4386-bacd-74f95a4fc0e2","year":2020},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.535529Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:c1e72a3fb928fc91c43cbd0fba296b154824d91f748e66dbf30710d15bf2f2b8","observation_id":"2f24f194-683f-4e59-8d68-099c4f93bb23","resolution":{"observed_at":"2026-08-05T12:43:08.992377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-05T12:43:08.538697Z","title":"The graph neural network model,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.538697Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:c1238810219ce8c392e9da670e7458f3b65364846a02cfdac9ffb9f478f46af0","observation_id":"466ef85f-d1ce-420c-b839-c1e85b564e5c","resolution":{"observed_at":"2026-08-05T12:43:08.538697Z","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-05T12:43:08.976039Z","title":"Neural network for graphs: A contextual constructive approach,","venue":null,"work_id":"0699396b-cb17-4918-83e9-bb829b60fa95","year":2009},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.541558Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:2eae9f993aee9e7288ad93caa9316b88e3f4abd107a09c18af2444ff6d99efc1","observation_id":"91504fca-2b38-4896-b0e0-e1584b6fbf47","resolution":{"observed_at":"2026-08-05T12:43:08.978887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-05T12:43:08.967755Z","title":"On the bottleneck of graph neural networks and its practical implications,","venue":null,"work_id":"21611a8e-db59-4b02-879c-7f5cdfbe9866","year":2021},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.544186Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:382c0a49155c0d1d19ce6b07b12a41c9feadabe12f724f77b4dd3095f3352289","observation_id":"7b6ebc21-a7a4-4787-a256-9da2bd99d35d","resolution":{"observed_at":"2026-08-05T12:43:08.970915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-05T12:43:08.959164Z","title":"Hierarchical graph neural nets can capture long-range interactions,","venue":null,"work_id":"2258415e-051b-41ad-8fb5-d3537183542f","year":2021},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.547161Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:68c49e5c19e9e3a296f785700b67304b765454fd67418a04f3f08040d67927ed","observation_id":"888feec7-13c4-4b9b-9498-c3680396989a","resolution":{"observed_at":"2026-08-05T12:43:08.962492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-05T12:43:08.950490Z","title":"Hignn: Hierarchical informative graph neural networks for molecular property prediction equipped with feature-wise attention,","venue":null,"work_id":"3dc608c5-42fb-482c-b67d-a561c40a77b3","year":2022},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.549821Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:d9d646fa32efadf26cae0881b2de852d546e30db3d1671ce07395b44280eeba8","observation_id":"0f92f644-3462-4a57-9b6e-932e22b18cd5","resolution":{"observed_at":"2026-08-05T12:43:08.953708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-05T12:43:08.941934Z","title":"Megraph: capturing long-range interactions by alternating local and hierarchical aggregation on multi-scaled graph hierarchy,","venue":null,"work_id":"909dbd87-670b-438d-8949-865c3b6f4daa","year":2023},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.552583Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:0889a7d90d194fd90daca4719b6d68fef8c3498ea4b579bfebf5f9a789edc1d6","observation_id":"50e60b4b-5217-47f5-849b-a16d2f5d8104","resolution":{"observed_at":"2026-08-05T12:43:08.945195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-05T12:43:08.933275Z","title":"Graph neural networks with learnable structural and positional representations,","venue":null,"work_id":"fef158cd-9ea0-499b-ac9e-7aa5c411d6bc","year":2022},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.554830Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:1462de150d93877d99863e885de31655a277a62e65d69c6efcf6ccba91926ab0","observation_id":"1ce94677-5c75-4789-8496-3a28c8f2489f","resolution":{"observed_at":"2026-08-05T12:43:08.936608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-05T12:43:08.557397Z","title":"Deepwalk: online learning of social representations,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.557397Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:eb6cff62960ca8de1b15d741701192f56529ee8e0a4d26722e6467c49bb66c98","observation_id":"84e09d98-57a1-4027-b388-9234cedc4871","resolution":{"observed_at":"2026-08-05T12:43:08.557397Z","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-05T12:43:08.559830Z","title":"node2vec: Scalable feature learning for networks,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.559830Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:e3f4efc1c53b30fb21373a5fa646055d90ea099dff7dd506d77ca98f06328d96","observation_id":"4f705840-58aa-48cc-939a-0df227f4e0a0","resolution":{"observed_at":"2026-08-05T12:43:08.559830Z","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-05T12:43:08.924809Z","title":"Agent-based graph neural networks,","venue":null,"work_id":"dfeae98e-4151-4e36-8ecd-4758aed23aa4","year":2023},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.562196Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:35cedc848bb65e093818016872db661dff1717f4590f71379fb90266a63fbc9d","observation_id":"e2ad18c4-560b-480a-aa05-1304b23235a8","resolution":{"observed_at":"2026-08-05T12:43:08.927711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-05T12:43:08.915360Z","title":"Walking out of the weisfeiler leman hierarchy: Graph learning beyond message passing,","venue":null,"work_id":"e7292682-0806-4651-aef3-027af99e6f0b","year":2023},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.565011Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:8460a264236781ac550f63ac9284b3142650b527dc21bb221fc982777c28dd79","observation_id":"af6e278b-809d-4c7a-9ca3-44d19a92f4ad","resolution":{"observed_at":"2026-08-05T12:43:08.919449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-05T12:43:08.567602Z","title":"Graph mamba: Towards learning on graphs with state space models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.567602Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:20e77e8307e87f020ddc24cd2ab347366edaf97e0fea1c9132bf571c28c5a872","observation_id":"cb99bc39-0b39-467e-8181-b31c829c19d7","resolution":{"observed_at":"2026-08-05T12:43:08.567602Z","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-05T12:43:08.906383Z","title":"Learning long range dependencies on graphs via random walks,","venue":null,"work_id":"1a169037-fc36-4010-b88d-33a211212fe2","year":2025},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.570672Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:0da831a6f200229b76ca79673283ad07ce0e87966e8830e5a9f4153bc2b44d40","observation_id":"4353496a-a967-424a-b236-50d3c301c83e","resolution":{"observed_at":"2026-08-05T12:43:08.909675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-05T12:43:08.897192Z","title":"Revisiting random walks for learning on graphs,","venue":null,"work_id":"78a10740-c904-402c-837c-74cb1ac39bf3","year":2025},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.573456Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:b99a9c4cdbd31f5e1067bebc2ed17926f79a9626e288d5630ee76c496975f138","observation_id":"92c7d74e-42f3-4be9-8e16-90b2f5e7e129","resolution":{"observed_at":"2026-08-05T12:43:08.900374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-05T12:43:08.888589Z","title":"Non-convolutional graph neural networks","venue":null,"work_id":"0c93048c-4eb0-4ecc-b23f-b7bd8fb8e5e0","year":2024},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.575703Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:c8b9f27bdd3c081943df47a2d668fa0bbc555c2c821198a4dddc40ece3c1e3ff","observation_id":"6e4b2278-35b4-4e00-b11a-1f6198aa705a","resolution":{"observed_at":"2026-08-05T12:43:08.891618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-05T12:43:08.577924Z","title":"A fast and high quality multilevel scheme for partitioning irregular graphs,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.577924Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:0f81e23d317cd6dcb2da3a8b3fc340bbca768a0d0e7c2d1fbd1a9170a96f2d3f","observation_id":"c1d8ce7f-cade-4396-aa77-8fc6cb20e7a9","resolution":{"observed_at":"2026-08-05T12:43:08.577924Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15852","last_updated":"2024-08-29T10:28:42Z","snapshot_observed_at":"2026-07-06T18:35:26.627414Z","submitted_at":"2024-06-22T13:57:09Z","title":"Next Level Message-Passing with Hierarchical Support Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.15852","snapshot_observed_at":"2026-08-05T12:43:08.580291Z","title":"Next level message- passing with hierarchical support graphs,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.580291Z"},"links":{"cited_paper":"/paper/2406.15852","citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:52211fb31f984104bd4da52871e62f5b306f89905a416ef07b76379cb95d8106","observation_id":"f2d66817-366b-448f-a555-d9d035ad9956","resolution":{"observed_at":"2026-08-05T12:43:08.580291Z","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":"10.24963/ijcai.2023/752","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T12:43:08.610328Z","title":"Graph pooling for graph neural networks: progress, challenges, and opportunities,","venue":null,"work_id":"0921c1e4-be8b-48d5-ae7a-9181a72a056c","year":2023},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.583119Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:0aa81ebfb7c47b7223fd0674728d0583c0806ec1caf3ffb8622fc87a3eaff3ba","observation_id":"4cadb937-67cf-4ce9-84cb-56e5951b772c","resolution":{"observed_at":"2026-08-05T12:43:08.616811Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-05T12:43:08.880087Z","title":"Deep sets,","venue":null,"work_id":"1006bd89-1f6a-4885-b574-525a2c43d313","year":2017},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.585470Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:e8bdf6c76674314fbd5f8be4231c000e1ff9c87a3c11b0df3c23c64e0c565871","observation_id":"1a9f2346-ebaf-418a-9c61-1804400ca5c5","resolution":{"observed_at":"2026-08-05T12:43:08.883034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-05T12:43:08.871611Z","title":"Categorical reparame- terization with gumbel-softmax,","venue":null,"work_id":"b040250d-6636-4368-bfda-43a84f40cc1c","year":2017},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.587844Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:dd927add64cc131399f64d753ee4e16992d28178255e7f5f9dc27cabf54ec2c7","observation_id":"0076ad6e-e572-43aa-8b67-4d80902b36c6","resolution":{"observed_at":"2026-08-05T12:43:08.874575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-05T12:43:08.861954Z","title":"Mamba: Linear-time sequence modeling with selective state spaces,","venue":null,"work_id":"79cd380e-3dce-423c-a757-b909c9d959da","year":2024},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.590141Z"},"links":{"citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:c3c33f68606cba8ff9763e4c05b2991107013b23e1436675ad8f657a7279acfc","observation_id":"172c14e3-98c8-4647-935d-ffeab937cf22","resolution":{"observed_at":"2026-08-05T12:43:08.865791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06970","last_updated":"2024-06-03T10:50:08Z","snapshot_observed_at":"2026-07-06T16:30:46.321160Z","submitted_at":"2023-10-10T19:47:58Z","title":"Flood and Echo Net: Algorithmically Aligned GNNs that Generalize","version":3},"cited_work":{"arxiv_id":"2310.06970","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.06970","snapshot_observed_at":"2026-08-05T12:43:08.633446Z","title":"Flood and Echo Net: Algorithmically Aligned GNNs that Generalize","venue":"cs.LG","work_id":"42be0801-102b-4040-a0b7-13e08d7c8420","year":2023},"citing_paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T12:43:08.592390Z"},"links":{"cited_paper":"/paper/2310.06970","citing_paper":"/paper/2509.01381"},"observation_digest":"sha256:9360e13194a60ce9c1924e487b53079aa3ccf9a234b70f804f89387662d16006","observation_id":"4eb26b38-a72b-4928-aff9-980043235bb9","resolution":{"observed_at":"2026-08-05T12:43:08.638787Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.01381","last_updated":"2025-09-01T11:27:53Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T12:43:08.260727Z","submitted_at":"2025-09-01T11:27:53Z","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":2,"verified_fuzzy":15},"total_outbound_references":23},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 1 inbound Pith citation observation for arXiv:2509.01381."}