{"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/7","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":7,"pages_in_order":19,"rows_per_page":100,"rows":[601,700],"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/6","next":"/task/node-classification/papers/8","papers":[{"url":"/paper/sgat-simplicial-graph-attention-network","slug":"sgat-simplicial-graph-attention-network","title":"SGAT: Simplicial Graph Attention Network","date":"2022-07-24","arxiv_id":"2207.11761","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-non-linearity-in-graph-neural","slug":"understanding-non-linearity-in-graph-neural","title":"Understanding Non-linearity in Graph Neural Networks from the Bayesian-Inference Perspective","date":"2022-07-22","arxiv_id":"2207.11311","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-homophily-structure-aware-path","slug":"beyond-homophily-structure-aware-path","title":"Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network","date":"2022-07-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/differentially-private-graph-learning-via","slug":"differentially-private-graph-learning-via","title":"Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank","date":"2022-07-14","arxiv_id":"2207.06944","repositories_listed":1,"syntology":null},{"url":"/paper/equivariant-hypergraph-diffusion-neural","slug":"equivariant-hypergraph-diffusion-neural","title":"Equivariant Hypergraph Diffusion Neural Operators","date":"2022-07-14","arxiv_id":"2207.06680","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/equivariant-hypergraph-diffusion-neural#ran","syntology_url":"https://syntology.ai/paper/2207.06680","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.06680"}},"official":{"repos":["graph-com/ed-hnn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/the-dlcc-node-classification-benchmark-for","slug":"the-dlcc-node-classification-benchmark-for","title":"The DLCC Node Classification Benchmark for Analyzing Knowledge Graph Embeddings","date":"2022-07-13","arxiv_id":"2207.06014","repositories_listed":1,"syntology":null},{"url":"/paper/a-proposal-of-multi-layer-perceptron-with","slug":"a-proposal-of-multi-layer-perceptron-with","title":"A Proposal of Multi-Layer Perceptron with Graph Gating Unit for Graph Representation Learning and its Application to Surrogate Model for FEM","date":"2022-07-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/scalable-privacy-enhanced-benchmark-graph","slug":"scalable-privacy-enhanced-benchmark-graph","title":"Graph Generative Model for Benchmarking Graph Neural Networks","date":"2022-07-10","arxiv_id":"2207.04396","repositories_listed":1,"syntology":null},{"url":"/paper/graph-trees-with-attention","slug":"graph-trees-with-attention","title":"TREE-G: Decision Trees Contesting Graph Neural Networks","date":"2022-07-06","arxiv_id":"2207.02760","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/graph-trees-with-attention#ran","syntology_url":"https://syntology.ai/paper/2207.02760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02760"}},"official":{"repos":["mayabechlerspeicher/tree-g"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/what-do-graph-convolutional-neural-networks","slug":"what-do-graph-convolutional-neural-networks","title":"What Do Graph Convolutional Neural Networks Learn?","date":"2022-07-05","arxiv_id":"2207.01839","repositories_listed":1,"syntology":null},{"url":"/paper/assessing-the-effects-of-hyperparameters-on","slug":"assessing-the-effects-of-hyperparameters-on","title":"Assessing the Effects of Hyperparameters on Knowledge Graph Embedding Quality","date":"2022-07-01","arxiv_id":"2207.00473","repositories_listed":1,"syntology":null},{"url":"/paper/modularity-optimization-as-a-training","slug":"modularity-optimization-as-a-training","title":"Modularity Optimization as a Training Criterion for Graph Neural Networks","date":"2022-06-30","arxiv_id":"2207.00107","repositories_listed":1,"syntology":null},{"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/structural-entropy-guided-graph-hierarchical","slug":"structural-entropy-guided-graph-hierarchical","title":"Structural Entropy Guided Graph Hierarchical Pooling","date":"2022-06-26","arxiv_id":"2206.13510","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/structural-entropy-guided-graph-hierarchical#ran","syntology_url":"https://syntology.ai/paper/2206.13510","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.13510"}},"official":{"repos":["wu-junran/sep"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tam-topology-aware-margin-loss-for-class","slug":"tam-topology-aware-margin-loss-for-class","title":"TAM: Topology-Aware Margin Loss for Class-Imbalanced Node Classification","date":"2022-06-26","arxiv_id":"2206.12917","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":0,"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/tam-topology-aware-margin-loss-for-class#ran","syntology_url":"https://syntology.ai/paper/2206.12917","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.12917"}},"official":{"repos":["Jaeyun-Song/TAM"],"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/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/task-adaptive-few-shot-node-classification","slug":"task-adaptive-few-shot-node-classification","title":"Task-Adaptive Few-shot Node Classification","date":"2022-06-23","arxiv_id":"2206.11972","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/task-adaptive-few-shot-node-classification#ran","syntology_url":"https://syntology.ai/paper/2206.11972","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.11972"}},"official":{"repos":["songw-sw/tent"],"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","unlocated"]}}},{"url":"/paper/descent-steps-of-a-relation-aware-energy","slug":"descent-steps-of-a-relation-aware-energy","title":"Descent Steps of a Relation-Aware Energy Produce Heterogeneous Graph Neural Networks","date":"2022-06-22","arxiv_id":"2206.11081","repositories_listed":1,"syntology":null},{"url":"/paper/graphframex-towards-systematic-evaluation-of","slug":"graphframex-towards-systematic-evaluation-of","title":"GraphFramEx: Towards Systematic Evaluation of Explainability Methods for Graph Neural Networks","date":"2022-06-20","arxiv_id":"2206.09677","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":0,"n_honours":4,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 4 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graphframex-towards-systematic-evaluation-of#ran","syntology_url":"https://syntology.ai/paper/2206.09677","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.09677"}},"official":{"repos":["graphframex/graphframex"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["community","official"]}}},{"url":"/paper/beyond-real-world-benchmark-datasets-an","slug":"beyond-real-world-benchmark-datasets-an","title":"Beyond Real-world Benchmark Datasets: An Empirical Study of Node Classification with GNNs","date":"2022-06-18","arxiv_id":"2206.09144","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"7 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/beyond-real-world-benchmark-datasets-an#ran","syntology_url":"https://syntology.ai/paper/2206.09144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.09144"}},"official":{"repos":["seijimaekawa/empirical-study-of-gnns"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dfg-nas-deep-and-flexible-graph-neural","slug":"dfg-nas-deep-and-flexible-graph-neural","title":"DFG-NAS: Deep and Flexible Graph Neural Architecture Search","date":"2022-06-17","arxiv_id":"2206.08582","repositories_listed":1,"syntology":null},{"url":"/paper/sheaf-neural-networks-with-connection","slug":"sheaf-neural-networks-with-connection","title":"Sheaf Neural Networks with Connection Laplacians","date":"2022-06-17","arxiv_id":"2206.08702","repositories_listed":1,"syntology":null},{"url":"/paper/clnode-curriculum-learning-for-node","slug":"clnode-curriculum-learning-for-node","title":"CLNode: Curriculum Learning for Node Classification","date":"2022-06-15","arxiv_id":"2206.07258","repositories_listed":1,"syntology":null},{"url":"/paper/graphfm-improving-large-scale-gnn-training","slug":"graphfm-improving-large-scale-gnn-training","title":"GraphFM: Improving Large-Scale GNN Training via Feature Momentum","date":"2022-06-14","arxiv_id":"2206.07161","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/graphfm-improving-large-scale-gnn-training#ran","syntology_url":"https://syntology.ai/paper/2206.07161","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.07161"}},"official":{"repos":["divelab/DIG"],"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/acmp-allen-cahn-message-passing-for-graph","slug":"acmp-allen-cahn-message-passing-for-graph","title":"ACMP: Allen-Cahn Message Passing for Graph Neural Networks with Particle Phase Transition","date":"2022-06-11","arxiv_id":"2206.05437","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/acmp-allen-cahn-message-passing-for-graph#ran","syntology_url":"https://syntology.ai/paper/2206.05437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.05437"}},"official":{"repos":["ykiiiiii/acmp"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/nagphormer-neighborhood-aggregation-graph","slug":"nagphormer-neighborhood-aggregation-graph","title":"NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs","date":"2022-06-10","arxiv_id":"2206.04910","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/nagphormer-neighborhood-aggregation-graph#ran","syntology_url":"https://syntology.ai/paper/2206.04910","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04910"}},"official":{"repos":["jhl-hust/nagphormer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/i-m-me-we-re-us-and-i-m-us-tri-directional","slug":"i-m-me-we-re-us-and-i-m-us-tri-directional","title":"I'm Me, We're Us, and I'm Us: Tri-directional Contrastive Learning on Hypergraphs","date":"2022-06-09","arxiv_id":"2206.04739","repositories_listed":1,"syntology":null},{"url":"/paper/neo-gnns-neighborhood-overlap-aware-graph-1","slug":"neo-gnns-neighborhood-overlap-aware-graph-1","title":"Neo-GNNs: Neighborhood Overlap-aware Graph Neural Networks for Link Prediction","date":"2022-06-09","arxiv_id":"2206.04216","repositories_listed":1,"syntology":null},{"url":"/paper/pseudo-poincare-a-unification-framework-for","slug":"pseudo-poincare-a-unification-framework-for","title":"A Unification Framework for Euclidean and Hyperbolic Graph Neural Networks","date":"2022-06-09","arxiv_id":"2206.04285","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":2,"n_violates":1,"n_no_contract":7,"n_pointer_only":4,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/pseudo-poincare-a-unification-framework-for#ran","syntology_url":"https://syntology.ai/paper/2206.04285","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04285"}},"official":{"repos":["oom-debugger/ijcai23"],"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/on-calibration-of-graph-neural-networks-for","slug":"on-calibration-of-graph-neural-networks-for","title":"On Calibration of Graph Neural Networks for Node Classification","date":"2022-06-03","arxiv_id":"2206.01570","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-relation-aware-graph-network","slug":"automatic-relation-aware-graph-network","title":"Automatic Relation-aware Graph Network Proliferation","date":"2022-05-31","arxiv_id":"2205.15678","repositories_listed":1,"syntology":null},{"url":"/paper/label-enhanced-graph-neural-network-for-semi","slug":"label-enhanced-graph-neural-network-for-semi","title":"Label-Enhanced Graph Neural Network for Semi-supervised Node Classification","date":"2022-05-31","arxiv_id":"2205.15653","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-robust-graph-contrastive-learning","slug":"bayesian-robust-graph-contrastive-learning","title":"Bayesian Robust Graph Contrastive Learning","date":"2022-05-27","arxiv_id":"2205.14109","repositories_listed":1,"syntology":null},{"url":"/paper/evennet-ignoring-odd-hop-neighbors-improves","slug":"evennet-ignoring-odd-hop-neighbors-improves","title":"EvenNet: Ignoring Odd-Hop Neighbors Improves Robustness of Graph Neural Networks","date":"2022-05-27","arxiv_id":"2205.13892","repositories_listed":1,"syntology":null},{"url":"/paper/geometer-graph-few-shot-class-incremental","slug":"geometer-graph-few-shot-class-incremental","title":"Geometer: Graph Few-Shot Class-Incremental Learning via Prototype Representation","date":"2022-05-27","arxiv_id":"2205.13954","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/geometer-graph-few-shot-class-incremental#ran","syntology_url":"https://syntology.ai/paper/2205.13954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13954"}},"official":{"repos":["RobinLu1209/Geometer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/compressing-deep-graph-neural-networks-via","slug":"compressing-deep-graph-neural-networks-via","title":"Compressing Deep Graph Neural Networks via Adversarial Knowledge Distillation","date":"2022-05-24","arxiv_id":"2205.11678","repositories_listed":1,"syntology":null},{"url":"/paper/recipe2vec-multi-modal-recipe-representation","slug":"recipe2vec-multi-modal-recipe-representation","title":"Recipe2Vec: Multi-modal Recipe Representation Learning with Graph Neural Networks","date":"2022-05-24","arxiv_id":"2205.12396","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/on-the-prediction-instability-of-graph-neural","slug":"on-the-prediction-instability-of-graph-neural","title":"On the Prediction Instability of Graph Neural Networks","date":"2022-05-20","arxiv_id":"2205.10070","repositories_listed":1,"syntology":null},{"url":"/paper/towards-explanation-for-unsupervised-graph","slug":"towards-explanation-for-unsupervised-graph","title":"Towards Explanation for Unsupervised Graph-Level Representation Learning","date":"2022-05-20","arxiv_id":"2205.09934","repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-yet-effective-svd-gcn-for-directed","slug":"a-simple-yet-effective-svd-gcn-for-directed","title":"A Simple Yet Effective SVD-GCN for Directed Graphs","date":"2022-05-19","arxiv_id":"2205.09335","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"5 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; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-simple-yet-effective-svd-gcn-for-directed#ran","syntology_url":"https://syntology.ai/paper/2205.09335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.09335"}},"official":{"repos":["thisisforreview/svd-gcn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/simplifying-node-classification-on","slug":"simplifying-node-classification-on","title":"Simplifying Node Classification on Heterophilous Graphs with Compatible Label Propagation","date":"2022-05-19","arxiv_id":"2205.09389","repositories_listed":1,"syntology":null},{"url":"/paper/finding-global-homophily-in-graph-neural","slug":"finding-global-homophily-in-graph-neural","title":"Finding Global Homophily in Graph Neural Networks When Meeting Heterophily","date":"2022-05-15","arxiv_id":"2205.07308","repositories_listed":1,"syntology":null},{"url":"/paper/bandits-for-structure-perturbation-based","slug":"bandits-for-structure-perturbation-based","title":"Bandits for Structure Perturbation-based Black-box Attacks to Graph Neural Networks with Theoretical Guarantees","date":"2022-05-07","arxiv_id":"2205.03546","repositories_listed":1,"syntology":null},{"url":"/paper/lpgnet-link-private-graph-networks-for-node","slug":"lpgnet-link-private-graph-networks-for-node","title":"LPGNet: Link Private Graph Networks for Node Classification","date":"2022-05-06","arxiv_id":"2205.03105","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":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) · 2 unverified","sample_list":"/paper/lpgnet-link-private-graph-networks-for-node#ran","syntology_url":"https://syntology.ai/paper/2205.03105","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.03105"}},"official":{"repos":["ashgeek/lpgnet-prototype"],"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/learning-label-initialization-for-time","slug":"learning-label-initialization-for-time","title":"Learning Label Initialization for Time-Dependent Harmonic Extension","date":"2022-05-03","arxiv_id":"2205.01358","repositories_listed":1,"syntology":null},{"url":"/paper/rosa-a-robust-self-aligned-framework-for-node","slug":"rosa-a-robust-self-aligned-framework-for-node","title":"RoSA: A Robust Self-Aligned Framework for Node-Node Graph Contrastive Learning","date":"2022-04-29","arxiv_id":"2204.13846","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":6,"phrase":"2 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/rosa-a-robust-self-aligned-framework-for-node#ran","syntology_url":"https://syntology.ai/paper/2204.13846","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.13846"}},"official":{"repos":["zhuyun97/rosa"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/bsal-a-framework-of-bi-component-structure","slug":"bsal-a-framework-of-bi-component-structure","title":"BSAL: A Framework of Bi-component Structure and Attribute Learning for Link Prediction","date":"2022-04-18","arxiv_id":"2204.09508","repositories_listed":1,"syntology":null},{"url":"/paper/neural-structured-prediction-for-inductive-1","slug":"neural-structured-prediction-for-inductive-1","title":"Neural Structured Prediction for Inductive Node Classification","date":"2022-04-15","arxiv_id":"2204.07524","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/neural-structured-prediction-for-inductive-1#ran","syntology_url":"https://syntology.ai/paper/2204.07524","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.07524"}},"official":{"repos":["deepgraphlearning/spn"],"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-hierarchical-block-distance-model-for-ultra","slug":"a-hierarchical-block-distance-model-for-ultra","title":"A Hierarchical Block Distance Model for Ultra Low-Dimensional Graph Representations","date":"2022-04-12","arxiv_id":"2204.05885","repositories_listed":1,"syntology":null},{"url":"/paper/graph-ordering-attention-networks","slug":"graph-ordering-attention-networks","title":"Graph Ordering Attention Networks","date":"2022-04-11","arxiv_id":"2204.05351","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-ordering-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2204.05351","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.05351"}},"official":{"repos":["michailchatzianastasis/goat"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/inferring-from-references-with-differences","slug":"inferring-from-references-with-differences","title":"Inferring from References with Differences for Semi-Supervised Node Classification on Graphs","date":"2022-04-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/explicit-feature-interaction-aware-graph","slug":"explicit-feature-interaction-aware-graph","title":"Explicit Feature Interaction-aware Graph Neural Networks","date":"2022-04-07","arxiv_id":"2204.03225","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-the-gap-of-autograph-between","slug":"bridging-the-gap-of-autograph-between","title":"Bridging the Gap of AutoGraph between Academia and Industry: Analysing AutoGraph Challenge at KDD Cup 2020","date":"2022-04-06","arxiv_id":"2204.02625","repositories_listed":1,"syntology":null},{"url":"/paper/synthetic-graph-generation-to-benchmark-graph","slug":"synthetic-graph-generation-to-benchmark-graph","title":"Synthetic Graph Generation to Benchmark Graph Learning","date":"2022-04-04","arxiv_id":"2204.01376","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-neighbor-effect-conv-agnostic-gnns","slug":"exploiting-neighbor-effect-conv-agnostic-gnns","title":"Exploiting Neighbor Effect: Conv-Agnostic GNNs Framework for Graphs with Heterophily","date":"2022-03-19","arxiv_id":"2203.11200","repositories_listed":1,"syntology":null},{"url":"/paper/view-consistent-heterogeneous-network-on","slug":"view-consistent-heterogeneous-network-on","title":"View-Consistent Heterogeneous Network on Graphs With Few Labeled Nodes","date":"2022-03-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/grand-scalable-graph-random-neural-networks","slug":"grand-scalable-graph-random-neural-networks","title":"GRAND+: Scalable Graph Random Neural Networks","date":"2022-03-12","arxiv_id":"2203.06389","repositories_listed":1,"syntology":null},{"url":"/paper/defending-graph-convolutional-networks","slug":"defending-graph-convolutional-networks","title":"Defending Graph Convolutional Networks against Dynamic Graph Perturbations via Bayesian Self-supervision","date":"2022-03-07","arxiv_id":"2203.03762","repositories_listed":1,"syntology":null},{"url":"/paper/r-gcn-the-r-could-stand-for-random","slug":"r-gcn-the-r-could-stand-for-random","title":"R-GCN: The R Could Stand for Random","date":"2022-03-04","arxiv_id":"2203.02424","repositories_listed":1,"syntology":null},{"url":"/paper/graph-representation-learning-beyond-node-and","slug":"graph-representation-learning-beyond-node-and","title":"Graph Representation Learning Beyond Node and Homophily","date":"2022-03-03","arxiv_id":"2203.01564","repositories_listed":1,"syntology":null},{"url":"/paper/gap-differentially-private-graph-neural","slug":"gap-differentially-private-graph-neural","title":"GAP: Differentially Private Graph Neural Networks with Aggregation Perturbation","date":"2022-03-02","arxiv_id":"2203.00949","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gap-differentially-private-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2203.00949","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.00949"}},"official":{"repos":["sisaman/gap"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-attention-retrospective","slug":"graph-attention-retrospective","title":"Graph Attention Retrospective","date":"2022-02-26","arxiv_id":"2202.13060","repositories_listed":1,"syntology":null},{"url":"/paper/graph-masked-autoencoder","slug":"graph-masked-autoencoder","title":"Graph Masked Autoencoders with Transformers","date":"2022-02-17","arxiv_id":"2202.08391","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-graph-contrastive-learning-with","slug":"adversarial-graph-contrastive-learning-with","title":"Adversarial Graph Contrastive Learning with Information Regularization","date":"2022-02-14","arxiv_id":"2202.06491","repositories_listed":1,"syntology":null},{"url":"/paper/hyla-hyperbolic-laplacian-features-for-graph","slug":"hyla-hyperbolic-laplacian-features-for-graph","title":"Random Laplacian Features for Learning with Hyperbolic Space","date":"2022-02-14","arxiv_id":"2202.06854","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hyla-hyperbolic-laplacian-features-for-graph#ran","syntology_url":"https://syntology.ai/paper/2202.06854","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.06854"}},"official":{"repos":["ydtydr/hyla"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-sheaf-diffusion-a-topological","slug":"neural-sheaf-diffusion-a-topological","title":"Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs","date":"2022-02-09","arxiv_id":"2202.04579","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/neural-sheaf-diffusion-a-topological#ran","syntology_url":"https://syntology.ai/paper/2202.04579","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.04579"}},"official":{"repos":["twitter-research/neural-sheaf-diffusion"],"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/simplified-graph-convolution-with-heterophily","slug":"simplified-graph-convolution-with-heterophily","title":"Simplified Graph Convolution with Heterophily","date":"2022-02-08","arxiv_id":"2202.04139","repositories_listed":1,"syntology":null},{"url":"/paper/markovgnn-graph-neural-networks-on-markov","slug":"markovgnn-graph-neural-networks-on-markov","title":"MarkovGNN: Graph Neural Networks on Markov Diffusion","date":"2022-02-05","arxiv_id":"2202.02470","repositories_listed":1,"syntology":null},{"url":"/paper/convolutional-neural-networks-on-graphs-with-1","slug":"convolutional-neural-networks-on-graphs-with-1","title":"Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited","date":"2022-02-04","arxiv_id":"2202.03580","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/convolutional-neural-networks-on-graphs-with-1#ran","syntology_url":"https://syntology.ai/paper/2202.03580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.03580"}},"official":{"repos":["ivam-he/chebnetii"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-coloring-with-physics-inspired-graph","slug":"graph-coloring-with-physics-inspired-graph","title":"Graph Coloring with Physics-Inspired Graph Neural Networks","date":"2022-02-03","arxiv_id":"2202.01606","repositories_listed":1,"syntology":null},{"url":"/paper/dimensionality-reduction-meets-message","slug":"dimensionality-reduction-meets-message","title":"Dimensionality Reduction Meets Message Passing for Graph Node Embeddings","date":"2022-02-01","arxiv_id":"2202.00408","repositories_listed":1,"syntology":null},{"url":"/paper/questions-for-flat-minima-optimization-of","slug":"questions-for-flat-minima-optimization-of","title":"When Do Flat Minima Optimizers Work?","date":"2022-02-01","arxiv_id":"2202.00661","repositories_listed":1,"syntology":null},{"url":"/paper/smgrl-a-scalable-multi-resolution-graph","slug":"smgrl-a-scalable-multi-resolution-graph","title":"SMGRL: Scalable Multi-resolution Graph Representation Learning","date":"2022-01-29","arxiv_id":"2201.12670","repositories_listed":1,"syntology":null},{"url":"/paper/partition-based-active-learning-for-graph","slug":"partition-based-active-learning-for-graph","title":"Partition-Based Active Learning for Graph Neural Networks","date":"2022-01-23","arxiv_id":"2201.09391","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-graph-poisoning-attack-via","slug":"unsupervised-graph-poisoning-attack-via","title":"Unsupervised Graph Poisoning Attack via Contrastive Loss Back-propagation","date":"2022-01-20","arxiv_id":"2201.07986","repositories_listed":1,"syntology":null},{"url":"/paper/decoupling-the-depth-and-scope-of-graph-1","slug":"decoupling-the-depth-and-scope-of-graph-1","title":"Decoupling the Depth and Scope of Graph Neural Networks","date":"2022-01-19","arxiv_id":"2201.07858","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"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 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) · 1 unverified","sample_list":"/paper/decoupling-the-depth-and-scope-of-graph-1#ran","syntology_url":"https://syntology.ai/paper/2201.07858","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.07858"}},"official":{"repos":["facebookresearch/shaDow_GNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-unsupervised-deep-graph-structure","slug":"towards-unsupervised-deep-graph-structure","title":"Towards Unsupervised Deep Graph Structure Learning","date":"2022-01-17","arxiv_id":"2201.06367","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-unsupervised-deep-graph-structure#ran","syntology_url":"https://syntology.ai/paper/2201.06367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.06367"}},"official":{"repos":["grand-lab/sublime"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rgl-a-simple-yet-effective-relation-graph","slug":"rgl-a-simple-yet-effective-relation-graph","title":"RGL: A Simple yet Effective Relation Graph Augmented Prompt-based Tuning Approach for Few-Shot Learning","date":"2022-01-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/quasi-framelets-another-improvement-to","slug":"quasi-framelets-another-improvement-to","title":"Quasi-Framelets: Robust Graph Neural Networks via Adaptive Framelet Convolution","date":"2022-01-11","arxiv_id":"2201.04728","repositories_listed":1,"syntology":null},{"url":"/paper/mgae-masked-autoencoders-for-self-supervised","slug":"mgae-masked-autoencoders-for-self-supervised","title":"MGAE: Masked Autoencoders for Self-Supervised Learning on Graphs","date":"2022-01-07","arxiv_id":"2201.02534","repositories_listed":1,"syntology":null},{"url":"/paper/asymptotics-of-ell-2-regularized-network","slug":"asymptotics-of-ell-2-regularized-network","title":"Asymptotics of $\\ell_2$ Regularized Network Embeddings","date":"2022-01-05","arxiv_id":"2201.01689","repositories_listed":1,"syntology":null},{"url":"/paper/towards-similarity-aware-time-series","slug":"towards-similarity-aware-time-series","title":"Towards Similarity-Aware Time-Series Classification","date":"2022-01-05","arxiv_id":"2201.01413","repositories_listed":1,"syntology":null},{"url":"/paper/hypergraph-induced-semantic-tuplet-loss-for","slug":"hypergraph-induced-semantic-tuplet-loss-for","title":"Hypergraph-Induced Semantic Tuplet Loss for Deep Metric Learning","date":"2022-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/motif-graph-neural-network","slug":"motif-graph-neural-network","title":"Motif Graph Neural Network","date":"2021-12-30","arxiv_id":"2112.14900","repositories_listed":1,"syntology":null},{"url":"/paper/deformable-graph-convolutional-networks","slug":"deformable-graph-convolutional-networks","title":"Deformable Graph Convolutional Networks","date":"2021-12-29","arxiv_id":"2112.14438","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":0,"n_no_contract":1,"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, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deformable-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2112.14438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.14438"}},"official":{"repos":["mlvlab/DeformableGCN"],"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/investigating-neighborhood-modeling-and","slug":"investigating-neighborhood-modeling-and","title":"D-HYPR: Harnessing Neighborhood Modeling and Asymmetry Preservation for Digraph Representation Learning","date":"2021-12-22","arxiv_id":"2112.11734","repositories_listed":1,"syntology":null},{"url":"/paper/skipnode-on-alleviating-over-smoothing-for","slug":"skipnode-on-alleviating-over-smoothing-for","title":"SkipNode: On Alleviating Performance Degradation for Deep Graph Convolutional Networks","date":"2021-12-22","arxiv_id":"2112.11628","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/skipnode-on-alleviating-over-smoothing-for#ran","syntology_url":"https://syntology.ai/paper/2112.11628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.11628"}},"official":{"repos":["weiganglu/skipnode"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/lifelong-learning-in-evolving-graphs-with","slug":"lifelong-learning-in-evolving-graphs-with","title":"Lifelong Learning on Evolving Graphs Under the Constraints of Imbalanced Classes and New Classes","date":"2021-12-20","arxiv_id":"2112.10558","repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolutional-networks-with-dual","slug":"graph-convolutional-networks-with-dual","title":"Graph Convolutional Networks with Dual Message Passing for Subgraph Isomorphism Counting and Matching","date":"2021-12-16","arxiv_id":"2112.08764","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-convolutional-networks-with-dual#ran","syntology_url":"https://syntology.ai/paper/2112.08764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.08764"}},"official":{"repos":["hkust-knowcomp/dualmessagepassing"],"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/shgnn-structure-aware-heterogeneous-graph","slug":"shgnn-structure-aware-heterogeneous-graph","title":"SHGNN: Structure-Aware Heterogeneous Graph Neural Network","date":"2021-12-12","arxiv_id":"2112.06244","repositories_listed":1,"syntology":null},{"url":"/paper/a-piece-wise-polynomial-filtering-approach","slug":"a-piece-wise-polynomial-filtering-approach","title":"A Piece-wise Polynomial Filtering Approach for Graph Neural Networks","date":"2021-12-07","arxiv_id":"2112.03499","repositories_listed":1,"syntology":null},{"url":"/paper/augmentation-free-self-supervised-learning-on","slug":"augmentation-free-self-supervised-learning-on","title":"Augmentation-Free Self-Supervised Learning on Graphs","date":"2021-12-05","arxiv_id":"2112.02472","repositories_listed":1,"syntology":null},{"url":"/paper/autogel-an-automated-graph-neural-network-1","slug":"autogel-an-automated-graph-neural-network-1","title":"AutoGEL: An Automated Graph Neural Network with Explicit Link Information","date":"2021-12-02","arxiv_id":"2112.01064","repositories_listed":1,"syntology":null},{"url":"/paper/source-free-unsupervised-graph-domain","slug":"source-free-unsupervised-graph-domain","title":"Source Free Unsupervised Graph Domain Adaptation","date":"2021-12-02","arxiv_id":"2112.00955","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/source-free-unsupervised-graph-domain#ran","syntology_url":"https://syntology.ai/paper/2112.00955","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.00955"}},"official":{"repos":["haitaomao/soga"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/p2pgnn-a-decentralized-graph-neural-network","slug":"p2pgnn-a-decentralized-graph-neural-network","title":"p2pGNN: A Decentralized Graph Neural Network for Node Classification in Peer-to-Peer Networks","date":"2021-11-29","arxiv_id":"2111.14837","repositories_listed":1,"syntology":null},{"url":"/paper/hgate-heterogeneous-graph-attention-auto","slug":"hgate-heterogeneous-graph-attention-auto","title":"HGATE: Heterogeneous Graph Attention Auto-Encoders","date":"2021-11-28","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/autohensgnn-winning-solution-to-autograph","slug":"autohensgnn-winning-solution-to-autograph","title":"AutoHEnsGNN: Winning Solution to AutoGraph Challenge for KDD Cup 2020","date":"2021-11-25","arxiv_id":"2111.12952","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-unreasonable-effectiveness-of-feature-1","slug":"on-the-unreasonable-effectiveness-of-feature-1","title":"On the Unreasonable Effectiveness of Feature propagation in Learning on Graphs with Missing Node Features","date":"2021-11-23","arxiv_id":"2111.12128","repositories_listed":1,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":4,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/on-the-unreasonable-effectiveness-of-feature-1#ran","syntology_url":"https://syntology.ai/paper/2111.12128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12128"}},"official":{"repos":["twitter-research/feature-propagation"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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}],"record_sha256":"6031662d00203753f4388b3303a897ffb16dbaa643d9153ad06ab078b97eba91","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}