{"as_of":"2026-08-21T03:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:685fbf325c5e215e4b71eaad3bc6a9e1b27857c2db16f4f61dfadac8e29727ba","coverage":[{"denominator":102,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:16:13.994351Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2504.21206/citation-record","integrity":"/paper/2504.21206/integrity","json":"/paper/2504.21206/citation-record.json","paper":"/paper/2504.21206"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.470639Z","title":"Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.470639Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:f6d84f1aafe58621a39f70919ec14513ae9caed21ed5fb6442b1ad4ce3a38b23","observation_id":"d62351a2-0bcd-4207-aa43-410a169d8df6","resolution":{"observed_at":"2026-08-16T05:16:13.470639Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.476877Z","title":"Personalized subgraph federated learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.476877Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:a7f2aad293995620862cbda4f5796c7c921c56dc12b2fe24a4241b25c6eba678","observation_id":"f318936b-5805-451f-9d18-48c0489ee11e","resolution":{"observed_at":"2026-08-16T05:16:13.476877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00075","last_updated":"2017-07-07T01:31:36Z","snapshot_observed_at":"2026-08-18T22:23:56.302350Z","submitted_at":"2017-07-01T01:09:33Z","title":"Data Decisions and Theoretical Implications when Adversarially Learning Fair Representations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.00075","snapshot_observed_at":"2026-08-16T05:16:13.482101Z","title":"Data decisions and theoretical implications when adversarially learning fair representations","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.482101Z"},"links":{"cited_paper":"/paper/1707.00075","citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:a94305d0e9e2975fb6e5b747521967cea9fbabd54f48110904b3ca9417434190","observation_id":"cc1582fd-26f9-469c-840c-71fa2a7c7d36","resolution":{"observed_at":"2026-08-16T05:16:13.482101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.487601Z","title":"Node classification in social networks","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.487601Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:0198c380dabcfb31309414fc6e4039c1ba3e6c42ae0ab8590ee0ca54266dcbee","observation_id":"9f91e9ad-c4a6-434b-9650-56fa0d6be7f7","resolution":{"observed_at":"2026-08-16T05:16:13.487601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.492753Z","title":"Fast unfolding of communities in large networks","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.492753Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:ae982650774c1cdce00e9245e5475a36523f517dc9111f3ae6cd8c9225587e7c","observation_id":"b52c5b05-e966-4fa0-8c51-f3b62845bddb","resolution":{"observed_at":"2026-08-16T05:16:13.492753Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.497792Z","title":"Beyond low-frequency information in graph convolutional networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.497792Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:9a81b76ff8aace004a8868948dff07eec91c679d39b43f8a7cd7479379c3b09b","observation_id":"e665ca29-5752-4871-b36b-48755fde7997","resolution":{"observed_at":"2026-08-16T05:16:13.497792Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.503731Z","title":"Geometric deep learning: going beyond euclidean data","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.503731Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:14b49ac4806b99c927c2d153096eaf8ab1c5a9ed26cf1043e4f61d091e790f3b","observation_id":"6fc0c772-3ca8-4521-b31a-b695db337399","resolution":{"observed_at":"2026-08-16T05:16:13.503731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.03170","last_updated":"2021-05-07T11:27:23Z","snapshot_observed_at":"2026-08-17T22:33:38.866910Z","submitted_at":"2021-05-07T11:27:23Z","title":"FedGL: Federated Graph Learning Framework with Global Self-Supervision","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.03170","snapshot_observed_at":"2026-08-16T05:16:13.508953Z","title":"Fedgl: Federated graph learning framework with global self-supervision","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.508953Z"},"links":{"cited_paper":"/paper/2105.03170","citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:b5bcad63295168c91059c5073b51ee3656096b133126413a49cfc0ebf80007b3","observation_id":"9405afc9-0e20-4487-90d9-6eaeb04fa364","resolution":{"observed_at":"2026-08-16T05:16:13.508953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.514158Z","title":"Fede: Embedding knowledge graphs in federated setting","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.514158Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:47d7af2ad235cc6f061c65fc556993a6902eebdc64770fead95ae8e382261b95","observation_id":"5b7241f6-eb9d-46ba-8d8e-83b47ae5c677","resolution":{"observed_at":"2026-08-16T05:16:13.514158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.520854Z","title":"Iterative deep graph learning for graph neural networks: Better and robust node embeddings","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.520854Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:442cda3c40fff912917ba19acc5242d109187632ca7a75717f74f8fbf319f4a7","observation_id":"2dcf487e-ebe6-4fce-8ea8-03368e6b8c18","resolution":{"observed_at":"2026-08-16T05:16:13.520854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-08-14T06:24:06.038319Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-08-16T05:16:13.525752Z","title":"Adaptive universal generalized pagerank graph neural network","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.525752Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:02f9ab2eb9f8d13e4630d729b55994323ebad16ae8712e7b4c33f7e0cbedc92b","observation_id":"e877e200-fa5c-4402-8018-53bc04d8a08d","resolution":{"observed_at":"2026-08-16T05:16:13.525752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.530959Z","title":"Grapheditor: An efficient graph representation learning and unlearning approach","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.530959Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:47fe59af3616731875fb679af4e04f7cb482c0dbb6bb40ff88c03883879a83ad","observation_id":"3ceadb40-707d-4324-b5c0-dedfe2fc326c","resolution":{"observed_at":"2026-08-16T05:16:13.530959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.08570","last_updated":"2023-09-27T02:10:11Z","snapshot_observed_at":"2026-08-16T17:06:13.946842Z","submitted_at":"2022-04-18T21:41:07Z","title":"A Comprehensive Survey on Trustworthy Graph Neural Networks: Privacy, Robustness, Fairness, and Explainability","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.08570","snapshot_observed_at":"2026-08-16T05:16:13.536560Z","title":"A comprehensive survey on trustworthy graph neural networks: Privacy, robustness, fairness, and explainability","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.536560Z"},"links":{"cited_paper":"/paper/2204.08570","citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:dafdbe4a08f2ab620c37af6ba10532923e12fa16eb862ea1dce834a0b983295b","observation_id":"cc84ba6e-3d6d-4d99-8d31-1dd2237d68a2","resolution":{"observed_at":"2026-08-16T05:16:13.536560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.541778Z","title":"Benchmarking graph neural networks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.541778Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:8b48151e9d940f46ee8124d54f5fd5b5727bc02fd1226ff74417cc4cf41e973c","observation_id":"3609b4bc-2b88-4e7d-be20-3e9ff54a913b","resolution":{"observed_at":"2026-08-16T05:16:13.541778Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.547785Z","title":"Fairness through awareness","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.547785Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:1b3fd45d813c236418bfb63dc4fc4024883cc44444cf9a17ae92670a238837af","observation_id":"6a588db2-d0d1-4e19-93b5-d9e2f2300443","resolution":{"observed_at":"2026-08-16T05:16:13.547785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.552704Z","title":"Variational inference for graph convolutional networks in the absence of graph data and adversarial settings","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.552704Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:bc231c74306579cd99954b0e70a2bffe82e6a5203fc6a6ded975f8453f7bcfcc","observation_id":"d3e8468f-3e2b-433a-9485-98ab6c608952","resolution":{"observed_at":"2026-08-16T05:16:13.552704Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.558418Z","title":"Graph neural networks for social recommendation","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.558418Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:60560c46d7ccb3b6da31651fc238966d331985cb0e57c59c74afdf27cfaa3f18","observation_id":"b4c51565-d977-4903-8734-eca49f35d440","resolution":{"observed_at":"2026-08-16T05:16:13.558418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.563710Z","title":"Learning discrete structures for graph neural networks","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.563710Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:ab2c08cb98f3d732c3cfb8fbdd6fd2555abc7b87cfed77c08acc8a354003fa45","observation_id":"da3f2cb9-6410-4d37-b8de-a7c43ead4d00","resolution":{"observed_at":"2026-08-16T05:16:13.563710Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.568569Z","title":"Federated learning: A signal processing perspective","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.568569Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:1df00a79ee1b4019795017409ea20092c6a66bd1e892dac58d6ef9340a27c3bd","observation_id":"f847109a-1e7d-4482-8e7f-cba0235ceb0b","resolution":{"observed_at":"2026-08-16T05:16:13.568569Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.573414Z","title":"Diffusion improves graph learning","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.573414Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:5aadb866bc2abb28e9bd0c3e04868e4c7a193c771d9996319e2626bdfc63472a","observation_id":"8baa4750-05fe-40f1-acb3-05df86385c75","resolution":{"observed_at":"2026-08-16T05:16:13.573414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.579020Z","title":"Attribute inference attacks in online social networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.579020Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:186b2fd9c2e9c1d41c17894a4b71d97cc6395ebd7961c4119a3dc7b6f85ec119","observation_id":"b0e81dea-4101-4af2-be90-ff37988b3f7d","resolution":{"observed_at":"2026-08-16T05:16:13.579020Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.02743","last_updated":"2021-06-04T22:20:47Z","snapshot_observed_at":"2026-08-16T18:19:31.559761Z","submitted_at":"2021-06-04T22:20:47Z","title":"SpreadGNN: Serverless Multi-task Federated Learning for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.02743","snapshot_observed_at":"2026-08-16T05:16:13.583924Z","title":"Spreadgnn: Serverless multi-task federated learning for graph neural networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.583924Z"},"links":{"cited_paper":"/paper/2106.02743","citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:8e51c681dc93566868ceec0be3dd72a94788616c8cd12a9fcbc9c6a406f7b595","observation_id":"3ae66680-40fb-46f8-a005-ec2b6675bc3a","resolution":{"observed_at":"2026-08-16T05:16:13.583924Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.589195Z","title":"Ieee-cis fraud detection, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.589195Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:fcacda24a93bbf167d30d2fb191dfb6977875eb6716cac622dea183a48991797","observation_id":"59a632e4-662f-49a4-8afd-db026cc30ee2","resolution":{"observed_at":"2026-08-16T05:16:13.589195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.594248Z","title":"Semi-supervised learning with graph learning-convolutional networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.594248Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:13f144a54384fcc1e7686ee6d434150bad585132ce370c55e181d28c0f08cd81","observation_id":"f2666fca-5b91-4700-bf5b-6a0018065212","resolution":{"observed_at":"2026-08-16T05:16:13.594248Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.599064Z","title":"Graph structure learning for robust graph neural networks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.599064Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:f2e5aa09df47ae8a8092a58d9040db770d1ad7a7a2bbf7073c78fa97f97115a5","observation_id":"99469013-ced7-4e27-8848-c7315384bfa7","resolution":{"observed_at":"2026-08-16T05:16:13.599064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.604051Z","title":"Metis: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.604051Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:798c30aa83003b9dd80775c3760e91ca5fae6cdfb8260144817c6f415d461a82","observation_id":"63c46db0-cd12-416c-80e1-413859098955","resolution":{"observed_at":"2026-08-16T05:16:13.604051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.608766Z","title":"Differentiable graph module (dgm) for graph convolutional networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.608766Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:1de71bac34a5ee97135ed82dd846452beebfbf50602248cb08011da0d23103d5","observation_id":"ac9b2f3d-e5b7-4681-b273-3ac865a02385","resolution":{"observed_at":"2026-08-16T05:16:13.608766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.04879","last_updated":"2022-04-11T05:45:09Z","snapshot_observed_at":"2026-08-16T17:07:54.016269Z","submitted_at":"2022-04-11T05:45:09Z","title":"How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.04879","snapshot_observed_at":"2026-08-16T05:16:13.613581Z","title":"How to find your friendly neighborhood: Graph attention design with self-supervision","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.613581Z"},"links":{"cited_paper":"/paper/2204.04879","citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:d791dede061eee3844b9c426ffe8d573a88bb95c20cf8c316420a8cfb7abf515","observation_id":"b108c3e2-29a0-41b2-bddf-156972c54fea","resolution":{"observed_at":"2026-08-16T05:16:13.613581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-17T19:26:44.032537Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-16T05:16:13.619029Z","title":"Adam: A method for stochastic optimization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.619029Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:71ec0b864d913557d5d4f99010975b80140405dc3e8fecf5975564fb02163a5d","observation_id":"c36fafa2-57c2-4f38-9add-dd680df0a9ed","resolution":{"observed_at":"2026-08-16T05:16:13.619029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-17T10:49:36.026134Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-16T05:16:13.623920Z","title":"Semi-supervised classification with graph convolutional networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.623920Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:4f156b8b701496deb594f2fcdcfe86dedeb43a55becc3d93798469f88852d1c1","observation_id":"aec2a67d-81ae-4bad-ae24-e9d98a9a9350","resolution":{"observed_at":"2026-08-16T05:16:13.623920Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.629755Z","title":"Rethinking graph transformers with spectral attention","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.629755Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:2ba4e212752c0074c7d003efee8328caefabdb411cfe34f09ab49d3a5f2b8b69","observation_id":"b2c2a175-cf48-451c-a721-71b262d1c56b","resolution":{"observed_at":"2026-08-16T05:16:13.629755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:15.317923Z","title":"Federated learning over coupled graphs","venue":null,"work_id":"a703ce46-2ecd-44c7-a52f-53bd33622c8b","year":2023},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.634985Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:5d1c242ca9ebbb6bc10ed975088af34bd93627cf01507b47a078e62862a058c7","observation_id":"730ba1ae-5297-4d27-8e2f-d968696c1fa9","resolution":{"observed_at":"2026-08-16T05:16:15.323263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:15.299690Z","title":"Adaptive graph convolutional neural networks","venue":null,"work_id":"caa0aa4d-741c-42bf-a206-904e3b337f30","year":2018},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.639876Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:315b6e9cb2aabcb178799329bdcad0702bb990c6bff98adf07ffcecbb2abca61","observation_id":"4152bbef-7c74-49a6-89cf-14deac79e2b3","resolution":{"observed_at":"2026-08-16T05:16:15.305243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:15.278313Z","title":"Adaptive graph convolutional neural networks","venue":null,"work_id":"be42e72d-7d48-4f04-8c30-b19004f50ee1","year":2018},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.645132Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:87f0c3f88d9793322a9e4c8a016f13a1f26d1d51207af44043973516cf39e92f","observation_id":"3a74e2dc-940c-4783-ad14-282b12a87409","resolution":{"observed_at":"2026-08-16T05:16:15.285947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.649958Z","title":"Federated learning: Challenges, methods, and future directions","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.649958Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:d50ccc5e6ea0c73d006a86263f769ff00837de97d003e98515d534f36174384c","observation_id":"0ebc8875-5594-45c8-9562-e5e0bde27d72","resolution":{"observed_at":"2026-08-16T05:16:13.649958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:15.246357Z","title":"Finding global homophily in graph neural networks when meeting heterophily","venue":null,"work_id":"e106c04d-adaf-4315-baf2-509e1500424b","year":2022},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.654603Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:60720c7d8768ba64c08509f9919e891774bc46560e0d96c8af4c9b4ecadce685","observation_id":"d1e7eefd-7aa8-4ef6-baa0-77318276efd5","resolution":{"observed_at":"2026-08-16T05:16:15.251917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:15.229307Z","title":"Gslb: the graph structure learning benchmark","venue":null,"work_id":"d2d7970d-6e40-4e05-9b53-06854a8f83e7","year":2024},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.659152Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:b445018a018dab071ca8479bd10b4189147d844d83b12de1f4a75cc6661afc4d","observation_id":"62cf55ce-f7a6-4b42-adac-ea720f3468c4","resolution":{"observed_at":"2026-08-16T05:16:15.234922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:15.212477Z","title":"Towards deeper graph neural networks","venue":null,"work_id":"d0ead504-2f6d-4de6-aa8d-50263301edec","year":2020},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.664122Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:5e4e6c28056b6314278812d6f498fe98a60cf8ee974e984c5401e6276989ebb7","observation_id":"c9a23602-df46-4b0c-96c4-b0945fefc7b1","resolution":{"observed_at":"2026-08-16T05:16:15.218097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07256","last_updated":"2022-12-21T10:09:44Z","snapshot_observed_at":"2026-08-20T02:44:06.876118Z","submitted_at":"2022-02-15T09:05:35Z","title":"Federated Graph Neural Networks: Overview, Techniques and Challenges","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.07256","snapshot_observed_at":"2026-08-16T05:16:13.669071Z","title":"Federated graph neural networks: Overview, techniques and challenges","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.669071Z"},"links":{"cited_paper":"/paper/2202.07256","citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:166e36f74c2d938a47b0154f3fcef222979ad1e85b11994a536fda4b9bf857bf","observation_id":"f5207f3e-591c-4b4c-92bb-c3314a92f7a0","resolution":{"observed_at":"2026-08-16T05:16:13.669071Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:15.195053Z","title":"Federated graph neural networks: Overview, techniques, and challenges","venue":null,"work_id":"a9086f69-7964-4a7c-8344-bc3550467b3c","year":2024},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.674830Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:ba5ac3e4e7c3e5f4a40c85f8413d955b755fbb721df636f7a5f40483df51cd1a","observation_id":"1f86d57e-2b8d-48f4-9332-761698f6470a","resolution":{"observed_at":"2026-08-16T05:16:15.200509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:15.178260Z","title":"Towards unsupervised deep graph structure learning","venue":null,"work_id":"5fd0496e-d44f-4939-bec6-8edb0f5af5e7","year":2022},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.680054Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:6f94e8432172b0af3ebcc9a09276515f01e476111fabb99b568ebfca95ba8cd1","observation_id":"649eeb04-e754-45b2-b985-045e9fd22a74","resolution":{"observed_at":"2026-08-16T05:16:15.183931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:15.160245Z","title":"Beyond smoothing: Unsupervised graph representation learning with edge heterophily discriminating","venue":null,"work_id":"56f687a4-8e37-4204-a143-21219ac3dbea","year":2023},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.686414Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:07832da09b4845a82b2f0ff8c2a25d490c9e9a1d44a3cac845de718cd66e29f7","observation_id":"082a03e8-006f-4703-9a08-cfb17aa60905","resolution":{"observed_at":"2026-08-16T05:16:15.165516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:15.141753Z","title":"Egnn: Graph structure learning based on evolutionary computation helps more in graph neural networks","venue":null,"work_id":"f66773c8-b785-4305-bdea-9f4c5d68aa59","year":2023},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.691568Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:bb54f2293986aa2e0fd0ada60fac0d12767bf344d3bf93c0a6686e3290ad5d77","observation_id":"8715c8f6-fa72-4ff6-9c7b-c655d2915d27","resolution":{"observed_at":"2026-08-16T05:16:15.147250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.06750","last_updated":"2022-01-11T08:38:21Z","snapshot_observed_at":"2026-08-16T17:42:15.695830Z","submitted_at":"2021-11-12T14:55:57Z","title":"STFL: A Temporal-Spatial Federated Learning Framework for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.06750","snapshot_observed_at":"2026-08-16T05:16:13.696199Z","title":"Stfl: A temporal-spatial federated learning framework for graph neural networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.696199Z"},"links":{"cited_paper":"/paper/2111.06750","citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:2468ade2e6ebc12409d2db6665d25b9593d6f2ebe9bd6178b70286ecc4eaec2c","observation_id":"de435c30-61ba-4b68-92ad-4ea865ee078d","resolution":{"observed_at":"2026-08-16T05:16:13.696199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:15.123016Z","title":"Revisiting heterophily for graph neural networks","venue":null,"work_id":"eddaaeba-5403-49de-9225-de6d3fab1265","year":2022},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.701454Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:3918df6c115c4d66188f0fdc486246e08d1bf158d808338426286eb1920a373b","observation_id":"b50e93b8-5768-4c58-a127-778826983d11","resolution":{"observed_at":"2026-08-16T05:16:15.129532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:15.104998Z","title":"Learning to drop: Robust graph neural network via topological denoising","venue":null,"work_id":"ff02b193-5935-47a1-aa93-9c6978d2c3ef","year":2021},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.706395Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:7ded2344cdab0d8dfddffad68b0aca9924e3d04f5e2897b853bc67abdfe20057","observation_id":"86c6ec12-5b3c-458a-8ef2-31f5415e9b9f","resolution":{"observed_at":"2026-08-16T05:16:15.111416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:15.087728Z","title":"Learning disentangled representations for recommendation","venue":null,"work_id":"6684ef16-6014-47c9-b5b8-82bae8ffe5d1","year":2019},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.711515Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:74e4907abe5c49fae70f818bad2bfa3c34f187dead25357beaac420f0b5d3788","observation_id":"69e7c928-98c1-4da8-9a53-bec982b850f5","resolution":{"observed_at":"2026-08-16T05:16:15.093040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.06134","last_updated":"2023-07-21T05:02:21Z","snapshot_observed_at":"2026-08-17T11:47:23.309229Z","submitted_at":"2021-06-11T02:44:00Z","title":"Is Homophily a Necessity for Graph Neural Networks?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.06134","snapshot_observed_at":"2026-08-16T05:16:13.717271Z","title":"Is homophily a necessity for graph neural networks? arXiv preprint arXiv:2106.06134, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.717271Z"},"links":{"cited_paper":"/paper/2106.06134","citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:6ca33be520ce75216a34f12e61cb0b30075d39bd379eec62ecc26a2d8d6ac738","observation_id":"9f34ca23-21b5-497f-94d8-86ac03b735e6","resolution":{"observed_at":"2026-08-16T05:16:13.717271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.01323","last_updated":"2023-10-15T03:50:52Z","snapshot_observed_at":"2026-08-16T15:27:13.974345Z","submitted_at":"2023-06-02T07:46:20Z","title":"Demystifying Structural Disparity in Graph Neural Networks: Can One Size Fit All?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.01323","snapshot_observed_at":"2026-08-16T05:16:13.722501Z","title":"Demystifying structural disparity in graph neural networks: Can one size fit all? arXiv preprint arXiv:2306.01323, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.722501Z"},"links":{"cited_paper":"/paper/2306.01323","citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:b5a6cdd42e10fa783debbcba24bb3851dfda291c903de9b5d0a5a0527e9e323f","observation_id":"49e00170-cc7e-4122-9439-02a324b3c502","resolution":{"observed_at":"2026-08-16T05:16:13.722501Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.728549Z","title":"Communication-efficient learning of deep networks from decentralized data","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.728549Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:f61bc3ae76c66bdeff352cece1d403e39fb72c562b90cedd198b89994c061a48","observation_id":"63629d99-0ecc-40a0-bd83-e23abb8907ba","resolution":{"observed_at":"2026-08-16T05:16:13.728549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:15.057880Z","title":"Sgnn: A graph neural network based federated learning approach by hiding structure","venue":null,"work_id":"34a5c970-c653-4c85-b873-6e5ffbdd8d28","year":2019},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.734531Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:b6bba3a7527cf288130725ffc6c1b1a94c2918faf68940849b2bc4ebfd4004a2","observation_id":"d5253065-4cb4-441c-b07f-4497d492f3d9","resolution":{"observed_at":"2026-08-16T05:16:15.063601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:15.038533Z","title":"Query-driven active surveying for collective classification","venue":null,"work_id":"ffa55271-1074-4568-9265-e26ffbaf6b3f","year":2012},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.740181Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:e01e27c8476f422817f8ee1f1faf28a61785f5be461561b59eb9a8338e5a50a2","observation_id":"f7c281b8-ab24-4873-b9bc-7113b628f3aa","resolution":{"observed_at":"2026-08-16T05:16:15.044347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:15.017793Z","title":"Cosine similarity metric learning for face verification","venue":null,"work_id":"f8eb8de1-eb2d-4abe-98f5-125760e695f5","year":2010},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.746108Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:863c48684cce60253cca71a115c65ed155295749feeec83d52c22363d6db0fd1","observation_id":"eb4fa7b7-7ea9-4887-9703-0a4b73ec6f0b","resolution":{"observed_at":"2026-08-16T05:16:15.026580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:15.000409Z","title":"Netprobe: a fast and scalable system for fraud detection in online auction networks","venue":null,"work_id":"6ef352e7-195e-451e-adf1-819df18f5253","year":2007},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.751500Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:527febc3e2be90404e0cb0efd904d8eadc441445a34520b7eea8470b7489c1d3","observation_id":"13f3c21d-8e61-4a4d-9cce-6a74e68cbc54","resolution":{"observed_at":"2026-08-16T05:16:15.005471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.982247Z","title":"Differentially private federated knowledge graphs embedding","venue":null,"work_id":"ef9a98db-c44d-4a7c-a116-49103be5e75a","year":2021},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.756289Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:1bde743e3276dfafdc7bcd3476a63c7b3107f9200a2cbc46e7ad0df04e9900b4","observation_id":"6fd70857-d770-4444-b7c4-348395433cc9","resolution":{"observed_at":"2026-08-16T05:16:14.988729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.761281Z","title":"Multi-scale attributed node embedding","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.761281Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:5083619dc7b6ed5b5f78f706401515648e9acc0dfe1a7ebc8ba5037d7d33d1a8","observation_id":"26af0bcf-ddf4-4fdb-a9c5-ad1883fb407c","resolution":{"observed_at":"2026-08-16T05:16:13.761281Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.767702Z","title":"The graph neural network model","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.767702Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:625331624e62080f5cdc154f974a4aa5e75a42ff51647c70593b1550f984940f","observation_id":"1d298d79-b119-4690-8b13-07bb3684e150","resolution":{"observed_at":"2026-08-16T05:16:13.767702Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.773014Z","title":"Collective classification in network data","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.773014Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:d319a0f41204fecbbee2e6f74ddde81e56c70ae01cbf24591d3faea131a85e79","observation_id":"a77a762b-8fae-4222-904f-b302f5f5b687","resolution":{"observed_at":"2026-08-16T05:16:13.773014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.924985Z","title":"Graph neural networks in particle physics","venue":null,"work_id":"a3bab7fb-a105-4b06-b9bb-db2e776316d0","year":2020},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.778214Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:3d9e24ad0d74e4ac0e6c78fec3dc5a3facdc8a3b45719f94ead3263ccd9a41ea","observation_id":"ec2abb04-1853-49a1-b69f-8f609432945a","resolution":{"observed_at":"2026-08-16T05:16:14.930994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.906551Z","title":"Graph structure learning with variational information bottleneck","venue":null,"work_id":"ff005bf4-68ec-46d3-9970-c7535a5ce660","year":2022},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.783032Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:67984b6fcfd07a62f191d4d552ea069b06e156c11559a1580e8a421679eb7701","observation_id":"983f4930-aa17-45bc-b2bb-4b9dcb7aa7e8","resolution":{"observed_at":"2026-08-16T05:16:14.912064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.886522Z","title":"Breaking the limit of graph neural networks by improving the assortativity of graphs with local mixing patterns","venue":null,"work_id":"c5aad1b9-d4fc-452b-a30a-2a1097c8e2c4","year":2021},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.788080Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:ebdf219aa1ca33ce2b3af9068f7866e454aadd182191e07e8ac28de7ca77f1da","observation_id":"3743365c-ebfb-49b0-9fb8-6105b3b10f1e","resolution":{"observed_at":"2026-08-16T05:16:14.891929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.869812Z","title":"Federated learning on non-iid graphs via structural knowledge sharing","venue":null,"work_id":"3147e1aa-881b-452a-a076-8bf9348ca541","year":2023},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.793374Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:cd837181ff0be1b877e6351e870f67df8a0b7adb373f8635ee884e720cac4ae3","observation_id":"d73dc56d-79c5-46cd-ac4c-ceb91fd6c4b5","resolution":{"observed_at":"2026-08-16T05:16:14.875083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.853800Z","title":"Social influence analysis in large-scale networks","venue":null,"work_id":"e329a6dd-51b7-4e9c-ad4e-843c27f9b1d6","year":2009},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.798399Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:d751def6b4f8717a27ebaa5c0eb4744b876570a0d01160d9a285e628077de3ab","observation_id":"8aeb098b-58aa-4b8d-9d5a-042b58d20c98","resolution":{"observed_at":"2026-08-16T05:16:14.858940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.835891Z","title":"Social influence analysis in large-scale networks","venue":null,"work_id":"c5b32632-bfb3-443b-b94d-ebbee61d6532","year":2009},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.803400Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:92d0433aa869af5d65c07c0c96df4721542fcb8a46a97c22aff1ae99f391f2d3","observation_id":"80d46e46-560c-4b6a-8f0d-d78a5df6a70a","resolution":{"observed_at":"2026-08-16T05:16:14.841100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.808133Z","title":"Graph attention networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.808133Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:57fc9d8a59ce91610a579c79d2d07edfa5fa6452f5818b9334aa73fe75ce3449","observation_id":"57b76378-3eba-44c5-8814-dffa632bcd34","resolution":{"observed_at":"2026-08-16T05:16:13.808133Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.808201Z","title":"Confederated learning: Federated learning with decentralized edge servers","venue":null,"work_id":"5133f4fa-3a7d-44a4-9df2-52a823341b8b","year":2023},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.813717Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:b2d77032e3e8edf60b327c5f19b50f5ac9fa9e65e777d4c8acc6755abcd10c8f","observation_id":"423b1ca8-a64f-470d-b374-09553344f7aa","resolution":{"observed_at":"2026-08-16T05:16:14.813783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.791529Z","title":"Am-gcn: Adaptive multi-channel graph convolutional networks","venue":null,"work_id":"6856485c-37e3-4dae-ad6c-fb91fa5497ea","year":2020},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.818838Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:fdcc533e9e4f697312097242aa36b8ddd9e7ca9dfe2e9d614a46c70e03483683","observation_id":"05b8e346-225f-4016-8da9-7c2e024e462a","resolution":{"observed_at":"2026-08-16T05:16:14.796650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.774981Z","title":"Nodeformer: A scalable graph structure learning transformer for node classification","venue":null,"work_id":"fa645ddc-424b-4a92-8b62-b86bcb4a9c5d","year":2022},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.823767Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:e223d2157ae8555f7e0f3b09106679de07cdc4ef27efbfa5caa5512d11051d8a","observation_id":"697c3bd1-b8f1-49f7-b637-508f16404ab7","resolution":{"observed_at":"2026-08-16T05:16:14.780316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.829168Z","title":"Session-based recommendation with graph neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.829168Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:fc2fc729703d77bb905319b05c72b83c1ad5190d07aa07e6b9761a25f0c44c90","observation_id":"2355882e-ad2f-4745-b4cc-51dc3f0a8f0d","resolution":{"observed_at":"2026-08-16T05:16:13.829168Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.745653Z","title":"Graph information bottleneck","venue":null,"work_id":"32def157-6906-4b38-bafd-2aac277f7bed","year":2020},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.834233Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:0d2245de04ad4b4c4f292cd5ab66a43f608cbb59b7a0ed2292c345b50e8892e8","observation_id":"75d93774-b092-4c4c-94ad-601ed516b7b2","resolution":{"observed_at":"2026-08-16T05:16:14.750629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.730341Z","title":"A comprehensive survey on graph neural networks","venue":null,"work_id":"6cfecb7f-1f34-42a8-b12a-a4f5754bc679","year":2020},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.839680Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:6f1bcc4908242e0e322b2743494b9bf180d7bde5a1667e9fc68bf8e58a53bd17","observation_id":"eab25bc4-1928-4b62-9306-277b498717fc","resolution":{"observed_at":"2026-08-16T05:16:14.735204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.844733Z","title":"Graph learning: A survey","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.844733Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:4326b42fd275f72c399995fe112c5dd5373c43ea3eeaf78255a44631c2412339","observation_id":"6b03066f-1e63-43d9-9c84-ce3dd03ad5ff","resolution":{"observed_at":"2026-08-16T05:16:13.844733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.849874Z","title":"Graph neural networks in node classification: survey and evaluation","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.849874Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:c15c12ed802221bf3eccff4060a970d9188a21a467fe25282ab9b3e182b27f3f","observation_id":"87485a30-b5f6-4786-981c-1d34ac2ff780","resolution":{"observed_at":"2026-08-16T05:16:13.849874Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.694307Z","title":"Federated graph classification over non-iid graphs","venue":null,"work_id":"0de55d49-266f-42f4-b576-f046704e0793","year":2021},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.858166Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:18564316021a6469d494e1fb2775562d2c8f78a68720f1744830406ed309dfad","observation_id":"f64f4174-7711-4166-b8e3-bf456626307a","resolution":{"observed_at":"2026-08-16T05:16:14.699743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.677336Z","title":"Federated node classification over graphs with latent link-type heterogeneity","venue":null,"work_id":"c6538bdc-e79a-4cd4-9b43-09b2af1868f8","year":2023},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.863787Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:5296c13130824de2fa2d916740044a215a04edde48f929f6c3e5420300234005","observation_id":"a47baa0d-4129-4f88-8a69-12e4ff430d4b","resolution":{"observed_at":"2026-08-16T05:16:14.682912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-08-13T05:06:48.606308Z","submitted_at":"2018-10-01T17:11:31Z","title":"How Powerful are Graph Neural Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00826","snapshot_observed_at":"2026-08-16T05:16:13.868896Z","title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826, 2018 a","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.868896Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:05d53233ecaf6b5c6db13f74a374eb7d2541dd7ae5f220a4411b936143d42d25","observation_id":"bac83556-4089-4fd2-a2b3-17ac92db07c8","resolution":{"observed_at":"2026-08-16T05:16:13.868896Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.660070Z","title":"Representation learning on graphs with jumping knowledge networks","venue":null,"work_id":"e01238c3-43ba-498b-be9e-f0f639be9ec0","year":2018},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.874588Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:12e0e06e2d738ecaa0832d206c841550c49533f1b5e811588a0f21a8b4b8a14e","observation_id":"044e4887-ecec-45e5-8198-d75fea9c4e8f","resolution":{"observed_at":"2026-08-16T05:16:14.665637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.639191Z","title":"Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks","venue":null,"work_id":"ebf49c4e-8eb8-490d-a65a-ebf0c421b52a","year":2022},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.879574Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:6aaddc49d507da48eb6e3a29230d9215a07d32cc110094d559f6ec4b50e56757","observation_id":"07a3ff2a-4c9c-4894-9edd-1cd9ca58661c","resolution":{"observed_at":"2026-08-16T05:16:14.644748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.884628Z","title":"Diverse message passing for attribute with heterophily","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.884628Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:c190efead2cf9d96d398c584aa28e0ba4f703fd18d7c4b46464eca5e1b190894","observation_id":"b4e2565a-43eb-4a10-a3a4-4369ed17b90f","resolution":{"observed_at":"2026-08-16T05:16:13.884628Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.612532Z","title":"Graph pointer neural networks","venue":null,"work_id":"669f8961-d18d-43ff-9098-5fdc234570a3","year":2022},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.889850Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:fa25b21787e7621a01ae21ab3ddb58dfb5746bddf881bed09ab909b8834c30ac","observation_id":"b8b42fb3-0579-4075-89a9-1a003fb0786d","resolution":{"observed_at":"2026-08-16T05:16:14.617282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.894875Z","title":"Revisiting semi-supervised learning with graph embeddings","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.894875Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:0ba9c14f8356cf9d2d24baafa6ad12afd0b4f42953d2bfde7b95636a68302a1c","observation_id":"5053212d-3267-4825-8626-c17b619e4f0f","resolution":{"observed_at":"2026-08-16T05:16:13.894875Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.586473Z","title":"Fedfm: Anchor-based feature matching for data heterogeneity in federated learning","venue":null,"work_id":"81e4eaf0-4424-431e-9b41-fa0908b25267","year":2023},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.900117Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:1279dace3b6063102763ea83d94b9df9309276ffa6b6caae24f3ec37a380abad","observation_id":"507ec9de-4c53-40b1-893b-e46bf1528607","resolution":{"observed_at":"2026-08-16T05:16:14.591582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.569792Z","title":"The comparisons of data mining techniques for the predictive accuracy of probability of default of credit card clients","venue":null,"work_id":"f141770e-bd07-4a59-8998-9437a6e76872","year":2009},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.905114Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:b257d33a4baa04a9cdd7538fb62ed4e53cc212d72aa3f04435da440b0c165bae","observation_id":"7b83cc7b-41ff-470e-b07e-692d907de12c","resolution":{"observed_at":"2026-08-16T05:16:14.575461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.910160Z","title":"Graph convolutional neural networks for web-scale recommender systems","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.910160Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:f32e838fae29acf380040a85d36982aff7acccf39288fa4b26fda6618da4f82b","observation_id":"c58abc3d-ecbc-4b06-abcf-820191ea936c","resolution":{"observed_at":"2026-08-16T05:16:13.910160Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.543458Z","title":"Graph-revised convolutional network","venue":null,"work_id":"28fe7fb3-5300-47e8-a782-6e8aa43aa474","year":2020},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.915038Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:a3e513d745e9a99a5035881a0a2dae0173bd745304c8272c9e6fce541cdf3557","observation_id":"9651be05-dd10-4353-8566-3f6499639d3c","resolution":{"observed_at":"2026-08-16T05:16:14.548425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.920356Z","title":"Explainability in graph neural networks: A taxonomic survey","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.920356Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:6d5516bbbc1c9a0f1667721909172ad26bfdd0b324358481b2bb6cc194822131","observation_id":"d61301b9-f4d5-4573-8468-6eb1e6114987","resolution":{"observed_at":"2026-08-16T05:16:13.920356Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-16T05:16:13.925104Z","title":"Graphsaint: Graph sampling based inductive learning method","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.925104Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:e4d9c2443b75f0dd758fd48f78a8277e4ea48f354498440f3e766bde70ed6cb6","observation_id":"58934daf-2ed1-4ced-8506-af569cbf50bd","resolution":{"observed_at":"2026-08-16T05:16:13.925104Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.09553","last_updated":"2022-10-29T04:48:55Z","snapshot_observed_at":"2026-08-19T13:36:16.825877Z","submitted_at":"2022-03-17T18:32:19Z","title":"Efficient Federated Learning on Knowledge Graphs via Privacy-preserving Relation Embedding Aggregation","version":3},"cited_work":{"arxiv_id":"2203.09553","doi":null,"metadata_source":"pith","pith_arxiv_id":"2203.09553","snapshot_observed_at":"2026-08-16T05:16:14.102682Z","title":"Efficient Federated Learning on Knowledge Graphs via Privacy-preserving Relation Embedding Aggregation","venue":"cs.AI","work_id":"3395cb34-53e6-4c7c-bbaa-9c50c44bc7e8","year":2022},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.930462Z"},"links":{"cited_paper":"/paper/2203.09553","citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:f8baf48264c76cbd17c9608ee0c10200086b008076171f04199393da7babc8ae","observation_id":"1c862091-b11b-43b3-be2d-dd6694c48024","resolution":{"observed_at":"2026-08-16T05:16:14.110220Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.513565Z","title":"Subgraph federated learning with missing neighbor generation","venue":null,"work_id":"704f5e46-e841-497a-9377-b37f4885479d","year":2021},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.936032Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:aaa2c40174d8f26852d27ab16a643cbe865cbb3cd57e15373d0cb22a5c64f11a","observation_id":"b5471591-2d9a-4fa7-8b86-92c70a43ed25","resolution":{"observed_at":"2026-08-16T05:16:14.519305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.495502Z","title":"Bayesian graph convolutional neural networks for semi-supervised classification","venue":null,"work_id":"5e9edb38-de9e-4e31-b4a0-a335630e2d01","year":2019},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.942414Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:1150d0ebfb99fa3a0aefe97c28c2b661b6ae9010b7f8b706f7a58b448a80cc0f","observation_id":"701c0198-665e-4a70-b557-95a064221204","resolution":{"observed_at":"2026-08-16T05:16:14.501219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.477831Z","title":"Heterogeneous graph structure learning for graph neural networks","venue":null,"work_id":"0f39250a-2ad9-4a6f-9558-f8553fef788f","year":2021},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.948046Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:e0dbf9d4cbf7cef6b75d95580385a7579e20a2e6cf02f8d79a2e9b9a498c3948","observation_id":"e7f6c23b-ae1a-413e-8ba1-48e32c3c2a38","resolution":{"observed_at":"2026-08-16T05:16:14.483021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.461500Z","title":"Data augmentation for graph neural networks","venue":null,"work_id":"fc1388f6-6b52-4c92-98f8-d2025a3d9b4d","year":2021},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.953283Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:8ef72ba5dda391425cabdc5a56d92653c67433e86904a56b314609fb142885e7","observation_id":"043d7b96-f705-4074-86e1-069be40719de","resolution":{"observed_at":"2026-08-16T05:16:14.466459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.11264","last_updated":"2023-06-20T03:33:22Z","snapshot_observed_at":"2026-08-20T10:26:10.530569Z","submitted_at":"2023-06-20T03:33:22Z","title":"GraphGLOW: Universal and Generalizable Structure Learning for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.11264","snapshot_observed_at":"2026-08-16T05:16:13.958671Z","title":"Graphglow: Universal and generalizable structure learning for graph neural networks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.958671Z"},"links":{"cited_paper":"/paper/2306.11264","citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:e984c6494c3716fe9a8293850e14901ec8b23545ad591c5b2f8ca7857ae519ce","observation_id":"637e76b2-dcbf-42fe-9589-17022802b485","resolution":{"observed_at":"2026-08-16T05:16:13.958671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.445180Z","title":"Asfgnn: Automated separated-federated graph neural network","venue":null,"work_id":"0e741060-a573-4fdc-812a-3c410d16ce8b","year":2021},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.963888Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:3c0be08c48fa1692485da386fed9c9fbe7c7794a33b65fdee647df20fe4e2e1d","observation_id":"b5866476-ba34-41c6-81d8-e4cf058bd049","resolution":{"observed_at":"2026-08-16T05:16:14.450652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07082","last_updated":"2026-04-18T08:18:16Z","snapshot_observed_at":"2026-08-20T19:57:46.670773Z","submitted_at":"2022-02-14T23:07:47Z","title":"Graph Neural Networks for Graphs with Heterophily: A Survey","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.07082","snapshot_observed_at":"2026-08-16T05:16:13.968970Z","title":"Graph neural networks for graphs with heterophily: A survey","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.968970Z"},"links":{"cited_paper":"/paper/2202.07082","citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:ccc11d8d1510148be9cdfe511dd166bd3751c0c5b12b1ff2b6ea0e15e1728726","observation_id":"96bf75a0-89d3-4d51-86c5-7dfd8ea5834c","resolution":{"observed_at":"2026-08-16T05:16:13.968970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.428684Z","title":"Finding the missing-half: Graph complementary learning for homophily-prone and heterophily-prone graphs","venue":null,"work_id":"8d30d0df-647d-4f04-9b5e-cdf958107e6e","year":2023},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.974207Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:ac59e0ee863c50e5f9ba16d7cbb9fd6df797bfac64b204c98b45c4b3f7c7c6f9","observation_id":"0e1dbfac-23ff-4eaf-a677-43826626f431","resolution":{"observed_at":"2026-08-16T05:16:14.434084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.979652Z","title":"Graph neural networks: A review of methods and applications","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.979652Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:b338d198f7a69ddefa1064fa07bd057c87ae7f7ede503ab46089568212df33fb","observation_id":"ae5d752c-c929-4a8c-8de8-2259a1f9ca40","resolution":{"observed_at":"2026-08-16T05:16:13.979652Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:13.984852Z","title":"Beyond homophily in graph neural networks: Current limitations and effective designs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.984852Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:e5b964e70b3c206fa37cef150f09f093cc0a137c662408bae353ad7a1ba1639f","observation_id":"7f0613b2-b2e7-48e9-8356-c598f07fa79e","resolution":{"observed_at":"2026-08-16T05:16:13.984852Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:16:14.391760Z","title":"Mixedad: A scalable algorithm for detecting mixed anomalies in attributed graphs","venue":null,"work_id":"dadef7d3-3600-4eff-9354-2792e96c6bbc","year":2020},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.989774Z"},"links":{"citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:64dee7f91f00d4222583c3fe6f2eae661452f14106eebbb32f91461dd29fdb77","observation_id":"f243fcbe-b7c3-4c4d-83fd-1f2185e82da9","resolution":{"observed_at":"2026-08-16T05:16:14.396916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.08730","last_updated":"2019-02-23T03:45:31Z","snapshot_observed_at":"2026-08-14T17:12:25.829086Z","submitted_at":"2019-02-23T03:45:31Z","title":"AliGraph: A Comprehensive Graph Neural Network Platform","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.08730","snapshot_observed_at":"2026-08-16T05:16:13.994351Z","title":"Aligraph: A comprehensive graph neural network platform","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.994351Z"},"links":{"cited_paper":"/paper/1902.08730","citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:dc30be516c3f13174cfc321054ee3ce651653df7391405ee145da77e5496ed10","observation_id":"0cf73341-ff69-4e9a-a4b4-878be7babf38","resolution":{"observed_at":"2026-08-16T05:16:13.994351Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":55,"verified_exact":1,"verified_fuzzy":44},"total_outbound_references":102},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 100 of 102 outbound references and 0 inbound Pith citation observations for arXiv:2504.21206."}