{"as_of":"2026-08-07T23:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9c86a6b48050a64aeb7f8053b68548dca51cd0229bc54766ca817f6c306ed30a","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":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":29,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T19:25:40.748982Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T04:27:37.371060Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-07T19:25:40.748982Z","title":"arXiv preprint arXiv:2002.05287 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.10111","last_updated":"2025-02-14T12:17:24Z","snapshot_observed_at":"2026-08-07T22:06:27.680605Z","submitted_at":"2025-02-14T12:17:24Z","title":"COMBINEX: A Unified Counterfactual Explainer for Graph Neural Networks via Node Feature and Structural Perturbations","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T19:25:40.748982Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2502.10111"},"observation_digest":"sha256:ac49e3f5c323572aba0870db026900ee6f5a9d7652c02f0e6a8e8b7905402be1","observation_id":"cf41b542-a70e-4734-8730-aa6690ee28f6","resolution":{"observed_at":"2026-08-07T19:25:40.748982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-07T19:05:45.898813Z","title":"C.-C., Lei, Y., and Yang, B","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2502.10208","last_updated":"2025-02-14T15:03:43Z","snapshot_observed_at":"2026-08-07T18:55:09.770952Z","submitted_at":"2025-02-14T15:03:43Z","title":"SGS-GNN: A Supervised Graph Sparsification method for Graph Neural Networks","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T19:05:45.898813Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2502.10208"},"observation_digest":"sha256:a6e835c761ee51b598666bcb09f586dfa7c630b2f19a5183cb7e6b419d332704","observation_id":"3b324403-6865-41be-b645-64919925bdca","resolution":{"observed_at":"2026-08-07T19:05:45.898813Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-07T14:28:34.696094Z","title":"C.-C., Lei, Y ., and Yang, B","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:34.696094Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:e1d2b646d949fcf7565f334994c9fea8832345ce285be49b956dd7dc24965bf7","observation_id":"581ed39f-7ad8-445c-8a80-f54b69911c2e","resolution":{"observed_at":"2026-08-07T14:28:34.696094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-07T13:51:45.633953Z","title":"C.-C., Lei, Y., and Yang, B","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.20840","last_updated":"2026-05-29T10:47:05Z","snapshot_observed_at":"2026-08-07T13:43:41.541960Z","submitted_at":"2025-05-27T07:59:17Z","title":"Aggregation Buffer: Revisiting DropEdge with a New Parameter Block","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:45.633953Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2505.20840"},"observation_digest":"sha256:e1e67414b43c1bb973465a63c066a4b47bc5f9123826729cd5efd22876f8ff99","observation_id":"cd62a6aa-1925-4eae-a86e-118b185b0e22","resolution":{"observed_at":"2026-08-07T13:51:45.633953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-07T12:54:21.935535Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.23345","last_updated":"2025-06-15T04:04:46Z","snapshot_observed_at":"2026-08-07T12:45:32.756495Z","submitted_at":"2025-05-29T11:10:11Z","title":"Graph Positional Autoencoders as Self-supervised Learners","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T12:54:21.935535Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2505.23345"},"observation_digest":"sha256:bfdf0591202a3061b8325b7bb1c8498f7000ce32854ebb681f4de17a3e5b3d68","observation_id":"d7ed0f09-b999-4dab-9362-5cf47e715d90","resolution":{"observed_at":"2026-08-07T12:54:21.935535Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-07T11:24:01.187324Z","title":"Geom-gcn: Geometric graph convolutional networks.arXiv preprint arXiv:2002.05287, 2020","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.02842","last_updated":"2025-06-03T13:13:56Z","snapshot_observed_at":"2026-08-07T11:12:06.760452Z","submitted_at":"2025-06-03T13:13:56Z","title":"Sheaves Reloaded: A Directional Awakening","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T11:24:01.187324Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2506.02842"},"observation_digest":"sha256:8f83981266650a6b435d4fc1b83e50791e27a90111c589364949dc799097e259","observation_id":"ced7cb21-77fc-4bba-9fee-11cc63f313bf","resolution":{"observed_at":"2026-08-07T11:24:01.187324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-07T10:43:59.384379Z","title":"Geom-gcn: Geometric graph convolutional networks","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.04653","last_updated":"2025-06-05T05:49:12Z","snapshot_observed_at":"2026-08-07T10:34:14.373427Z","submitted_at":"2025-06-05T05:49:12Z","title":"The Oversmoothing Fallacy: A Misguided Narrative in GNN Research","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T10:43:59.384379Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2506.04653"},"observation_digest":"sha256:7c632258f7efc31bd183e530d7c8d3db970a9164843f26313ed7eda1c42f61ba","observation_id":"de28c197-f021-497d-b087-939cfd17db6f","resolution":{"observed_at":"2026-08-07T10:43:59.384379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-07T10:37:17.846436Z","title":"Geom-gcn: Geometric graph convolutional networks.arXiv preprint arXiv:2002.05287, 2020","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.04765","last_updated":"2025-06-05T08:48:46Z","snapshot_observed_at":"2026-08-07T10:30:48.555447Z","submitted_at":"2025-06-05T08:48:46Z","title":"OpenGT: A Comprehensive Benchmark For Graph Transformers","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:17.846436Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2506.04765"},"observation_digest":"sha256:f37e47bd5275bfbfcc336e87163f71d5d2dd3bc2b3a5e9f837fc27f4277f3907","observation_id":"a11b5338-59db-4175-8f88-2020bbbabb38","resolution":{"observed_at":"2026-08-07T10:37:17.846436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-07T01:07:34.759359Z","title":"Geom-gcn: Geometric graph convolutional networks","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.11869","last_updated":"2025-08-22T19:08:50Z","snapshot_observed_at":"2026-08-07T00:59:56.868062Z","submitted_at":"2025-06-13T15:19:28Z","title":"How do Probabilistic Graphical Models and Graph Neural Networks Look at Network Data?","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T01:07:34.759359Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2506.11869"},"observation_digest":"sha256:3ce5d3edef6fd959e8058415246773a87f0c7dde1dc34d9bb193b67194659211","observation_id":"a07b7555-13e3-45cc-af4d-05f3fc07a25d","resolution":{"observed_at":"2026-08-07T01:07:34.759359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-07T00:55:54.806901Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.12468","last_updated":"2025-06-17T03:17:11Z","snapshot_observed_at":"2026-08-07T00:46:40.868394Z","submitted_at":"2025-06-14T12:14:15Z","title":"Delving into Instance-Dependent Label Noise in Graph Data: A Comprehensive Study and Benchmark","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T00:55:54.806901Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2506.12468"},"observation_digest":"sha256:a541595ca483115b3a4a1f95cb9a92922e5753cac5a8682989f38388345151bf","observation_id":"27a1c442-8ba0-4d1a-9744-f231d07a928a","resolution":{"observed_at":"2026-08-07T00:55:54.806901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-06T23:12:03.113234Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.19282","last_updated":"2025-06-24T03:31:43Z","snapshot_observed_at":"2026-08-07T02:46:32.003410Z","submitted_at":"2025-06-24T03:31:43Z","title":"A Batch-Insensitive Dynamic GNN Approach to Address Temporal Discontinuity in Graph Streams","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T23:12:03.113234Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2506.19282"},"observation_digest":"sha256:70129631698b19a9ac26ec87e129fa18f67cb77dc6cd13b206a551f6bef73f19","observation_id":"08156981-c23e-4cab-9799-f5e1eece2a40","resolution":{"observed_at":"2026-08-06T23:12:03.113234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-06T20:42:58.731287Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.02078","last_updated":"2025-07-02T18:29:47Z","snapshot_observed_at":"2026-08-06T20:36:23.014436Z","submitted_at":"2025-07-02T18:29:47Z","title":"Enhancing Power Flow Estimation with Topology-Aware Gated Graph Neural Networks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T20:42:58.731287Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2507.02078"},"observation_digest":"sha256:bd8ff7a3263f2b4e4ece5833a9d4f41ed3c51debf3021c272d2f484872c06272","observation_id":"56ee54c7-f61a-4738-9d99-19bbd3aa6702","resolution":{"observed_at":"2026-08-06T20:42:58.731287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":"2002.05287","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-07-03T04:27:37.371060Z","title":"arXiv preprint arXiv:2002.05287 (2020)","venue":null,"work_id":"cbbb3cd6-6da6-4cd4-9de7-da08fc13622e","year":2002},"citing_paper":{"arxiv_id":"2507.05311","last_updated":"2026-05-22T09:31:03Z","snapshot_observed_at":"2026-08-03T00:47:40.108614Z","submitted_at":"2025-07-07T09:48:09Z","title":"PLACE: Prompt Learning for Attributed Community Search in Large Graphs","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-25T07:47:47.529586Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2507.05311"},"observation_digest":"sha256:db2644c10528079f60f8044c86c73b28bedb2d928753dbc84333c6da20e0bf4a","observation_id":"05bc02ed-5791-4cd1-98b8-d3982e109dbe","resolution":{"observed_at":"2026-05-25T07:50:29.432844Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-06T16:24:06.777009Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:06.777009Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:003e8ea6359d2d10d9b841b66a1f144a2adea61a65c752f0e8a47a32b8de3f3f","observation_id":"ae005426-ca29-46a6-85ea-f77c91843d52","resolution":{"observed_at":"2026-08-06T16:24:06.777009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-05T13:44:08.804616Z","title":"arXiv preprint arXiv:2002.05287 (2020)","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.00387","last_updated":"2025-08-30T06:53:36Z","snapshot_observed_at":"2026-08-05T13:43:56.438025Z","submitted_at":"2025-08-30T06:53:36Z","title":"Unifying Adversarial Perturbation for Graph Neural Networks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T13:44:08.804616Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2509.00387"},"observation_digest":"sha256:6f9b39b502c86033d82a53d9aefafc45e76681ab206181d04490a902236541f5","observation_id":"62768154-f16e-4841-80e7-623a2547b228","resolution":{"observed_at":"2026-08-05T13:44:08.804616Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-04T11:19:48.954103Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2510.05750","last_updated":"2026-07-17T11:17:45Z","snapshot_observed_at":"2026-08-06T11:13:48.215346Z","submitted_at":"2025-10-07T10:12:21Z","title":"Are Heterogeneous Graph Neural Networks Truly Effective for Node Classification? A Causal Perspective","version":2},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-04T11:19:48.954103Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2510.05750"},"observation_digest":"sha256:82b46dfa3a8cf20ad25b0e932e1f757aa26cca43d9bc6757218b67cea44f752a","observation_id":"7bd31b42-e575-409f-89f7-c9983e371e42","resolution":{"observed_at":"2026-08-04T11:19:48.954103Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-03T00:05:34.671939Z","title":"Geom-gcn: Geometric graph convolutional networks","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.11802","last_updated":"2026-05-29T13:06:09Z","snapshot_observed_at":"2026-08-03T00:05:09.905343Z","submitted_at":"2026-02-12T10:29:44Z","title":"Structural Bias Beyond Homophily: A Study of Fairness in Link Prediction","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T00:05:34.671939Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2602.11802"},"observation_digest":"sha256:74495c43d3e4c59b6e8e6de0c506dc5909f2700f14be6d8a2fb0065a3d57a5b3","observation_id":"d023920e-d8c6-467a-b036-c6efcb69fbac","resolution":{"observed_at":"2026-08-03T00:05:34.671939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":"2002.05287","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-07-03T04:27:37.371060Z","title":"arXiv preprint arXiv:2002.05287 (2020)","venue":null,"work_id":"cbbb3cd6-6da6-4cd4-9de7-da08fc13622e","year":2002},"citing_paper":{"arxiv_id":"2604.15699","last_updated":"2026-07-19T02:35:09Z","snapshot_observed_at":"2026-08-02T16:10:58.374407Z","submitted_at":"2026-04-17T04:58:25Z","title":"Frequency-Corrupt Based Graph Self-Supervised Learning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-10T08:32:08.154085Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2604.15699"},"observation_digest":"sha256:a34c4faa4aea4fdc81c8b5d5b6fc26ee1b53adfbcd6f4feb507628364c1ea2cf","observation_id":"e4115ee8-3e21-424c-bc1a-0f026ec29777","resolution":{"observed_at":"2026-05-10T08:32:52.059421Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-02T16:10:59.751880Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2604.15699","last_updated":"2026-07-19T02:35:09Z","snapshot_observed_at":"2026-08-02T16:10:58.374407Z","submitted_at":"2026-04-17T04:58:25Z","title":"Frequency-Corrupt Based Graph Self-Supervised Learning","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-02T16:10:59.751880Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2604.15699"},"observation_digest":"sha256:81408cf16a12d1657c4e1141a24fa39f3675a17d8d5a951cbd5d2ecf6756d912","observation_id":"f06672c1-a41a-4c32-870f-e33893bf8474","resolution":{"observed_at":"2026-08-02T16:10:59.751880Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":"2002.05287","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-07-03T04:27:37.371060Z","title":"arXiv preprint arXiv:2002.05287 (2020)","venue":null,"work_id":"cbbb3cd6-6da6-4cd4-9de7-da08fc13622e","year":2002},"citing_paper":{"arxiv_id":"2604.19186","last_updated":"2026-04-21T07:55:19Z","snapshot_observed_at":"2026-07-06T23:05:53.378585Z","submitted_at":"2026-04-21T07:55:19Z","title":"Inductive Subgraphs as Shortcuts: Causal Disentanglement for Heterophilic Graph Learning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-10T02:54:22.394142Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2604.19186"},"observation_digest":"sha256:a4aa051097df142b4deea6f4f9594ce0f1dd88096b75feb3c15b8a9ba9cce117","observation_id":"2635d07b-8a56-49c6-a88d-0687cdef07bc","resolution":{"observed_at":"2026-05-11T12:51:02.744366Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":"2002.05287","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-07-03T04:27:37.371060Z","title":"arXiv preprint arXiv:2002.05287 (2020)","venue":null,"work_id":"cbbb3cd6-6da6-4cd4-9de7-da08fc13622e","year":2002},"citing_paper":{"arxiv_id":"2605.09457","last_updated":"2026-05-10T10:15:40Z","snapshot_observed_at":"2026-07-06T23:21:35.327066Z","submitted_at":"2026-05-10T10:15:40Z","title":"RAwR: Role-Aware Rewiring via Approximate Equitable Partition","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-12T04:36:07.130356Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2605.09457"},"observation_digest":"sha256:900441ed654cf989f0117a53e1c48a939971278286b209744113efe69c838965","observation_id":"0f03c76a-7675-48e1-8f70-28214a09de25","resolution":{"observed_at":"2026-05-12T06:06:25.988165Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":"2002.05287","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-07-03T04:27:37.371060Z","title":"arXiv preprint arXiv:2002.05287 (2020)","venue":null,"work_id":"cbbb3cd6-6da6-4cd4-9de7-da08fc13622e","year":2002},"citing_paper":{"arxiv_id":"2605.19405","last_updated":"2026-06-20T03:20:00Z","snapshot_observed_at":"2026-08-02T12:22:38.707797Z","submitted_at":"2026-05-19T05:59:47Z","title":"A complete discussion on fully reconfigurable, digital, scalable, graph and sparsity-aware near-memory accelerator for graph neural networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-20T02:22:43.820890Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2605.19405"},"observation_digest":"sha256:a448ca973dd2375b7b2908d0bbee0a25856b5f6b08f62f04ff5c8a68eea5a9e7","observation_id":"71ad8517-faff-4d93-b940-46d669c11e35","resolution":{"observed_at":"2026-05-20T02:22:59.188355Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":"2002.05287","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-07-03T04:27:37.371060Z","title":"arXiv preprint arXiv:2002.05287 (2020)","venue":null,"work_id":"cbbb3cd6-6da6-4cd4-9de7-da08fc13622e","year":2002},"citing_paper":{"arxiv_id":"2605.19405","last_updated":"2026-06-20T03:20:00Z","snapshot_observed_at":"2026-08-02T12:22:38.707797Z","submitted_at":"2026-05-19T05:59:47Z","title":"A complete discussion on fully reconfigurable, digital, scalable, graph and sparsity-aware near-memory accelerator for graph neural networks","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-30T17:55:36.649039Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2605.19405"},"observation_digest":"sha256:c5c666fbdf919910166ea84dbfb8339469c9cd18ee95464af49b1555479a2ce6","observation_id":"a7591e97-043b-46dd-ace3-e7dd973dbf2e","resolution":{"observed_at":"2026-06-30T18:04:58.419675Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":"2002.05287","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-07-03T04:27:37.371060Z","title":"arXiv preprint arXiv:2002.05287 (2020)","venue":null,"work_id":"cbbb3cd6-6da6-4cd4-9de7-da08fc13622e","year":2002},"citing_paper":{"arxiv_id":"2605.20248","last_updated":"2026-05-18T06:47:41Z","snapshot_observed_at":"2026-07-06T23:30:53.900592Z","submitted_at":"2026-05-18T06:47:41Z","title":"Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-21T08:32:32.410473Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2605.20248"},"observation_digest":"sha256:f39523e196148a2eed5f93e1cd66342aaf80a49b93e492d437f135265abda336","observation_id":"8c99087a-4ab1-430c-ada9-b64da295cfb5","resolution":{"observed_at":"2026-05-21T08:34:05.438903Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":"2002.05287","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-07-03T04:27:37.371060Z","title":"arXiv preprint arXiv:2002.05287 (2020)","venue":null,"work_id":"cbbb3cd6-6da6-4cd4-9de7-da08fc13622e","year":2002},"citing_paper":{"arxiv_id":"2605.21247","last_updated":"2026-05-31T15:52:48Z","snapshot_observed_at":"2026-08-02T05:32:25.292328Z","submitted_at":"2026-05-20T14:36:52Z","title":"Graph Navier Stokes Networks","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-21T05:12:39.203165Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2605.21247"},"observation_digest":"sha256:a4ea571e8b8a50b127706e24ec5de620b0f1d4adf6c1ac1b338bc93d512c2866","observation_id":"a439cefe-6ab9-4e8c-a8b0-0fd9abcad89a","resolution":{"observed_at":"2026-05-21T05:13:58.233665Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":"2002.05287","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-07-03T04:27:37.371060Z","title":"arXiv preprint arXiv:2002.05287 (2020)","venue":null,"work_id":"cbbb3cd6-6da6-4cd4-9de7-da08fc13622e","year":2002},"citing_paper":{"arxiv_id":"2605.21247","last_updated":"2026-05-31T15:52:48Z","snapshot_observed_at":"2026-08-02T05:32:25.292328Z","submitted_at":"2026-05-20T14:36:52Z","title":"Graph Navier Stokes Networks","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-06-30T17:11:15.801586Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2605.21247"},"observation_digest":"sha256:c7eb909239548d2389c2cdeaddf0cf3f307b178596cb57a357727280a7181379","observation_id":"70504e1d-f42b-4c28-a736-4792e4c2bdb3","resolution":{"observed_at":"2026-06-30T17:14:56.859596Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":"2002.05287","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-07-03T04:27:37.371060Z","title":"arXiv preprint arXiv:2002.05287 (2020)","venue":null,"work_id":"cbbb3cd6-6da6-4cd4-9de7-da08fc13622e","year":2002},"citing_paper":{"arxiv_id":"2606.10284","last_updated":"2026-06-09T01:13:44Z","snapshot_observed_at":"2026-08-06T23:41:36.397111Z","submitted_at":"2026-06-09T01:13:44Z","title":"Revisiting Positive Samples in Graph Contrastive Learning: From the Perspective of Message Passing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T13:51:32.704225Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2606.10284"},"observation_digest":"sha256:d87c964d03505f042ccc070eb78dd39834d8ffd323d5ead789dc0a540bce7a21","observation_id":"bee752fe-6518-497f-8aaa-7d89e39cb9ba","resolution":{"observed_at":"2026-07-03T04:27:37.372495Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-02T03:41:00.237465Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.13837","last_updated":"2026-07-15T13:45:26Z","snapshot_observed_at":"2026-08-04T01:39:39.151520Z","submitted_at":"2026-07-15T13:45:26Z","title":"NodeImport: Imbalanced Node Classification with Node Importance Assessment","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-02T03:41:00.237465Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2607.13837"},"observation_digest":"sha256:13804ea351b74128f55f62c039858f72e731f4d3ad3762538951465118a1b7b9","observation_id":"48ff1c8c-ae13-4e16-a0c1-4b15a2a7af6c","resolution":{"observed_at":"2026-08-02T03:41:00.237465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-01T02:57:52.500897Z","title":"Geom-gcn: Geo- metric graph convolutional networks,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.25273","last_updated":"2026-07-28T04:20:34Z","snapshot_observed_at":"2026-08-05T10:36:26.620712Z","submitted_at":"2026-07-28T04:20:34Z","title":"HeAD-CP: Heterophily-Aware Diffused Conformal Prediction Sets for Graph Neural Networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T02:57:52.500897Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2607.25273"},"observation_digest":"sha256:56bd5b8d23334e39724a853447d417b9e8df255d18bb6a65bc6b64cd565d57e2","observation_id":"11f25e31-eaef-4780-af24-10cb7e058621","resolution":{"observed_at":"2026-08-01T02:57:52.500897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2002.05287/citation-record","integrity":"/paper/2002.05287/integrity","json":"/paper/2002.05287/citation-record.json","paper":"/paper/2002.05287"},"outbound":[],"paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T18:28:55.768202Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 29 inbound Pith citation observations for arXiv:2002.05287."}