{"as_of":"2026-08-18T17:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a2ca88faa668df6340c795a5115077f250bdf7b45662138465acfc37d57b6bb0","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":57,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T10:12:35.071633Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":249,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"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-12T15:57:04.507841Z","title":"Residual gated graph convnets,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.13797","last_updated":"2024-11-21T02:51:52Z","snapshot_observed_at":"2026-08-16T06:25:34.253723Z","submitted_at":"2024-11-21T02:51:52Z","title":"Hugging Rain Man: A Novel Facial Action Units Dataset for Analyzing Atypical Facial Expressions in Children with Autism Spectrum Disorder","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-12T15:57:04.507841Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2411.13797"},"observation_digest":"sha256:32b508047cbc5a6e73ccd5fe67289a3c6db4bc16f15cae55f538284c7cbb157c","observation_id":"65d406a0-ac8f-41d8-9e60-10ce1bcfcb9f","resolution":{"observed_at":"2026-08-12T15:57:04.507841Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-12T12:21:08.014064Z","title":"and Laurent, T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.17296","last_updated":"2025-05-29T04:23:01Z","snapshot_observed_at":"2026-08-15T11:20:39.917091Z","submitted_at":"2024-11-26T10:38:00Z","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","version":3},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-12T12:21:08.014064Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2411.17296"},"observation_digest":"sha256:a7a60a16823409b53ac4d8cd57c664b786fcf6ea5a0e8e2fd84b01d4f23d3758","observation_id":"3084986c-5095-49c3-a10c-b3f5cf1004d6","resolution":{"observed_at":"2026-08-12T12:21:08.014064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-12T04:21:47.950498Z","title":"Residual gated graph convnets","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-17T09:37:33.376911Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:47.950498Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:5735fff0c66c2e61f5a94e874131e171ec27c183b68f515222f60dfd5adad0f6","observation_id":"3cd7cccc-6c45-423e-8e52-99b1013419a4","resolution":{"observed_at":"2026-08-12T04:21:47.950498Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-11T22:46:26.285714Z","title":"Residual gated graph convnets","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.03190","last_updated":"2024-12-04T10:22:34Z","snapshot_observed_at":"2026-08-17T16:12:01.133377Z","submitted_at":"2024-12-04T10:22:34Z","title":"Node Classification With Integrated Reject Option","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T22:46:26.285714Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2412.03190"},"observation_digest":"sha256:fafcafae1d97c3a4754c89a37ff2c4655681e8f3f68e98f6e391951fd91c5293","observation_id":"1a6ef0f2-1955-4fc6-a5ea-ff518b53c6d2","resolution":{"observed_at":"2026-08-11T22:46:26.285714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-11T17:24:55.292580Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.09030","last_updated":"2024-12-12T07:45:17Z","snapshot_observed_at":"2026-08-16T05:15:32.100342Z","submitted_at":"2024-12-12T07:45:17Z","title":"RingFormer: A Ring-Enhanced Graph Transformer for Organic Solar Cell Property Prediction","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T17:24:55.292580Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2412.09030"},"observation_digest":"sha256:23ca37c3c03cdd046aa04aa6d8a8bceb73952b55c399322a4158f5506bda89bf","observation_id":"a81f525b-2b9b-4802-ac81-12f4880f7b04","resolution":{"observed_at":"2026-08-11T17:24:55.292580Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-11T16:39:05.028184Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.028184Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:a35ef9073583b5521452e0b4d927ea1ab95577e9a2c15d43b52875fe4fd8832e","observation_id":"3f586a21-525a-4165-ab13-94238ab43722","resolution":{"observed_at":"2026-08-11T16:39:05.028184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-11T05:23:48.009572Z","title":"Semih Cant¨ urk, Renming Liu, Olivier Lapointe-Gagn´ e, Vincent L´ etourneau, Guy Wolf, Dominique Beaini, and Ladislav Ramp´ aˇ sek","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.17609","last_updated":"2024-12-23T14:28:56Z","snapshot_observed_at":"2026-08-18T00:30:12.229070Z","submitted_at":"2024-12-23T14:28:56Z","title":"Towards Foundation Models on Graphs: An Analysis on Cross-Dataset Transfer of Pretrained GNNs","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-11T05:23:48.009572Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2412.17609"},"observation_digest":"sha256:5b8f4c8a1cb5633bf7b666bb6124f11ce686186ee66c8941105a269daa882672","observation_id":"afe06e31-0cf0-4566-8f9a-56cff09a9548","resolution":{"observed_at":"2026-08-11T05:23:48.009572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-15T23:59:40.987439Z","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:7b93f72d1d98c41367f01bf04f70e7cebfe58e550260399827f354cd0a54baae","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":{"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-10T16:57:29.042022Z","title":"Residual Gated Graph ConvNets","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.12732","last_updated":"2025-01-22T09:09:17Z","snapshot_observed_at":"2026-08-14T13:37:49.807864Z","submitted_at":"2025-01-22T09:09:17Z","title":"GRAMA: Adaptive Graph Autoregressive Moving Average Models","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T16:57:29.042022Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2501.12732"},"observation_digest":"sha256:639a50c83f3a128be19e800aa8d0f42c80c3902ee5fecf2811933a234c71398a","observation_id":"71b5dbcc-959d-4c8a-8141-a750bf5efeed","resolution":{"observed_at":"2026-08-10T16:57:29.042022Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-09T19:38:34.620516Z","title":"and Laurent, T","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.00282","last_updated":"2025-02-01T02:46:48Z","snapshot_observed_at":"2026-08-15T08:51:37.963214Z","submitted_at":"2025-02-01T02:46:48Z","title":"GraphMinNet: Learning Dependencies in Graphs with Light Complexity Minimal Architecture","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T19:38:34.620516Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2502.00282"},"observation_digest":"sha256:215560db387db8abb946108943b09b671e0a83af250976b7e9daaa1f356e7794","observation_id":"80f96444-2932-4abc-a29f-d3ae82fbc563","resolution":{"observed_at":"2026-08-09T19:38:34.620516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T21:50:23.392461Z","title":"and Laurent, T","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-13T10:50:05.346329Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.392461Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:cbc22551b3d98013dc3d33e3a9ed88dd9b0658aad7e933fb64c3e8408a5aead3","observation_id":"6ca46ad6-5d4f-4ccb-9eea-d9b96171cc29","resolution":{"observed_at":"2026-08-07T21:50:23.392461Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T21:26:16.875312Z","title":"Residual gated graph convnets","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.09473","last_updated":"2025-02-14T09:14:14Z","snapshot_observed_at":"2026-08-17T15:41:24.930256Z","submitted_at":"2025-02-13T16:36:25Z","title":"Learning to Predict Global Atrial Fibrillation Dynamics from Sparse Measurements","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T21:26:16.875312Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2502.09473"},"observation_digest":"sha256:9b621a7b93ee9bd26fc1bc41aca6ca22194f57cdb7d1048346f2eba4c030a264","observation_id":"3aca7c53-e87d-4228-8850-27fac98ef3ea","resolution":{"observed_at":"2026-08-07T21:26:16.875312Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-16T10:12:35.071633Z","title":"arXiv preprint arXiv:1711.07553 (2017)","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.18910","last_updated":"2025-04-26T12:50:12Z","snapshot_observed_at":"2026-08-16T10:04:21.744646Z","submitted_at":"2025-04-26T12:50:12Z","title":"Kinship Verification through a Forest Neural Network","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-16T10:12:35.071633Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2504.18910"},"observation_digest":"sha256:1f4497f4dcac6f377245f32c208a35e7aefcc850a302ef58b68bd77a969a300a","observation_id":"ab2be898-f239-43c9-8374-37f65f9fd13d","resolution":{"observed_at":"2026-08-16T10:12:35.071633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-16T05:31:06.763204Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.20666","last_updated":"2025-04-29T11:45:24Z","snapshot_observed_at":"2026-08-16T05:20:59.657387Z","submitted_at":"2025-04-29T11:45:24Z","title":"SFi-Former: Sparse Flow Induced Attention for Graph Transformer","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T05:31:06.763204Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2504.20666"},"observation_digest":"sha256:b796e86173eab5dcc05e92dda998406c1429a9dafee614cc56a45c5936e15ac4","observation_id":"e8c6956a-7023-43f5-a222-249e0a54c8af","resolution":{"observed_at":"2026-08-16T05:31:06.763204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-15T20:58:40.403731Z","title":"and Laurent, T., Residual Gated Graph ConvNets","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.11230","last_updated":"2025-05-16T13:25:22Z","snapshot_observed_at":"2026-08-17T21:13:14.536062Z","submitted_at":"2025-05-16T13:25:22Z","title":"Learning traffic flows: Graph Neural Networks for Metamodelling Traffic Assignment","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:40.403731Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2505.11230"},"observation_digest":"sha256:5b2ab178e473004a5ab639603647809535488f1ed43931730c97ea1e1b60d7be","observation_id":"5eaf136b-f397-420e-98bc-fbc18a43e845","resolution":{"observed_at":"2026-08-15T20:58:40.403731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-15T20:41:18.019895Z","title":"Residual gated graph convnets","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.12302","last_updated":"2025-05-18T08:33:33Z","snapshot_observed_at":"2026-08-15T20:34:23.179374Z","submitted_at":"2025-05-18T08:33:33Z","title":"SenseFlow: A Physics-Informed and Self-Ensembling Iterative Framework for Power Flow Estimation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T20:41:18.019895Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2505.12302"},"observation_digest":"sha256:16e4f3cab36651aa0b5e2c2037bcde916dee9ce6ee58ee139a8a04c16392cc9d","observation_id":"f68bae8c-da71-4e9d-9da4-e9dee780334b","resolution":{"observed_at":"2026-08-15T20:41:18.019895Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T14:32:35.481645Z","title":"Residual Gated Graph ConvNets","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.18728","last_updated":"2026-05-26T08:20:42Z","snapshot_observed_at":"2026-08-14T09:58:06.733761Z","submitted_at":"2025-05-24T14:53:07Z","title":"Message-Passing State-Space Models: Improving Graph Learning with Modern Sequence Modeling","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:32:35.481645Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2505.18728"},"observation_digest":"sha256:4ab96f81d10f0ce1c2c5286f6073099be0ef68341175c92c9025fb95fa5d68bc","observation_id":"4a432ef6-f29b-4214-bde4-b67400965fba","resolution":{"observed_at":"2026-08-07T14:32:35.481645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T12:57:31.614442Z","title":"and Laurent, T","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.23185","last_updated":"2025-05-29T07:23:07Z","snapshot_observed_at":"2026-08-12T14:49:39.153279Z","submitted_at":"2025-05-29T07:23:07Z","title":"Improving the Effective Receptive Field of Message-Passing Neural Networks","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T12:57:31.614442Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2505.23185"},"observation_digest":"sha256:a854b9210481cb3457a8e4c0a5e9b8db8ae669a31b7f9aef8a6bc5f028e0bc52","observation_id":"0cb38f1a-626a-4f10-b0a5-b71934ebca52","resolution":{"observed_at":"2026-08-07T12:57:31.614442Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T11:54:07.947305Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.01231","last_updated":"2025-06-20T09:18:32Z","snapshot_observed_at":"2026-08-18T03:02:33.493586Z","submitted_at":"2025-06-02T01:03:12Z","title":"Towards Efficient Few-shot Graph Neural Architecture Search via Partitioning Gradient Contribution","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:54:07.947305Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2506.01231"},"observation_digest":"sha256:5f40cc9d6ea2daa8251b5fc116caf1db05f71c72eae635c5a19b9112c0970ad9","observation_id":"618cd6b7-3f21-4770-9678-e43fb9700829","resolution":{"observed_at":"2026-08-07T11:54:07.947305Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T10:18:55.903211Z","title":"and Laurent, T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.05971","last_updated":"2025-06-06T10:48:30Z","snapshot_observed_at":"2026-08-17T15:29:14.652475Z","submitted_at":"2025-06-06T10:48:30Z","title":"On Measuring Long-Range Interactions in Graph Neural Networks","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T10:18:55.903211Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2506.05971"},"observation_digest":"sha256:9f1f42dad5eb934eb64035de949c7a5a82ebb9b97ac7a18b24b3bfcaa70fab72","observation_id":"c333df4b-56dc-4c35-9a69-a52e2298d3a1","resolution":{"observed_at":"2026-08-07T10:18:55.903211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-15T19:33:23.126717Z","title":"Residual gated graph convnets","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.16428","last_updated":"2025-06-19T16:07:11Z","snapshot_observed_at":"2026-08-18T00:05:58.466351Z","submitted_at":"2025-06-19T16:07:11Z","title":"EFormer: An Effective Edge-based Transformer for Vehicle Routing Problems","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T19:33:23.126717Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2506.16428"},"observation_digest":"sha256:2d9580db4420386aef6b57fed959cf1ab2c9ec59e671f46169f732f1b11d1358","observation_id":"91bebf9f-7e67-40e2-b7c2-ea28c35230a2","resolution":{"observed_at":"2026-08-15T19:33:23.126717Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-06T19:08:28.171038Z","title":"Residual gated graph convnets,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.06538","last_updated":"2025-07-09T04:42:18Z","snapshot_observed_at":"2026-08-16T04:09:54.994514Z","submitted_at":"2025-07-09T04:42:18Z","title":"Few-shot Learning on AMS Circuits and Its Application to Parasitic Capacitance Prediction","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T19:08:28.171038Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2507.06538"},"observation_digest":"sha256:719d1cdf3df2cfa30daf371c142f9358eb7fa351efcacc772dd6ef556ec30ea4","observation_id":"aacc6892-2845-49af-ad96-e9aa4717a3a2","resolution":{"observed_at":"2026-08-06T19:08:28.171038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-06T16:19:28.707306Z","title":"Bresson and T","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.13954","last_updated":"2025-07-18T14:21:10Z","snapshot_observed_at":"2026-08-10T03:11:19.387576Z","submitted_at":"2025-07-18T14:21:10Z","title":"Robust Anomaly Detection with Graph Neural Networks using Controllability","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T16:19:28.707306Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2507.13954"},"observation_digest":"sha256:8f63b73b72196f591d079b4fd5aad30e80cc9e1cbd15943d9051e935d0879493","observation_id":"4e89d3d5-aaf8-4264-ad64-79166fed9d9b","resolution":{"observed_at":"2026-08-06T16:19:28.707306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-06T15:43:39.918665Z","title":"Residual gated graph convnets,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.15195","last_updated":"2025-07-22T02:51:41Z","snapshot_observed_at":"2026-08-09T01:08:11.983319Z","submitted_at":"2025-07-21T02:45:55Z","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:39.918665Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2507.15195"},"observation_digest":"sha256:c093fadda2b465032add4ff38b947fb69281c068da0e4d526f3aefacc7d3eaa9","observation_id":"4d567ec1-df01-48d8-9ccc-4da735b3ae45","resolution":{"observed_at":"2026-08-06T15:43:39.918665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-05T23:39:46.034720Z","title":"Residual Gated Graph ConvNets","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.05070","last_updated":"2025-08-07T06:44:01Z","snapshot_observed_at":"2026-08-13T10:50:13.738897Z","submitted_at":"2025-08-07T06:44:01Z","title":"TANGO: Graph Neural Dynamics via Learned Energy and Tangential Flows","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:46.034720Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2508.05070"},"observation_digest":"sha256:397fdab4367c7f885fc1027ef94cc28590a76db926121544a1898c9a85de2d1e","observation_id":"f4b577b2-6d0d-474e-a981-f5a929137ae8","resolution":{"observed_at":"2026-08-05T23:39:46.034720Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-04T23:55:58.150188Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.06289","last_updated":"2025-09-08T02:23:51Z","snapshot_observed_at":"2026-08-09T01:07:40.974422Z","submitted_at":"2025-09-08T02:23:51Z","title":"A Spatio-Temporal Graph Neural Networks Approach for Predicting Silent Data Corruption inducing Circuit-Level Faults","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T23:55:58.150188Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2509.06289"},"observation_digest":"sha256:17f00accc63a24ba4bf8a5ebeb54cf92c8cc77153581ecfa90d1ef74d07302e9","observation_id":"0e823930-874f-4795-94bc-ce5b1813fcf9","resolution":{"observed_at":"2026-08-04T23:55:58.150188Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2509.24886","last_updated":"2026-04-16T13:48:06Z","snapshot_observed_at":"2026-08-14T22:31:38.192942Z","submitted_at":"2025-09-29T14:59:46Z","title":"Adaptive Canonicalization with Application to Invariant Anisotropic Geometric Networks","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-18T12:45:28.458804Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2509.24886"},"observation_digest":"sha256:72549678cbbba2561509df9b40264e5c320ef52cc008ca4b95e9602b46e16742","observation_id":"ef8354b3-e2bb-42b6-a2c4-d123547a87cd","resolution":{"observed_at":"2026-05-18T12:46:23.286508Z","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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2601.01123","last_updated":"2026-05-17T16:57:28Z","snapshot_observed_at":"2026-08-13T12:47:08.793489Z","submitted_at":"2026-01-03T08:51:38Z","title":"Learning from Historical Activations in Graph Neural Networks","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-21T17:14:52.859473Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2601.01123"},"observation_digest":"sha256:c1f13c89d2f2e8162833ffb9eb47cb7265f3c366b5485555d86466238ae135cd","observation_id":"ed0407ea-bd77-4956-8240-1afee79ebc7d","resolution":{"observed_at":"2026-05-21T17:15:25.390984Z","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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2604.02899","last_updated":"2026-04-03T09:14:39Z","snapshot_observed_at":"2026-08-03T17:05:55.935192Z","submitted_at":"2026-04-03T09:14:39Z","title":"Extracting Money Laundering Transactions from Quasi-Temporal Graph Representation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-13T20:52:59.566447Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2604.02899"},"observation_digest":"sha256:b4ca9c74d75637d4372d56870fee508be815f60698c1a7392be7c3bd0991d7eb","observation_id":"5474bdfe-e307-4f83-89e7-a07be42c4768","resolution":{"observed_at":"2026-05-13T20:53:15.015915Z","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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2604.06336","last_updated":"2026-08-11T04:37:16Z","snapshot_observed_at":"2026-08-14T23:09:22.178882Z","submitted_at":"2026-04-07T18:16:02Z","title":"BiScale-GTR: Fragment-Aware Graph Transformers for Multi-Scale Molecular Representation Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T18:50:46.135600Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2604.06336"},"observation_digest":"sha256:cbc292d346bca3da125779548986396037520c763339ad289bf29425d9288114","observation_id":"2f9d3d1d-b942-4d9b-8b80-3ec640099ddf","resolution":{"observed_at":"2026-05-10T23:50:54.370601Z","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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2604.08810","last_updated":"2026-04-09T22:59:27Z","snapshot_observed_at":"2026-08-15T20:08:01.699095Z","submitted_at":"2026-04-09T22:59:27Z","title":"R2G: A Multi-View Circuit Graph Benchmark Suite from RTL to GDSII","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T17:01:41.339487Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2604.08810"},"observation_digest":"sha256:9e0c03928558b50d48eb9eb5d45f67c556fb7bda3d7c0e4f1311e3035c9249b0","observation_id":"7b386171-588f-4118-9e99-08b1bc3290eb","resolution":{"observed_at":"2026-05-11T07:41:01.270285Z","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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2604.08980","last_updated":"2026-04-10T05:35:21Z","snapshot_observed_at":"2026-08-12T15:13:59.515041Z","submitted_at":"2026-04-10T05:35:21Z","title":"Neighbourhood Transformer: Switchable Attention for Monophily-Aware Graph Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T18:00:47.753649Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2604.08980"},"observation_digest":"sha256:53cd57e82e8fc6b78187b29841604e5399eb0aea1337efa2538d7ea4616dd96e","observation_id":"e1514368-dcc3-4583-84e0-02dffcc8a740","resolution":{"observed_at":"2026-05-11T05:40:58.470538Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2604.17324","last_updated":"2026-06-07T04:11:52Z","snapshot_observed_at":"2026-08-14T05:52:51.194943Z","submitted_at":"2026-04-19T08:33:48Z","title":"Capacity-Controlled Global Attention for Graph Transformers","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T06:27:24.557866Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2604.17324"},"observation_digest":"sha256:8d8cdcb7ce419f2be6531b64ba13b5614c5a2f16ee71af0472327f90f7273d0e","observation_id":"42e2348b-c340-4446-9372-c299a34d1af4","resolution":{"observed_at":"2026-05-10T06:31:30.764782Z","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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2604.19028","last_updated":"2026-04-21T03:23:34Z","snapshot_observed_at":"2026-08-14T17:32:00.083714Z","submitted_at":"2026-04-21T03:23:34Z","title":"Learning Posterior Predictive Distributions for Node Classification from Synthetic Graph Priors","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-05-10T03:50:44.626261Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2604.19028"},"observation_digest":"sha256:9145e1378973f37f4fff8494616fe2e0d750bc00c1730d297d47312951566af9","observation_id":"d245fff9-ebdf-400f-b381-acc8e539cc1f","resolution":{"observed_at":"2026-05-11T12:21:04.875605Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"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":3,"source":"pdf_text","source_observed_at":"2026-05-07T06:27:36.438779Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2604.27786"},"observation_digest":"sha256:2b6770694de47bbeda8139e6afb5e9627063d70b68e00668b3c4d5ec7b678453","observation_id":"6b57f4e3-e3bc-4ae2-ae97-a9057fe56c49","resolution":{"observed_at":"2026-05-12T10:21:30.251640Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2605.01336","last_updated":"2026-05-02T09:17:53Z","snapshot_observed_at":"2026-08-17T03:01:16.749411Z","submitted_at":"2026-05-02T09:17:53Z","title":"A Multi-View Media Profiling Suite: Resources, Evaluation, and Analysis","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-09T15:22:45.263415Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2605.01336"},"observation_digest":"sha256:ea8e50df91a7a114aa069e56b52c6b383b2c821d7298d60e7183e81895328a28","observation_id":"7c196366-cc2c-4d51-8390-a8141545c005","resolution":{"observed_at":"2026-05-11T16:41:15.333337Z","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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2605.05689","last_updated":"2026-05-07T05:29:57Z","snapshot_observed_at":"2026-07-06T23:18:17.333660Z","submitted_at":"2026-05-07T05:29:57Z","title":"GCCM: Enhancing Generative Graph Prediction via Contrastive Consistency Model","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-08T11:46:42.010486Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2605.05689"},"observation_digest":"sha256:8e73391ce1db3f2400ec555ce23c0b2e1f51c70aee386b09f75a209abba02157","observation_id":"d21c0073-b736-4a42-a7ae-92ac7b6abe45","resolution":{"observed_at":"2026-05-11T19:31:08.963860Z","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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2605.06467","last_updated":"2026-05-07T15:55:24Z","snapshot_observed_at":"2026-07-06T23:18:55.724335Z","submitted_at":"2026-05-07T15:55:24Z","title":"No Triangulation Without Representation: Generalization in Topological Deep Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-08T12:37:30.458352Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2605.06467"},"observation_digest":"sha256:810af36fe70ecc3f241571c65db1c964eae0b2a6fe18bacd4af0011282dce20f","observation_id":"cd60123c-e9a8-45c5-8615-8cf89448bdf2","resolution":{"observed_at":"2026-05-11T19:06:11.105732Z","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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2605.06588","last_updated":"2026-05-07T17:16:54Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T17:16:54Z","title":"Towards Metric-Faithful Neural Graph Matching","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-08T12:16:49.816847Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2605.06588"},"observation_digest":"sha256:602366c628e02cfc555f67cba48a595d815b9cbb86f12370cf67b08ab78e0888","observation_id":"d8c27550-bedd-4b5d-8f25-c3a83aba0902","resolution":{"observed_at":"2026-05-11T19:21:07.195557Z","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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2605.07113","last_updated":"2026-05-08T01:41:40Z","snapshot_observed_at":"2026-08-16T13:35:03.384619Z","submitted_at":"2026-05-08T01:41:40Z","title":"Solving Max-Cut to Global Optimality via Feasibility-Preserving Graph Neural Networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-11T00:55:32.471978Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2605.07113"},"observation_digest":"sha256:8d9582447fac8c2a6a65c7094033262e7fdb53405d5374e9746c2de9b9695853","observation_id":"66ae9d40-eccc-482a-80b3-8491625af365","resolution":{"observed_at":"2026-05-11T05:00:55.663513Z","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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2605.07527","last_updated":"2026-05-30T07:31:00Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:57:22Z","title":"Why Self-Inconsistency Arises in GNN Explanations and How to Exploit It","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-11T02:14:02.401190Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2605.07527"},"observation_digest":"sha256:9ae8f1b46df47526486a427650cb0bf9b38c2cd8c2b3013a7e030dbe9439ba4f","observation_id":"f8de969f-4f9f-4e42-88b1-f8e17dcc082d","resolution":{"observed_at":"2026-05-11T03:50:55.248974Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2605.07527","last_updated":"2026-05-30T07:31:00Z","snapshot_observed_at":"2026-07-06T23:19:51.414344Z","submitted_at":"2026-05-08T09:57:22Z","title":"Why Self-Inconsistency Arises in GNN Explanations and How to Exploit It","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-30T23:14:31.835825Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2605.07527"},"observation_digest":"sha256:ae2619234693c69805adb330fc72dafcffdfda8e61250316ec3d66951cf36a68","observation_id":"a0edb909-d447-4394-9e03-07dcd4347ec0","resolution":{"observed_at":"2026-06-30T23:15:07.890292Z","resolver_source":"local_arxiv","status":"malformed_identifier"},"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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2605.20618","last_updated":"2026-05-20T02:07:10Z","snapshot_observed_at":"2026-08-14T22:40:55.723553Z","submitted_at":"2026-05-20T02:07:10Z","title":"COAgents: Multi-Agent Framework to Learn and Navigate Routing Problems Search Space","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-21T05:25:44.647620Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2605.20618"},"observation_digest":"sha256:b4ce57720ae7899b5990f85f4f7840936f78dc74494b5fbc44683d5bab54039d","observation_id":"16220316-c165-49a9-9904-f259fa84b8bb","resolution":{"observed_at":"2026-05-21T05:29:39.182434Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2605.23446","last_updated":"2026-05-22T10:01:28Z","snapshot_observed_at":"2026-08-13T07:36:03.224251Z","submitted_at":"2026-05-22T10:01:28Z","title":"Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-25T04:45:41.043520Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2605.23446"},"observation_digest":"sha256:a03b28afaa757ce20323f23308a43928c8538ed53412d66ec1e8b1868bb0edde","observation_id":"96bfa441-97e4-426a-85ca-0747e94f5be9","resolution":{"observed_at":"2026-05-25T04:46:37.339431Z","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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2605.23708","last_updated":"2026-05-22T14:55:09Z","snapshot_observed_at":"2026-08-18T14:10:43.798815Z","submitted_at":"2026-05-22T14:55:09Z","title":"Learning Dynamic Stability Landscapes in Synchronization Networks","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-05-25T05:04:16.957305Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2605.23708"},"observation_digest":"sha256:628961df9b77e1523efb29b5557d7b5d2d54afd2ae3dcab8154529de9fd97ff5","observation_id":"a673b508-0a38-41d2-8cb3-cda684bbce78","resolution":{"observed_at":"2026-05-25T05:05:20.779419Z","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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2605.29346","last_updated":"2026-05-28T04:37:24Z","snapshot_observed_at":"2026-08-13T00:10:59.648484Z","submitted_at":"2026-05-28T04:37:24Z","title":"Understanding and Reducing Metadata-Driven Host Overheads in Sampling-Based GNN Training","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T05:59:41.958293Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2605.29346"},"observation_digest":"sha256:77064854507a462d87b38bf10a86afd2315c80d0217d844fff49cccb8ab75ed1","observation_id":"230120bb-109d-42d0-a442-986f0175cec1","resolution":{"observed_at":"2026-06-29T06:03:08.464226Z","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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2606.03068","last_updated":"2026-06-02T02:57:13Z","snapshot_observed_at":"2026-08-14T00:37:43.114749Z","submitted_at":"2026-06-02T02:57:13Z","title":"Learn When and Where to Connect: Adaptive Virtual Nodes for Dynamic Message Passing on Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T11:14:14.178933Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2606.03068"},"observation_digest":"sha256:f3ef640457b068b8d592bdfa24936dbdfc9e0f1a3897ba35a555e460d75a8fab","observation_id":"f8545d53-a471-433b-9f57-b124c2399abd","resolution":{"observed_at":"2026-06-28T11:22:03.000965Z","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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2606.03923","last_updated":"2026-06-02T17:14:28Z","snapshot_observed_at":"2026-08-08T22:44:24.817542Z","submitted_at":"2026-06-02T17:14:28Z","title":"Contrastive Neural Algorithmic Reasoning for Graph Coloring","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T11:18:49.300810Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2606.03923"},"observation_digest":"sha256:7a131c74c95efb40688c15eec925e9f37525bbd586848389460687eb64da0cd8","observation_id":"01663338-d8b0-430d-8ae2-0ffa816fc1d5","resolution":{"observed_at":"2026-07-02T02:06:26.453225Z","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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2606.04647","last_updated":"2026-06-03T09:15:46Z","snapshot_observed_at":"2026-08-16T05:56:31.563489Z","submitted_at":"2026-06-03T09:15:46Z","title":"ALINC: Active Learning for Inductive Node Classification via Graph Sampling","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T07:08:45.831294Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2606.04647"},"observation_digest":"sha256:c7e6c60f33c513d7a85e217862efee73e3c150630533910bf0f6699b0d828667","observation_id":"cbeeebc8-9599-4af6-ab1d-d3b9f8f391de","resolution":{"observed_at":"2026-07-02T07:06:44.357860Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2606.06364","last_updated":"2026-06-04T16:33:15Z","snapshot_observed_at":"2026-08-16T17:08:50.490532Z","submitted_at":"2026-06-04T16:33:15Z","title":"End-to-End Subgraph Detection with GraphDETR","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T02:54:47.401548Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2606.06364"},"observation_digest":"sha256:0c3014f679f17ccfe2e40cea36256b09bede25c82c7ff16848626b36640dd90e","observation_id":"f62bf90e-7cba-495f-9b9a-7efaef867e08","resolution":{"observed_at":"2026-07-02T11:46:56.098257Z","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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2606.22429","last_updated":"2026-06-21T10:40:33Z","snapshot_observed_at":"2026-08-07T18:47:13.612767Z","submitted_at":"2026-06-21T10:40:33Z","title":"Enhancing LLMs for Graph Tasks via Graph-aware LoRA Generation","version":1},"reference_index":152,"source":"arxiv_source","source_observed_at":"2026-06-26T10:59:25.867813Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2606.22429"},"observation_digest":"sha256:0a3f21149aa64ba896b28bde1a89c45996716e44480bf05a66c76cdf17f2dc56","observation_id":"daafe01e-a68a-449b-8d03-9569477114c6","resolution":{"observed_at":"2026-06-26T11:09:23.769815Z","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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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":"1711.07553","doi":"10.48550/arxiv.1711.07553","metadata_source":"pith","pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Residual Gated Graph ConvNets","venue":"cs.LG","work_id":"88e9cbb3-5e47-44fc-b1f0-f8bf82b9e07c","year":2017},"citing_paper":{"arxiv_id":"2607.01553","last_updated":"2026-07-02T00:20:58Z","snapshot_observed_at":"2026-08-15T19:26:27.147119Z","submitted_at":"2026-07-02T00:20:58Z","title":"X-LogSMask: Expand Transformer for Graph-Structured Data","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-03T01:00:18.263578Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2607.01553"},"observation_digest":"sha256:936bb731631dded631184f4b3b7c342830ab259eeac71f4dde2d6b4d17ca36e9","observation_id":"09d22e79-f9ad-45c7-a71b-470e990267a0","resolution":{"observed_at":"2026-07-03T01:07:29.725857Z","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-06-02T00:56:28.790107+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:28.790107+00:00","source":"openalex_status_cache"},{"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-07-12T07:49:39.894643Z","title":"arXiv preprint arXiv:1711.07553 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02671","last_updated":"2026-07-02T18:05:23Z","snapshot_observed_at":"2026-08-13T13:07:29.218216Z","submitted_at":"2026-07-02T18:05:23Z","title":"Benign Overfitting Does Not Occur in Diffusion Models","version":1},"reference_index":139,"source":"arxiv_source","source_observed_at":"2026-07-12T07:49:39.894643Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2607.02671"},"observation_digest":"sha256:b09a6e5cd909206a6b07c8b1e250a81d38be4c508ba093b930bf4554365637e7","observation_id":"38ca0a40-ff68-44fb-9042-5a41771bd2b5","resolution":{"observed_at":"2026-07-12T07:49:39.894643Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-02T03:50:44.362087Z","title":"Residual gated graph convnets,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.13763","last_updated":"2026-07-17T14:27:46Z","snapshot_observed_at":"2026-08-14T21:59:26.698920Z","submitted_at":"2026-07-15T12:22:36Z","title":"MxGPS: Multiplex Graph Transformers for a Power Grid Foundation Model","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T03:50:44.362087Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2607.13763"},"observation_digest":"sha256:4a50be18a0bbc191d39502591ed558b2cca5bac191a04192d12c2c166716632c","observation_id":"e2675178-34b0-4dc9-9c7e-8633a54d89db","resolution":{"observed_at":"2026-08-02T03:50:44.362087Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-01T12:56:38.531562Z","title":"arXiv preprint arXiv:1711.07553 , eprint =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19270","last_updated":"2026-07-21T16:41:59Z","snapshot_observed_at":"2026-08-09T14:25:05.228501Z","submitted_at":"2026-07-21T16:41:59Z","title":"GUIDED Network-Agnostic Feature Initialization for Spatial Transferability in GNN-based Models","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T12:56:38.531562Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2607.19270"},"observation_digest":"sha256:b3416e14e38dbe2e5dce5bed7aa51ac1e07bf9dbadc2752fcdfb1f7d3d4b385a","observation_id":"ab4f379b-f3fc-4565-a690-c8dcc25dca81","resolution":{"observed_at":"2026-08-01T12:56:38.531562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-01T03:16:39.641135Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.25169","last_updated":"2026-07-28T00:46:34Z","snapshot_observed_at":"2026-08-17T02:41:17.419972Z","submitted_at":"2026-07-28T00:46:34Z","title":"CondPSE: A Polynomial-Filtered Structural Encoder with Conditional Modulation for Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T03:16:39.641135Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2607.25169"},"observation_digest":"sha256:d76f0c98a1b85713a80aabfd441e19d7cbc53a07d3497f402199103b683aabb7","observation_id":"d9ae5dce-d2dc-4009-b03d-24e46a0577d1","resolution":{"observed_at":"2026-08-01T03:16:39.641135Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-03T15:56:12.953752Z","title":"Residual gated graph convnets.arXiv preprint arXiv:1711.07553, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.28989","last_updated":"2026-07-31T03:33:35Z","snapshot_observed_at":"2026-08-14T13:04:02.754556Z","submitted_at":"2026-07-31T03:33:35Z","title":"SILVA Networks as Structured Implicit Layers and Vector Attractors via Dynamic Interaction Fields","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-03T15:56:12.953752Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2607.28989"},"observation_digest":"sha256:2f01ec48fa8f0f049cf2cd22de6544e16bdceb8472c06b039f211093331e10a3","observation_id":"ec74cf3f-dd88-45c9-af58-a8ea1a05dcf7","resolution":{"observed_at":"2026-08-03T15:56:12.953752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1711.07553/citation-record","integrity":"/paper/1711.07553/integrity","json":"/paper/1711.07553/citation-record.json","paper":"/paper/1711.07553"},"outbound":[],"paper":{"arxiv_id":"1711.07553","last_updated":"2018-04-24T08:19:32Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T20:11:44.023605Z","submitted_at":"2017-11-20T21:28:40Z","title":"Residual Gated Graph ConvNets"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 57 inbound Pith citation observations for arXiv:1711.07553."}