{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/node-clustering","name":"Node Clustering","slug":"node-clustering","description_markdown":null,"categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":130,"papers_with_code":72,"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":14,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/imdb-movie-reviews","name":"IMDb Movie Reviews","full_name":"","num_papers_in_archive":1787},{"url":"/dataset/pubmed","name":"Pubmed","full_name":"","num_papers_in_archive":1236},{"url":"/dataset/cora","name":"Cora","full_name":"","num_papers_in_archive":602},{"url":"/dataset/citeseer","name":"Citeseer","full_name":"","num_papers_in_archive":381},{"url":"/dataset/dblp","name":"DBLP","full_name":"Citation Network Dataset","num_papers_in_archive":218},{"url":"/dataset/wiki-squirrel","name":"Wiki Squirrel","full_name":"Wikipedia Squirrel","num_papers_in_archive":208},{"url":"/dataset/webkb","name":"WebKB","full_name":"WebKB","num_papers_in_archive":113},{"url":"/dataset/wiki-cs","name":"Wiki-CS","full_name":"","num_papers_in_archive":111},{"url":"/dataset/cornell","name":"Cornell","full_name":null,"num_papers_in_archive":54},{"url":"/dataset/amazon-photo","name":"Amazon Photo","full_name":"Amazon Photo","num_papers_in_archive":11},{"url":"/dataset/brazil-air-traffic","name":"Brazil Air-Traffic","full_name":"Brazil Air-Traffic","num_papers_in_archive":8},{"url":"/dataset/wiki","name":"Wiki","full_name":"Web Traffic Time Series Forecasting","num_papers_in_archive":8},{"url":"/dataset/arxivcs","name":"arXivCS","full_name":"","num_papers_in_archive":2},{"url":"/dataset/herigraph","name":"HeriGraph","full_name":"Multimodal Machine Learning Datasets on Graphs of Heritage Values and Attributes","num_papers_in_archive":2}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":2,"rows_per_page":100,"shown":100,"of":130,"of_with_code":72,"tagged_in_all":130,"counts":{"archive_papers_tagged":130,"with_a_code_link":72,"where_syntology_ran_a_sample":21,"not_listed_spam_title":0,"listed":130,"listed_where_code_ran":21,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":19,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":19,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/transitivity-preserving-graph-representation","slug":"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":19,"n_constructed":0,"n_ran_checked":13,"n_instrument":6,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 6 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/transitivity-preserving-graph-representation#ran","syntology_url":"https://syntology.ai/paper/2308.09517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09517"}},"official":{"repos":["nslab-cuk/unified-graph-transformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/attributed-graph-clustering-a-deep","slug":"attributed-graph-clustering-a-deep","title":"Attributed Graph Clustering: A Deep Attentional Embedding Approach","date":"2019-06-15","arxiv_id":"1906.06532","repositories_listed":3,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/attributed-graph-clustering-a-deep#ran","syntology_url":"https://syntology.ai/paper/1906.06532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06532"}},"official":null}},{"url":"/paper/graph-parsing-networks","slug":"graph-parsing-networks","title":"Graph Parsing Networks","date":"2024-02-22","arxiv_id":"2402.14393","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-parsing-networks#ran","syntology_url":"https://syntology.ai/paper/2402.14393","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.14393"}},"official":{"repos":["lumia-group/graphparsingnetworks"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/convert-contrastive-graph-clustering-with","slug":"convert-contrastive-graph-clustering-with","title":"CONVERT:Contrastive Graph Clustering with Reliable Augmentation","date":"2023-08-17","arxiv_id":"2308.08963","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/convert-contrastive-graph-clustering-with#ran","syntology_url":"https://syntology.ai/paper/2308.08963","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08963"}},"official":{"repos":["xihongyang1999/convert"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-temporal-graph-clustering","slug":"deep-temporal-graph-clustering","title":"Deep Temporal Graph Clustering","date":"2023-05-18","arxiv_id":"2305.10738","repositories_listed":2,"syntology":null},{"url":"/paper/contrastive-deep-graph-clustering-with","slug":"contrastive-deep-graph-clustering-with","title":"GraphLearner: Graph Node Clustering with Fully Learnable Augmentation","date":"2022-12-07","arxiv_id":"2212.03559","repositories_listed":2,"syntology":null},{"url":"/paper/nafs-a-simple-yet-tough-to-beat-baseline-for-1","slug":"nafs-a-simple-yet-tough-to-beat-baseline-for-1","title":"NAFS: A Simple yet Tough-to-beat Baseline for Graph Representation Learning","date":"2022-06-17","arxiv_id":"2206.08583","repositories_listed":2,"syntology":null},{"url":"/paper/asymptotics-of-network-embeddings-learned-via","slug":"asymptotics-of-network-embeddings-learned-via","title":"Asymptotics of Network Embeddings Learned via Subsampling","date":"2021-07-06","arxiv_id":"2107.02363","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/asymptotics-of-network-embeddings-learned-via#ran","syntology_url":"https://syntology.ai/paper/2107.02363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.02363"}},"official":{"repos":["aday651/embed-asym-exeriments","aday651/embed-asym-experiments"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/simple-spectral-graph-convolution","slug":"simple-spectral-graph-convolution","title":"Simple Spectral Graph Convolution","date":"2021-01-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/graph-infoclust-leveraging-cluster-level-node","slug":"graph-infoclust-leveraging-cluster-level-node","title":"Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learning","date":"2020-09-15","arxiv_id":"2009.06946","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-infoclust-leveraging-cluster-level-node#ran","syntology_url":"https://syntology.ai/paper/2009.06946","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.06946"}},"official":null}},{"url":"/paper/magnn-metapath-aggregated-graph-neural","slug":"magnn-metapath-aggregated-graph-neural","title":"MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding","date":"2020-02-05","arxiv_id":"2002.01680","repositories_listed":2,"syntology":null},{"url":"/paper/fusing-structure-and-content-via-non-negative","slug":"fusing-structure-and-content-via-non-negative","title":"Fusing Structure and Content via Non-negative Matrix Factorization for Embedding Information Networks","date":"2018-04-15","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/mitigating-degree-bias-in-graph","slug":"mitigating-degree-bias-in-graph","title":"Mitigating Degree Bias in Graph Representation Learning with Learnable Structural Augmentation and Structural Self-Attention","date":"2025-04-21","arxiv_id":"2504.15075","repositories_listed":1,"syntology":null},{"url":"/paper/cluster-wise-graph-transformer-with-dual","slug":"cluster-wise-graph-transformer-with-dual","title":"Cluster-wise Graph Transformer with Dual-granularity Kernelized Attention","date":"2024-10-09","arxiv_id":"2410.06746","repositories_listed":1,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":6,"n_instrument":7,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":14,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 7 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/cluster-wise-graph-transformer-with-dual#ran","syntology_url":"https://syntology.ai/paper/2410.06746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.06746"}},"official":{"repos":["lumia-group/cluster-wise-graph-transformer"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-versatile-framework-for-attributed-network","slug":"a-versatile-framework-for-attributed-network","title":"A Versatile Framework for Attributed Network Clustering via K-Nearest Neighbor Augmentation","date":"2024-08-10","arxiv_id":"2408.05459","repositories_listed":1,"syntology":null},{"url":"/paper/bootstrap-latents-of-nodes-and-neighbors-for","slug":"bootstrap-latents-of-nodes-and-neighbors-for","title":"Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning","date":"2024-08-09","arxiv_id":"2408.05087","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/bootstrap-latents-of-nodes-and-neighbors-for#ran","syntology_url":"https://syntology.ai/paper/2408.05087","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.05087"}},"official":{"repos":["cloudy1225/blnn"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/cluster-based-graph-collaborative-filtering","slug":"cluster-based-graph-collaborative-filtering","title":"Cluster-based Graph Collaborative Filtering","date":"2024-04-16","arxiv_id":"2404.10321","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cluster-based-graph-collaborative-filtering#ran","syntology_url":"https://syntology.ai/paper/2404.10321","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.10321"}},"official":{"repos":["zhao254014/clustergcf"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-contrastive-variational-graph-auto-encoder","slug":"a-contrastive-variational-graph-auto-encoder","title":"A Contrastive Variational Graph Auto-Encoder for Node Clustering","date":"2023-12-28","arxiv_id":"2312.16830","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-degree-biases-in-message-passing","slug":"mitigating-degree-biases-in-message-passing","title":"Mitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structures","date":"2023-12-28","arxiv_id":"2312.16788","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-deep-nonnegative-matrix","slug":"contrastive-deep-nonnegative-matrix","title":"Contrastive Deep Nonnegative Matrix Factorization for Community Detection","date":"2023-11-04","arxiv_id":"2311.02357","repositories_listed":1,"syntology":null},{"url":"/paper/universal-graph-random-features","slug":"universal-graph-random-features","title":"General Graph Random Features","date":"2023-10-07","arxiv_id":"2310.04859","repositories_listed":1,"syntology":null},{"url":"/paper/sr-hgn-semantic-and-relation-aware","slug":"sr-hgn-semantic-and-relation-aware","title":"SR-HGN: semantic- and relation-aware heterogeneous graph neural network","date":"2023-08-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/classification-of-edge-dependent-labels-of","slug":"classification-of-edge-dependent-labels-of","title":"Classification of Edge-dependent Labels of Nodes in Hypergraphs","date":"2023-06-05","arxiv_id":"2306.03032","repositories_listed":1,"syntology":null},{"url":"/paper/commonsense-knowledge-graph-completion-via","slug":"commonsense-knowledge-graph-completion-via","title":"Commonsense Knowledge Graph Completion Via Contrastive Pretraining and Node Clustering","date":"2023-05-26","arxiv_id":"2305.17019","repositories_listed":1,"syntology":null},{"url":"/paper/csgcl-community-strength-enhanced-graph","slug":"csgcl-community-strength-enhanced-graph","title":"CSGCL: Community-Strength-Enhanced Graph Contrastive Learning","date":"2023-05-08","arxiv_id":"2305.04658","repositories_listed":1,"syntology":{"n":9,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/csgcl-community-strength-enhanced-graph#ran","syntology_url":"https://syntology.ai/paper/2305.04658","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.04658"}},"official":{"repos":["hanchen-hust/csgcl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/pgb-a-pubmed-graph-benchmark-for","slug":"pgb-a-pubmed-graph-benchmark-for","title":"PGB: A PubMed Graph Benchmark for Heterogeneous Network Representation Learning","date":"2023-05-04","arxiv_id":"2305.02691","repositories_listed":1,"syntology":null},{"url":"/paper/cross-city-traffic-prediction-via-semantic","slug":"cross-city-traffic-prediction-via-semantic","title":"Semantic-Fused Multi-Granularity Cross-City Traffic Prediction","date":"2023-02-23","arxiv_id":"2302.11774","repositories_listed":1,"syntology":null},{"url":"/paper/eagle-large-scale-learning-of-turbulent-fluid","slug":"eagle-large-scale-learning-of-turbulent-fluid","title":"Eagle: Large-Scale Learning of Turbulent Fluid Dynamics with Mesh Transformers","date":"2023-02-16","arxiv_id":"2302.10803","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/eagle-large-scale-learning-of-turbulent-fluid#ran","syntology_url":"https://syntology.ai/paper/2302.10803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.10803"}},"official":null}},{"url":"/paper/user-unsupervised-structural-entropy-based","slug":"user-unsupervised-structural-entropy-based","title":"USER: Unsupervised Structural Entropy-based Robust Graph Neural Network","date":"2023-02-12","arxiv_id":"2302.05889","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-attributed-graph-subspace-clustering","slug":"scalable-attributed-graph-subspace-clustering","title":"Scalable Attributed-Graph Subspace Clustering","date":"2023-02-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/autoac-towards-automated-attribute-completion","slug":"autoac-towards-automated-attribute-completion","title":"AutoAC: Towards Automated Attribute Completion for Heterogeneous Graph Neural Network","date":"2023-01-08","arxiv_id":"2301.03049","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-graph-contrastive-learning-with","slug":"heterogeneous-graph-contrastive-learning-with","title":"Heterogeneous Graph Contrastive Learning with Meta-path Contexts and Adaptively Weighted Negative Samples","date":"2022-12-28","arxiv_id":"2212.13847","repositories_listed":1,"syntology":null},{"url":"/paper/multi-task-self-supervised-graph-neural","slug":"multi-task-self-supervised-graph-neural","title":"Multi-task Self-supervised Graph Neural Networks Enable Stronger Task Generalization","date":"2022-10-05","arxiv_id":"2210.02016","repositories_listed":1,"syntology":null},{"url":"/paper/msgnn-a-spectral-graph-neural-network-based","slug":"msgnn-a-spectral-graph-neural-network-based","title":"MSGNN: A Spectral Graph Neural Network Based on a Novel Magnetic Signed Laplacian","date":"2022-09-01","arxiv_id":"2209.00546","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/msgnn-a-spectral-graph-neural-network-based#ran","syntology_url":"https://syntology.ai/paper/2209.00546","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.00546"}},"official":{"repos":["sherylhyx/msgnn"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/a-representation-learning-framework-for-1","slug":"a-representation-learning-framework-for-1","title":"A Representation Learning Framework for Property Graphs","date":"2022-06-27","arxiv_id":"2206.13176","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/a-representation-learning-framework-for-1#ran","syntology_url":"https://syntology.ai/paper/2206.13176","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.13176"}},"official":{"repos":["yifan-h/pge"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/geometry-contrastive-learning-on","slug":"geometry-contrastive-learning-on","title":"Geometry Contrastive Learning on Heterogeneous Graphs","date":"2022-06-25","arxiv_id":"2206.12547","repositories_listed":1,"syntology":null},{"url":"/paper/heterformer-a-transformer-architecture-for","slug":"heterformer-a-transformer-architecture-for","title":"Heterformer: Transformer-based Deep Node Representation Learning on Heterogeneous Text-Rich Networks","date":"2022-05-20","arxiv_id":"2205.10282","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/heterformer-a-transformer-architecture-for#ran","syntology_url":"https://syntology.ai/paper/2205.10282","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10282"}},"official":{"repos":["petergriffinjin/heterformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/semi-supervised-graph-learning-meets","slug":"semi-supervised-graph-learning-meets","title":"Semi-Supervised Graph Learning Meets Dimensionality Reduction","date":"2022-03-23","arxiv_id":"2203.12522","repositories_listed":1,"syntology":null},{"url":"/paper/dissecting-graph-measure-performance-for-node","slug":"dissecting-graph-measure-performance-for-node","title":"Dissecting graph measure performance for node clustering in LFR parameter space","date":"2022-02-20","arxiv_id":"2202.09827","repositories_listed":1,"syntology":null},{"url":"/paper/transformation-of-node-to-knowledge-graph","slug":"transformation-of-node-to-knowledge-graph","title":"Transformation of Node to Knowledge Graph Embeddings for Faster Link Prediction in Social Networks","date":"2021-11-17","arxiv_id":"2111.09308","repositories_listed":1,"syntology":null},{"url":"/paper/wasserstein-adversarially-regularized-graph","slug":"wasserstein-adversarially-regularized-graph","title":"Wasserstein Adversarially Regularized Graph Autoencoder","date":"2021-11-09","arxiv_id":"2111.04981","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/wasserstein-adversarially-regularized-graph#ran","syntology_url":"https://syntology.ai/paper/2111.04981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.04981"}},"official":{"repos":["LeonResearch/WARGA"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sssnet-semi-supervised-signed-network","slug":"sssnet-semi-supervised-signed-network","title":"SSSNET: Semi-Supervised Signed Network Clustering","date":"2021-10-13","arxiv_id":"2110.06623","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/sssnet-semi-supervised-signed-network#ran","syntology_url":"https://syntology.ai/paper/2110.06623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.06623"}},"official":{"repos":["sherylhyx/sssnet_signed_clustering"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/hemi-multi-view-embedding-in-heterogeneous","slug":"hemi-multi-view-embedding-in-heterogeneous","title":"HeMI: Multi-view Embedding in Heterogeneous Graphs","date":"2021-09-14","arxiv_id":"2109.07008","repositories_listed":1,"syntology":null},{"url":"/paper/rama-a-rapid-multicut-algorithm-on-gpu","slug":"rama-a-rapid-multicut-algorithm-on-gpu","title":"RAMA: A Rapid Multicut Algorithm on GPU","date":"2021-09-04","arxiv_id":"2109.01838","repositories_listed":1,"syntology":null},{"url":"/paper/rod-reception-aware-online-distillation-for","slug":"rod-reception-aware-online-distillation-for","title":"ROD: Reception-aware Online Distillation for Sparse Graphs","date":"2021-07-25","arxiv_id":"2107.11789","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-graph-autoencoder-models-for","slug":"rethinking-graph-autoencoder-models-for","title":"Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering","date":"2021-07-19","arxiv_id":"2107.08562","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rethinking-graph-autoencoder-models-for#ran","syntology_url":"https://syntology.ai/paper/2107.08562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.08562"}},"official":{"repos":["nairouz/R-GAE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-survey-on-role-oriented-network-embedding","slug":"a-survey-on-role-oriented-network-embedding","title":"A Survey on Role-Oriented Network Embedding","date":"2021-07-18","arxiv_id":"2107.08379","repositories_listed":1,"syntology":null},{"url":"/paper/on-generalization-of-graph-autoencoders-with","slug":"on-generalization-of-graph-autoencoders-with","title":"On Generalization of Graph Autoencoders with Adversarial Training","date":"2021-07-06","arxiv_id":"2107.02658","repositories_listed":1,"syntology":null},{"url":"/paper/automated-self-supervised-learning-for-graphs","slug":"automated-self-supervised-learning-for-graphs","title":"Automated Self-Supervised Learning for Graphs","date":"2021-06-10","arxiv_id":"2106.05470","repositories_listed":1,"syntology":null},{"url":"/paper/digrac-digraph-clustering-with-flow-imbalance","slug":"digrac-digraph-clustering-with-flow-imbalance","title":"DIGRAC: Digraph Clustering Based on Flow Imbalance","date":"2021-06-09","arxiv_id":"2106.05194","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/digrac-digraph-clustering-with-flow-imbalance#ran","syntology_url":"https://syntology.ai/paper/2106.05194","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05194"}},"official":{"repos":["sherylhyx/digrac_directed_clustering"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/free-energy-node-embedding-via-generalized","slug":"free-energy-node-embedding-via-generalized","title":"Free Energy Node Embedding via Generalized Skip-gram with Negative Sampling","date":"2021-05-19","arxiv_id":"2105.09182","repositories_listed":1,"syntology":null},{"url":"/paper/node-embedding-using-mutual-information-and","slug":"node-embedding-using-mutual-information-and","title":"Node Embedding using Mutual Information and Self-Supervision based Bi-level Aggregation","date":"2021-04-27","arxiv_id":"2104.13014","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-deep-manifold-attributed-graph","slug":"unsupervised-deep-manifold-attributed-graph","title":"Unsupervised Deep Manifold Attributed Graph Embedding","date":"2021-04-27","arxiv_id":"2104.13048","repositories_listed":1,"syntology":null},{"url":"/paper/permutation-invariant-variational-autoencoder","slug":"permutation-invariant-variational-autoencoder","title":"Permutation-Invariant Variational Autoencoder for Graph-Level Representation Learning","date":"2021-04-20","arxiv_id":"2104.09856","repositories_listed":1,"syntology":null},{"url":"/paper/higher-order-attribute-enhancing","slug":"higher-order-attribute-enhancing","title":"Higher-Order Attribute-Enhancing Heterogeneous Graph Neural Networks","date":"2021-04-16","arxiv_id":"2104.07892","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/higher-order-attribute-enhancing#ran","syntology_url":"https://syntology.ai/paper/2104.07892","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07892"}},"official":{"repos":["RingBDStack/HAE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deepened-graph-auto-encoders-help-stabilize","slug":"deepened-graph-auto-encoders-help-stabilize","title":"Deepened Graph Auto-Encoders Help Stabilize and Enhance Link Prediction","date":"2021-03-21","arxiv_id":"2103.11414","repositories_listed":1,"syntology":null},{"url":"/paper/accurate-learning-of-graph-representations-1","slug":"accurate-learning-of-graph-representations-1","title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","date":"2021-02-23","arxiv_id":"2102.11533","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/accurate-learning-of-graph-representations-1#ran","syntology_url":"https://syntology.ai/paper/2102.11533","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11533"}},"official":{"repos":["JinheonBaek/GMT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/lime-low-cost-and-incremental-learning-for","slug":"lime-low-cost-and-incremental-learning-for","title":"LIME: Low-Cost and Incremental Learning for Dynamic Heterogeneous Information Networks","date":"2021-02-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/identity-aware-graph-neural-networks","slug":"identity-aware-graph-neural-networks","title":"Identity-aware Graph Neural Networks","date":"2021-01-25","arxiv_id":"2101.10320","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-node-content-for-multiview-graph","slug":"exploiting-node-content-for-multiview-graph","title":"Exploiting Node Content for Multiview Graph Convolutional Network and Adversarial Regularization","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-graph-encoder-for-attributed-graph","slug":"adaptive-graph-encoder-for-attributed-graph","title":"Adaptive Graph Encoder for Attributed Graph Embedding","date":"2020-07-03","arxiv_id":"2007.01594","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adaptive-graph-encoder-for-attributed-graph#ran","syntology_url":"https://syntology.ai/paper/2007.01594","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.01594"}},"official":{"repos":["thunlp/AGE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/structpool-structured-graph-pooling-via","slug":"structpool-structured-graph-pooling-via","title":"StructPool: Structured Graph Pooling via Conditional Random Fields","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/gossip-and-attend-context-sensitive-graph","slug":"gossip-and-attend-context-sensitive-graph","title":"Gossip and Attend: Context-Sensitive Graph Representation Learning","date":"2020-03-30","arxiv_id":"2004.00413","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neighborhood-attentive-pooling-1","slug":"graph-neighborhood-attentive-pooling-1","title":"Graph Neighborhood Attentive Pooling","date":"2020-01-28","arxiv_id":"2001.10394","repositories_listed":1,"syntology":null},{"url":"/paper/simple-and-effective-graph-autoencoders-with","slug":"simple-and-effective-graph-autoencoders-with","title":"Simple and Effective Graph Autoencoders with One-Hop Linear Models","date":"2020-01-21","arxiv_id":"2001.07614","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-deep-graph-infomax","slug":"heterogeneous-deep-graph-infomax","title":"Heterogeneous Deep Graph Infomax","date":"2019-11-19","arxiv_id":"1911.08538","repositories_listed":1,"syntology":null},{"url":"/paper/is-performance-of-scholars-correlated-to","slug":"is-performance-of-scholars-correlated-to","title":"Is Performance of Scholars Correlated to Their Research Collaboration Patterns?","date":"2019-11-05","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/keep-it-simple-graph-autoencoders-without","slug":"keep-it-simple-graph-autoencoders-without","title":"Keep It Simple: Graph Autoencoders Without Graph Convolutional Networks","date":"2019-10-02","arxiv_id":"1910.00942","repositories_listed":1,"syntology":null},{"url":"/paper/rwr-gae-random-walk-regularization-for-graph","slug":"rwr-gae-random-walk-regularization-for-graph","title":"RWR-GAE: Random Walk Regularization for Graph Auto Encoders","date":"2019-08-12","arxiv_id":"1908.04003","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":5,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 1 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/rwr-gae-random-walk-regularization-for-graph#ran","syntology_url":"https://syntology.ai/paper/1908.04003","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04003"}},"official":{"repos":["MysteryVaibhav/DW-GAE"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/attributed-network-embedding-via-subspace","slug":"attributed-network-embedding-via-subspace","title":"Attributed Network Embedding via Subspace Discovery","date":"2019-01-14","arxiv_id":"1901.04095","repositories_listed":1,"syntology":null},{"url":"/paper/search-efficient-binary-network-embedding","slug":"search-efficient-binary-network-embedding","title":"Search Efficient Binary Network Embedding","date":"2019-01-14","arxiv_id":"1901.04097","repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-energy-aware-node-clustering","slug":"a-novel-energy-aware-node-clustering","title":"A Novel Energy Aware Node Clustering Algorithm for Wireless Sensor Networks Using a Modified Artificial Fish Swarm Algorithm","date":"2015-05-30","arxiv_id":"1506.00099","repositories_listed":1,"syntology":null},{"url":null,"slug":"multi-granular-attention-based-heterogeneous","title":"Multi-Granular Attention based Heterogeneous Hypergraph Neural Network","date":"2025-05-07","arxiv_id":"2505.04340","repositories_listed":0,"syntology":null},{"url":null,"slug":"adjusted-count-quantification-learning-on","title":"Adjusted Count Quantification Learning on Graphs","date":"2025-03-12","arxiv_id":"2503.09395","repositories_listed":0,"syntology":null},{"url":null,"slug":"thesaurus-contrastive-graph-clustering-by","title":"THESAURUS: Contrastive Graph Clustering by Swapping Fused Gromov-Wasserstein Couplings","date":"2024-12-16","arxiv_id":"2412.11550","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-deep-metric-learning-on-attributed","title":"Scalable Deep Metric Learning on Attributed Graphs","date":"2024-11-20","arxiv_id":"2411.13014","repositories_listed":0,"syntology":null},{"url":null,"slug":"tdgcn-based-mobile-multiuser-physical-layer","title":"TDGCN-Based Mobile Multiuser Physical-Layer Authentication for EI-Enabled IIoT","date":"2024-11-13","arxiv_id":"2411.08628","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-based-on-density-propagation-and","title":"Clustering Based on Density Propagation and Subcluster Merging","date":"2024-11-04","arxiv_id":"2411.01780","repositories_listed":0,"syntology":null},{"url":null,"slug":"g-sparc-spectral-architectures-tackling-the","title":"G-SPARC: SPectral ARchitectures tackling the Cold-start problem in Graph learning","date":"2024-11-03","arxiv_id":"2411.01532","repositories_listed":0,"syntology":null},{"url":null,"slug":"geographical-node-clustering-and-grouping-to","title":"Geographical Node Clustering and Grouping to Guarantee Data IIDness in Federated Learning","date":"2024-10-21","arxiv_id":"2410.15693","repositories_listed":0,"syntology":null},{"url":null,"slug":"hhgt-hierarchical-heterogeneous-graph","title":"HHGT: Hierarchical Heterogeneous Graph Transformer for Heterogeneous Graph Representation Learning","date":"2024-07-18","arxiv_id":"2407.13158","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphfm-a-comprehensive-benchmark-for-graph","title":"GraphFM: A Comprehensive Benchmark for Graph Foundation Model","date":"2024-06-12","arxiv_id":"2406.08310","repositories_listed":0,"syntology":null},{"url":null,"slug":"hencler-node-clustering-in-heterophilous","title":"HeNCler: Node Clustering in Heterophilous Graphs through Learned Asymmetric Similarity","date":"2024-05-27","arxiv_id":"2405.17050","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-investigation-into-using-unsupervised","title":"Unsupervised Optimisation of GNNs for Node Clustering","date":"2024-02-12","arxiv_id":"2402.07845","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-and-classification","title":"Community Detection Guarantees Using Embeddings Learned by Node2Vec","date":"2023-10-26","arxiv_id":"2310.17712","repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-and-contrastive-paradigms-are","title":"Generative and Contrastive Paradigms Are Complementary for Graph Self-Supervised Learning","date":"2023-10-24","arxiv_id":"2310.15523","repositories_listed":0,"syntology":null},{"url":null,"slug":"latent-random-steps-as-relaxations-of-max-cut","title":"Latent Random Steps as Relaxations of Max-Cut, Min-Cut, and More","date":"2023-08-12","arxiv_id":"2308.06448","repositories_listed":0,"syntology":null},{"url":null,"slug":"curvature-based-clustering-on-graphs","title":"Curvature-based Clustering on Graphs","date":"2023-07-19","arxiv_id":"2307.10155","repositories_listed":0,"syntology":null},{"url":null,"slug":"hagnn-hybrid-aggregation-for-heterogeneous","title":"HAGNN: Hybrid Aggregation for Heterogeneous Graph Neural Networks","date":"2023-07-04","arxiv_id":"2307.01636","repositories_listed":0,"syntology":null},{"url":null,"slug":"carl-g-clustering-accelerated-representation","title":"CARL-G: Clustering-Accelerated Representation Learning on Graphs","date":"2023-06-12","arxiv_id":"2306.06936","repositories_listed":0,"syntology":null},{"url":null,"slug":"arxiv4tgc-large-scale-datasets-for-temporal","title":"arXiv4TGC: Large-Scale Datasets for Temporal Graph Clustering","date":"2023-06-08","arxiv_id":"2306.04962","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-of-time-varying-graphs-based-on","title":"Clustering of Time-Varying Graphs Based on Temporal Label Smoothness","date":"2023-05-11","arxiv_id":"2305.06576","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-graph-level-clustering-using-pseudo","title":"Deep Graph-Level Clustering Using Pseudo-Label-Guided Mutual Information Maximization Network","date":"2023-02-05","arxiv_id":"2302.02369","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-node-a-concise-approach-to-effectively","title":"Meta-node: A Concise Approach to Effectively Learn Complex Relationships in Heterogeneous Graphs","date":"2022-10-26","arxiv_id":"2210.14480","repositories_listed":0,"syntology":null},{"url":null,"slug":"hcl-improving-graph-representation-with","title":"HCL: Improving Graph Representation with Hierarchical Contrastive Learning","date":"2022-10-21","arxiv_id":"2210.12020","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-granularity-graph-pooling-for-video","title":"Multi-Granularity Graph Pooling for Video-based Person Re-Identification","date":"2022-09-23","arxiv_id":"2209.11584","repositories_listed":0,"syntology":null},{"url":null,"slug":"hub-aware-random-walk-graph-embedding-methods","title":"Hub-aware Random Walk Graph Embedding Methods for Classification","date":"2022-09-15","arxiv_id":"2209.07603","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-graph-pooling-is-an-effective","title":"Hierarchical Graph Pooling is an Effective Citywide Traffic Condition Prediction Model","date":"2022-09-08","arxiv_id":"2209.03629","repositories_listed":0,"syntology":null},{"url":null,"slug":"grouping-matrix-based-graph-pooling-with","title":"Grouping-matrix based Graph Pooling with Adaptive Number of Clusters","date":"2022-09-07","arxiv_id":"2209.02939","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-asymmetric-embedding-for-attributed","title":"Learning Asymmetric Embedding for Attributed Networks via Convolutional Neural Network","date":"2022-02-13","arxiv_id":"2202.06307","repositories_listed":0,"syntology":null}],"syntology_records":22,"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"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":21,"papers_where_code_ran_first_page":"/task/node-clustering/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":2,"url":"/task/node-clustering/papers/2","json":"/task/node-clustering/papers/2.json","rows":30},{"order":"ran","page":1,"of":1,"url":"/task/node-clustering/papers/ran/1","json":"/task/node-clustering/papers/ran/1.json","rows":21}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"86dc888d61930f08aa5541fb00601962ed013eb8d8a4a239e323b5e2f610b8a5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}