{"as_of":"2026-08-19T09:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:45fd5cd56778c67ee901280745602002a48c0a34a8e74623c2530af76f56dbc9","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-24T08:44:23.340180Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-01T06:10:26.634933Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-01T09:45:40.658923Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"cited_work":{"arxiv_id":"2305.09958","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.09958","snapshot_observed_at":"2026-07-01T09:45:40.658923Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","venue":"cs.LG","work_id":"892e3e0e-a4ab-4dd7-a899-7adf22206fa2","year":2023},"citing_paper":{"arxiv_id":"2606.32016","last_updated":"2026-06-30T17:47:39Z","snapshot_observed_at":"2026-08-14T08:13:56.378815Z","submitted_at":"2026-06-30T17:47:39Z","title":"FedLAB: Traceable Semantic Codebooks for Federated Multimodal Graph Foundation Learning","version":1},"reference_index":123,"source":"arxiv_source","source_observed_at":"2026-07-01T06:10:26.634933Z"},"links":{"cited_paper":"/paper/2305.09958","citing_paper":"/paper/2606.32016"},"observation_digest":"sha256:b5b8b1ece31531d758c93bc18770eca156eb970245a992b49cc2b444d10c79ed","observation_id":"0a61fcb1-a327-4ae6-9da5-4a8979ac8bd7","resolution":{"observed_at":"2026-07-01T09:45:40.660564Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2305.09958/citation-record","integrity":"/paper/2305.09958/integrity","json":"/paper/2305.09958/citation-record.json","paper":"/paper/2305.09958"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Semi-supervised classifica- tion with graph convolutional networks","venue":null,"work_id":"b03f60cc-ca02-4f38-aa63-0fad387ae07d","year":2017},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:225d245aa6ebabef3c61f200161af578a63f375f2d3d63f6619a1ce299957ab8","observation_id":"1fda8f56-0037-4691-b693-e07e171c61c4","resolution":{"observed_at":"2026-05-24T08:46:06.141300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":"479350dd-8d02-4aec-98b1-a699184b14e0","year":2017},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:23c56d5802c1992edebc95db7e0b3eef22da5f74290ac4dbbf4142f36a3c8a50","observation_id":"2e5c47e6-7f09-48bf-a78d-2e9aec3e14bf","resolution":{"observed_at":"2026-05-24T08:46:06.137908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.01057","last_updated":"2023-06-03T00:47:06Z","snapshot_observed_at":"2026-08-16T17:09:40.224236Z","submitted_at":"2022-04-03T11:54:22Z","title":"A Survey on Machine Learning Solutions for Graph Pattern Extraction","version":3},"cited_work":{"arxiv_id":"2204.01057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2204.01057","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Learning-based approaches for graph problems: a survey","venue":null,"work_id":"f87e1623-57b1-4c1a-bc77-0209020105ac","year":2022},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"cited_paper":"/paper/2204.01057","citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:cf082be2a973f7e134c7c30f9780d38531c3e3178b3d6c68dd6282665a70f740","observation_id":"cbf8e8ae-c954-4f5f-a65f-72d0577c2556","resolution":{"observed_at":"2026-05-24T08:46:05.586310Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.02767","last_updated":"2022-08-02T15:56:51Z","snapshot_observed_at":"2026-08-16T17:02:19.565721Z","submitted_at":"2022-05-05T16:44:36Z","title":"Spiking Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":"2205.02767","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.02767","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Spiking graph convolutional networks","venue":null,"work_id":"6571b87f-a532-4e32-a49c-4f31316a8f50","year":2022},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"cited_paper":"/paper/2205.02767","citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:b2b85ffe1c803c1b7646bc6715e80211705de4f8b1f0d83c42212f5017dc53f8","observation_id":"78a4fd89-bdb9-408c-a5c0-1714b9929ac7","resolution":{"observed_at":"2026-05-24T08:46:05.576777Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fusing global domain information and local semantic information to classify financial documents","venue":null,"work_id":"b20a88c4-6201-4feb-909b-bc10657771a2","year":2020},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:863119ebb908f9eba8b08cff52c542f94a08746f70e9c6fe6edabdfc3235ef6d","observation_id":"86efec72-cc49-4dac-b08d-0a0a35a7cf4f","resolution":{"observed_at":"2026-05-24T08:46:06.133514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Approximate graph propagation","venue":null,"work_id":"768955eb-a679-4718-bec5-7b5967a2dd46","year":2021},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:8ae922ce58a3544fc656ae73e008f0ef93fe39283b4e6869f52b483df610974b","observation_id":"c4c7159d-dde3-4395-8839-3b53a762bf14","resolution":{"observed_at":"2026-05-24T08:46:06.130934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Scalable graph neural networks via bidirectional propagation","venue":null,"work_id":"1f07769d-a850-4574-8b6e-c7c99f3b27f2","year":2020},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:9bf476b8c683a579768935f08e2461b93a3c5cf2f34da9e1ac20ef3b7811fc2e","observation_id":"9008b097-b683-45a4-9d6a-da603c6d9faf","resolution":{"observed_at":"2026-05-24T08:46:06.127709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10903","last_updated":"2018-02-04T19:13:29Z","snapshot_observed_at":"2026-08-13T22:35:40.714745Z","submitted_at":"2017-10-30T12:41:12Z","title":"Graph Attention Networks","version":3},"cited_work":{"arxiv_id":"1710.10903","doi":"10.48550/arxiv.1710.10903","metadata_source":"pith","pith_arxiv_id":"1710.10903","snapshot_observed_at":"2026-07-11T01:47:47.523783Z","title":"Graph Attention Networks","venue":"stat.ML","work_id":"7dd5bb04-b448-4f32-9719-5fc799641fd9","year":2017},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:82ca9f775a04745989717a1509319d8b7178719dd01e9d25b76f6b9387b66844","observation_id":"fbf45bd4-6124-4a59-8fc3-e4200ca355d6","resolution":{"observed_at":"2026-05-24T08:46:05.581982Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Predict then propagate: Graph neural networks meet personal- ized pagerank","venue":null,"work_id":"ea9dcc2d-8614-40a1-adc1-fda10462d05e","year":2018},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:3b7987d24e4f5ccee4dfaf6af93ff2c952601ddaac2bd67fda5e411a96bf0e48","observation_id":"2bcc8963-5fe5-4f5e-8387-2a0758cd5405","resolution":{"observed_at":"2026-05-24T08:46:06.124805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Beyond homophily in graph neural networks: Current limitations and effective designs","venue":null,"work_id":"915c139d-1732-4796-92fe-fa13800e692a","year":2020},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:cec13bdd17b1b2cf504b5321af6a2270710a050045dd395e73d12f6f31758445","observation_id":"0644eefa-eb65-47de-9b16-8afe27ae3d2f","resolution":{"observed_at":"2026-05-24T08:46:06.121375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing","venue":null,"work_id":"a9dd700e-96ae-4b4c-9081-11732a20f1bd","year":2019},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:faeb3597c446da82b36b6bd24ff769dfba6ed6c47acef1aae5bb94f7906cec7c","observation_id":"aa2bb647-699f-41b2-aa49-5ed486194bb1","resolution":{"observed_at":"2026-05-24T08:46:06.118488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Geom-gcn: Geometric graph convolutional networks","venue":null,"work_id":"76364c26-bf4d-4cc6-bd99-fdc7375d521c","year":2020},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:b1e1c2edb7caf7f3a939615287fb3e104432b10eb70f03c117d209023503bf60","observation_id":"3128da36-7694-4d41-8dab-7c4271fa8595","resolution":{"observed_at":"2026-05-24T08:46:06.004580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Graph pointer neural networks","venue":null,"work_id":"42cdf5c8-919d-4e75-90bd-a9a63eaf8973","year":2022},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:571c0a8c36aa6503176ae019c0432171823b0c5e015e17e32c37f6be8f20fd4c","observation_id":"6776ae60-a44e-4174-9c60-7fa42c6974b9","resolution":{"observed_at":"2026-05-24T08:46:06.115288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Non-local graph neural networks","venue":null,"work_id":"9273017a-7918-4ed4-8d6e-b17b24b9bc5a","year":2021},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:b29e47dd076507a238c934799e4818eb925f5a72411a27a15415f8a361c3aef5","observation_id":"72dcd47b-6a69-43d1-9f8d-5589927e47cb","resolution":{"observed_at":"2026-05-24T08:46:06.112729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Universal graph convolutional networks","venue":null,"work_id":"e7911cdf-9b9d-464c-9dc7-fc40093ee3db","year":2021},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:6f32c7b6d528fb773d9976126a39c66b1804aa07c8401d656847c251c98ce9f9","observation_id":"5be7506e-15e2-4b6b-9268-5e7bf8c33ae8","resolution":{"observed_at":"2026-05-24T08:46:06.109780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Finding global homophily in graph neural networks when meeting heterophily","venue":null,"work_id":"12275f98-8169-4b55-823e-598a0d027451","year":2022},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:bd00ad05a45c3eaa53cde6713d1ff4ca0e3166abf54ed690020e4d5d11f07c0f","observation_id":"e2d1797c-0d94-4578-a664-0ef5e7595686","resolution":{"observed_at":"2026-05-24T08:46:06.144486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Large scale learning on non- homophilous graphs: New benchmarks and strong simple methods","venue":null,"work_id":"526ad8e0-e795-4da9-bf87-57472319a429","year":2021},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:3d6110e40644779d0321f35d9e43a9c69a39dcedf2869531d82af8240f1792e6","observation_id":"4f0c1710-624b-4a4a-8958-7e33a49dac76","resolution":{"observed_at":"2026-05-24T08:46:06.106333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Breaking the limit of graph neural networks by improving the assortativity of graphs with local mixing patterns","venue":null,"work_id":"a1dbddfa-16ff-48c9-8c90-893ab90fc3e1","year":2021},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:596e1c22f2ed58fa3fa0649fac6e3ded0893fd3eee727a49044eabe31fe19988","observation_id":"040202a7-d89d-453e-964e-84d941651e86","resolution":{"observed_at":"2026-05-24T08:46:06.102797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Simrank: a measure of structural- context similarity","venue":null,"work_id":"cc563475-4424-4728-86a5-490d514ceb83","year":2002},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:d87b033311f440f40b2eaa0b8f31ef488257a472e335cda7b9ad72ed13d59bfa","observation_id":"69ec7ecc-dbfc-4716-af08-766758e7df08","resolution":{"observed_at":"2026-05-24T08:46:06.097949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cast: a correlation-based adaptive spectral clustering algorithm on multi-scale data","venue":null,"work_id":"531defee-8a00-45e1-bf31-dc95810fd3d4","year":2020},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:b6f6b11d2753940207d7c5ec41728682fd926d985e2b8d82b849c29cc1a54cdd","observation_id":"475776d3-b5a5-4c8b-9abc-512ef5f3ea7e","resolution":{"observed_at":"2026-05-24T08:46:06.094141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.06462","last_updated":"2022-11-28T16:08:41Z","snapshot_observed_at":"2026-08-16T18:46:00.589607Z","submitted_at":"2021-02-12T11:52:34Z","title":"Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networks","version":8},"cited_work":{"arxiv_id":"2102.06462","doi":"10.48550/arxiv.2102.06462","metadata_source":"arxiv_reference","pith_arxiv_id":"2102.06462","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks","venue":"arXiv (Cornell University)","work_id":"838c4711-d405-469b-bf3e-83e94a018af3","year":2021},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"cited_paper":"/paper/2102.06462","citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:3a86e00e23bb4671a1a523e7493396f15737ebb5891cf2883c450f291d6fe5be","observation_id":"a765188a-2ced-40dd-bc56-2ed2fabae5d1","resolution":{"observed_at":"2026-05-24T08:46:05.596618Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Graph Neural Networks Beyond Compromise Between Attribute and Topology","venue":null,"work_id":"b2b8e15e-a667-4e7e-9ff5-949baee84198","year":2022},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:7643b8fe0581052d5d9d63fe2e9e8da14db8d02a7524baeb3b3a57abee39a847","observation_id":"7b9f4f64-87f1-4eab-83da-eb9a7b41fdaf","resolution":{"observed_at":"2026-05-24T08:46:06.091436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Exact single-source simrank computation on large graphs","venue":null,"work_id":"2aa7b713-0490-45b6-9fcd-bed97df52a46","year":2020},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:8112231cd90055fdd3fef5af9223448afd30242b6702d65edcf4bd6165a310f1","observation_id":"4ed27430-c32f-4a82-a4da-9e14de4f0baa","resolution":{"observed_at":"2026-05-24T08:46:06.088144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Representation learning on graphs with jumping knowledge networks","venue":null,"work_id":"6f4dae38-0e94-403b-9191-5f7631955288","year":2018},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:138e3ea0188c939b5a0723beee4ed62d00f23762279424ce1a9f0981740c2081","observation_id":"28d8605b-bd21-4ffa-960e-e31a7201b5b9","resolution":{"observed_at":"2026-05-24T08:46:06.085037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient top-k simrank-based simi- larity join","venue":null,"work_id":"4743fac1-ca02-4d31-aac2-b17d66f5e989","year":2014},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:597a09fb2c1bd1b5e8c8133c702b2517e065ef77cd84b2f5275367b422b4f3f8","observation_id":"d3887145-a93c-4213-8161-b3c818f1c765","resolution":{"observed_at":"2026-05-24T08:46:06.081762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient simrank track- ing in dynamic graphs","venue":null,"work_id":"13036cca-483c-42b3-a0be-5b69ed2ac0e3","year":2018},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:8638d6f88824b1cda97007dfc2734618c3409b15cba81ff7a51af435601eca2a","observation_id":"c4a96a89-b119-4e33-b8d6-4e348fecbf5d","resolution":{"observed_at":"2026-05-24T08:46:06.078695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.06144","last_updated":"2023-04-30T11:29:34Z","snapshot_observed_at":"2026-08-16T16:39:36.610569Z","submitted_at":"2022-08-12T07:26:05Z","title":"GSim: A Graph Neural Network based Relevance Measure for Heterogeneous Graphs","version":2},"cited_work":{"arxiv_id":"2208.06144","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2208.06144","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gsim: A graph neural network based rele- vance measure for heterogeneous graphs","venue":null,"work_id":"628f7d63-37e6-43f2-b1fe-72b2d6240a52","year":2022},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"cited_paper":"/paper/2208.06144","citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:b98e6945017cca83bf546fc469ffe52df4b969bf919a13842ddf293214cd1455","observation_id":"8af38ed1-6694-4c7e-bb3d-22dd54eeaf49","resolution":{"observed_at":"2026-05-24T08:46:05.590987Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04015","last_updated":"2023-04-08T14:02:31Z","snapshot_observed_at":"2026-08-16T15:41:51.698067Z","submitted_at":"2023-04-08T14:02:31Z","title":"Massively Parallel Single-Source SimRanks in $o(\\log n)$ Rounds","version":1},"cited_work":{"arxiv_id":"2304.04015","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2304.04015","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Massively parallel single- source simranks in o(logn) rounds","venue":null,"work_id":"34a29a09-0bd9-4dbf-b010-dfebe7b99ce7","year":2023},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"cited_paper":"/paper/2304.04015","citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:a41adc40b77e5735ecffa088115718d9145abd70ee91dcdfa3667db5ef431de8","observation_id":"921a143c-2717-41ef-a74e-d9ae1ec0963a","resolution":{"observed_at":"2026-05-24T08:46:05.571391Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cluster-gcn: An efficient algorithm for training deep and large graph convolutional networks","venue":null,"work_id":"ebd644ab-73a9-4142-891c-adf74615ae7e","year":2019},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:8c1ec478042ec749015bcfe8c992b9c4b50abcd6eac3acac60c5738d49ca7b52","observation_id":"f80d1b10-79a4-4d86-9fa1-1dfbc359bd5a","resolution":{"observed_at":"2026-05-24T08:46:06.075826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Adaptive universal generalized pagerank graph neural network","venue":null,"work_id":"11894436-c380-4cde-bf5c-7a526a53a4f6","year":null},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:fc4b4be4de2364c766ecee4eae618ad829204ddcb75a4035f53a08b5850ba6c7","observation_id":"3e402296-9402-457b-b8a1-ad96ab16d335","resolution":{"observed_at":"2026-05-24T08:46:06.072870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Available: https://openreview.net/forum? id=n6jl7fLxrP","venue":null,"work_id":"3c6cce2f-6cae-46d7-a08d-dcc0677ba0d3","year":null},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:d2e4b8a214052049208e1870589c55e7543d5d15c7942cdc7d20db20938c0bb3","observation_id":"51362c75-9eaf-403f-a012-c19340bab537","resolution":{"observed_at":"2026-05-24T08:46:06.069786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dif- fusion Improves Graph Learning","venue":null,"work_id":"6e02ab81-e14c-4087-acf3-b7219bf0931f","year":2019},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:9f8ae3e8687e5585e653d97ba05dc2027c9c787c809df2b5c17f034e1e1388b7","observation_id":"f9bd65e2-2686-4e08-8b89-748e3e4e2fd8","resolution":{"observed_at":"2026-05-24T08:46:06.066694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Scaling graph neural networks with approximate pagerank","venue":null,"work_id":"86859725-9765-4ed2-b990-7023df6eb86d","year":2020},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:afa8b080ef3e494d84e46e70ec6a90d8a1d7186c671652521d6ade3a955d6e49","observation_id":"831a43c9-33af-4e1a-aaaf-9197277141e8","resolution":{"observed_at":"2026-05-24T08:46:06.063484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Do transformers really perform badly for graph representation?","venue":null,"work_id":"d83628b0-c736-41c7-b798-d354113a2866","year":2021},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:c6b58c9e537a6a05c218df25366459d9b0b9550f1c50770033ad3fd92b1436a7","observation_id":"1ac9aa6a-1b71-4dce-8671-5972c76b8c2a","resolution":{"observed_at":"2026-05-24T08:46:06.060808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Simple and deep graph convolutional networks","venue":null,"work_id":"072f8cf2-24b8-4f4c-95cc-708c56f3deb0","year":2020},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:942188e2c153271553d06a4f63f7d45aef6d2c37db2868708a2d547379d0217b","observation_id":"15ac2f20-e8aa-4c80-bb90-7336a45445ce","resolution":{"observed_at":"2026-05-24T08:46:06.008735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Simplifying graph convolutional networks","venue":null,"work_id":"8fb5d138-351d-4f6e-af3f-fc0eab26a01c","year":2019},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:06a401a61382fdbfcdc941e988664c35a58c4673b51c239d3f90db9463a2d448","observation_id":"0079e326-297d-4861-8181-beb665851298","resolution":{"observed_at":"2026-05-24T08:46:06.058099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gbk-gnn: Gated bi-kernel graph neural networks for mod- eling both homophily and heterophily","venue":null,"work_id":"af70e88e-ba04-47f9-8e33-5d957b938326","year":2022},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:0b6ecac8b65652b69122f824603ec2dca27b91abc0d4fb0fe58182856adb6373","observation_id":"95f4396f-19e4-4575-a6b5-89e57ca80963","resolution":{"observed_at":"2026-05-24T08:46:06.054943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Powerful graph convolutional networks with adaptive propagation mechanism for homophily and heterophily","venue":null,"work_id":"d77b18d7-37cc-4dc5-b3e5-00ad2556aec4","year":2022},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:cad8a14a7ca3a23901fa643c64ce95a81482e64017052269623f8749171d5021","observation_id":"0e6d40b5-84b4-4939-a2bb-872753350891","resolution":{"observed_at":"2026-05-24T08:46:06.051936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Similarity-navigated graph neural networks for node classification","venue":null,"work_id":"4c892daf-6ac5-4e38-aabd-e69c314f483c","year":2023},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:41514f1d5ffd553367f08bbd776f98c9cfb32258aa1d27e1e235ccdf4617fcc6","observation_id":"07b40a9e-472c-4943-be85-e72e0b6802ae","resolution":{"observed_at":"2026-05-24T08:46:06.048263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Predicting global label relationship matrix for graph neural networks under heterophily","venue":null,"work_id":"12611a01-f691-4ade-b9fa-56163fdb0d2e","year":2023},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:75f53073dc33454e812ff07aa94242fea1aa11aab65fb51c4719823edf7b27a6","observation_id":"3551c6fb-ddae-4a09-bbc8-73a4fbbbd65a","resolution":{"observed_at":"2026-05-24T08:46:06.045283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Scara: Scalable graph neural networks with feature-oriented optimization","venue":null,"work_id":"2de23310-e9db-4ba2-84b7-41be10f4cbe9","year":2022},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:36a25181d397ece5153ff0e399c369e6afcebbf6950526505d5b86e980e57d39","observation_id":"b8653f1b-3434-4aa3-9d12-c6a40dc58e75","resolution":{"observed_at":"2026-05-24T08:46:06.041299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"LD2: Scalable heterophilous graph neural network with decoupled em- bedding","venue":null,"work_id":"885a6176-32d3-4541-bdc5-3aa45f68ee8e","year":2023},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:02a7d67a537dbdd8791e08f58a3ce1fbc7e52a523ccbdafb953864277b673f9e","observation_id":"2c8ad3b2-1e6f-48c1-9582-54ee4d72d1a2","resolution":{"observed_at":"2026-05-24T08:46:06.011654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00778-023-00829-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Scalable decoupling graph neural networks with feature-oriented optimization","venue":"The VLDB Journal","work_id":"486ed16f-30d9-49bc-b2b6-605583ab55f3","year":2024},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:61bedc6196669091810b05d348784e6131741b7f01035d28eada816ff1747658","observation_id":"429987cd-1873-4a6c-a849-a20b54fcf960","resolution":{"observed_at":"2026-05-24T08:46:05.497459Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bird: Efficient approximation of bidirectional hidden personalized pagerank","venue":null,"work_id":"d1ce539c-bc5e-4d01-bb4f-228275ed2997","year":2024},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:0f0944a269046d74fd13ce0d60685eb52822339a90d24d1b43df2b63a1513b8b","observation_id":"6fa18203-3be0-4da1-81f6-03fe8b1d3fe0","resolution":{"observed_at":"2026-05-24T08:46:06.038704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Agenda: Robust personalized pager- anks in evolving graphs","venue":null,"work_id":"50110cb1-cfe3-4758-bb8e-2bfc70974d11","year":2021},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:4cbf152867973a04050b9dc24bb1abd7bf7bae405312cb5b18b96e96f1e9ba49","observation_id":"ada2281c-3f08-4885-aabd-9ceb9bd2993e","resolution":{"observed_at":"2026-05-24T08:46:06.035304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Topology- monitorable contrastive learning on dynamic graphs","venue":null,"work_id":"ed9d0e65-76c8-4005-8059-818dacb920de","year":2024},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:a96b1ae758357929ed3a4d46cb6142746423cda2e5df4cd8c9ca76112847d330","observation_id":"41b971c1-7db5-4263-8677-23ed5d779736","resolution":{"observed_at":"2026-05-24T08:46:06.032515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05641","last_updated":"2021-09-12T23:57:05Z","snapshot_observed_at":"2026-08-16T17:57:10.705002Z","submitted_at":"2021-09-12T23:57:05Z","title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","version":1},"cited_work":{"arxiv_id":"2109.05641","doi":"10.48550/arxiv.2109.05641","metadata_source":"arxiv_reference","pith_arxiv_id":"2109.05641","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Is heterophily a real nightmare for graph neural networks to do node classification?arXiv preprint arXiv:2109.05641","venue":"arXiv (Cornell University)","work_id":"d51f8592-bfc6-4d6a-9722-3453ff767385","year":2021},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"cited_paper":"/paper/2109.05641","citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:cda5c03c81daa0c84e6538b225b44f5f7ac56f6052df30d29925ad9bd237affe","observation_id":"4f4ab57c-a739-4046-adfb-216a0cb03f98","resolution":{"observed_at":"2026-05-24T08:46:05.567538Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Multi- scale attributed node embedding","venue":null,"work_id":"8d08c76d-a742-4e65-bc88-0f6c30520db9","year":2021},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:a566cb0d906f236965c34dccc4901499565f8f84da1827804720de0bbc29a880","observation_id":"7a874d70-85ee-451a-b6ef-bf69c31b4b68","resolution":{"observed_at":"2026-05-24T08:46:06.029362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Deep gaussian embedding of graphs: Unsupervised inductive learning via ranking","venue":null,"work_id":"91a97845-4325-4502-bb83-98b934afebfe","year":2018},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:e426905eb21d0d128dae3c955654e3980bbb5033c0a31ef667c8f3472f85fd31","observation_id":"ba6c690d-0c18-41ed-b93b-3edfac5061cb","resolution":{"observed_at":"2026-05-24T08:46:06.026899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Collective classification in network data","venue":null,"work_id":"3aae71be-038a-4d4b-9ee9-6693ff693acf","year":2008},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:0dd549caf0f59456704a94fedc5e797e531fed252d9072cbe3eef0ff66b5b4e8","observation_id":"8f4acaec-2be3-46ae-b1c6-6e349633205d","resolution":{"observed_at":"2026-05-24T08:46:06.015242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Query-driven active surveying for collective classification","venue":null,"work_id":"d293879a-ccb8-49d7-be05-d03d8abc7f90","year":2012},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:d5f77342e8c7efeb2e3aac16e00b453c6304b372ff056ff2c0c6568e2ad80677","observation_id":"93ec8bb5-286d-4105-ac5e-8040fd118755","resolution":{"observed_at":"2026-05-24T08:46:06.023808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the use of arxiv as a dataset","venue":null,"work_id":"e5ca5789-7db3-431a-8f42-c8351ba3bb84","year":2019},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:522962ed65ee16a1ca3d35fdc6f960d9a6f6dc5df5833cd71f1d2c128ae3f594","observation_id":"cdc21e7b-37a0-4b87-854b-959960e806e7","resolution":{"observed_at":"2026-05-24T08:46:06.020790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Snap datasets: Stanford large network dataset collection","venue":null,"work_id":"9b2c6129-694d-449a-ada5-1c6e23c05f80","year":2014},"citing_paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation","version":5},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-24T08:44:23.340180Z"},"links":{"citing_paper":"/paper/2305.09958"},"observation_digest":"sha256:e0fe5125397e81da41669a9a008e00835ffdb86e6701fa26b4f97954be755ec2","observation_id":"ef58ca05-3e5f-4794-8b2f-0af59f92c2f2","resolution":{"observed_at":"2026-05-24T08:46:06.017864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2305.09958","last_updated":"2026-04-12T14:15:20Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T08:17:54.488360Z","submitted_at":"2023-05-17T05:35:49Z","title":"SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":8,"verified_fuzzy":45},"total_outbound_references":53},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 1 inbound Pith citation observation for arXiv:2305.09958."}