{"as_of":"2026-08-14T15:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e0e372c730abc9f6309bcd761e0e791a84f6a35a3ef212883b3a77e9eba0c2ea","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T17:44:04.365585Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2411.12330/citation-record","integrity":"/paper/2411.12330/integrity","json":"/paper/2411.12330/citation-record.json","paper":"/paper/2411.12330"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1811.05868","last_updated":"2019-06-18T13:15:39Z","snapshot_observed_at":"2026-08-10T09:46:29.797564Z","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-12T17:44:04.245807Z","title":"Pitfalls of Graph Neural Network Evaluation","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.245807Z"},"links":{"cited_paper":"/paper/1811.05868","citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:9fb7801a4152c846135bcdcded78ee8d3ec658edeb1bd9b289d3617be224505e","observation_id":"6f6ed45e-92ec-4cc2-bbda-1b8a62f802dc","resolution":{"observed_at":"2026-08-12T17:44:04.245807Z","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-12T17:44:05.200967Z","title":"Simple and deep graph convolutional networks","venue":null,"work_id":"05e0ef2f-b1f3-4eee-9b2b-e53420366b85","year":2020},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.249854Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:485066c523662bbec0c946264e77d649a63e5da4f4093dc92e497cd7eb6e1f5f","observation_id":"08c1a047-3c04-4896-951f-de1b55833cc4","resolution":{"observed_at":"2026-08-12T17:44:05.203455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:04.253006Z","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":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.253006Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:bdc4d83299e32163ad8eeab76d60e3559d7feff6b8e23842315a90d52dddf659","observation_id":"a153586a-8389-4fc4-8e7c-f8ed8e1b8842","resolution":{"observed_at":"2026-08-12T17:44:04.253006Z","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-12T17:44:04.257076Z","title":"Are we really making much progress? A worrying analysis of recent neural recommendation approaches","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.257076Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:f3f1327a4c6d1c4d2b86412f5f759847dd564d80dbf5021b5517935793f8d0d3","observation_id":"d060ed7b-303c-4029-9b86-9c4356b84ab5","resolution":{"observed_at":"2026-08-12T17:44:04.257076Z","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-12T17:44:05.192837Z","title":"Predict then propagate: Graph neural networks meet personalized pagerank","venue":null,"work_id":"20510a2a-5549-414f-ace0-817ef2eaff5f","year":2019},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.260122Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:8ee507c1581baab80d975670864dc6d3f9454b6c4ee1612c4ba2161436dea16f","observation_id":"9d59f4f0-440d-4722-a7ef-30900aa1acf2","resolution":{"observed_at":"2026-08-12T17:44:05.196036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:04.263178Z","title":"Homophily-oriented heterogeneous graph rewiring","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.263178Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:dedbfbaaab079ac2b55af1dcf61465e88578c16d4f8b82231db6e670fff0c7be","observation_id":"182b1447-9f51-4b7b-bdda-062181481985","resolution":{"observed_at":"2026-08-12T17:44:04.263178Z","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-12T17:44:05.184542Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":"1454d81c-a183-41b9-9247-24b6b43fbc18","year":2017},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.266594Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:169a407952a8f8d2e612ef717f1a447279bdd27c89fed3be64cd33c3a636dabe","observation_id":"f1131dbf-07a4-4a97-b3fb-fc7c40b73b0f","resolution":{"observed_at":"2026-08-12T17:44:05.187551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:04.269386Z","title":"Lightgcn: Simplifying and powering graph convolution network for recommendation","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.269386Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:004ba7def25502a5f870d517aa327c269a21600a930143af8f638f4986321bca","observation_id":"e5340c95-51a5-4a73-ab7a-d3ff854a95c5","resolution":{"observed_at":"2026-08-12T17:44:04.269386Z","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-12T17:44:05.176253Z","title":"Open graph benchmark: Datasets for machine learning on graphs","venue":null,"work_id":"4b000b90-db10-48c3-a9f2-6aa39aa3a636","year":2020},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.272213Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:ce586c1dc9b462806233d4e9ef954f0ccc204192cc184e8be1dc0a9cd27f7cb2","observation_id":"a8a6fd0f-9dc3-471c-acdd-3b7dad3a599b","resolution":{"observed_at":"2026-08-12T17:44:05.179367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.13993","last_updated":"2020-11-02T19:42:34Z","snapshot_observed_at":"2026-08-13T09:50:17.403129Z","submitted_at":"2020-10-27T02:10:52Z","title":"Combining Label Propagation and Simple Models Out-performs Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.13993","snapshot_observed_at":"2026-08-12T17:44:04.275164Z","title":"Combining label propagation and simple models out-performs graph neural networks","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.275164Z"},"links":{"cited_paper":"/paper/2010.13993","citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:e433f341d57c70a20a8f68e38d99df218349fdf8340ecee09f2d432b3946c230","observation_id":"d531ef59-9f29-4180-bcb1-78799c8d397c","resolution":{"observed_at":"2026-08-12T17:44:04.275164Z","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-12T17:44:05.167751Z","title":"Semi-supervised classification with graph convolutional networks","venue":null,"work_id":"821e2c30-8a30-4eb1-bf2c-90adf867c088","year":2017},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.278362Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:9d4f5fcccd71453ab5750c3bb3f1ec7469118f12b2be0d17e7c7085bce142280","observation_id":"ede39c45-d254-4320-a0a5-d7bebadfcac9","resolution":{"observed_at":"2026-08-12T17:44:05.171108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:04.281147Z","title":"Deeper insights into graph convolutional networks for semi-supervised learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.281147Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:589644b9662c9ba906bc20c2abe5925ecd40cd33a2a7f8a94d1323cc7fb83f47","observation_id":"6c756ae4-b078-4b71-b564-82fa00a2e12f","resolution":{"observed_at":"2026-08-12T17:44:04.281147Z","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":"10.1007/978-3-030-86520-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-13T11:03:48.094449Z","title":"Beyond low-pass filters: Adaptive feature propagation on graphs","venue":"Lecture notes in computer science","work_id":"1a527224-2244-4dad-9097-936f7f396390","year":2021},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.284124Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:80f9bd8f538ce7b63db05712b4ce794de546a8df17d58d09c232115da1da8808","observation_id":"84e8496c-db64-4c94-8160-a7846ad17f85","resolution":{"observed_at":"2026-08-12T17:44:04.401137Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:05.159200Z","title":"Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods","venue":null,"work_id":"d38d6f5c-185f-422e-b758-4ae665ac5d8a","year":2021},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.287384Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:c760929d4276319f7e260552d42573c610d8b40582463c67e5122f989d878bd0","observation_id":"c19c3906-11ea-491c-969b-86cd560ffec1","resolution":{"observed_at":"2026-08-12T17:44:05.162626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.01404","last_updated":"2021-07-05T23:22:02Z","snapshot_observed_at":"2026-08-03T15:31:44.975031Z","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-12T17:44:04.290058Z","title":"New benchmarks for learning on non-homophilous graphs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.290058Z"},"links":{"cited_paper":"/paper/2104.01404","citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:e2905c92fecec134bee6793cbf6de8cf01637413961c9c2caf25a53d40221bc7","observation_id":"96fa3e51-86d3-4fa4-846d-fd40ff3c3c42","resolution":{"observed_at":"2026-08-12T17:44:04.290058Z","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-12T17:44:05.151168Z","title":"Semi-supervised classification of network data using very few labels","venue":null,"work_id":"acc87a18-0cc6-4f81-bee0-16bc5c4d9df6","year":2010},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.293076Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:cfaed2a46054d822a0cf4ff1b56ab1e485157e7826ee71a827edd2c8196d11a4","observation_id":"2224a48d-5b48-4ca9-818c-a7cc659433e2","resolution":{"observed_at":"2026-08-12T17:44:05.154048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:05.142890Z","title":"Troubling trends in machine learning scholarship: Some ml papers suffer from flaws that could mislead the public and stymie future research","venue":null,"work_id":"c41c72bb-e42c-4dd1-b364-b888f093af81","year":2019},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.295313Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:26f189c134ab487178ba8e893ddd4cb7b000f3c188465f99281647a3dc69e774","observation_id":"db52db31-e869-484f-a288-8752a1a14a26","resolution":{"observed_at":"2026-08-12T17:44:05.146027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:05.134906Z","title":"Taxonomy of benchmarks in graph representation learning","venue":null,"work_id":"a1fa4e3e-2064-4765-a8ba-a4234dd55d74","year":2022},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.297812Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:10a5fb989f41c45af25c219535ae2b2c67b4beba86a3917d811b483a895231be","observation_id":"54888d18-9477-43bd-a231-3cacacafb77a","resolution":{"observed_at":"2026-08-12T17:44:05.137806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:05.126504Z","title":"Graph neural networks with adaptive residual","venue":null,"work_id":"67d7aea5-bd91-4efa-8b23-8184153540fd","year":2021},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.300040Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:f2c2a6c1fab313fc458f9718bf718534e2b3de2a3a0037c217425cb169f73d2c","observation_id":"6a8a1720-33c4-46d9-b552-92cbcda7c09c","resolution":{"observed_at":"2026-08-12T17:44:05.129980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:04.302356Z","title":"Meta-weight graph neural network: Push the limits beyond global homophily","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.302356Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:b7e5e2a700225ca6cf24d5122cacb42517b050cc3b5aedf69f523b6b6c40311e","observation_id":"d1a2752e-7a54-4115-a2bd-446ee8b35e82","resolution":{"observed_at":"2026-08-12T17:44:04.302356Z","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-12T17:44:05.118738Z","title":"A simple relational classifier","venue":null,"work_id":"2f5b9db2-a0e3-416c-95bd-98f361190ee1","year":2003},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.304833Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:d175998bf4d23c6d4728ea38ed36f3c8c0b5c8ce520d5f88d90909e1d52bfcef","observation_id":"10a5ed22-d445-4e56-9696-58241be6efdb","resolution":{"observed_at":"2026-08-12T17:44:05.121472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:05.111228Z","title":"Beyond real-world benchmark datasets: An empirical study of node classification with gnns","venue":null,"work_id":"d2d7f0c0-6d38-4406-ad2d-4d14c2bed4d6","year":2022},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.307130Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:5aab4ac2520fc6e7eb67a730b607d6fe7f0aca2bc89941dcc7b5c01ae9c3210c","observation_id":"5ec6c2c5-72ab-4431-91f4-91fa0a58a417","resolution":{"observed_at":"2026-08-12T17:44:05.113675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:04.309486Z","title":"Ultragcn: ultra simplification of graph convolutional networks for recommendation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.309486Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:1744e59f16a29b60e38f5fdb23f0bc672abfaa41b018f8c61c61ba21ebdd1a63","observation_id":"79684b59-e0d9-4b1b-b9f6-df28e2c5bad0","resolution":{"observed_at":"2026-08-12T17:44:04.309486Z","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-12T17:44:04.312221Z","title":"Image-based recommendations on styles and substitutes","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.312221Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:0629103764c9f8d7eeb27a70e7ba8ecd4b8dc2091b1c1749cabb2ea69d298227","observation_id":"7845c108-a788-4bcf-afd3-9b9298bc4170","resolution":{"observed_at":"2026-08-12T17:44:04.312221Z","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-12T17:44:05.104119Z","title":"Iterative classification in relational data","venue":null,"work_id":"aa800170-0f48-4c35-8bff-c5ca16bcb235","year":2000},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.315334Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:1863bb5d71a6aab16e9e38a212efab28293e1d195b16c9fab778e2ed82fa7bde","observation_id":"1e5a24e3-aac3-4f2d-8d06-2e83ebd3a913","resolution":{"observed_at":"2026-08-12T17:44:05.106613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:04.318163Z","title":"GraphWorld : Fake Graphs Bring Real Insights for GNNs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.318163Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:76b15dbe2f682396398d54f8691d79cad325cc1831262c365b8120ca7be4e6d6","observation_id":"cb249ff7-1bcf-4d55-b0cf-08ce3d1e1623","resolution":{"observed_at":"2026-08-12T17:44:04.318163Z","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-12T17:44:05.097130Z","title":"Geom-gcn: Geometric graph convolutional networks","venue":null,"work_id":"14700c1e-8908-4126-b0da-8c6cee4da3ae","year":2020},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.320843Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:2c621c2ffdefe1407350b32b4a4a37983251ecf7f2f72b178e3ef003899ae2a3","observation_id":"08db9b8a-c87d-4441-8cb4-6c5de044bb07","resolution":{"observed_at":"2026-08-12T17:44:05.099597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:05.089149Z","title":"A critical look at the evaluation of gnns under heterophily: Are we really making progress? In The Eleventh International Conference on Learning Representations, 2023","venue":null,"work_id":"b1077ad4-9b8e-4354-9852-a46de510ba4b","year":2023},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.323680Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:e89aa1e2ac01fbefbfcc1f029f40433752b2e4ac4d4c59a39bf8208542c4d323","observation_id":"acf8b14c-847a-42a0-b399-6cae15a344df","resolution":{"observed_at":"2026-08-12T17:44:05.092320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:05.080687Z","title":"Near linear time algorithm to detect community structures in large-scale networks","venue":null,"work_id":"5f044ec7-0fda-48cd-a207-f41b06df6978","year":2007},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.326506Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:dc5668fc8598b0de11c915583e9b17af654fb2986a2be7614f700c125c3a87f7","observation_id":"f738e325-093f-497b-9c2f-4bc694845ff6","resolution":{"observed_at":"2026-08-12T17:44:05.083704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:05.072951Z","title":"Graph attention networks","venue":null,"work_id":"df20e962-03e1-41ec-a267-d5cda60e8a3c","year":2018},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.329279Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:0d9ca9dd9ded16385fed30c52155d14c8b8aff823b37d014ab45ae5b92af8ad0","observation_id":"91418ec2-2d1c-4144-b6c6-20bb82c02c21","resolution":{"observed_at":"2026-08-12T17:44:05.075538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T17:44:04.550142Z","title":"Label information enhanced fraud detection against low homophily in graphs","venue":null,"work_id":"218ee9cb-edf3-4eaa-a7fb-b20570a5f3b3","year":2023},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.332014Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:77a9f47909839051e8fb078eb9aa4b25eb12dd04f58aa87ea1f0bae9689c57dd","observation_id":"a4446488-c175-4fb6-a709-71a71de2b48f","resolution":{"observed_at":"2026-08-12T17:44:04.552819Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:05.064664Z","title":"Simplifying graph convolutional networks","venue":null,"work_id":"4cdeba00-fdcf-4f8b-9810-216f15f707ec","year":2019},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.334736Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:db6799d068513491c623854aaa6935c8baf852542e726f93dc025d238f456171","observation_id":"baa9e45d-779c-497b-9ae2-aa44769f1fa1","resolution":{"observed_at":"2026-08-12T17:44:05.067736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:04.337800Z","title":"Learning to augment graph structure for both homophily and heterophily graphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.337800Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:d081240120b9d6cd4ee8af82e0b139af0db54df22eb92d55e634d1013f42ae32","observation_id":"c3b514c2-07e9-49fe-a354-3439d7c09bc3","resolution":{"observed_at":"2026-08-12T17:44:04.337800Z","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-12T17:44:04.340657Z","title":"A comprehensive survey on graph neural networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.340657Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:a970210bd273facc4f0878ab1c9cfc735c56a5589214a18f6a7d70672b5e9b40","observation_id":"05d4d01b-6d27-471a-ac9a-24f591f310cf","resolution":{"observed_at":"2026-08-12T17:44:04.340657Z","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-12T17:44:05.055974Z","title":"Representation learning on graphs with jumping knowledge networks","venue":null,"work_id":"ead2d08c-85a7-4409-b83e-6ac6a2c743cf","year":2018},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.343395Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:842f84f33586ee0e3c5b69ee51cd0f886580d87c2881a91ea9df651389856b05","observation_id":"9448bdcc-5575-4a58-aed2-49f527e4c996","resolution":{"observed_at":"2026-08-12T17:44:05.059185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:05.047306Z","title":"Revisiting semi-supervised learning with graph embeddings","venue":null,"work_id":"2571a036-2d43-4c5a-a9c3-fd6e819b1523","year":2016},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.346289Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:0db586f73fbd27fa021be6cbb4af7ac42c43c5f7e5f6eec5a12a2eaae0909f7c","observation_id":"d5493056-9c00-44fc-94b3-b084d58191c4","resolution":{"observed_at":"2026-08-12T17:44:05.050261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:05.038682Z","title":"Design space for graph neural networks","venue":null,"work_id":"73e7f70b-de25-471f-a11b-c6c9f2309a87","year":2020},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.349029Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:fe6bdea2146c78a1026e1585c53c9e8d6c8b2ba057fc3b347af6bcf25defc3fa","observation_id":"859a5553-46b5-482c-bcf8-6019909a0913","resolution":{"observed_at":"2026-08-12T17:44:05.041771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:04.351816Z","title":"To join or not to join: the illusion of privacy in social networks with mixed public and private user profiles","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.351816Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:e06a67561c12a2ecd2d36ad9ba0d7c35b9a1913b96e7cb68a319711ee14edc77","observation_id":"4f501487-1828-454b-9504-b261e227dff4","resolution":{"observed_at":"2026-08-12T17:44:04.351816Z","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-12T17:44:05.029917Z","title":"Simplifying node classification on heterophilous graphs with compatible label propagation","venue":null,"work_id":"4e8053e2-7d33-4bb7-b58c-9d5b53e87394","year":2022},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.354592Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:f46acd5f7a80160f527475e32ff59217a0d0bfbea2234455a799845bd70cd70a","observation_id":"c1000f1c-184e-4582-b833-3997d216157a","resolution":{"observed_at":"2026-08-12T17:44:05.033113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:04.357203Z","title":"Graph neural networks: A review of methods and applications","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.357203Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:b170a68f6ff48ed8d657f285c505630e9b2daecbd369ce8d4add7767b771240d","observation_id":"71ad0133-2bc4-4991-b06c-3fee2564cf04","resolution":{"observed_at":"2026-08-12T17:44:04.357203Z","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-12T17:44:05.021350Z","title":"Beyond homophily in graph neural networks: Current limitations and effective designs","venue":null,"work_id":"82b0684c-149e-4e24-a2f6-4815af18d7ba","year":2020},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.360321Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:8aab24c9904c7b89b2506e3de82a6325247b3d1ea7f669734a5da384ce69e9b4","observation_id":"3c4fb123-6c31-4b9a-9de8-d38a92470535","resolution":{"observed_at":"2026-08-12T17:44:05.024408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:05.012637Z","title":"Semi-supervised learning with graphs","venue":null,"work_id":"db4f61bf-b80a-4553-8092-fdf7bcf8b7e1","year":2005},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.363008Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:81f65c45910dc4460f1f1320547b0ae5d16ed8c6f4574b07a9dd7f925f678316","observation_id":"f3f30270-4c73-4012-b4e3-dbad7f89a37a","resolution":{"observed_at":"2026-08-12T17:44:05.015819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T17:44:04.365585Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:04.365585Z"},"links":{"citing_paper":"/paper/2411.12330"},"observation_digest":"sha256:8ff977ff608646ca74bcd0c6fecf02dd53d18fe44f169e6b5681eb27c70d9be7","observation_id":"9cdd9e88-7045-487b-adb7-5732146baeea","resolution":{"observed_at":"2026-08-12T17:44:04.365585Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.12330","last_updated":"2024-11-19T08:32:14Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T17:36:51.630189Z","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":2,"verified_fuzzy":24},"total_outbound_references":43},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2411.12330."}