{"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-classification/papers/5","list_of":"/task/node-classification","task":"Node Classification","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":5,"pages_in_order":19,"rows_per_page":100,"rows":[401,500],"of":1860,"counts":{"archive_papers_tagged":1860,"with_a_code_link":991,"where_syntology_ran_a_sample":305,"not_listed_spam_title":0,"listed":1860,"listed_where_code_ran":305,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":256,"every_run_a_failure_of_syntologys_instrument":49,"listed_with_a_run_with_no_instrument_failure":256,"listed_every_run_a_failure_of_syntologys_instrument":49,"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"},"first_page":"/task/node-classification","prev":"/task/node-classification/papers/4","next":"/task/node-classification/papers/6","papers":[{"url":"/paper/erase-error-resilient-representation-learning","slug":"erase-error-resilient-representation-learning","title":"ERASE: Error-Resilient Representation Learning on Graphs for Label Noise Tolerance","date":"2023-12-13","arxiv_id":"2312.08852","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-initialization-of-graph-neural","slug":"on-the-initialization-of-graph-neural","title":"On the Initialization of Graph Neural Networks","date":"2023-12-05","arxiv_id":"2312.02622","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-the-initialization-of-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2312.02622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02622"}},"official":{"repos":["lspongebobjh/virgo_icml2023"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/the-self-loop-paradox-investigating-the","slug":"the-self-loop-paradox-investigating-the","title":"The Self-Loop Paradox: Investigating the Impact of Self-Loops on Graph Neural Networks","date":"2023-12-04","arxiv_id":"2312.01721","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"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) · 0 unverified","sample_list":"/paper/the-self-loop-paradox-investigating-the#ran","syntology_url":"https://syntology.ai/paper/2312.01721","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.01721"}},"official":{"repos":["m-lampert/self-loop-paradox"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tracing-hyperparameter-dependencies-for-model","slug":"tracing-hyperparameter-dependencies-for-model","title":"Tracing Hyperparameter Dependencies for Model Parsing via Learnable Graph Pooling Network","date":"2023-12-03","arxiv_id":"2312.02224","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tracing-hyperparameter-dependencies-for-model#ran","syntology_url":"https://syntology.ai/paper/2312.02224","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02224"}},"official":{"repos":["chelsea234/lgpn"],"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","unlocated"]}}},{"url":"/paper/bhgnn-rt-network-embedding-for-directed","slug":"bhgnn-rt-network-embedding-for-directed","title":"BHGNN-RT: Network embedding for directed heterogeneous graphs","date":"2023-11-24","arxiv_id":"2311.14404","repositories_listed":1,"syntology":null},{"url":"/paper/hard-label-black-box-node-injection-attack-on","slug":"hard-label-black-box-node-injection-attack-on","title":"Hard Label Black Box Node Injection Attack on Graph Neural Networks","date":"2023-11-22","arxiv_id":"2311.13244","repositories_listed":1,"syntology":null},{"url":"/paper/node-classification-in-random-trees","slug":"node-classification-in-random-trees","title":"Node Classification in Random Trees","date":"2023-11-20","arxiv_id":"2311.12167","repositories_listed":1,"syntology":null},{"url":"/paper/improvements-on-uncertainty-quantification","slug":"improvements-on-uncertainty-quantification","title":"Improvements on Uncertainty Quantification for Node Classification via Distance-Based Regularization","date":"2023-11-10","arxiv_id":"2311.05795","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/improvements-on-uncertainty-quantification#ran","syntology_url":"https://syntology.ai/paper/2311.05795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.05795"}},"official":{"repos":["neoques/graph-posterior-network"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mixture-of-weak-strong-experts-on-graphs","slug":"mixture-of-weak-strong-experts-on-graphs","title":"Mixture of Weak & Strong Experts on Graphs","date":"2023-11-09","arxiv_id":"2311.05185","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mixture-of-weak-strong-experts-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2311.05185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.05185"}},"official":{"repos":["facebookresearch/mowst-gnn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/predicting-properties-of-nodes-via-community","slug":"predicting-properties-of-nodes-via-community","title":"Predicting Properties of Nodes via Community-Aware Features","date":"2023-11-08","arxiv_id":"2311.04730","repositories_listed":1,"syntology":null},{"url":"/paper/architecture-matters-uncovering-implicit-1","slug":"architecture-matters-uncovering-implicit-1","title":"Architecture Matters: Uncovering Implicit Mechanisms in Graph Contrastive Learning","date":"2023-11-05","arxiv_id":"2311.02687","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 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; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/architecture-matters-uncovering-implicit-1#ran","syntology_url":"https://syntology.ai/paper/2311.02687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02687"}},"official":{"repos":["pku-ml/architecturemattersgcl"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/calibrate-and-boost-logical-expressiveness-of","slug":"calibrate-and-boost-logical-expressiveness-of","title":"Calibrate and Boost Logical Expressiveness of GNN Over Multi-Relational and Temporal Graphs","date":"2023-11-03","arxiv_id":"2311.01647","repositories_listed":1,"syntology":null},{"url":"/paper/cooperative-network-learning-for-large-scale","slug":"cooperative-network-learning-for-large-scale","title":"Cooperative Network Learning for Large-Scale and Decentralized Graphs","date":"2023-11-03","arxiv_id":"2311.02117","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-semi-supervised-imbalanced-node-1","slug":"rethinking-semi-supervised-imbalanced-node-1","title":"Rethinking Semi-Supervised Imbalanced Node Classification from Bias-Variance Decomposition","date":"2023-10-28","arxiv_id":"2310.18765","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/rethinking-semi-supervised-imbalanced-node-1#ran","syntology_url":"https://syntology.ai/paper/2310.18765","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18765"}},"official":{"repos":["yanliang3612/revar"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-graph-neural-networks-with","slug":"enhancing-graph-neural-networks-with","title":"PSP: Pre-Training and Structure Prompt Tuning for Graph Neural Networks","date":"2023-10-26","arxiv_id":"2310.17394","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":8,"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) · 0 unverified","sample_list":"/paper/enhancing-graph-neural-networks-with#ran","syntology_url":"https://syntology.ai/paper/2310.17394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.17394"}},"official":{"repos":["gqq1210/psp"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/label-propagation-for-graph-label-noise","slug":"label-propagation-for-graph-label-noise","title":"Resurrecting Label Propagation for Graphs with Heterophily and Label Noise","date":"2023-10-25","arxiv_id":"2310.16560","repositories_listed":1,"syntology":null},{"url":"/paper/deceptive-fairness-attacks-on-graphs-via-meta","slug":"deceptive-fairness-attacks-on-graphs-via-meta","title":"Deceptive Fairness Attacks on Graphs via Meta Learning","date":"2023-10-24","arxiv_id":"2310.15653","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"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) · 3 unverified","sample_list":"/paper/deceptive-fairness-attacks-on-graphs-via-meta#ran","syntology_url":"https://syntology.ai/paper/2310.15653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15653"}},"official":{"repos":["jiank2/fate"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-study-on-knowledge-graph-embeddings-and","slug":"a-study-on-knowledge-graph-embeddings-and","title":"A Study on Knowledge Graph Embeddings and Graph Neural Networks for Web Of Things","date":"2023-10-23","arxiv_id":"2310.14866","repositories_listed":1,"syntology":null},{"url":"/paper/neighborhood-homophily-guided-graph-1","slug":"neighborhood-homophily-guided-graph-1","title":"Neighborhood Homophily-Guided Graph Convolutional Network","date":"2023-10-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/pretraining-language-models-with-text","slug":"pretraining-language-models-with-text","title":"Pretraining Language Models with Text-Attributed Heterogeneous Graphs","date":"2023-10-19","arxiv_id":"2310.12580","repositories_listed":1,"syntology":null},{"url":"/paper/locally-differentially-private-graph","slug":"locally-differentially-private-graph","title":"Privacy-Preserving Graph Embedding based on Local Differential Privacy","date":"2023-10-17","arxiv_id":"2310.11060","repositories_listed":1,"syntology":null},{"url":"/paper/empower-text-attributed-graphs-learning-with","slug":"empower-text-attributed-graphs-learning-with","title":"Leveraging Large Language Models for Node Generation in Few-Shot Learning on Text-Attributed Graphs","date":"2023-10-15","arxiv_id":"2310.09872","repositories_listed":1,"syntology":{"n":4,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"0 ran · 4 unverified","sample_list":"/paper/empower-text-attributed-graphs-learning-with#ran","syntology_url":"https://syntology.ai/paper/2310.09872","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.09872"}},"official":{"repos":["jianxiangyu/llm4ng"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":[]}}},{"url":"/paper/causality-and-independence-enhancement-for","slug":"causality-and-independence-enhancement-for","title":"Causality and Independence Enhancement for Biased Node Classification","date":"2023-10-14","arxiv_id":"2310.09586","repositories_listed":1,"syntology":null},{"url":"/paper/non-backtracking-graph-neural-networks","slug":"non-backtracking-graph-neural-networks","title":"Non-backtracking Graph Neural Networks","date":"2023-10-11","arxiv_id":"2310.07430","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/non-backtracking-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2310.07430","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07430"}},"official":{"repos":["seonghyun26/nba-gnn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/enhanced-graph-neural-networks-with-ego","slug":"enhanced-graph-neural-networks-with-ego","title":"Enhanced Graph Neural Networks with Ego-Centric Spectral Subgraph Embeddings Augmentation","date":"2023-10-10","arxiv_id":"2310.12169","repositories_listed":1,"syntology":null},{"url":"/paper/simplifying-gnn-performance-with-low-rank","slug":"simplifying-gnn-performance-with-low-rank","title":"Simple GNNs with Low Rank Non-parametric Aggregators","date":"2023-10-08","arxiv_id":"2310.05250","repositories_listed":1,"syntology":null},{"url":"/paper/tailoring-self-attention-for-graph-via-rooted-1","slug":"tailoring-self-attention-for-graph-via-rooted-1","title":"Tailoring Self-Attention for Graph via Rooted Subtrees","date":"2023-10-08","arxiv_id":"2310.05296","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":10,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/tailoring-self-attention-for-graph-via-rooted-1#ran","syntology_url":"https://syntology.ai/paper/2310.05296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.05296"}},"official":{"repos":["lumia-group/subtree-attention"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/label-free-node-classification-on-graphs-with","slug":"label-free-node-classification-on-graphs-with","title":"Label-free Node Classification on Graphs with Large Language Models (LLMS)","date":"2023-10-07","arxiv_id":"2310.04668","repositories_listed":1,"syntology":{"n":29,"n_ran":22,"n_constructed":0,"n_ran_checked":19,"n_instrument":3,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":18,"n_pointer_only":10,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 1 honoured, 0 violated, 18 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/label-free-node-classification-on-graphs-with#ran","syntology_url":"https://syntology.ai/paper/2310.04668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.04668"}},"official":{"repos":["currytang/llmgnn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/grapes-learning-to-sample-graphs-for-scalable","slug":"grapes-learning-to-sample-graphs-for-scalable","title":"GRAPES: Learning to Sample Graphs for Scalable Graph Neural Networks","date":"2023-10-05","arxiv_id":"2310.03399","repositories_listed":1,"syntology":null},{"url":"/paper/deephgcn-toward-deeper-hyperbolic-graph","slug":"deephgcn-toward-deeper-hyperbolic-graph","title":"DeepHGCN: Toward Deeper Hyperbolic Graph Convolutional Networks","date":"2023-10-03","arxiv_id":"2310.02027","repositories_listed":1,"syntology":null},{"url":"/paper/holonets-spectral-convolutions-do-extend-to","slug":"holonets-spectral-convolutions-do-extend-to","title":"HoloNets: Spectral Convolutions do extend to Directed Graphs","date":"2023-10-03","arxiv_id":"2310.02232","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"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 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) · 1 unverified","sample_list":"/paper/holonets-spectral-convolutions-do-extend-to#ran","syntology_url":"https://syntology.ai/paper/2310.02232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02232"}},"official":{"repos":["ChristianKoke/HoloNets"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-insights-into-noisy-pseudo-labeling-on-1","slug":"deep-insights-into-noisy-pseudo-labeling-on-1","title":"Deep Insights into Noisy Pseudo Labeling on Graph Data","date":"2023-10-02","arxiv_id":"2310.01634","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"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) · 2 unverified","sample_list":"/paper/deep-insights-into-noisy-pseudo-labeling-on-1#ran","syntology_url":"https://syntology.ai/paper/2310.01634","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.01634"}},"official":{"repos":["AcEbt/CPL"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/distilling-influences-to-mitigate-prediction","slug":"distilling-influences-to-mitigate-prediction","title":"Distilling Influences to Mitigate Prediction Churn in Graph Neural Networks","date":"2023-10-02","arxiv_id":"2310.00946","repositories_listed":1,"syntology":null},{"url":"/paper/the-map-equation-goes-neural","slug":"the-map-equation-goes-neural","title":"The Map Equation Goes Neural: Mapping Network Flows with Graph Neural Networks","date":"2023-10-02","arxiv_id":"2310.01144","repositories_listed":1,"syntology":null},{"url":"/paper/from-cluster-assumption-to-graph-convolution","slug":"from-cluster-assumption-to-graph-convolution","title":"From Cluster Assumption to Graph Convolution: Graph-based Semi-Supervised Learning Revisited","date":"2023-09-24","arxiv_id":"2309.13599","repositories_listed":1,"syntology":null},{"url":"/paper/higher-order-graph-convolutional-network-with","slug":"higher-order-graph-convolutional-network-with","title":"Higher-order Graph Convolutional Network with Flower-Petals Laplacians on Simplicial Complexes","date":"2023-09-22","arxiv_id":"2309.12971","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-graph-convolutional-network-with#ran","syntology_url":"https://syntology.ai/paper/2309.12971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.12971"}},"official":{"repos":["yiminghh/higcn"],"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/improving-article-classification-with-edge","slug":"improving-article-classification-with-edge","title":"Article Classification with Graph Neural Networks and Multigraphs","date":"2023-09-20","arxiv_id":"2309.11341","repositories_listed":1,"syntology":null},{"url":"/paper/graph-contrastive-learning-meets-graph-meta","slug":"graph-contrastive-learning-meets-graph-meta","title":"Graph Contrastive Learning Meets Graph Meta Learning: A Unified Method for Few-shot Node Tasks","date":"2023-09-19","arxiv_id":"2309.10376","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"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) · 0 unverified","sample_list":"/paper/graph-contrastive-learning-meets-graph-meta#ran","syntology_url":"https://syntology.ai/paper/2309.10376","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.10376"}},"official":{"repos":["haoliu-cola/cola"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/semi-supervised-domain-adaptation-on-graphs","slug":"semi-supervised-domain-adaptation-on-graphs","title":"Semi-supervised Domain Adaptation on Graphs with Contrastive Learning and Minimax Entropy","date":"2023-09-14","arxiv_id":"2309.07402","repositories_listed":1,"syntology":null},{"url":"/paper/bregman-graph-neural-network","slug":"bregman-graph-neural-network","title":"Bregman Graph Neural Network","date":"2023-09-12","arxiv_id":"2309.06645","repositories_listed":1,"syntology":null},{"url":"/paper/2309-05865","slug":"2309-05865","title":"Force-directed graph embedding with hops distance","date":"2023-09-11","arxiv_id":"2309.05865","repositories_listed":1,"syntology":null},{"url":"/paper/unikg-a-benchmark-and-universal-embedding-for","slug":"unikg-a-benchmark-and-universal-embedding-for","title":"UniKG: A Benchmark and Universal Embedding for Large-Scale Knowledge Graphs","date":"2023-09-11","arxiv_id":"2309.05269","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-learning-on-multimodal-knowledge","slug":"end-to-end-learning-on-multimodal-knowledge","title":"End-to-End Learning on Multimodal Knowledge Graphs","date":"2023-09-03","arxiv_id":"2309.01169","repositories_listed":1,"syntology":null},{"url":"/paper/concur-self-supervised-graph-representation","slug":"concur-self-supervised-graph-representation","title":"ConCur: Self-supervised graph representation based on contrastive learning with curriculum negative sampling","date":"2023-09-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/benchtemp-a-general-benchmark-for-evaluating","slug":"benchtemp-a-general-benchmark-for-evaluating","title":"BenchTemp: A General Benchmark for Evaluating Temporal Graph Neural Networks","date":"2023-08-31","arxiv_id":"2308.16385","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/benchtemp-a-general-benchmark-for-evaluating#ran","syntology_url":"https://syntology.ai/paper/2308.16385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.16385"}},"official":{"repos":["qianghuangwhu/benchtemp"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/domain-adaptive-message-passing-graph-neural","slug":"domain-adaptive-message-passing-graph-neural","title":"Domain-adaptive Message Passing Graph Neural Network","date":"2023-08-31","arxiv_id":"2308.16470","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/domain-adaptive-message-passing-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2308.16470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.16470"}},"official":{"repos":["shenxiaocam/dm_gnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/rank-collapse-causes-over-smoothing-and-over","slug":"rank-collapse-causes-over-smoothing-and-over","title":"Rank Collapse Causes Over-Smoothing and Over-Correlation in Graph Neural Networks","date":"2023-08-31","arxiv_id":"2308.16800","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/rank-collapse-causes-over-smoothing-and-over#ran","syntology_url":"https://syntology.ai/paper/2308.16800","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.16800"}},"official":{"repos":["roth-andreas/rank_collapse"],"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/a-hybrid-membership-latent-distance-model-for","slug":"a-hybrid-membership-latent-distance-model-for","title":"A Hybrid Membership Latent Distance Model for Unsigned and Signed Integer Weighted Networks","date":"2023-08-29","arxiv_id":"2308.15293","repositories_listed":1,"syntology":null},{"url":"/paper/low-bit-quantization-for-deep-graph-neural","slug":"low-bit-quantization-for-deep-graph-neural","title":"Low-bit Quantization for Deep Graph Neural Networks with Smoothness-aware Message Propagation","date":"2023-08-29","arxiv_id":"2308.14949","repositories_listed":1,"syntology":null},{"url":"/paper/topological-augmentation-for-class-imbalanced","slug":"topological-augmentation-for-class-imbalanced","title":"Class-Imbalanced Graph Learning without Class Rebalancing","date":"2023-08-27","arxiv_id":"2308.14181","repositories_listed":1,"syntology":{"n":19,"n_ran":17,"n_constructed":0,"n_ran_checked":16,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/topological-augmentation-for-class-imbalanced#ran","syntology_url":"https://syntology.ai/paper/2308.14181","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.14181"}},"official":{"repos":["zhiningliu1998/bat"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-survey-of-imbalanced-learning-on-graphs","slug":"a-survey-of-imbalanced-learning-on-graphs","title":"A Survey of Imbalanced Learning on Graphs: Problems, Techniques, and Future Directions","date":"2023-08-26","arxiv_id":"2308.13821","repositories_listed":1,"syntology":null},{"url":"/paper/class-label-aware-graph-anomaly-detection","slug":"class-label-aware-graph-anomaly-detection","title":"Class Label-aware Graph Anomaly Detection","date":"2023-08-22","arxiv_id":"2308.11669","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":3,"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/class-label-aware-graph-anomaly-detection#ran","syntology_url":"https://syntology.ai/paper/2308.11669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.11669"}},"official":{"repos":["jhkim611/clad"],"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/transformers-for-capturing-multi-level-graph","slug":"transformers-for-capturing-multi-level-graph","title":"Enhancing Graph Transformers with Hierarchical Distance Structural Encoding","date":"2023-08-22","arxiv_id":"2308.11129","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/transformers-for-capturing-multi-level-graph#ran","syntology_url":"https://syntology.ai/paper/2308.11129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.11129"}},"official":{"repos":["luoyk1999/hdse"],"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/geometric-instability-of-graph-neural","slug":"geometric-instability-of-graph-neural","title":"Geometric instability of graph neural networks on large graphs","date":"2023-08-19","arxiv_id":"2308.10099","repositories_listed":1,"syntology":null},{"url":"/paper/disparity-inequality-and-accuracy-tradeoffs","slug":"disparity-inequality-and-accuracy-tradeoffs","title":"Disparity, Inequality, and Accuracy Tradeoffs in Graph Neural Networks for Node Classification","date":"2023-08-18","arxiv_id":"2308.09596","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-the-interplay-between-features","slug":"investigating-the-interplay-between-features","title":"Investigating the Interplay between Features and Structures in Graph Learning","date":"2023-08-18","arxiv_id":"2308.09570","repositories_listed":1,"syntology":{"n":17,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":17,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/investigating-the-interplay-between-features#ran","syntology_url":"https://syntology.ai/paper/2308.09570","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09570"}},"official":{"repos":["danielecastellana22/feature-structure-interplay-graph-learning"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/half-hop-a-graph-upsampling-approach-for","slug":"half-hop-a-graph-upsampling-approach-for","title":"Half-Hop: A graph upsampling approach for slowing down message passing","date":"2023-08-17","arxiv_id":"2308.09198","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/half-hop-a-graph-upsampling-approach-for#ran","syntology_url":"https://syntology.ai/paper/2308.09198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09198"}},"official":{"repos":["nerdslab/halfhop"],"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/mitigating-semantic-confusion-from-hostile","slug":"mitigating-semantic-confusion-from-hostile","title":"Mitigating Semantic Confusion from Hostile Neighborhood for Graph Active Learning","date":"2023-08-17","arxiv_id":"2308.08823","repositories_listed":1,"syntology":null},{"url":"/paper/independent-distribution-regularization-for","slug":"independent-distribution-regularization-for","title":"Independent Distribution Regularization for Private Graph Embedding","date":"2023-08-16","arxiv_id":"2308.08360","repositories_listed":1,"syntology":null},{"url":"/paper/s-mixup-structural-mixup-for-graph-neural","slug":"s-mixup-structural-mixup-for-graph-neural","title":"S-Mixup: Structural Mixup for Graph Neural Networks","date":"2023-08-16","arxiv_id":"2308.08097","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/towards-temporal-edge-regression-a-case-study","slug":"towards-temporal-edge-regression-a-case-study","title":"Towards Temporal Edge Regression: A Case Study on Agriculture Trade Between Nations","date":"2023-08-15","arxiv_id":"2308.07883","repositories_listed":1,"syntology":null},{"url":"/paper/unig-encoder-a-universal-feature-encoder-for","slug":"unig-encoder-a-universal-feature-encoder-for","title":"UniG-Encoder: A Universal Feature Encoder for Graph and Hypergraph Node Classification","date":"2023-08-03","arxiv_id":"2308.01650","repositories_listed":1,"syntology":null},{"url":"/paper/diffusal-coupling-active-learning-with-graph","slug":"diffusal-coupling-active-learning-with-graph","title":"DiffusAL: Coupling Active Learning with Graph Diffusion for Label-Efficient Node Classification","date":"2023-07-31","arxiv_id":"2308.00146","repositories_listed":1,"syntology":null},{"url":"/paper/addressing-the-impact-of-localized-training","slug":"addressing-the-impact-of-localized-training","title":"Addressing the Impact of Localized Training Data in Graph Neural Networks","date":"2023-07-24","arxiv_id":"2307.12689","repositories_listed":1,"syntology":null},{"url":"/paper/opengda-graph-domain-adaptation-benchmark-for","slug":"opengda-graph-domain-adaptation-benchmark-for","title":"OpenGDA: Graph Domain Adaptation Benchmark for Cross-network Learning","date":"2023-07-21","arxiv_id":"2307.11341","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/opengda-graph-domain-adaptation-benchmark-for#ran","syntology_url":"https://syntology.ai/paper/2307.11341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.11341"}},"official":{"repos":["skyorca/opengda"],"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/examining-the-effects-of-degree-distribution","slug":"examining-the-effects-of-degree-distribution","title":"Examining the Effects of Degree Distribution and Homophily in Graph Learning Models","date":"2023-07-17","arxiv_id":"2307.08881","repositories_listed":1,"syntology":null},{"url":"/paper/polygnn-polyhedron-based-graph-neural-network","slug":"polygnn-polyhedron-based-graph-neural-network","title":"PolyGNN: Polyhedron-based Graph Neural Network for 3D Building Reconstruction from Point Clouds","date":"2023-07-17","arxiv_id":"2307.08636","repositories_listed":1,"syntology":null},{"url":"/paper/improving-fairness-of-graph-neural-networks-a","slug":"improving-fairness-of-graph-neural-networks-a","title":"Towards Fair Graph Neural Networks via Graph Counterfactual","date":"2023-07-10","arxiv_id":"2307.04937","repositories_listed":1,"syntology":null},{"url":"/paper/learning-from-heterogeneity-a-dynamic","slug":"learning-from-heterogeneity-a-dynamic","title":"Learning from Heterogeneity: A Dynamic Learning Framework for Hypergraphs","date":"2023-07-07","arxiv_id":"2307.03411","repositories_listed":1,"syntology":null},{"url":"/paper/transformerg2g-adaptive-time-stepping-for","slug":"transformerg2g-adaptive-time-stepping-for","title":"TransformerG2G: Adaptive time-stepping for learning temporal graph embeddings using transformers","date":"2023-07-05","arxiv_id":"2307.02588","repositories_listed":1,"syntology":null},{"url":"/paper/re-think-and-re-design-graph-neural-networks","slug":"re-think-and-re-design-graph-neural-networks","title":"Re-Think and Re-Design Graph Neural Networks in Spaces of Continuous Graph Diffusion Functionals","date":"2023-07-01","arxiv_id":"2307.00222","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/re-think-and-re-design-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2307.00222","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.00222"}},"official":{"repos":["Dandy5721/GNN-PDE-COV"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/diffusion-jump-gnns-homophiliation-via","slug":"diffusion-jump-gnns-homophiliation-via","title":"Diffusion-Jump GNNs: Homophiliation via Learnable Metric Filters","date":"2023-06-29","arxiv_id":"2306.16976","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/diffusion-jump-gnns-homophiliation-via#ran","syntology_url":"https://syntology.ai/paper/2306.16976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.16976"}},"official":{"repos":["AhmedBegggaUA/TFM"],"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/contrastive-meta-learning-for-few-shot-node","slug":"contrastive-meta-learning-for-few-shot-node","title":"Contrastive Meta-Learning for Few-shot Node Classification","date":"2023-06-27","arxiv_id":"2306.15154","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-episode-generation-for-graph","slug":"unsupervised-episode-generation-for-graph","title":"Unsupervised Episode Generation for Graph Meta-learning","date":"2023-06-27","arxiv_id":"2306.15217","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":3,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unsupervised-episode-generation-for-graph#ran","syntology_url":"https://syntology.ai/paper/2306.15217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.15217"}},"official":{"repos":["jhngjng/naq-pytorch"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/torsion-graph-neural-networks","slug":"torsion-graph-neural-networks","title":"Torsion Graph Neural Networks","date":"2023-06-23","arxiv_id":"2306.13541","repositories_listed":1,"syntology":null},{"url":"/paper/cat-walk-inductive-hypergraph-learning-via","slug":"cat-walk-inductive-hypergraph-learning-via","title":"CAT-Walk: Inductive Hypergraph Learning via Set Walks","date":"2023-06-19","arxiv_id":"2306.11147","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 1 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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/cat-walk-inductive-hypergraph-learning-via#ran","syntology_url":"https://syntology.ai/paper/2306.11147","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.11147"}},"official":{"repos":["ubc-systopia/CATWalk"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/from-hypergraph-energy-functions-to","slug":"from-hypergraph-energy-functions-to","title":"From Hypergraph Energy Functions to Hypergraph Neural Networks","date":"2023-06-16","arxiv_id":"2306.09623","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/from-hypergraph-energy-functions-to#ran","syntology_url":"https://syntology.ai/paper/2306.09623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.09623"}},"official":{"repos":["yxzwang/phenomnn"],"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":["found_in_text","official"]}}},{"url":"/paper/graphsha-synthesizing-harder-samples-for","slug":"graphsha-synthesizing-harder-samples-for","title":"GraphSHA: Synthesizing Harder Samples for Class-Imbalanced Node Classification","date":"2023-06-16","arxiv_id":"2306.09612","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-dynamic-network-embedding-with","slug":"accelerating-dynamic-network-embedding-with","title":"Accelerating Dynamic Network Embedding with Billions of Parameter Updates to Milliseconds","date":"2023-06-15","arxiv_id":"2306.08967","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/accelerating-dynamic-network-embedding-with#ran","syntology_url":"https://syntology.ai/paper/2306.08967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08967"}},"official":{"repos":["zjunet/damf"],"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/the-split-matters-flat-minima-methods-for","slug":"the-split-matters-flat-minima-methods-for","title":"The Split Matters: Flat Minima Methods for Improving the Performance of GNNs","date":"2023-06-15","arxiv_id":"2306.09121","repositories_listed":1,"syntology":null},{"url":"/paper/nodeformer-a-scalable-graph-structure","slug":"nodeformer-a-scalable-graph-structure","title":"NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classification","date":"2023-06-14","arxiv_id":"2306.08385","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/nodeformer-a-scalable-graph-structure#ran","syntology_url":"https://syntology.ai/paper/2306.08385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08385"}},"official":{"repos":["qitianwu/nodeformer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/why-using-either-aggregated-features-or","slug":"why-using-either-aggregated-features-or","title":"A Simple and Scalable Graph Neural Network for Large Directed Graphs","date":"2023-06-14","arxiv_id":"2306.08274","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":2,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/why-using-either-aggregated-features-or#ran","syntology_url":"https://syntology.ai/paper/2306.08274","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08274"}},"official":{"repos":["seijimaekawa/a2dug"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/bemap-balanced-message-passing-for-fair-graph","slug":"bemap-balanced-message-passing-for-fair-graph","title":"BeMap: Balanced Message Passing for Fair Graph Neural Network","date":"2023-06-07","arxiv_id":"2306.04107","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":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/bemap-balanced-message-passing-for-fair-graph#ran","syntology_url":"https://syntology.ai/paper/2306.04107","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.04107"}},"official":{"repos":["xiaolin-cs/bemap"],"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/randomized-schur-complement-views-for-graph","slug":"randomized-schur-complement-views-for-graph","title":"Randomized Schur Complement Views for Graph Contrastive Learning","date":"2023-06-06","arxiv_id":"2306.04004","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/randomized-schur-complement-views-for-graph#ran","syntology_url":"https://syntology.ai/paper/2306.04004","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.04004"}},"official":{"repos":["kvignesh1420/rlap"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/schema-first-learn-versatile-knowledge-graph","slug":"schema-first-learn-versatile-knowledge-graph","title":"Schema First! Learn Versatile Knowledge Graph Embeddings by Capturing Semantics with MASCHInE","date":"2023-06-06","arxiv_id":"2306.03659","repositories_listed":1,"syntology":null},{"url":"/paper/clarify-confused-nodes-through-separated","slug":"clarify-confused-nodes-through-separated","title":"Clarify Confused Nodes via Separated Learning","date":"2023-06-04","arxiv_id":"2306.02285","repositories_listed":1,"syntology":null},{"url":"/paper/towards-deep-attention-in-graph-neural","slug":"towards-deep-attention-in-graph-neural","title":"Towards Deep Attention in Graph Neural Networks: Problems and Remedies","date":"2023-06-04","arxiv_id":"2306.02376","repositories_listed":1,"syntology":null},{"url":"/paper/demystifying-structural-disparity-in-graph-1","slug":"demystifying-structural-disparity-in-graph-1","title":"Demystifying Structural Disparity in Graph Neural Networks: Can One Size Fit All?","date":"2023-06-02","arxiv_id":"2306.01323","repositories_listed":1,"syntology":null},{"url":"/paper/graph-entropy-minimization-for-semi","slug":"graph-entropy-minimization-for-semi","title":"Graph Entropy Minimization for Semi-supervised Node Classification","date":"2023-05-31","arxiv_id":"2305.19502","repositories_listed":1,"syntology":null},{"url":"/paper/node-embedding-from-neural-hamiltonian-orbits","slug":"node-embedding-from-neural-hamiltonian-orbits","title":"Node Embedding from Neural Hamiltonian Orbits in Graph Neural Networks","date":"2023-05-30","arxiv_id":"2305.18965","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":3,"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/node-embedding-from-neural-hamiltonian-orbits#ran","syntology_url":"https://syntology.ai/paper/2305.18965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18965"}},"official":{"repos":["zknus/hamiltonian-gnn"],"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","unlocated"]}}},{"url":"/paper/task-equivariant-graph-few-shot-learning","slug":"task-equivariant-graph-few-shot-learning","title":"Task-Equivariant Graph Few-shot Learning","date":"2023-05-30","arxiv_id":"2305.18758","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/task-equivariant-graph-few-shot-learning#ran","syntology_url":"https://syntology.ai/paper/2305.18758","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18758"}},"official":{"repos":["sung-won-kim/teg"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/confidence-based-feature-imputation-for","slug":"confidence-based-feature-imputation-for","title":"Confidence-Based Feature Imputation for Graphs with Partially Known Features","date":"2023-05-26","arxiv_id":"2305.16618","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/confidence-based-feature-imputation-for#ran","syntology_url":"https://syntology.ai/paper/2305.16618","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.16618"}},"official":{"repos":["daehoum1/pcfi"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-convection-diffusion-with","slug":"graph-neural-convection-diffusion-with","title":"Graph Neural Convection-Diffusion with Heterophily","date":"2023-05-26","arxiv_id":"2305.16780","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"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) · 0 unverified","sample_list":"/paper/graph-neural-convection-diffusion-with#ran","syntology_url":"https://syntology.ai/paper/2305.16780","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.16780"}},"official":{"repos":["zknus/graph-diffusion-cde"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-online-node-labeling-for-very-large","slug":"fast-online-node-labeling-for-very-large","title":"Fast Online Node Labeling for Very Large Graphs","date":"2023-05-25","arxiv_id":"2305.16257","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/fast-online-node-labeling-for-very-large#ran","syntology_url":"https://syntology.ai/paper/2305.16257","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.16257"}},"official":{"repos":["baojian/FastONL"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/degree-decomposition-based-explanation-for-1","slug":"degree-decomposition-based-explanation-for-1","title":"DEGREE: Decomposition Based Explanation For Graph Neural Networks","date":"2023-05-22","arxiv_id":"2305.12895","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":0,"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/degree-decomposition-based-explanation-for-1#ran","syntology_url":"https://syntology.ai/paper/2305.12895","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12895"}},"official":{"repos":["Qizhang-Feng/DEGREE"],"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/graph-propagation-transformer-for-graph","slug":"graph-propagation-transformer-for-graph","title":"Graph Propagation Transformer for Graph Representation Learning","date":"2023-05-19","arxiv_id":"2305.11424","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"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) · 4 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/graph-propagation-transformer-for-graph#ran","syntology_url":"https://syntology.ai/paper/2305.11424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.11424"}},"official":{"repos":["czczup/gptrans"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/less-can-be-more-unsupervised-graph-pruning","slug":"less-can-be-more-unsupervised-graph-pruning","title":"Less Can Be More: Unsupervised Graph Pruning for Large-scale Dynamic Graphs","date":"2023-05-18","arxiv_id":"2305.10673","repositories_listed":1,"syntology":null},{"url":"/paper/edge-directionality-improves-learning-on","slug":"edge-directionality-improves-learning-on","title":"Edge Directionality Improves Learning on Heterophilic Graphs","date":"2023-05-17","arxiv_id":"2305.10498","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"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) · 1 unverified","sample_list":"/paper/edge-directionality-improves-learning-on#ran","syntology_url":"https://syntology.ai/paper/2305.10498","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.10498"}},"official":{"repos":["emalgorithm/directed-graph-neural-network"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/addressing-heterophily-in-node-classification","slug":"addressing-heterophily-in-node-classification","title":"Addressing Heterophily in Node Classification with Graph Echo State Networks","date":"2023-05-14","arxiv_id":"2305.08233","repositories_listed":1,"syntology":null}],"record_sha256":"32e0fd92624b2115aa64bf226a2f537b4ee521566235edaccdfb87bb22dd81c9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}