{"url":"/task/isomorphism-testing","name":"Isomorphism Testing","slug":"isomorphism-testing","description_markdown":"To test the power of graph representation learning methods based on Isomorphism Testing","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":14,"papers_with_code":10,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/graph-classification","name":"Graph Classification"}],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":10,"of":10,"tagged_in_all":14,"items":[{"url":"/paper/transitivity-preserving-graph-representation","title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","date":"2023-08-18","arxiv_id":"2308.09517","repositories_listed":3,"syntology":{"n":26,"n_ran":5,"n_unverified":21,"n_pointer_only":0}},{"url":"/paper/logical-expressiveness-of-graph-neural-1","title":"Logical Expressiveness of Graph Neural Networks with Hierarchical Node Individualization","date":"2025-06-16","arxiv_id":"2506.13911","repositories_listed":1,"syntology":{"n":8,"n_ran":0,"n_unverified":8,"n_pointer_only":0}},{"url":"/paper/covered-forest-fine-grained-generalization","title":"Covered Forest: Fine-grained generalization analysis of graph neural networks","date":"2024-12-10","arxiv_id":"2412.07106","repositories_listed":1,"syntology":{"n":7,"n_ran":1,"n_unverified":6,"n_pointer_only":0}},{"url":"/paper/plane-representation-learning-over-planar-1","title":"PlanE: Representation Learning over Planar Graphs","date":"2023-07-03","arxiv_id":"2307.01180","repositories_listed":1,"syntology":null},{"url":"/paper/a-practical-progressively-expressive-gnn","title":"A Practical, Progressively-Expressive GNN","date":"2022-10-18","arxiv_id":"2210.09521","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/gradual-weisfeiler-leman-slow-and-steady-wins","title":"Gradual Weisfeiler-Leman: Slow and Steady Wins the Race","date":"2022-09-19","arxiv_id":"2209.09048","repositories_listed":1,"syntology":null},{"url":"/paper/weisfeiler-and-leman-go-infinite-spectral-and","title":"Weisfeiler and Leman Go Infinite: Spectral and Combinatorial Pre-Colorings","date":"2022-01-31","arxiv_id":"2201.13410","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_unverified":0,"n_pointer_only":2}},{"url":"/paper/on-graph-neural-networks-versus-graph-1","title":"On Graph Neural Networks versus Graph-Augmented MLPs","date":"2020-10-28","arxiv_id":"2010.15116","repositories_listed":1,"syntology":null},{"url":"/paper/can-graph-neural-networks-count-substructures","title":"Can Graph Neural Networks Count Substructures?","date":"2020-02-10","arxiv_id":"2002.04025","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-equivalence-between-graph-isomorphism","title":"On the equivalence between graph isomorphism testing and function approximation with GNNs","date":"2019-05-29","arxiv_id":"1905.12560","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_unverified":0,"n_pointer_only":0}}],"syntology_records":6,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}