{"as_of":"2026-08-18T19:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f21d4144b6184a575e3a39558d592596669eb456e37823f7bc8a649e1b74644f","coverage":[{"denominator":79,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":79,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:02:05.477635Z","state":"measured"},{"denominator":81,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":81,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T05:57:11.727855Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T10:21:30.278482Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.03113","snapshot_observed_at":"2026-08-03T05:57:11.727855Z","title":"Balancing efficiency and expressiveness: Subgraph gnns with walk-based centrality.arXiv preprint arXiv:2501.03113, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.01083","last_updated":"2026-06-03T11:39:37Z","snapshot_observed_at":"2026-08-18T15:43:49.111336Z","submitted_at":"2026-02-01T08:00:51Z","title":"On the Expressive Power of Permutation-Equivariant Weight-Space Networks","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-03T05:57:11.727855Z"},"links":{"cited_paper":"/paper/2501.03113","citing_paper":"/paper/2602.01083"},"observation_digest":"sha256:7e402ee21f6d93716cd629072cdacc40f457b4dd3ce31acf11b9821fa271d776","observation_id":"95031fd6-9f2f-4260-a266-d8994637dc6d","resolution":{"observed_at":"2026-08-03T05:57:11.727855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"cited_work":{"arxiv_id":"2501.03113","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.03113","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"parallel","venue":null,"work_id":"d81f0c35-d059-4ace-8994-2a71983e2407","year":2024},"citing_paper":{"arxiv_id":"2604.27786","last_updated":"2026-05-04T09:48:40Z","snapshot_observed_at":"2026-08-15T18:49:45.661740Z","submitted_at":"2026-04-30T12:29:14Z","title":"On the Expressive Power of GNNs to Solve Linear SDPs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-07T06:27:36.438779Z"},"links":{"cited_paper":"/paper/2501.03113","citing_paper":"/paper/2604.27786"},"observation_digest":"sha256:376ff67d74a2abcacda2550f93829288fe0e1a69100a2fd981f5dcbed3c386e6","observation_id":"2c10eb82-1fa8-4003-ad95-24ccd5bf5e8a","resolution":{"observed_at":"2026-05-12T10:21:30.281249Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.03113/citation-record","integrity":"/paper/2501.03113/integrity","json":"/paper/2501.03113/citation-record.json","paper":"/paper/2501.03113"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:02:04.914067Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:04.914067Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:13bd8d6fbbfe1dbe4e9b81ac7907144bd37c9c4bcb0fb3ba028369e77a2cf3a5","observation_id":"41be9554-be2f-416f-a8e2-a50108b756ec","resolution":{"observed_at":"2026-08-10T22:02:04.914067Z","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-10T22:02:07.374084Z","title":"\\.I ., Grohe, M., and Lukasiewicz, T","venue":null,"work_id":"40ca8262-e217-43de-b21d-5b5e07bbebb0","year":2021},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:04.921647Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:7cbf8a8398bb7165df220547d3b5e10dc5724d10a593137a810bf208b2337a56","observation_id":"67a32a24-44c7-46b7-bf5c-421f8d8ef9bb","resolution":{"observed_at":"2026-08-10T22:02:07.382970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:07.351440Z","title":"u ck, F., K \\","venue":null,"work_id":"c5b04071-9280-4f62-a0ee-8136109c3aa2","year":2020},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:04.927528Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:8503d580703b41201f9bca48f7d692ad2bedb8af0e4f9c5f45cb868a36e7ffc0","observation_id":"0e452633-e85c-4fa9-ac84-56a00d5a26e9","resolution":{"observed_at":"2026-08-10T22:02:07.359103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:07.317440Z","title":"Subgraphormer: Unifying subgraph gnns and graph transformers via graph products","venue":null,"work_id":"9d3ade7a-cdea-4161-9b5d-e76260f2d4df","year":2024},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:04.935700Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:d36ea0f9f4a23afcac42a4ecf4e8eff1d3998159a69fea254ce8cc600b16f871","observation_id":"11819611-c132-486e-8842-38958b5fcf47","resolution":{"observed_at":"2026-08-10T22:02:07.331794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:07.293263Z","title":"A flexible, equivariant framework for subgraph gnns via graph products and graph coarsening","venue":null,"work_id":"0fa1d9b1-7183-4e22-9e27-54c3fa768179","year":2024},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:04.943634Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:26fedbf236b3ca64500067349e98055fac5aa632376e5a85711e02540238172a","observation_id":"e49afd3b-6b79-471c-a19c-5469e089f000","resolution":{"observed_at":"2026-08-10T22:02:07.299836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:07.263516Z","title":"and Klymko, C","venue":null,"work_id":"3cb6ec58-b0ce-4e1b-ae1d-29c44fe4af0f","year":2013},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:04.952842Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:f415e4ba05872e699f4e48f221fdcba413468f8f59a1e73f02ed94ffb350b713","observation_id":"623c6618-3501-413b-8f96-e6f6cb9f0246","resolution":{"observed_at":"2026-08-10T22:02:07.271581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6722","last_updated":"2015-04-30T18:13:15Z","snapshot_observed_at":"2026-08-15T23:59:36.753513Z","submitted_at":"2013-12-23T23:41:40Z","title":"On the limiting behavior of parameter-dependent network centrality measures","version":7},"cited_work":{"arxiv_id":"1312.6722","doi":null,"metadata_source":"pith","pith_arxiv_id":"1312.6722","snapshot_observed_at":"2026-08-10T22:02:05.902475Z","title":"On the limiting behavior of parameter-dependent network centrality measures","venue":"math.NA","work_id":"2658f3ef-4293-47fc-9dfd-7bc3e4421263","year":2013},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:04.959099Z"},"links":{"cited_paper":"/paper/1312.6722","citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:d40421a3f4c9e724f8b09b8fb9b1d141fbe151fde2bc5b2e74a8078bffe2ccfd","observation_id":"4ebf4195-bd54-4eef-b1a7-fd49bcaaec0f","resolution":{"observed_at":"2026-08-10T22:02:05.908762Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:07.230752Z","title":"M., and Maron, H","venue":null,"work_id":"fb30ec32-7b08-444d-ac14-3c0cb5b02a8e","year":2021},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:04.967133Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:de91b24ce6fbf90d503e20d62852902e11d5b544074649a2edf9efae1f2dbfbe","observation_id":"c41e9214-e456-4538-9d34-bd24b6c80cff","resolution":{"observed_at":"2026-08-10T22:02:07.236714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:07.196957Z","title":"Efficient subgraph gnns by learning effective selection policies","venue":null,"work_id":"828ef4de-57e9-47d9-98b7-944afd0ccbcd","year":2024},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:04.988582Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:071dbc092cac93f8f69c80879081ee482aa5781760f75c924c4a93d5981b513d","observation_id":"c01a8aa5-98bc-4b2b-ac64-b9780b959f7f","resolution":{"observed_at":"2026-08-10T22:02:07.210997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:07.172094Z","title":null,"venue":null,"work_id":"bf226914-77e4-4793-8d81-0dd12cfa3324","year":2020},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:04.998132Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:f632ca0bf2d3eb8be6e24953442d1b054c4fc23b8b00c97e4070c3ff0c55da2a","observation_id":"df8ebf65-7fb2-46bf-9126-7e5ebd9bbe2f","resolution":{"observed_at":"2026-08-10T22:02:07.179542Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:07.137904Z","title":"F., and Bronstein, M","venue":null,"work_id":"5b32402f-796b-4f37-a3b9-1c6783aa9ab7","year":2021},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.008734Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:4a25eb3a916c3b4c4ea44a1d96f2624657daa876e6c9b4a02fa5a9d09402147b","observation_id":"0b776f98-4534-4813-a29d-6425f4edda7e","resolution":{"observed_at":"2026-08-10T22:02:07.145805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:07.102760Z","title":"F., Lio, P., and Bronstein, M","venue":null,"work_id":"701d2889-bb7c-48ff-9f98-3dc23d4fa08d","year":2021},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.018828Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:c1fae0101b8ca5906480f64297da2611a50cc3d37ad510c9c0c3179fdd87916f","observation_id":"74493615-519a-4cb4-99ec-69706e07c5b9","resolution":{"observed_at":"2026-08-10T22:02:07.111244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:07.072558Z","title":"P., and Bronstein, M","venue":null,"work_id":"81543147-8c9d-4ac2-9c8a-7720e8fbd1f6","year":2022},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.027015Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:171d869752abb6c4f9c568cd10deca397dbb77846d0261721214bdf036b61070","observation_id":"20d97288-0618-41a9-9857-856215408222","resolution":{"observed_at":"2026-08-10T22:02:07.082751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.07553","last_updated":"2018-04-24T08:19:32Z","snapshot_observed_at":"2026-08-14T20:11:44.023605Z","submitted_at":"2017-11-20T21:28:40Z","title":"Residual Gated Graph ConvNets","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-10T22:02:05.035190Z","title":"and Laurent, T","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.035190Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:65c09216022d7a451f367b00a27831e5fac470d07e18db75e5b46af632258135","observation_id":"f6b6f4e1-7380-45e0-ab57-4d0a04533f2e","resolution":{"observed_at":"2026-08-10T22:02:05.035190Z","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-10T22:02:07.042825Z","title":null,"venue":null,"work_id":"8ae9e710-d2b1-4560-8946-88517819b70f","year":2009},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.045867Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:3eb18ba110abb13d1b72c791d0955e29c369a751a534467f663f3b6d8f8d016d","observation_id":"ccabdb9e-ead6-40e4-87bb-9f58f38ed74a","resolution":{"observed_at":"2026-08-10T22:02:07.049988Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:07.010386Z","title":"Can graph neural networks count substructures? Advances in neural information processing systems, 33: 0 10383--10395, 2020","venue":null,"work_id":"ce839541-24a7-480f-a924-68823d58fb1a","year":2020},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.051137Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:2c780349a291d3a5133ff438d546da977f256b7478e4ae24afb23f9bd4cdb0c0","observation_id":"0ed110ad-0391-4459-b01e-6aa7a23adb52","resolution":{"observed_at":"2026-08-10T22:02:07.020853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:06.973677Z","title":"and Jegelka, S","venue":null,"work_id":"8c13eb04-0324-45ef-b454-f22acecbb501","year":2022},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.056702Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:ba83a034f06f326dedf4fa15bdf4994befdfd4e959afe75807be1a474f5c8bc0","observation_id":"2b86abc5-c3a5-4ee2-8d94-e5d2595e4e0c","resolution":{"observed_at":"2026-08-10T22:02:06.994828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:06.947858Z","title":"Reconstruction for powerful graph representations","venue":null,"work_id":"41be8d00-946e-4039-8807-dc1fa94d1af3","year":2021},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.065228Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:fb98926ee6998ecbc868357914cd694a6002f0ff30da839294444e5f291b0293","observation_id":"01f72f5f-c58b-4b08-b63b-58a83c24d8ff","resolution":{"observed_at":"2026-08-10T22:02:06.954561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:05.076067Z","title":"Approximation by superpositions of a sigmoidal function","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.076067Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:403fa6b28d343436f285bea702cf94538b21186cdc8a1abb63ab74a92915d6ad","observation_id":"ee077707-8d00-40d9-8c8e-31a54d2f36a3","resolution":{"observed_at":"2026-08-10T22:02:05.076067Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.09141","last_updated":"2022-03-17T07:50:48Z","snapshot_observed_at":"2026-08-16T17:13:52.632936Z","submitted_at":"2022-03-17T07:50:48Z","title":"Graph Representation Learning with Individualization and Refinement","version":1},"cited_work":{"arxiv_id":"2203.09141","doi":null,"metadata_source":"pith","pith_arxiv_id":"2203.09141","snapshot_observed_at":"2026-08-10T22:02:05.851277Z","title":"Graph Representation Learning with Individualization and Refinement","venue":"cs.LG","work_id":"eb1e7c92-6079-4c1a-aead-cfa5503a52c5","year":2022},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.082189Z"},"links":{"cited_paper":"/paper/2203.09141","citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:5b297416866c6f952ed5a140a08f40718ae8562494c935f66f1d51938c88301f","observation_id":"afedf36b-0dac-4392-a6b1-088472dcacd4","resolution":{"observed_at":"2026-08-10T22:02:05.859281Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:05.090103Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.090103Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:76d9fca855195bbe4965e81c86d51c42552a3b134eaf30eb89a41da09e3d13dd","observation_id":"90c17f54-174c-481f-9681-74c9b7848b29","resolution":{"observed_at":"2026-08-10T22:02:05.090103Z","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-10T22:02:06.891512Z","title":"P., Luu, A","venue":null,"work_id":"579bbf67-94e9-4989-91af-db27b2358ad9","year":2021},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.097851Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:663c7c14e09dcfc1acaa77034a8290f4f9ebce28d14c886b56754629db56a936","observation_id":"e3dbd741-1b7f-44c6-80ea-87e3e2a040be","resolution":{"observed_at":"2026-08-10T22:02:06.898751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:05.107778Z","title":"P., Ramp \\'a s ek, L., Galkin, M., Parviz, A., Wolf, G., Luu, A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.107778Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:cff6317c4620433083971ef88b8a6860234a93b11e1d5cd532ff1015aba0c40e","observation_id":"d8eb6841-3a43-47b1-a7de-c13cbde384ee","resolution":{"observed_at":"2026-08-10T22:02:05.107778Z","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-10T22:02:05.115708Z","title":"P., Joshi, C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.115708Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:607a8bc87bc7428207054a55bdf7953534d44503fc9e2e62cf3827a4efcc9326","observation_id":"e7f040ff-b86a-413b-b858-9c7eb00c664b","resolution":{"observed_at":"2026-08-10T22:02:05.115708Z","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-10T22:02:06.834498Z","title":"and Rodriguez-Velazquez, J","venue":null,"work_id":"45eb6cff-89ba-4b8a-b102-6ef0d7797b55","year":2005},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.122335Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:8de6f5a3d5a24a53d22a6472fa6e3e28e9f6e4e18b5d2e93467bb88153ff1d04","observation_id":"109f5985-3a3e-4ced-b2e4-0ba329047db5","resolution":{"observed_at":"2026-08-10T22:02:06.844635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:06.800940Z","title":"and Weber, M","venue":null,"work_id":"d7e9931f-a99c-446b-a06f-92c01b6085ea","year":2024},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.129026Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:fd4309d152ba5cda349fbda144241f79fa69dd07f2a7ed4ff46c552bbddcd21c","observation_id":"8d946a86-e530-4cc2-875f-6b63e695f151","resolution":{"observed_at":"2026-08-10T22:02:06.811059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:06.768701Z","title":"and Lenssen, J","venue":null,"work_id":"63473852-3bfe-4f8c-a809-f8488459e643","year":2019},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.135126Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:724215b6afc7075a60b966b9a0a03c0e66d8f12087d673d8a669d85f5a541aee","observation_id":"eb86cd53-b2bd-4848-86de-462c46770e07","resolution":{"observed_at":"2026-08-10T22:02:06.774725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:05.141020Z","title":"Understanding and extending subgraph gnns by rethinking their symmetries","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.141020Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:14b5f5ecf1b6521b92cf427a460d7531561dab639a816686a486c641d7ba76be","observation_id":"d602cda6-f368-442b-abc3-7d8045750c4a","resolution":{"observed_at":"2026-08-10T22:02:05.141020Z","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-10T22:02:06.731073Z","title":null,"venue":null,"work_id":"17149a6b-8f15-4353-b519-c3b384d28c9b","year":1977},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.148453Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:159c19a1c6d7685c38c9dcba55df1e45b74908c24e0af26093159c22528d4e1b","observation_id":"8ffe7fe5-1d77-4deb-a20b-947957a7b7b3","resolution":{"observed_at":"2026-08-10T22:02:06.737678Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:06.706483Z","title":null,"venue":null,"work_id":"e0266149-8d37-41bd-acf6-3f26caa2fb3e","year":2021},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.154403Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:77b0d46df8c1b9303d1956d5a0a055a40347baf0c97172cf3d80602b66e956bc","observation_id":"1eb17e0b-886c-415b-87f6-ed941c8a8ff0","resolution":{"observed_at":"2026-08-10T22:02:06.714925Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:06.686780Z","title":"and Reutter, J","venue":null,"work_id":"52780048-7046-4717-a236-444a7bad9e67","year":2023},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.159701Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:0ac1d2fae860b310736f5472b7cc0f5e224b0e6d6a67c792880b372c4ca43b38","observation_id":"dbcfa7d6-d748-4692-82e7-3877b4ca21d6","resolution":{"observed_at":"2026-08-10T22:02:06.692844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:05.166045Z","title":"S., Riley, P","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.166045Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:3d51cc5ec5917a2a20ff42776656537b440dcbd94a62dcb322ea637b8ef97782","observation_id":"cb26e39e-0ecc-4d6f-94da-7216603e4eb2","resolution":{"observed_at":"2026-08-10T22:02:05.166045Z","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-10T22:02:05.174674Z","title":"N., Duvenaud, D., Hern \\'a ndez-Lobato, J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.174674Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:8597969cd085c1d7e58eb064b225a402c33b3ce616bffbcff555e94107f5aa43","observation_id":"765ee00c-cb26-4440-adf6-42e312b5dd7c","resolution":{"observed_at":"2026-08-10T22:02:05.174674Z","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-10T22:02:05.182617Z","title":"A new model for learning in graph domains","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.182617Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:5a8da7cd69e4c75dd284a7677dee33cede0db9aa03d2fb1c3bc5c7372d1b174d","observation_id":"14af6679-70ac-4e03-8498-2f090284ce1c","resolution":{"observed_at":"2026-08-10T22:02:05.182617Z","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-10T22:02:06.637540Z","title":"J., and Schult, D","venue":null,"work_id":"7d7d5d22-5f3c-49ee-b0ac-95562d997d8b","year":2008},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.188556Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:d56712aba41f18a06fb2af390c51736e57e1bde1ee24670ffac845558710ae35","observation_id":"31924e2a-cc3d-4b1e-8720-785abcba5d10","resolution":{"observed_at":"2026-08-10T22:02:06.643572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:06.617714Z","title":"A generalization of vit/mlp-mixer to graphs","venue":null,"work_id":"f705bf92-aadd-474d-8bb3-29ffc6bb5d51","year":2023},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.194437Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:e5338635c04fc271c42d82e447022bd5c6861fbc6b4164027b245f67d30c1475","observation_id":"adc5530c-a3f5-429c-8406-6f1eab764bc0","resolution":{"observed_at":"2026-08-10T22:02:06.624107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:05.201766Z","title":"Approximation capabilities of multilayer feedforward networks","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.201766Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:490b04cce139348a8f23a9ce516eb850732a97a147e8a9001e5538f5f0baf40d","observation_id":"b81cae9b-60d2-4cde-847e-99598a750720","resolution":{"observed_at":"2026-08-10T22:02:05.201766Z","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-10T22:02:06.580516Z","title":"Graph policy network for transferable active learning on graphs","venue":null,"work_id":"334933f5-f236-4561-a464-da5c92cde6d7","year":2020},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.211517Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:fcd76eba2dc2f6666eec04071be0746d4dea257cfe932fa28ef2aadc7d9d7359","observation_id":"9715f1a1-037a-4a25-91bb-58f0f9944856","resolution":{"observed_at":"2026-08-10T22:02:06.588440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:06.559142Z","title":"Open graph benchmark: Datasets for machine learning on graphs","venue":null,"work_id":"29dea0a5-b0ed-410d-a173-64789a40a250","year":2020},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.218497Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:5875d84310d39fee1ade840818d978c2328f76c7aee7acaf536b791aa7f57cd8","observation_id":"4b94f48c-cd93-4a3f-b220-56c11d4b65dc","resolution":{"observed_at":"2026-08-10T22:02:06.565403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:06.540687Z","title":"Strategies for pre-training graph neural networks","venue":null,"work_id":"e45fb370-0046-43ff-8468-8d0f2607925a","year":2020},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.224988Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:0c91915a44bc8a74f35d67b9041cb1602669bcc47ae504c38e9679e2ffad4a2a","observation_id":"1f1dd060-1da6-4c62-892f-e77e92143a0e","resolution":{"observed_at":"2026-08-10T22:02:06.546072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:06.522576Z","title":"Boosting the cycle counting power of graph neural networks with I ^2 -gnns","venue":null,"work_id":"d0f6447b-63dd-4d24-9bff-1ffbf86e629c","year":2023},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.231974Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:396e1d18948fb43b0888fc4d6a316439d5bda1015d4b26629b5c672284d2c895","observation_id":"5eef4406-8af2-4029-a21d-98637e1b94f3","resolution":{"observed_at":"2026-08-10T22:02:06.527881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:06.507379Z","title":"and Ribeiro, A","venue":null,"work_id":"eece5be6-6bb1-42e4-ade5-4f369a415c35","year":2024},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.237436Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:0625d678e48f299fb77fb1a0aecb5a82808e8511b7ca06ab8d754b83f92d8429","observation_id":"eaf2276a-33ef-4373-9d9f-f540ddb53c5e","resolution":{"observed_at":"2026-08-10T22:02:06.512118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:06.489343Z","title":"A new status index derived from sociometric analysis","venue":null,"work_id":"8ba9ba08-4f06-4871-af24-1b30db9dded9","year":1953},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.243750Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:528658c25f01f1e16899200a456f2b17ba53787858faffbefe411cac451e9758","observation_id":"017a3ab0-301b-4b33-a626-f45ae451ea62","resolution":{"observed_at":"2026-08-10T22:02:06.496060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:05.254191Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.254191Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:b1e0ed290ffe30ea08de5ff63b7f788d5390de4f24043edc5133327ea7d02a9c","observation_id":"112ddedf-6db2-41ff-bf11-03c262823d8e","resolution":{"observed_at":"2026-08-10T22:02:05.254191Z","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-10T22:02:06.455264Z","title":"Mag-gnn: Reinforcement learning boosted graph neural network","venue":null,"work_id":"0fbc7043-36fe-4a4f-b553-c1a64fd27d12","year":2024},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.260051Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:911fc47679e90360f475fb0fca42fc2f5976fffa1a9b8dfccc3534d8d1642d4e","observation_id":"5651ce54-297e-40df-8398-888fced447e0","resolution":{"observed_at":"2026-08-10T22:02:06.462161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:05.265425Z","title":"Rethinking graph transformers with spectral attention","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.265425Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:bbc4425839630718ba58cd4b39660ca46bacfee96765f03f6470bfec68e33df6","observation_id":"7924643c-9121-44b8-b084-9c341c8f90ac","resolution":{"observed_at":"2026-08-10T22:02:05.265425Z","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-10T22:02:05.270524Z","title":"Distance encoding: Design provably more powerful neural networks for graph representation learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.270524Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:7fc8a501230ed2e7ed26f4aae1924946108e3a46c166072429327c16be0b92e9","observation_id":"fe51bf59-d12c-41ed-a170-7a97f0ed1d00","resolution":{"observed_at":"2026-08-10T22:02:05.270524Z","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-10T22:02:06.415982Z","title":"D., Zhao, L., Smidt, T., Sra, S., Maron, H., and Jegelka, S","venue":null,"work_id":"03020e57-39df-4581-aff6-4f465b020e5d","year":2023},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.275225Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:b08243b35e8c19e1641d69635fecc9a9179c20e6c7e93ff1c906b1b2e28fc12b","observation_id":"9c01aedf-a18f-4057-95ab-48b1b57909cd","resolution":{"observed_at":"2026-08-10T22:02:06.421656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:06.394561Z","title":"Expressive sign equivariant networks for spectral geometric learning","venue":null,"work_id":"1154ad6e-e33b-4d6f-917b-5fc5ede08218","year":2024},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.288861Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:615de2949f6c1aa1c7774b623486a404e6a8abfd213e595d314efd3148a86d3d","observation_id":"ad656948-b670-429a-a689-48f6b3616c76","resolution":{"observed_at":"2026-08-10T22:02:06.401665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:05.294274Z","title":"and Hutter, F","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.294274Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:51e4e13ac68192384c895bb3720719413dfc92be473cf24e9cbbf34c31d4130d","observation_id":"a3fb607f-3d10-467b-af63-721d92f3b0a2","resolution":{"observed_at":"2026-08-10T22:02:05.294274Z","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-10T22:02:06.359049Z","title":"Invariant and equivariant graph networks","venue":null,"work_id":"4e968a12-aa28-4048-a7cd-e39828b61f41","year":2018},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.299382Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:988be7918138b07644553b7a5cd36dcb3015b7ed5f4638a5b6edafbd086aee91","observation_id":"8e3c36c7-b12e-4652-aa1b-29fce0349c42","resolution":{"observed_at":"2026-08-10T22:02:06.364294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:05.305700Z","title":"Neural network for graphs: A contextual constructive approach","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.305700Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:1df1ecc392a9a88419b547c6cd2cedd6fee2f040d8a981b9f21a47c2894285a7","observation_id":"594db345-11ed-4a49-ac75-2c50d1bbdd7d","resolution":{"observed_at":"2026-08-10T22:02:05.305700Z","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-10T22:02:05.311197Z","title":"L., Lenssen, J","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.311197Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:341676965efbf438ecead8433cd41098831dfa3971e79456dc20c93bb478d470","observation_id":"4465a85c-53fb-49c8-9347-fc372d3069be","resolution":{"observed_at":"2026-08-10T22:02:05.311197Z","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-10T22:02:06.314255Z","title":"M., Bause, F., Kersting, K., Mutzel, P., and Neumann, M","venue":null,"work_id":"ee9cd58d-7edc-41f4-8f69-b83780da1837","year":2020},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.318249Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:c0714c89b523188b78728f8f06027877616eedcaa20f98fc5079518a9d254de1","observation_id":"6fdf99c6-17b2-4acd-846d-15310550fceb","resolution":{"observed_at":"2026-08-10T22:02:06.321514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:06.295502Z","title":"Weisfeiler and leman go sparse: Towards scalable higher-order graph embeddings","venue":null,"work_id":"a73f6042-64e5-41a7-892a-ae0b99677a3c","year":2020},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.324153Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:ca36d66a0ed5a32c32645d30d818c8c3f46599fd0da899ab0746bd2aff855c44","observation_id":"b5c4a337-592a-4204-83cb-6dafa09ca1c5","resolution":{"observed_at":"2026-08-10T22:02:06.301429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:06.278567Z","title":"M., Grohe, M., Fey, M., and Borgwardt, K","venue":null,"work_id":"15cc5732-4022-45df-93f6-696c0c4858c7","year":2023},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.329746Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:7cd7a20b669c4dde573496c619877088ec76f125e7b38ee6c4e523c207e84ffa","observation_id":"45bf39b1-f4b8-473b-80c4-95172c179253","resolution":{"observed_at":"2026-08-10T22:02:06.283658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:06.261721Z","title":null,"venue":null,"work_id":"fd809dc9-d188-4229-a115-14ee732b9992","year":2022},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.336607Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:a676b007a5caf4d8f08e3ba7262e9846e3eb3a03ebe94b0bc3805937bc580c93","observation_id":"9a729a96-2696-40b1-b6cb-3153644515df","resolution":{"observed_at":"2026-08-10T22:02:06.266913Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:06.242866Z","title":"A., Martinkus, K., Faber, L., and Wattenhofer, R","venue":null,"work_id":"1afa3c05-0e5a-46c8-963f-3bdd01d6905b","year":2021},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.343624Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:a85d40e487c78dadc62907a3f8b7a70409ec82b4777c49e5a61366be47bc9a06","observation_id":"ff811b74-297b-4b86-902e-2096d3409adf","resolution":{"observed_at":"2026-08-10T22:02:06.248678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:05.349348Z","title":"Pytorch: An imperative style, high-performance deep learning library","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.349348Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:2039bb6e999eea9eff7f7b683bde7d7f0568c007c8b6c90da3f8d46a7f7d9364","observation_id":"f6460321-a9e3-41b7-81ba-5d36a7230048","resolution":{"observed_at":"2026-08-10T22:02:05.349348Z","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-10T22:02:06.212760Z","title":"Ordered subgraph aggregation networks","venue":null,"work_id":"9725eecd-501d-4787-a07d-8b5385dadc8f","year":2022},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.354889Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:56cb5ed7069a92fa45a79dfa54ece3e4958afee79ad699f085f9f862367db450","observation_id":"2d5396c5-6958-44dc-b46e-8739e8bcf8d8","resolution":{"observed_at":"2026-08-10T22:02:06.219961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:05.361193Z","title":"P., Luu, A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.361193Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:ddea8863f965d8ead7e117762a6a820128162213f202cdcbc032028a62314b66","observation_id":"f1813100-e426-448a-ae8b-d96acf4ac832","resolution":{"observed_at":"2026-08-10T22:02:05.361193Z","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-10T22:02:06.178873Z","title":null,"venue":null,"work_id":"3847dfde-b55d-4566-b662-44e0d22076ea","year":1998},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.366885Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:21ce75dc8db7df76d460f2c0cbd7071b5df22e8061c44581a9c3f3c2e4e050d3","observation_id":"fe21b79c-49f1-4227-b668-c32f28f17a34","resolution":{"observed_at":"2026-08-10T22:02:06.184980Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:06.159156Z","title":"Random features strengthen graph neural networks","venue":null,"work_id":"bcd39b42-dac7-452f-97ba-7d54f530e5e6","year":2021},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.372344Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:f63f7b5ccdb61c2c485fb631781afc9510f0bba2f87590e3e06caa807065bee3","observation_id":"1adafe14-d582-4f92-a7aa-ac7d8ac5ce5b","resolution":{"observed_at":"2026-08-10T22:02:06.164499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:05.378321Z","title":"C., Hagenbuchner, M., and Monfardini, G","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.378321Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:1f0740ec27a76a6b576cdb6c1b28e796cc996dc0b4daf1f08f86faaaa540550c","observation_id":"1ad7f734-bebf-44fb-8c61-2f80d50b34a5","resolution":{"observed_at":"2026-08-10T22:02:05.378321Z","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-10T22:02:06.139342Z","title":"and Irwin, J","venue":null,"work_id":"c1b817df-6c65-4277-9d55-fb4b51462a07","year":2015},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.386458Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:dad05098c2229a72fda08b8d3bb1b41f413a3f1c3f4a7070ee6930a154508f94","observation_id":"9349b336-a152-4cb5-93d0-5172f663597b","resolution":{"observed_at":"2026-08-10T22:02:06.144602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:06.122732Z","title":"S., and He, L","venue":null,"work_id":"ae3c665c-c5bb-4b80-a2d1-71ae60ef0fd5","year":2021},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.392565Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:2be17c10b3e531904298e982d9b5f916a78ec8863213859d3065e7a98f39b9da","observation_id":"907326bc-c35d-4447-baf6-3b6bb5e3ecbd","resolution":{"observed_at":"2026-08-10T22:02:06.128122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.03174","last_updated":"2021-10-11T03:36:32Z","snapshot_observed_at":"2026-08-16T19:00:42.431693Z","submitted_at":"2020-12-06T03:42:54Z","title":"Counting Substructures with Higher-Order Graph Neural Networks: Possibility and Impossibility Results","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.03174","snapshot_observed_at":"2026-08-10T22:02:05.398595Z","title":"Counting substructures with higher-order graph neural networks: Possibility and impossibility results","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.398595Z"},"links":{"cited_paper":"/paper/2012.03174","citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:a8eaf5b0cf20e17d47204225d87a069dc2c61c05af4125dd2f151ee4b2c5e60f","observation_id":"2c7ae1e5-c705-4eb7-a63b-792e8b8e1f2c","resolution":{"observed_at":"2026-08-10T22:02:05.398595Z","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-10T22:02:06.101671Z","title":"Where did the gap go? reassessing the long-range graph benchmark","venue":null,"work_id":"b34ff683-be72-45af-a436-12d08a666c0c","year":2023},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.405769Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:b26036c9964f77757158ca6fa0d6b042a0d3ca185fe3f8a698f247c3b82911e2","observation_id":"9470de83-2d7a-4926-85ef-d7c5df91215b","resolution":{"observed_at":"2026-08-10T22:02:06.109456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:06.082476Z","title":"Building powerful and equivariant graph neural networks with structural message-passing","venue":null,"work_id":"f9a1d7f5-5469-4818-9196-87dcd63b42ca","year":2020},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.411358Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:901e925d5e4c5026b9be0b31dbc7885adb853faa823ee5dbb3c7e0cdf18b0606","observation_id":"c7faaf85-c54c-4caa-965f-81f8291dfe41","resolution":{"observed_at":"2026-08-10T22:02:06.088572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:05.417776Z","title":"Equivariant and stable positional encoding for more powerful graph neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.417776Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:e383cb5cda20d5ada2e17c624e40239857c144b8ca112995fb7c788de8d20e01","observation_id":"49a7102f-1f73-406e-8a6d-3a0ab47bbae2","resolution":{"observed_at":"2026-08-10T22:02:05.417776Z","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-10T22:02:05.425499Z","title":"and Leman, A","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.425499Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:8a542bd59b46e5c4b07c299af374ac067308282bd097e386ef9a99cb24c9ec08","observation_id":"23ba6c7f-4848-4326-9505-735d78867760","resolution":{"observed_at":"2026-08-10T22:02:05.425499Z","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-10T22:02:05.430947Z","title":"How powerful are graph neural networks? In International Conference on Learning Representations, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.430947Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:168241b0dbfbabdd5da7ad509160092cf391177d21c560b543042105bd587a47","observation_id":"926c4e51-33dc-41e1-ad86-487e7a42eace","resolution":{"observed_at":"2026-08-10T22:02:05.430947Z","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-10T22:02:05.438126Z","title":"Do transformers really perform badly for graph representation? Advances in Neural Information Processing Systems, 34: 0 28877--28888, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.438126Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:78d73ceeae11b05078036ea32dc8c70ff8a4a1f4de859596c4782a645698097e","observation_id":"97b38f15-9e7f-41f0-ac69-f0a9360df9f2","resolution":{"observed_at":"2026-08-10T22:02:05.438126Z","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-10T22:02:05.444526Z","title":"M., Ying, R., and Leskovec, J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.444526Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:1c17c1c1bea4d5057af7445af3daedd59f4d14569239c4b874365cfcd755c5a6","observation_id":"3f6e0e35-ea88-4585-af96-ffd3dfe01a70","resolution":{"observed_at":"2026-08-10T22:02:05.444526Z","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-10T22:02:05.992772Z","title":"Small relu networks are powerful memorizers: a tight analysis of memorization capacity","venue":null,"work_id":"50c6e86f-2eaa-4dc9-bf6a-cde9d1b87c5b","year":2019},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.451827Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:a89574fea21ce5bd61d2357fd08cc1c0bcea698585070b167277a5a56c10a0e0","observation_id":"e1c712e4-3832-4580-85a6-2fe7b734892b","resolution":{"observed_at":"2026-08-10T22:02:05.998528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:05.971413Z","title":"A complete expressiveness hierarchy for subgraph gnns via subgraph weisfeiler-lehman tests","venue":null,"work_id":"8ae93cc1-0cbf-430b-a00a-cbeb3f1f4b30","year":2023},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.459299Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:bfe5e752c680aca26ddcb5fd19c9d8f4394ec4d0e965a40a92275c65a508e661","observation_id":"a212fa4a-1ed2-400f-b112-c07e8353e9dd","resolution":{"observed_at":"2026-08-10T22:02:05.978949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:05.953639Z","title":"Rethinking the expressive power of gnns via graph biconnectivity","venue":null,"work_id":"76eaf5be-66e8-4a01-8d0c-6d00081b6824","year":2023},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.465557Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:1e56b7d3ff781dd5d34f98ebea1739572523d6557f8c4923e68cf98176381383","observation_id":"ef94a45c-7393-4c3f-97a4-80867b2c4609","resolution":{"observed_at":"2026-08-10T22:02:05.959439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:02:05.471815Z","title":"and Li, P","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.471815Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:e233f250d367cf7072e7d2848231a853b9eeb98ff7fbc2cb5eb34cfde7c786c9","observation_id":"53521a86-0247-42ed-8d65-69269db2463a","resolution":{"observed_at":"2026-08-10T22:02:05.471815Z","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-10T22:02:05.923012Z","title":"From stars to subgraphs: Uplifting any gnn with local structure awareness","venue":null,"work_id":"e3f6c790-2140-4be2-8e7d-d22a879d2021","year":2022},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.477635Z"},"links":{"citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:7ee2366ab902d1bcc3ada15c4d33c82884b98f38b9be07df5532a5c22cd6184c","observation_id":"f47cfec5-421c-4a6f-8f65-651391213b58","resolution":{"observed_at":"2026-08-10T22:02:05.928634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality"},"reference_resolution":{"displayed":79,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":33,"verified_exact":2,"verified_fuzzy":44},"total_outbound_references":79},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 79 of 79 outbound references and 2 inbound Pith citation observations for arXiv:2501.03113."}