{"as_of":"2026-08-10T04:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d0e979fc3f5cee0523332471dae614a97ea4bc626b8c1b3853684279f7a5b8ab","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:08:36.367268Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2506.08871/citation-record","integrity":"/paper/2506.08871/integrity","json":"/paper/2506.08871/citation-record.json","paper":"/paper/2506.08871"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:08:46.924233Z","title":"A comprehensive survey on graph neural networks,","venue":null,"work_id":"be908dc1-8e7d-4b11-a312-0d2db935a5bf","year":2021},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:30.200442Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:444df29ce1ccdcc11d320735b22df30dd03ef95d90c124a94539af52ae6c060c","observation_id":"a4ad2cc1-ba27-4769-8d68-ae8e39454283","resolution":{"observed_at":"2026-08-07T05:08:46.985400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:46.697663Z","title":"Geometric deep learning: Going beyond Euclidean data,","venue":null,"work_id":"3d975371-a397-4e77-b88e-8ab123de7ae6","year":2017},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:30.307441Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:92f74c6395b397df61bd1e83e50923decf646a41764252850023b5c0cdde01c2","observation_id":"e4177392-18f1-49f0-ac9f-5d483e0181b1","resolution":{"observed_at":"2026-08-07T05:08:46.820084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:46.540426Z","title":"A survey of convolutional neural networks: Analysis, applications, and prospects,","venue":null,"work_id":"fda1dd17-aeec-408e-83cb-7446007a74d8","year":2022},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:30.425096Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:ed7f853ea494ecdc46e2cab953458b3cfb8d5e389de73b96f0417b5b131da53c","observation_id":"e6ae38be-e396-45f6-877d-4a12af22be93","resolution":{"observed_at":"2026-08-07T05:08:46.619767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:46.336838Z","title":"Exploiting the structure of two graphs with graph neural networks,","venue":null,"work_id":"517ed9bb-91de-4873-b56d-4cd44aebd4c9","year":2024},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:30.521964Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:1fc53efed864538ce43c6bdfa390005a7d2447637aec2ec8fad3c13e7ea5acc5","observation_id":"27397574-6cb7-470c-9388-8e47c66414b0","resolution":{"observed_at":"2026-08-07T05:08:46.441531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:46.042485Z","title":"Beyond homophily in graph neural networks: Current limitations and effective designs,","venue":null,"work_id":"e49f153d-ec8c-498b-af0e-8fbe3a28922b","year":2020},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:30.639605Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:659f41cb9d55cbb668c4529c5e5ae462a092e3c482b3b9096a21a8e771e23dd9","observation_id":"08000e2c-74eb-40da-bc63-fd39908559a9","resolution":{"observed_at":"2026-08-07T05:08:46.172612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:45.680182Z","title":"Is homophily a necessity for graph neural networks?","venue":null,"work_id":"b067fff9-f04d-461f-84d6-bac9674d9cfe","year":2022},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:30.771834Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:3d55afc80f7f4c44995c8ca3f9da42e69d5447d7568377842c5303293d09fca2","observation_id":"af5aab7c-8017-4850-bd25-239d91aedbe1","resolution":{"observed_at":"2026-08-07T05:08:45.905595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:45.434411Z","title":"Geom- GCN: Geometric graph convolutional networks,","venue":null,"work_id":"5238b16b-0775-4c07-89fe-50e91627fecf","year":2020},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:30.878768Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:46c3867c4463c12770948c5a9f917e18cb0b507fd0d84884f4cc082f0d162681","observation_id":"e6249492-d8c3-4cc7-9384-16803e0d8b0d","resolution":{"observed_at":"2026-08-07T05:08:45.549981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:45.156881Z","title":"Revisiting graph neural networks: Graph filtering perspective,","venue":null,"work_id":"28c85558-53e5-4773-9977-ac7239f86c54","year":2021},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:31.010928Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:f9379cc4816732f50751836adbb187ebb8d403ecf00a934b95b286cec04e8bd8","observation_id":"6a7f8a93-cf54-4759-99f8-c009b8b2167c","resolution":{"observed_at":"2026-08-07T05:08:45.296856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:44.730062Z","title":"MixHop: Higher-order graph convolutional architectures via sparsified neighborhood mixing,","venue":null,"work_id":"52336d95-d9e3-4c42-9811-3fbe7049694e","year":2019},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:31.103315Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:9963e60cb454d7d8e11ab5ac0183091509a07eff2c7d84dc85b112a849808825","observation_id":"9f268daf-72d9-4a66-a35c-b88667005128","resolution":{"observed_at":"2026-08-07T05:08:44.948316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:44.333422Z","title":"Beyond low-frequency infor- mation in graph convolutional networks,","venue":null,"work_id":"ade5bc3c-f7a9-4f83-a4b1-cd2778d2fa07","year":2021},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:31.220340Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:dc7cb09554725e8491a59a034fa93549ce78a28d6454b27291505094411d1edb","observation_id":"c03477aa-2dbe-4f32-9b79-432cf3e7dd7a","resolution":{"observed_at":"2026-08-07T05:08:44.549981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:44.137347Z","title":"Large scale learning on non-homophilous graphs: new benchmarks and strong simple methods,","venue":null,"work_id":"7a333814-fa27-4ea2-9342-4f6957202311","year":2021},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:31.372467Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:747d2942c2406cfa23b95f0c5c31f6a400970aabdd188ec2e055035a9a9bb3de","observation_id":"01e5683a-934c-40e5-9ee2-ffb58f0d9c91","resolution":{"observed_at":"2026-08-07T05:08:44.232673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:43.965383Z","title":"Adaptive universal generalized PageRank graph neural network,","venue":null,"work_id":"6428e714-66aa-49b6-affb-34e5498c042d","year":2021},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:31.510968Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:8dce93cfaad86be6e8e62c7a305276beb874b198a8b2474ef8fb693bdc9ded7c","observation_id":"dbb6e2db-6d9e-4191-8879-82de1383f338","resolution":{"observed_at":"2026-08-07T05:08:44.041846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:43.785557Z","title":"Simple and deep graph convolutional networks,","venue":null,"work_id":"8e3eea98-f073-44c2-8a46-0e2fd4942d1c","year":2020},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:31.600571Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:780d08515a57c5fa9cd33eb8cb0d3473cf1eddb72cde41a3458db8a9bc0ddee9","observation_id":"7653e451-7a5b-4d35-b933-941ea5d1dbf4","resolution":{"observed_at":"2026-08-07T05:08:43.861022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:43.601283Z","title":"Diffusion improves graph learning,","venue":null,"work_id":"f5c5c0d9-7d32-42ee-a289-6a270dea8e64","year":2019},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:31.770421Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:32dbd6d3abb1e52642f14a9f85e733ad626309b41c1a8626d2e4855013e37433","observation_id":"f7dc2250-f2e6-4a86-a58c-89648a70457e","resolution":{"observed_at":"2026-08-07T05:08:43.665865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:43.457996Z","title":"Predict then propagate: Graph neural networks meet personalized PageRank,","venue":null,"work_id":"acd2e3ea-b6fb-455a-bf3f-337ff11caa3c","year":2019},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:31.953261Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:5491c6b3453326304314a6759abe481c2fbb69431857784b3581d50d48d6a7cd","observation_id":"feb6ada5-08af-4a76-8b7a-391d4dc7b086","resolution":{"observed_at":"2026-08-07T05:08:43.518595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:43.243852Z","title":"Graph neural networks: Architec- tures, stability, and transferability,","venue":null,"work_id":"3f0a0509-ed40-432c-a272-99501e880dff","year":2021},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:32.060223Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:080233bb26a115897392480e0234a014f6fa903944c88c821d5f3d3361fc2e2d","observation_id":"e123a4e1-1764-4666-811e-031b808db66d","resolution":{"observed_at":"2026-08-07T05:08:43.343576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:43.110723Z","title":"Stability properties of graph neural networks,","venue":null,"work_id":"121711e9-c618-4b51-bafa-b72ca951926a","year":2020},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:32.194876Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:b89873e5a5f139dbc87562318a5b5459e44d0a1c5e6372f952f8bd3d1d00bbec","observation_id":"c2b63a42-4e31-4cbf-b84c-a7020f0e68b6","resolution":{"observed_at":"2026-08-07T05:08:43.164579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:42.873413Z","title":null,"venue":null,"work_id":"e434fd38-7105-4f5c-880d-0f779104d21c","year":2025},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:32.324203Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:bbe2b3a0d2412520a9ad9b442d1c9887461f3b6ee0f78040808a55cb609f3b05","observation_id":"98b034bd-5e36-459a-a128-4b4520738aed","resolution":{"observed_at":"2026-08-07T05:08:42.996167Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:42.674823Z","title":"Breaking the limit of graph neural networks by improving the assortativity of graphs with local mixing patterns,","venue":null,"work_id":"56f38e0c-ad73-48c3-a03f-f4c494f93cfb","year":2021},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:32.417147Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:7d303e73265df22c07d4d06882a536454759205ef5dab242508f2d5259cf0246","observation_id":"5a45c4d4-30fc-475a-acea-91f82c86002d","resolution":{"observed_at":"2026-08-07T05:08:42.783759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:42.492752Z","title":"Beyond homophily and homogeneity assumption: Relation-based frequency adaptive graph neural networks,","venue":null,"work_id":"2f339a5d-3b8b-4a5b-ab93-c041f75854df","year":2024},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:32.562916Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:3f9e3530300a0afcb993b1477d92d9d22016ea41800ba1096c5e8c4a2afe90b9","observation_id":"a14838e7-84b4-43ff-a767-d42f19e45124","resolution":{"observed_at":"2026-08-07T05:08:42.587721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:42.335731Z","title":"Structure-guided input graph for GNNs facing heterophily,","venue":null,"work_id":"eaa4b3b7-2e94-491d-834d-85660e209960","year":2024},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:32.680801Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:db383a87b657d2d512cf820c73f5bb8aced97cd3458e85188678245ca0a3ec5e","observation_id":"243234bb-cbd7-4914-bef6-c66c67078291","resolution":{"observed_at":"2026-08-07T05:08:42.406106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:42.094064Z","title":"Role-oriented graph auto-encoder guided by structural information,","venue":null,"work_id":"d679ccbb-cc9f-4c0f-a5da-9acd2ff3d037","year":2020},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:32.779652Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:32321579fe1fc7042c339e9ba443aba1af854aaf1fdc1a4642359c1ebd0d505a","observation_id":"f69da0ef-80c5-4e90-ac4d-d06ca147ebda","resolution":{"observed_at":"2026-08-07T05:08:42.215963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:41.917449Z","title":"Recovering missing node features with local structure-based embeddings,","venue":null,"work_id":"2ef68216-8372-4961-9175-c657e4c4bba1","year":2024},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:32.882657Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:5a7a25d1afda1f48bcfc0b59ba0d0f894e4beed578b350a62dbc5c473591c339","observation_id":"633cdb4a-820d-433b-8fab-f7db5525a42d","resolution":{"observed_at":"2026-08-07T05:08:42.007331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:33.001931Z","title":"Newman,Networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:33.001931Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:9c8d057039c11e4caac8202c411413dcafa82a87b821a9e11f4e640bb37a2e72","observation_id":"530285f0-ab48-4820-9b3e-e0871949cc3f","resolution":{"observed_at":"2026-08-07T05:08:33.001931Z","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-07T05:08:41.775407Z","title":"Homophily- enhanced self-supervision for graph structure learning: Insights and directions,","venue":null,"work_id":"4225a441-cde7-4f46-b3ca-dd7d7b4f631d","year":2024},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:33.165852Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:da602c2a6b7a8890e07d82906b8e43d27f9488ca6cd2d721be743ef573eb6618","observation_id":"025a2379-6163-4148-a846-4ad1cf0432e9","resolution":{"observed_at":"2026-08-07T05:08:41.863013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:41.537497Z","title":"Graph structure learning for robust graph neural networks,","venue":null,"work_id":"91081b1c-385e-4876-a53b-8e249e33d6fd","year":2020},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:33.259471Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:e8fa93d4cf03bb72177d5ad81d63385e109d333307e46f314cc5b9e40aeb1d06","observation_id":"2b36073e-fd58-49ed-adbc-280b108fbd61","resolution":{"observed_at":"2026-08-07T05:08:41.661856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:41.334958Z","title":"Measuring and relieving the over-smoothing problem for graph neural networks from the topological view,","venue":null,"work_id":"77c48f86-da92-4910-8218-e0a452d4a114","year":2020},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:33.366289Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:120db559ae1f8a314956cba9a85396fde91b12a0376b730e3fea6c1c36438320","observation_id":"2de7e4e0-2c12-4317-8a46-26e8a26e8e33","resolution":{"observed_at":"2026-08-07T05:08:41.432670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:41.063766Z","title":"Node similarity preserving graph convolutional networks,","venue":null,"work_id":"575d7c43-6c36-4264-a4e6-ba6e7f4421c5","year":2021},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:33.527853Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:df21360cd7577a8f18b43eb9d8b2acf366a2189aa75845d20a34623167378759","observation_id":"ad5fb8e8-cb4f-4660-9daf-2d4547f7f050","resolution":{"observed_at":"2026-08-07T05:08:41.205627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:40.919451Z","title":"Seeking similarities while removing differences: Graph neural networks based on node correlation,","venue":null,"work_id":"48da8677-931e-4f5c-94fa-388425c6c643","year":2024},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:33.691694Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:8b90a5b00c9f121627d2d48267ed5d7fba9f2d524c29717aa7ce112c156f3aba","observation_id":"64082da5-b5c7-4f91-9954-62495cedf508","resolution":{"observed_at":"2026-08-07T05:08:40.967305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:40.761698Z","title":"Unbiased graph embedding with biased graph observations,","venue":null,"work_id":"7e56b4f1-3a34-4dc4-afcf-6c74a34024a8","year":2022},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:33.797682Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:7ed82f23cbb53521f2757d76978d2ddf6f93a2b31673af51ef95536092c0067a","observation_id":"79e9d642-beae-4853-b270-b9f9b512bd4b","resolution":{"observed_at":"2026-08-07T05:08:40.846549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:40.553389Z","title":"struc2vec: Learning node representations from structural identity,","venue":null,"work_id":"70ed5b55-d403-4917-b3c2-9f18327c6226","year":2017},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:33.912540Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:c19e8e5b55bc786617f7fdbe5b5704d96f81e8d8d734ea322e0346260ebee09b","observation_id":"aa332f12-23b3-4d7b-a77f-283fdce8906e","resolution":{"observed_at":"2026-08-07T05:08:40.658794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:40.221961Z","title":"Semi-supervised classification with graph convolutional networks,","venue":null,"work_id":"5da4231e-573e-4a33-8dd8-0eb6214ebe43","year":2017},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:34.016197Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:90b7dab52ceb4273c92984a6c64cde23f36743b67db43e7a3d2663849832b834","observation_id":"2447f7dc-ed37-496b-a64c-111a1cd3e825","resolution":{"observed_at":"2026-08-07T05:08:40.399908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:39.958077Z","title":"Graph attention networks,","venue":null,"work_id":"229acc61-4661-4ccd-ba6f-1b9651e18b46","year":2018},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:34.138492Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:5319e28ece2e60b3ff96c8ceb031387b3edbd3e5f884270b49b0e55f3be004a4","observation_id":"d5c26dc6-a95a-4d4e-b494-cf607798e29a","resolution":{"observed_at":"2026-08-07T05:08:40.087070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:34.262232Z","title":"Birds of a feather: Homophily in social networks,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:34.262232Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:c26588eb36e5d522de627d6f297130a2f5d9f5604e4637c6695d49bd8ea59573","observation_id":"7bf861a4-e853-4c63-a57e-7ebc431d48cb","resolution":{"observed_at":"2026-08-07T05:08:34.262232Z","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-07T05:08:39.674385Z","title":"Simplifying graph convolutional networks,","venue":null,"work_id":"6b1d1f5f-6603-42d8-8cad-6c1e33046082","year":2019},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:34.360947Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:bcbdf80aef3e098aafe310ffdbf72a420c58e5535b98918ed5cb0503332057cf","observation_id":"c6d3bce7-20f9-4447-8b5b-70163c717155","resolution":{"observed_at":"2026-08-07T05:08:39.788271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05641","last_updated":"2021-09-12T23:57:05Z","snapshot_observed_at":"2026-08-06T17:45:44.000243Z","submitted_at":"2021-09-12T23:57:05Z","title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.05641","snapshot_observed_at":"2026-08-07T05:08:34.482166Z","title":"Is heterophily a real nightmare for graph neural networks to do node classification?","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:34.482166Z"},"links":{"cited_paper":"/paper/2109.05641","citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:ad3ca458935803406d16521ea056ea6a8d57a9a1b0ad902cf4ca752820ba67a0","observation_id":"a056cd74-dd5a-4de2-8679-2958ed1121c8","resolution":{"observed_at":"2026-08-07T05:08:34.482166Z","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-07T05:08:39.369841Z","title":"Discrete signal processing on graphs: Frequency analysis,","venue":null,"work_id":"344d7614-89e3-45b0-bbcd-545903750951","year":2014},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:34.657199Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:2f25863bfaf9da1a17bd88b8d891b067be5092bcfd676e3a540a1f47510323c6","observation_id":"d3e39086-b965-475e-bc9a-115310d2eba2","resolution":{"observed_at":"2026-08-07T05:08:39.525932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:39.112790Z","title":"RolX: structural role extraction & mining in large graphs,","venue":null,"work_id":"cf475b4b-5858-4bf3-bddd-aca24658be6d","year":2012},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:34.762709Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:daf182ebde128aaa39f79315f32e0f42d41ec48532c899244816a21e49fe5ffa","observation_id":"3b96b774-9fdb-49bc-a6a2-e2f66bc7329c","resolution":{"observed_at":"2026-08-07T05:08:39.241957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:34.913534Z","title":"A set of measures of centrality based on betweenness,","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:34.913534Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:a4ca36f81747bc5f7ef6735b513a25b068b0adb9e4d7f168e2284498c34c5736","observation_id":"025e1fd2-942d-4edc-bec6-d4128059645d","resolution":{"observed_at":"2026-08-07T05:08:34.913534Z","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-07T05:08:38.835168Z","title":"Automat- ing the construction of internet portals with machine learning,","venue":null,"work_id":"908fa153-2c9e-4bf0-9347-40557dd40ee0","year":2000},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:35.071609Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:956a790d8c73f4252f1a4f3ea1bb2703736cc4d1bc34a43d940132593fa62454","observation_id":"85f6ed2d-be36-4390-8cbe-543b8e0267e5","resolution":{"observed_at":"2026-08-07T05:08:38.970423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:38.487321Z","title":"CiteSeer: An automatic citation indexing system,","venue":null,"work_id":"779b4a26-5e63-40fc-9694-392c500c3dda","year":1998},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:35.257232Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:92eb2fb990c22e6fb4f6bb1c9de35e01258e65391c186e4bb8cb508be3072e45","observation_id":"0a818049-3120-4446-9c86-7423c0f1f7f5","resolution":{"observed_at":"2026-08-07T05:08:38.625275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:38.205140Z","title":"Tensor graph convolutional networks for multi-relational and robust learning,","venue":null,"work_id":"d9fab968-0b9a-45d4-b709-a2f9a6b7e4a5","year":2020},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:35.414428Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:4773db743d3357325240113d24ca1a51ee2d25ab08dabf86c34c6fc3bd07e0d0","observation_id":"0805db1e-ce06-4c67-a4af-460f9c85b393","resolution":{"observed_at":"2026-08-07T05:08:38.329927Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:37.891296Z","title":"How powerful are graph neural networks?","venue":null,"work_id":"0fbe067d-7a74-491c-9b68-169c36a8a8ed","year":2019},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:35.594011Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:5a6dafb0432af282c33d77b221158f0809afce985964e0eacc52d242fb7f1ee9","observation_id":"c3768a4b-deac-4522-a935-ed28d4414bde","resolution":{"observed_at":"2026-08-07T05:08:38.023665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:35.702083Z","title":"Collective classification in network data,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:35.702083Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:36b4aa4ad940dfac3d928560f24142486791a1f8358a982e286ca9f7ebe9dca7","observation_id":"d75b74fd-efdd-4a60-815a-827bd5170d6a","resolution":{"observed_at":"2026-08-07T05:08:35.702083Z","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-07T05:08:37.633185Z","title":"DeepWalk: Online learning of social representations,","venue":null,"work_id":"a52232af-398f-479f-992f-16d1f6f53b69","year":2014},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:35.837170Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:725e249d28787c995eb0635ddb71f932a5d69152519107da400487de6f92cb36","observation_id":"553bcceb-634c-42bf-8f29-fe22ea3eeb19","resolution":{"observed_at":"2026-08-07T05:08:37.773429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:37.366604Z","title":"node2vec: Scalable feature learning for net- works,","venue":null,"work_id":"d018bc62-e341-40ec-bc4b-54c14b58113b","year":2016},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:35.987483Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:8bef53abe69e876903f774588c95941c62aad16ccc6a261e31c58080159e9fdb","observation_id":"4c0ae4d4-0525-4c2e-b8d1-cd7f95473291","resolution":{"observed_at":"2026-08-07T05:08:37.449842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:37.108196Z","title":"Learning structural node embeddings via diffusion wavelets,","venue":null,"work_id":"ac9abfa7-2a11-4112-b8b0-76fa58b44fc1","year":2018},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:36.130680Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:96c894366ef3c220c358b15974e7b8aa3667c2209f443a57e01acf54a237f208","observation_id":"2aff24f8-e115-4526-9722-dc8bd342dd92","resolution":{"observed_at":"2026-08-07T05:08:37.239648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:36.802679Z","title":"Edge directionality improves learning on heterophilic graphs,","venue":null,"work_id":"220edaaa-113a-4ec3-bf6f-1e41984baa34","year":2024},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:36.270760Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:4c9ccf42ff72a276b7b9feab76350a42579cff9bb03fbaba36f16c5e65aae938","observation_id":"8e4c8fe9-4018-407f-a19e-8fc61d8a94f3","resolution":{"observed_at":"2026-08-07T05:08:36.964022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T05:08:36.591967Z","title":"Simple spectral graph convolution,","venue":null,"work_id":"5c55192c-caa7-4661-9962-83082dba9d0f","year":2021},"citing_paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T05:08:36.367268Z"},"links":{"citing_paper":"/paper/2506.08871"},"observation_digest":"sha256:d8777de47063472236293d16b29337c2ad5869e831121bd8f0883318e5edd7e1","observation_id":"b979943a-c605-4caa-a53d-714b8c67739a","resolution":{"observed_at":"2026-08-07T05:08:36.733280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.08871","last_updated":"2025-06-10T15:03:23Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T04:57:17.146057Z","submitted_at":"2025-06-10T15:03:23Z","title":"Adapting to Heterophilic Graph Data with Structure-Guided Neighbor Discovery"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":43},"total_outbound_references":49},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2506.08871."}