{"as_of":"2026-08-08T12:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2f5248468cc5ae4005b744f68baa67417a58b8ed0d3c4564f4335ffee027fb32","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-08T06:32:00.761636+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:38664ce88bd9c84180480668df9322179d7efcf3996a1448c590c463075c5e61","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:4a290e092b596d1d4afd377a2a6d2eb5cd44f1c419f4db79578a450e38671365","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:b12761ef4b3539914cc8291822a6eeb95cf118fb26786b3a0e58a71b62135a18","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:78dbb71c1a6e9d0df83d08a3500ade577e72cb868d17bfb9297d308718ce8c42","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:56e0f2407f7b85ea9918d6507aa793cab2b046a7de98c356ab9de882f01e3cd8","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:536d55d4ae66522879f5b687ab4ce04553cea5bd7bfcd5d3ea197e245b9d9b33","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:cf9398c224502bd7392b8b098d1268b370dce47b6732ff6d72eb14713f36afe8","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:834a352352bcdaf4584081886f8669c6056dadecde68aa603efc9983cd6385bc","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:b88940b264607f5f16bd381590d9ccb3817276357d792dc7fe601eb7170247f9","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:36330b52c4857eb5b771dba9b41972a02da4df8109ef0fdbe28c62ba8cc599b2","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:b27d5c8b0500982adbbbbd1d10e7191c409f31aaa246d95f00070c239c71295e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:e6a8ed64d9e43cf48a234d2e732e0beb5c53dc5173f66c8fb0d2c13ec509adec","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:194756842818cf3750422ec3d7d179f098def7f33f9d3e55907c17f0e9b835a8","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:417be42d4adcf04a33aefbb08af56e950877aeaae0dd1782f2c1151cf919e421","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:d1c7c20aca9b332f6e1410bc0b002a666a05eac5ebd5fc030cea4b8ef8aae2ea","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:ec36f3810080941d162aaaec030d2a1166c12e44f4b4436594eaa83d9d1c90e3","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:c4cae95804ac41f65d0c933e54c6e55fc70d96b111377858c8d905f9a07fee31","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:f1741506faecf85149afbb33a578d211fe3d8c6516dfa16d5a63d3617a33c93f","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:47d843e7d7f7206aeeb406c32249416141e7d1bfa8d5be4750949641aa1403e1","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:344901eff77c4c23a7ba34121eaf6dd49eb8130dc27ecabfa263e9a00454989e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:3f7266ec1162ad27605fce1b1e5f1d4444a5f5ee4255327d6184cd4fd0651297","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:3c8d3f1c41736b02ec16125d1a6863635f6b51fa320ab10e5fccd1ae193ea30a","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:5185046de9680de96beed139906cd82d1d42ff503b130449e4943fdd13e63bcd","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:4da98fedcd3c9e1efbdbb0d1b67b957cd3b2053d3d1530fd480c0b53d4df21fb","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:48d7a6f3dc16195c73ded1d440a43341b34ce4b90bee83c34c52cb998b50660e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:6af2f4aaa7cca264f8eab2d1e03086ff7222e6c41973eecfc48f4942e2dfec16","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:e9965cc7822ac3ed8456552bb43dadc49427b809e7f75959eba005d3a0b4b8db","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:afd94ba95992dd0534fc981f4794005040c61d800ed3b6caea72db6940ec3e6e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:b1d5f2692859e1d603b6fe650c4ce974351a1ebe9d62f22d504582739b248e22","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:6f32feda55cfac1991c3367fdab0a2ffc08cca4df51d3fda24d69bc7c2c1269f","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:a98d6d43c0b14121d25e4413c3dda2b005b073940e0528d61784e2266abbf84b","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:086580222611f2f27446d0371b2259686e923f6b181b7d97273c8aa045e2457e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:bdc7b31c3ccb8b8d7aafb759c0a19275830754a061d67c61db718f15bb1a317b","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:e67df7725252499168dfb54c9767ffb892411427381a21202522945d1cbd07bd","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:4d9b23c3f9d7c68fe8d901cfa5e3f87663bf1f731296c15c2b7b92f418ab82d7","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:dce960ed1cc581717a7869441ec308d3c20a37094619cc8e8097224b2b08709d","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:e1aee2943ec256b174354000fb6799607f7f9b1f2dc09534aadc7ad718357383","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:026c1753aab66e07a74d2199cd808ed8202bbbe6c9d49be1b612f95bf7ae0ad4","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:b57f68f77f09f5523403a6b2203339dd24e75122304c8d9b3d66be5897c8bfe6","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:efa9883eef7063e8fc5e82fd6bb50323e2294d80fed33c76d5605853d2d8dc3e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:6a533736c31d968e460c88e77c0d7b4bf6c1f85e873b322d362a5f1aa5a54049","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:e1cab77f1b685fe536dab7659a367fcde3d28a6f7a06331b19b0e62219a075c2","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:dd9218b86ba320cac4779bb389a7a042ec80eef8ffae6876bae4e7dec4646b3f","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:c060f7844465e8a058ca1909825c857b2ad56a1c2dab5219699d08097c9746c9","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2506.08871."}