{"as_of":"2026-08-18T09:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7de6ce7fd6788a8e17a923f1889ede9976894cb5e44fc1eb067d19c6af36c501","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T18:02:52.520522Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"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/2412.08310/citation-record","integrity":"/paper/2412.08310/integrity","json":"/paper/2412.08310/citation-record.json","paper":"/paper/2412.08310"},"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-11T18:02:53.558023Z","title":"Beyond homophily in graph neural networks: Current limitations and effective designs","venue":null,"work_id":"8c2cdaed-dd76-48f2-be66-165c0246ac13","year":2020},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.332916Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:2da9c588637073f5845fc6dbca88dfd4c1a080f0ce9468742b38b78dc15cf4f0","observation_id":"7bb39287-d058-49ff-9ed0-a84054a8a0be","resolution":{"observed_at":"2026-08-11T18:02:53.563630Z","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":"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-11T18:02:52.340291Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.340291Z"},"links":{"cited_paper":"/paper/2202.07082","citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:da0726132ca99e2cbe9a2cc8a6ae2ec4e33cb8a028ee6c041b3f3a678b86d427","observation_id":"352b8467-7689-4cf2-b172-7688987aed8d","resolution":{"observed_at":"2026-08-11T18:02:52.340291Z","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":"2024.34599","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:53.121976Z","title":"Es-gnn: Generalizing graph neural networks beyond homophily with edge splitting","venue":null,"work_id":"6e824f8a-8d25-4ef5-8654-211091bdebed","year":2024},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.347480Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:8aede4158bd59bdabdae19d4c4a09465a2bd1a7be41240c2ca1648ded0b352cd","observation_id":"76a08507-4c53-4f2d-be0c-f4d9f6044e88","resolution":{"observed_at":"2026-08-11T18:02:53.133499Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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-11T18:02:53.536671Z","title":"Revisiting heterophily for graph neural networks","venue":null,"work_id":"caaaabae-487a-4d9d-899d-a389df7d80b2","year":2022},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.354156Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:265a4b54bf821addb5e19561369f1a49a0db17932d80aea4554dfbe0a95f4f27","observation_id":"fce212f0-e81e-40d3-85af-aabe941c6de0","resolution":{"observed_at":"2026-08-11T18:02:53.542763Z","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-11T18:02:53.516346Z","title":"Is homophily a necessity for graph neural networks? In The Tenth International Conference on Learning Representations, ICLR 2022, Virtual Event, April 25-29, 2022","venue":null,"work_id":"bafa07e0-4cda-4d9e-a6a8-f78d696c2d5a","year":2022},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.359949Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:11a2dbb5bfee93bcc9e78a62c0ac83799d415c9c573ad8237e6b732bd46846a8","observation_id":"b09435bf-d5d5-4c8e-b3b4-2cbb881241c8","resolution":{"observed_at":"2026-08-11T18:02:53.522474Z","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":"2106.04051","last_updated":"2021-06-08T02:07:21Z","snapshot_observed_at":"2026-08-18T04:29:11.129321Z","submitted_at":"2021-06-08T02:07:21Z","title":"Graph-MLP: Node Classification without Message Passing in Graph","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.04051","snapshot_observed_at":"2026-08-11T18:02:52.366261Z","title":"Graph-MLP: Node classification without message passing in graph","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.366261Z"},"links":{"cited_paper":"/paper/2106.04051","citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:ae84b53ecf83dbfc2ce6d4d4b676c0e1e360312f8b97c79a862efdc566f6e775","observation_id":"a1f2740a-7766-4d95-8faf-c31d496a32bd","resolution":{"observed_at":"2026-08-11T18:02:52.366261Z","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-11T18:02:53.492581Z","title":"Graph attention retrospective","venue":null,"work_id":"ec9b832b-4bea-41b6-ad07-961f6fe58d6b","year":2023},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.373418Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:597ef515005bbe0404fd7b9b55424bdcfabd3eacd2d974c361dfd305452bca66","observation_id":"37868d39-01ef-48fa-aa96-00cdc5b3db68","resolution":{"observed_at":"2026-08-11T18:02:53.500599Z","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-11T18:02:53.471657Z","title":"Kipf and Max Welling","venue":null,"work_id":"de778adf-38fa-4ba6-a218-ee293bcd0915","year":2017},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.378596Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:a3a4adb52b4b6788fa12cd5596d88423828dc16cf56eedfe33e6c19ecb3dccc0","observation_id":"afc9e4c9-9a1e-485b-a116-be0c038b509d","resolution":{"observed_at":"2026-08-11T18:02:53.478211Z","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-11T18:02:53.448415Z","title":"Souza Jr., Tianyi Zhang, Christopher Fifty, Tao Yu, and Kilian Q","venue":null,"work_id":"acb248a9-cb02-419a-ab5f-3fc4f5a5ba41","year":2019},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.383916Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:e9da69db7b33becfaa34950af913f0578611a09c8b4d643e362920243f861350","observation_id":"0791b9cb-d8ba-4733-8a0d-ef43305eb12c","resolution":{"observed_at":"2026-08-11T18:02:53.456148Z","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-11T18:02:53.427378Z","title":"Graph attention networks","venue":null,"work_id":"dafc2b03-7789-42b6-92ee-ea04dfa4fbb4","year":2018},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.393247Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:c632e6da1f2901a933bce3c779c699d0082054335e57c9ae0d76e5112b8717aa","observation_id":"a9a48f49-62a7-4481-aaa3-327737ce36cd","resolution":{"observed_at":"2026-08-11T18:02:53.434176Z","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-11T18:02:53.405233Z","title":"Hamilton, Zhitao Ying, and Jure Leskovec","venue":null,"work_id":"7662a293-20a6-4544-bf5f-8bc46da22862","year":2017},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.402963Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:fc04a7baa9a8303d1250e491c97a16a8e9dfa8ef972c9db93c7da7c533c51d39","observation_id":"c5adfd24-55c4-4444-bbba-1dba428a14c5","resolution":{"observed_at":"2026-08-11T18:02:53.411478Z","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-11T18:02:53.378551Z","title":"Schaub, and Danai Koutra","venue":null,"work_id":"7add2d71-dd37-4e29-9b19-70230d26d809","year":2023},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.409676Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:7fa0624c1164acb75ff7efbf8b61e50ab04fd48efb607b0f0620c7245814a8b7","observation_id":"603fd9c5-5d24-485f-baf4-37139f1c632b","resolution":{"observed_at":"2026-08-11T18:02:53.387500Z","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-11T18:02:53.359998Z","title":null,"venue":null,"work_id":"d39b298b-0202-4102-8ae0-458624bda3f0","year":2023},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.416379Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:266d575deec368f979aad126c507371c4048fe74f5bc2afb8acbfb89e6ea3126","observation_id":"1c823543-5e25-4631-bb56-208602596d6c","resolution":{"observed_at":"2026-08-11T18:02:53.366561Z","resolver_source":"raw_fallback","status":"unresolved"},"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-11T18:02:53.339644Z","title":"MixHop: Higher-order graph convolutional architectures via sparsified neighborhood mixing","venue":null,"work_id":"21cb9108-ba82-46ce-9bd9-9e6cafc497a6","year":2019},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.424870Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:dce0c672da33785e434e55a9acf1740796e2d52fb9c782edd22fd862a781d2b4","observation_id":"0897f678-d477-4291-b866-08b4276fc010","resolution":{"observed_at":"2026-08-11T18:02:53.345437Z","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-11T18:02:52.432503Z","title":"Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.432503Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:da45d8f8ec82b6d2c4cdd326a830ca428d2e66849b324b4604655cf02fe3a282","observation_id":"3a881136-290b-4d2e-bf6f-f8565eaed863","resolution":{"observed_at":"2026-08-11T18:02:52.432503Z","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-11T18:02:53.320987Z","title":"Adaptive universal generalized pagerank graph neural network","venue":null,"work_id":"7f9245eb-1fad-43a1-8ea3-551ffbb68d7c","year":2021},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.439990Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:ad2c18982e0c16c56cebd91db9e134d29cc00498c3e2d931ea4ea5b0a999678b","observation_id":"4f9829d7-728b-4f7f-89dd-c59de0c01e28","resolution":{"observed_at":"2026-08-11T18:02:53.327230Z","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-11T18:02:52.447667Z","title":"Neighborhood pattern is crucial for graph convolutional networks performing node classification","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.447667Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:c144fbd065c96a43d9bfba713a09616316ab7345c2b6d17c91506186d2fe31d0","observation_id":"5a5e5c65-8fb6-49fa-abfa-7d93e9fddf58","resolution":{"observed_at":"2026-08-11T18:02:52.447667Z","resolver_source":null,"status":"malformed_identifier"},"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-11T18:02:53.300335Z","title":"Label-wise graph convolutional network for heterophilic graphs","venue":null,"work_id":"fcfb1348-419f-4a4f-b83f-6d51681afd0d","year":2022},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.452841Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:a6aa773e6dc94a5d4217517ca84faa5a27afe8ce8fda358939c381807c433598","observation_id":"dc596517-8027-43ab-8145-3f06ce80888c","resolution":{"observed_at":"2026-08-11T18:02:53.306897Z","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-11T18:02:52.458762Z","title":"GBK-GNN: gated bi-kernel graph neural networks for modeling both homophily and heterophily","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.458762Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:f4a1456684ab1d157794f986d6185ec5e0da0fa62245249fd2e4ba5401f0e0d1","observation_id":"c7eb5e3c-21ea-4d1b-b1de-5b39332400e7","resolution":{"observed_at":"2026-08-11T18:02:52.458762Z","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-11T18:02:53.275314Z","title":"Bronstein","venue":null,"work_id":"1b17af66-53e9-4187-a495-2e103b9b3c50","year":2023},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.467811Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:cb6588ae5c19d9adf48fbe472c720b702202852b1bc2abae4950b07e7b0626b5","observation_id":"deca33eb-8a87-4a92-bb3c-987c97d8ba44","resolution":{"observed_at":"2026-08-11T18:02:53.281821Z","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-11T18:02:53.253760Z","title":"Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods","venue":null,"work_id":"9254cfba-cf66-4ff0-921e-429ca5e14a23","year":2021},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.473617Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:205e5b41b303902819255e8662f7fad3c97aba8976f1072d594afdc42f3ef5ac","observation_id":"1f570b9f-844d-4a53-9009-7c419231ce5e","resolution":{"observed_at":"2026-08-11T18:02:53.260700Z","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-11T18:02:53.232919Z","title":"Geom-GCN: Geometric graph convolutional networks","venue":null,"work_id":"87963355-9c5d-431d-8f10-86cafa05862d","year":2020},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.480023Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:491aed9c38e299162215a24ba9f3178c4e8b96da6a991098b3c2c3963f00544b","observation_id":"9620462c-3c2b-4205-a124-519183a5e3c6","resolution":{"observed_at":"2026-08-11T18:02:53.239009Z","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-11T18:02:53.210664Z","title":"Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods","venue":null,"work_id":"46bbd438-1e98-447f-b597-0e7ed775518d","year":2021},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.487927Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:25c7690c530ed821feb38a782c9a70b3a011270425d8263d7fed57db3643c65b","observation_id":"7d9d63a7-5a39-41b7-81ef-02fbc875f100","resolution":{"observed_at":"2026-08-11T18:02:53.217425Z","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-11T18:02:53.188682Z","title":"Characteriz- ing graph datasets for node classification: Homophily-heterophily dichotomy and beyond","venue":null,"work_id":"198fbbd7-8512-4b6b-9c91-e079b47a701d","year":2023},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.498621Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:386171529b07d2cfc6d699078060d04d119d940d56bee09d02568f5764382764","observation_id":"7b0be902-b0ef-4ebc-9262-ecb7f118eace","resolution":{"observed_at":"2026-08-11T18:02:53.195605Z","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-11T18:02:52.507653Z","title":"Collective classification in network data","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.507653Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:df29a6b8ce396ff339ab7334527bed3815632f477aa05f22ef67aa970d916d49","observation_id":"437dfa2c-df45-4757-b59f-ef6462ec0b6b","resolution":{"observed_at":"2026-08-11T18:02:52.507653Z","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-11T18:02:53.169935Z","title":null,"venue":null,"work_id":"c24eaeaa-f5fa-49e9-868e-9e3b200d2710","year":2023},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.514254Z"},"links":{"citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:6ae90666a15fb4dfed7600312abc906ccf639d2bb3e3214e92d177e9f9cd7e2d","observation_id":"6202044c-e955-4824-ba68-3d04d7cb921d","resolution":{"observed_at":"2026-08-11T18:02:53.175724Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"1811.05868","last_updated":"2019-06-18T13:15:39Z","snapshot_observed_at":"2026-08-14T17:59:20.424546Z","submitted_at":"2018-11-14T15:53:19Z","title":"Pitfalls of Graph Neural Network Evaluation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.05868","snapshot_observed_at":"2026-08-11T18:02:52.520522Z","title":"Pitfalls of graph neural network evaluation","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T18:02:52.520522Z"},"links":{"cited_paper":"/paper/1811.05868","citing_paper":"/paper/2412.08310"},"observation_digest":"sha256:873b3ef6f23f0fb547c35c770c089ca486992f95e5700116da8028ca849085a6","observation_id":"db326944-fd5f-4832-8e40-da0fcc52bce8","resolution":{"observed_at":"2026-08-11T18:02:52.520522Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.08310","last_updated":"2024-12-11T11:44:55Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T19:15:31.557485Z","submitted_at":"2024-12-11T11:44:55Z","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":2,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":17},"total_outbound_references":27},"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 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2412.08310."}