{"as_of":"2026-08-18T17:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6f4ea92517a0c62f64d7fabafc45cec8cf437e2298256b8e2fe09f93cfd9deec","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:42:59.298147Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2505.12411/citation-record","integrity":"/paper/2505.12411/integrity","json":"/paper/2505.12411/citation-record.json","paper":"/paper/2505.12411"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:59.196474Z","title":"Braingnn: Interpretable brain graph neural network for fmri analysis","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.196474Z"},"links":{"citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:8c6d7e2693d0841cb50a51f1707e3ef166a89f302c94e037d0f42bffb21d4180","observation_id":"bd04d86b-e891-4348-99af-50ce3dee4da9","resolution":{"observed_at":"2026-08-15T20:42:59.196474Z","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-15T20:42:59.623424Z","title":"Learning effective road network representation with hierarchical graph neural networks","venue":null,"work_id":"fbcb0b25-77e7-47f1-9db5-443adc652322","year":2020},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.200068Z"},"links":{"citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:50a04ccd07c3a8119379bec667bf4c10ba4038cf408acd1999f7022aa1d944a4","observation_id":"1d1ab6d6-47ca-4222-8a5e-71eeed891478","resolution":{"observed_at":"2026-08-15T20:42:59.626477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T20:42:59.613903Z","title":"Fast and flexible protein design using deep graph neural networks","venue":null,"work_id":"9c314b85-e26f-4552-940d-559e876fffb1","year":2020},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.203109Z"},"links":{"citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:5e89d0724c00ede04712615e8b9100ebc95c2cf4145d3ed5ae0f25cdcbd7e481","observation_id":"4967be75-db9b-4778-9cdb-eaae54fd84ab","resolution":{"observed_at":"2026-08-15T20:42:59.617262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T20:42:59.206221Z","title":"Birds of a feather: Homophily in social networks","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.206221Z"},"links":{"citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:46524af544e6fb937d857998debcf137479545857c9ac5ef4439358db44c74d3","observation_id":"42c40794-674d-4071-9d9e-27ff8c841f14","resolution":{"observed_at":"2026-08-15T20:42:59.206221Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07082","last_updated":"2026-04-18T08:18:16Z","snapshot_observed_at":"2026-08-02T07:00:41.767213Z","submitted_at":"2022-02-14T23:07:47Z","title":"Graph Neural Networks for Graphs with Heterophily: A Survey","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.07082","snapshot_observed_at":"2026-08-15T20:42:59.209084Z","title":"Graph neural networks for graphs with heterophily: A survey","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.209084Z"},"links":{"cited_paper":"/paper/2202.07082","citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:e664fb2cdd17fd3e7e062c4aeeb9738cec467c72b73f26df1d4c04c494f48705","observation_id":"6037b694-1ba9-43f9-83f3-06014697ff7c","resolution":{"observed_at":"2026-08-15T20:42:59.209084Z","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-15T20:42:59.597969Z","title":"Be- yond homophily in graph neural networks: Current limitations and effective designs","venue":null,"work_id":"f190ee9d-6e5f-4963-a541-8e07cdaaa345","year":2020},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.212393Z"},"links":{"citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:54a88486c0e0a495513599b8ca2e27803314cd440ed3311d614e0094adbcb72a","observation_id":"32c8fd94-e300-48ff-b0f6-80b91c0f3f72","resolution":{"observed_at":"2026-08-15T20:42:59.601284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T20:42:59.587779Z","title":"Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks","venue":null,"work_id":"f0bcc1f0-0b94-47a7-9ec9-dbb6157d8f8d","year":2022},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.215736Z"},"links":{"citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:bf8e436f135810717f2ee994e63d0455dd7f607e9df80452ffafab695d1458c4","observation_id":"a313716b-159a-4623-9d47-1c8eeb2fe660","resolution":{"observed_at":"2026-08-15T20:42:59.591122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T20:42:59.218517Z","title":"Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.218517Z"},"links":{"citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:ef8e45c3283db98eef93861d865a9670b9ead7fee5c2f88d952f4edd621a0cb0","observation_id":"c0b6e94a-5c98-4c24-80c0-b41d8a47bda9","resolution":{"observed_at":"2026-08-15T20:42:59.218517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-08-14T06:24:06.038319Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-08-15T20:42:59.221241Z","title":"Adaptive universal generalized pagerank graph neural network","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.221241Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:939fd06c9504a65a6e93acc53a74b11b11629734cfe0cb940554bf1a3bfc8123","observation_id":"e5ac6e05-cc9f-49d4-8edb-3da384d40b0d","resolution":{"observed_at":"2026-08-15T20:42:59.221241Z","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-15T20:42:59.571129Z","title":"Exploiting neighbor effect: Conv-agnostic gnn framework for graphs with heterophily","venue":null,"work_id":"ed7f7fac-4919-4c18-b40b-79f77f3ed0bd","year":2023},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.224376Z"},"links":{"citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:12f1bfac8d63770cda1d240619652c3fdc9c4ac760129973a2d93448fe367c8d","observation_id":"cd30af4d-6b25-4d77-819f-db5751e31479","resolution":{"observed_at":"2026-08-15T20:42:59.574213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.17429","last_updated":"2026-05-01T11:43:42Z","snapshot_observed_at":"2026-08-13T03:45:14.802748Z","submitted_at":"2024-11-26T13:38:12Z","title":"Graph Rewiring in GNNs to Mitigate Over-Squashing and Over-Smoothing: A Survey","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.17429","snapshot_observed_at":"2026-08-15T20:42:59.227186Z","title":"Rewiring techniques to mitigate over- squashing and oversmoothing in gnns: A survey","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.227186Z"},"links":{"cited_paper":"/paper/2411.17429","citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:9766f60c0cef983b1265a3171104a3c55982fcedfee8c9f4c4040de4d2b6db5e","observation_id":"3e9944bf-2e1d-4eff-b106-4d76305c13b3","resolution":{"observed_at":"2026-08-15T20:42:59.227186Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:42:59.230903Z","title":"Deeper insights into graph convolutional networks for semi-supervised learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.230903Z"},"links":{"citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:a7ec73e1f417535d38f7d35bb21771aab4fa2d1ca3cb80cf901c70de48f777fb","observation_id":"31c8d260-80f0-462d-90cb-46789b7f87ab","resolution":{"observed_at":"2026-08-15T20:42:59.230903Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.05205","last_updated":"2021-03-09T11:53:06Z","snapshot_observed_at":"2026-08-15T07:10:22.387933Z","submitted_at":"2020-06-09T12:04:50Z","title":"On the Bottleneck of Graph Neural Networks and its Practical Implications","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.05205","snapshot_observed_at":"2026-08-15T20:42:59.233580Z","title":"On the bottleneck of graph neural networks and its practical implications","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.233580Z"},"links":{"cited_paper":"/paper/2006.05205","citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:8e1329e8e959d40bab867aa19fc80f6f0b09a7f6ff8841356713cf7b27948d04","observation_id":"699420a5-266e-49e7-8df1-e0f6ab42307a","resolution":{"observed_at":"2026-08-15T20:42:59.233580Z","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-15T20:42:59.555052Z","title":"Supervised and semi-supervised diffusion maps with label-driven diffusion","venue":null,"work_id":"e3c356d8-1e82-466e-ac9d-bb69371fba02","year":2025},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.236670Z"},"links":{"citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:d293a908417d82ba67c53dc0f95cffa9e5d0749a63c996b57469499319c9a186","observation_id":"d0ab0083-988f-4cb3-98e0-f514d68e4d03","resolution":{"observed_at":"2026-08-15T20:42:59.558284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T20:42:59.239550Z","title":"Diffusion maps","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.239550Z"},"links":{"citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:b6766fd72ee110ffdbc058185459a2534aa3941c28f466a0f5dc5d6892d77fb9","observation_id":"9b0cf7d7-e261-4e37-addf-0563a507f085","resolution":{"observed_at":"2026-08-15T20:42:59.239550Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05287","last_updated":"2020-02-14T01:47:35Z","snapshot_observed_at":"2026-08-10T23:39:48.575656Z","submitted_at":"2020-02-13T00:03:09Z","title":"Geom-GCN: Geometric Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05287","snapshot_observed_at":"2026-08-15T20:42:59.242403Z","title":"Geom-gcn: Geometric graph convolutional networks","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.242403Z"},"links":{"cited_paper":"/paper/2002.05287","citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:c2b1c20cabc72970abc0c1992b94112e5d36bbed948fadd42364e743c5fd14ed","observation_id":"dedfadda-f5c7-41c2-a76c-1a743b1f22a3","resolution":{"observed_at":"2026-08-15T20:42:59.242403Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.01404","last_updated":"2021-07-05T23:22:02Z","snapshot_observed_at":"2026-08-16T18:34:05.316475Z","submitted_at":"2021-04-03T13:45:06Z","title":"New Benchmarks for Learning on Non-Homophilous Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.01404","snapshot_observed_at":"2026-08-15T20:42:59.245855Z","title":"New benchmarks for learning on non-homophilous graphs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.245855Z"},"links":{"cited_paper":"/paper/2104.01404","citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:0f54324c0d253246840cfc78f5f88770a9f658408ec4bec8299fda1acc4c0fc4","observation_id":"903f9696-7bf5-47bb-a881-9a7dcb0971ce","resolution":{"observed_at":"2026-08-15T20:42:59.245855Z","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-15T20:42:59.538898Z","title":"Neighborhood homophily-based graph convolutional network","venue":null,"work_id":"f6663ec7-d410-478b-bf47-f3e94188b79e","year":2023},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.249421Z"},"links":{"citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:937233df91ee748c6449dec2f3131c3099ddc390257266969bde49814d945cab","observation_id":"d51f4abe-d34b-4711-b702-b4c7e80bf061","resolution":{"observed_at":"2026-08-15T20:42:59.542361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T20:42:59.529240Z","title":"Graph neural networks with heterophily","venue":null,"work_id":"8b7bfb66-3f7b-4b37-b38b-2ca5f55b695f","year":2021},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.252268Z"},"links":{"citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:ce596245438a6420eb2b14c3f8a335fb959e1e3f0ad9e7e7d72ed939f80051e9","observation_id":"99487f57-e0be-46b1-8974-2d759ebb85df","resolution":{"observed_at":"2026-08-15T20:42:59.532399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T20:42:59.520081Z","title":"Powerful graph convolutional networks with adaptive propagation mechanism for homophily and heterophily","venue":null,"work_id":"3a1f9ba8-450c-4d9f-8f32-3eeaf9f16ba9","year":2022},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.255624Z"},"links":{"citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:87f0e6f672f45f82676d1a7073f229cebdf8ccd5594b92722aa2820d735673cf","observation_id":"65bb250e-8478-4773-a654-509649c9d573","resolution":{"observed_at":"2026-08-15T20:42:59.523273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T20:42:59.258666Z","title":"Revisiting over-smoothing and over-squashing using ollivier-ricci curvature","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.258666Z"},"links":{"citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:5d62e5525ded80a8feaffdf09dc2370d26b65f997fa11e2adce75fe55beec888","observation_id":"7c8bf886-6c64-440e-a99c-09965c6fdc39","resolution":{"observed_at":"2026-08-15T20:42:59.258666Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.14522","last_updated":"2022-11-12T16:11:19Z","snapshot_observed_at":"2026-08-16T17:38:39.072995Z","submitted_at":"2021-11-29T13:27:56Z","title":"Understanding over-squashing and bottlenecks on graphs via curvature","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.14522","snapshot_observed_at":"2026-08-15T20:42:59.261554Z","title":"Understanding over-squashing and bottlenecks on graphs via curvature","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.261554Z"},"links":{"cited_paper":"/paper/2111.14522","citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:227aa20234712a1b8a588e63c017917ab98eb90edb7159382621627834a89f7c","observation_id":"ef427f0e-cb06-443b-9fd0-5267563b69f2","resolution":{"observed_at":"2026-08-15T20:42:59.261554Z","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-15T20:42:59.504936Z","title":"Make heterophilic graphs better fit gnn: A graph rewiring approach","venue":null,"work_id":"8974f5a3-69d1-4433-a389-efc29c732082","year":2024},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.264527Z"},"links":{"citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:c5e69819057bf8f062eb234edcc2657084e2dd29a58b0e15ea48fd618404324d","observation_id":"280dab2a-fa46-4a3c-b47f-dc3cdc697cba","resolution":{"observed_at":"2026-08-15T20:42:59.508106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T20:42:59.495296Z","title":"Opengsl: A comprehensive benchmark for graph structure learning","venue":null,"work_id":"62b92b72-b3da-45b9-9559-39a929ec9923","year":2023},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.267820Z"},"links":{"citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:fc58ddc27cd0e8f7da84797c81a1323a8c777fbec007e4f95151cf9dbd488db4","observation_id":"36e59c2c-5b19-49dd-81dc-24f8a74d0b14","resolution":{"observed_at":"2026-08-15T20:42:59.498683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T20:42:59.270593Z","title":"How to learn a graph from smooth signals","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.270593Z"},"links":{"citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:3ed77054e41d6fae8ace6b27ede83657a2f61b9635aed44faceab1aaa73e58de","observation_id":"36fda3bb-a6d3-42ff-a5bf-da854a98f6e5","resolution":{"observed_at":"2026-08-15T20:42:59.270593Z","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-15T20:42:59.477083Z","title":"Measuring and relieving the over-smoothing problem for graph neural networks from the topological view","venue":null,"work_id":"ee210db5-338e-4a6b-adf7-3c9bc337f6da","year":2020},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.273441Z"},"links":{"citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:fceeb6bf451e954d0cbc25cf8d2d2e6de022750736cb4f233d3ea5c57911b5d8","observation_id":"936f372c-94cd-4fe7-be79-a0274ef1e21e","resolution":{"observed_at":"2026-08-15T20:42:59.482139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T20:42:59.276414Z","title":"A fast and high quality multilevel scheme for partitioning irregular graphs","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.276414Z"},"links":{"citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:7aab6d2ee0dcf1f0c522d09363df38bf7404737139860a228ab99f9f43b5321b","observation_id":"739903d7-7d6e-48eb-8f0d-4aeeef575e55","resolution":{"observed_at":"2026-08-15T20:42:59.276414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.11790","last_updated":"2023-02-16T03:22:54Z","snapshot_observed_at":"2026-08-17T02:03:44.819103Z","submitted_at":"2022-10-21T07:58:03Z","title":"FoSR: First-order spectral rewiring for addressing oversquashing in GNNs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.11790","snapshot_observed_at":"2026-08-15T20:42:59.279541Z","title":"Fosr: First-order spectral rewiring for addressing oversquashing in gnns","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.279541Z"},"links":{"cited_paper":"/paper/2210.11790","citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:c138653b00a1b568779158e72cb660562d19d211524d74f9c0713e04dff00618","observation_id":"922472c3-e29a-49e2-87b9-3918d2925a08","resolution":{"observed_at":"2026-08-15T20:42:59.279541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-17T10:49:36.026134Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-15T20:42:59.282665Z","title":"Semi-supervised classification with graph convolutional networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.282665Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:6fc2dfab35ebf8427863b5763520fdbbb15eb63d895af6640f29f40c6d5c65a1","observation_id":"f42643d0-e170-48d3-b29b-3ff6c05f8558","resolution":{"observed_at":"2026-08-15T20:42:59.282665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.14491","last_updated":"2022-01-31T07:20:20Z","snapshot_observed_at":"2026-07-06T11:14:04.454155Z","submitted_at":"2021-05-30T10:17:58Z","title":"How Attentive are Graph Attention Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.14491","snapshot_observed_at":"2026-08-15T20:42:59.285500Z","title":"How attentive are graph attention networks?arXiv preprint arXiv:2105.14491, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.285500Z"},"links":{"cited_paper":"/paper/2105.14491","citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:5a13cc80b3e830277a458aa1b7b83499bdb3f24c523e652e4b87d54a51489acf","observation_id":"b4248f81-33fc-4be0-9563-bb27542e4d1b","resolution":{"observed_at":"2026-08-15T20:42:59.285500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-18T15:06:05.060057Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-15T20:42:59.288593Z","title":"Predict then propagate: Graph neural networks meet personalized pagerank","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.288593Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:9c9311a0882892012aa400041e500963bd9ad2c54cf8fa5aae5c917c55d8fc8c","observation_id":"62623255-dc0c-4bd3-b032-6c32aef07422","resolution":{"observed_at":"2026-08-15T20:42:59.288593Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.01524","last_updated":"2023-02-03T03:38:50Z","snapshot_observed_at":"2026-08-16T15:58:01.043558Z","submitted_at":"2023-02-03T03:38:50Z","title":"Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.01524","snapshot_observed_at":"2026-08-15T20:42:59.291674Z","title":"Ordered gnn: Ordering message passing to deal with heterophily and over-smoothing.arXiv preprint arXiv:2302.01524, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.291674Z"},"links":{"cited_paper":"/paper/2302.01524","citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:1c79a6d42a7ff4fc651f67872b38603ae6940849f4288e8e92eed570ddf702c8","observation_id":"18771e54-1453-44cf-8bfc-82060b0763cb","resolution":{"observed_at":"2026-08-15T20:42:59.291674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.01102","last_updated":"2024-05-24T08:53:13Z","snapshot_observed_at":"2026-08-17T10:59:39.890994Z","submitted_at":"2024-05-02T09:12:22Z","title":"Less is More: on the Over-Globalizing Problem in Graph Transformers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.01102","snapshot_observed_at":"2026-08-15T20:42:59.294914Z","title":"Less is more: on the over- globalizing problem in graph transformers","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.294914Z"},"links":{"cited_paper":"/paper/2405.01102","citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:1c11a835bc64a7f071eebd65a3f49dc1d4ef2d85c6f46f3e771f1d75858b9560","observation_id":"3b602006-d338-45d4-9031-dfe509018104","resolution":{"observed_at":"2026-08-15T20:42:59.294914Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11640","last_updated":"2024-03-02T21:17:13Z","snapshot_observed_at":"2026-08-16T15:53:25.866662Z","submitted_at":"2023-02-22T20:32:59Z","title":"A critical look at the evaluation of GNNs under heterophily: Are we really making progress?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.11640","snapshot_observed_at":"2026-08-15T20:42:59.298147Z","title":"T/O\" indicates a timeout and","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:59.298147Z"},"links":{"cited_paper":"/paper/2302.11640","citing_paper":"/paper/2505.12411"},"observation_digest":"sha256:0cfbfb8bb3dd4bc0c9db55a508947c52b11ae98dc3e0af7c51ef11bbc9d49195","observation_id":"f54086ed-e992-4750-821b-02e669d35b40","resolution":{"observed_at":"2026-08-15T20:42:59.298147Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.12411","last_updated":"2025-05-18T13:28:56Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T04:15:10.598586Z","submitted_at":"2025-05-18T13:28:56Z","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":0,"verified_fuzzy":12},"total_outbound_references":34},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2505.12411."}