{"url":"/dataset/texas-60-20-20-random-splits-1","name":"Texas(60%/20%/20% random splits)","full_name":null,"description_markdown":"Node classification on Texas with 60%/20%/20% random splits for training/validation/test.","description_withheld":null,"homepage":"","introduced_date":"2022-10-14","introduced_date_note":null,"introduced_by":null,"license":null,"modalities":[{"name":"Graphs","url":"/datasets/modality/graphs"}],"tasks":[{"name":"Node Classification on Non-Homophilic (Heterophilic) Graphs","url":"/task/node-classification-on-non-homophilic","datasets_with_task":"/datasets/task/node-classification-on-non-homophilic"}],"languages":[{"name":"English","url":"/datasets/language/english"}],"variants":["Texas(60%/20%/20% random splits)"],"data_loaders":[],"num_papers_in_archive":16,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/node-classification-on-non-homophilic-2","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset_variant":"Texas(60%/20%/20% random splits)","rows":32,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"ACM-GCN++","paper":"/paper/revisiting-heterophily-for-graph-neural","metrics":{"1:1 Accuracy":"96.56 ± 2"},"code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers_with_a_benchmark_row":[{"paper":"/paper/revisiting-heterophily-for-graph-neural","title":"Revisiting Heterophily For Graph Neural Networks","date":"2022-10-14","rows_on_this_dataset":15,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":7,"samples_ran":2,"samples_unverified":5,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/bernnet-learning-arbitrary-graph-spectral","title":"BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximation","date":"2021-06-21","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":1,"samples_ran":0,"samples_unverified":1,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/beyond-low-frequency-information-in-graph","title":"Beyond Low-frequency Information in Graph Convolutional Networks","date":"2021-01-04","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/simple-and-deep-graph-convolutional-networks-1","title":"Simple and Deep Graph Convolutional Networks","date":"2020-07-04","rows_on_this_dataset":2,"code_links":4,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":7,"samples_ran":5,"samples_unverified":2,"pointer_only_for_licence":4,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/generalizing-graph-neural-networks-beyond","title":"Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs","date":"2020-06-20","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":21,"samples_ran":13,"samples_unverified":8,"pointer_only_for_licence":6,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/joint-adaptive-feature-smoothing-and-topology","title":"Adaptive Universal Generalized PageRank Graph Neural Network","date":"2020-06-14","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":2,"samples_ran":0,"samples_unverified":2,"pointer_only_for_licence":2,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/geom-gcn-geometric-graph-convolutional-1","title":"Geom-GCN: Geometric Graph Convolutional Networks","date":"2020-02-13","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":7,"samples_ran":7,"samples_unverified":0,"pointer_only_for_licence":7,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/break-the-ceiling-stronger-multi-scale-deep","title":"Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks","date":"2019-06-05","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":9,"samples_ran":1,"samples_unverified":8,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/mixhop-higher-order-graph-convolution","title":"MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing","date":"2019-04-30","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/simplifying-graph-convolutional-networks","title":"Simplifying Graph Convolutional Networks","date":"2019-02-19","rows_on_this_dataset":2,"code_links":7,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":8,"samples_ran":3,"samples_unverified":5,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/predict-then-propagate-graph-neural-networks","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","date":"2018-10-14","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":12,"samples_ran":1,"samples_unverified":11,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","rows_on_this_dataset":1,"code_links":93,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":106,"samples_ran":50,"samples_unverified":56,"pointer_only_for_licence":43,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/inductive-representation-learning-on-large","title":"Inductive Representation Learning on Large Graphs","date":"2017-06-07","rows_on_this_dataset":1,"code_links":20,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":5,"samples_ran":3,"samples_unverified":2,"pointer_only_for_licence":5,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","rows_on_this_dataset":1,"code_links":55,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":58,"samples_ran":31,"samples_unverified":27,"pointer_only_for_licence":22,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}}],"syntology_totals":{"read_at":"2026-09-24T18:15:14+00:00","papers_with_samples":12,"samples_harvested":243,"samples_ran":116,"samples_unverified":127,"pointer_only_for_licence":90,"papers_with_no_sample_that_ran":2,"note":"the per-paper counts above, summed; not a rate"},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks."}