{"url":"/dataset/minesweeper","name":"minesweeper","full_name":null,"description_markdown":"minesweeper is a synthetic graph emulating the eponymous game.","description_withheld":null,"homepage":"https://github.com/yandex-research/heterophilous-graphs","introduced_date":"2023-02-22","introduced_date_note":null,"introduced_by":{"paper":"/paper/a-critical-look-at-the-evaluation-of-gnns","title":"A critical look at the evaluation of GNNs under heterophily: Are we really making progress?","first_author":"Oleg Platonov","url":null},"license":{"name":"MIT License","url":"https://github.com/yandex-research/heterophilous-graphs?tab=MIT-1-ov-file"},"modalities":[{"name":"Graphs","url":"/datasets/modality/graphs"}],"tasks":[{"name":"Node Classification","url":"/task/node-classification","datasets_with_task":"/datasets/task/node-classification"}],"languages":[],"variants":["minesweeper"],"data_loaders":[],"num_papers_in_archive":34,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/node-classification-on-minesweeper","task":"Node Classification","dataset_variant":"minesweeper","rows":4,"metrics":["AUCROC"],"first_row_in_archive_order":{"model":"GCN","paper":"/paper/classic-gnns-are-strong-baselines-reassessing","metrics":{"AUCROC":"97.86 ± 0.24"},"code_links":[{"title":"LUOyk1999/tunedGNN","url":"https://github.com/LUOyk1999/tunedGNN"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers_with_a_benchmark_row":[{"paper":"/paper/classic-gnns-are-strong-baselines-reassessing","title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","date":"2024-06-13","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":9,"samples_ran":2,"samples_unverified":7,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/polynormer-polynomial-expressive-graph","title":"Polynormer: Polynomial-Expressive Graph Transformer in Linear Time","date":"2024-03-02","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":8,"samples_ran":5,"samples_unverified":3,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}}],"syntology_totals":{"read_at":"2026-09-25T09:33:49+00:00","papers_with_samples":2,"samples_harvested":17,"samples_ran":7,"samples_unverified":10,"pointer_only_for_licence":0,"papers_with_no_sample_that_ran":0,"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."}