{"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/6","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":6,"pages_in_order":19,"rows_per_page":100,"rows":[501,600],"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/5","next":"/task/node-classification/papers/7","papers":[{"url":"/paper/drew-dynamically-rewired-message-passing-with","slug":"drew-dynamically-rewired-message-passing-with","title":"DRew: Dynamically Rewired Message Passing with Delay","date":"2023-05-13","arxiv_id":"2305.08018","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/drew-dynamically-rewired-message-passing-with#ran","syntology_url":"https://syntology.ai/paper/2305.08018","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.08018"}},"official":{"repos":["bengutteridge/drew"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/fisher-information-embedding-for-node-and","slug":"fisher-information-embedding-for-node-and","title":"Fisher Information Embedding for Node and Graph Learning","date":"2023-05-12","arxiv_id":"2305.07580","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/fisher-information-embedding-for-node-and#ran","syntology_url":"https://syntology.ai/paper/2305.07580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.07580"}},"official":{"repos":["BorgwardtLab/fisher_information_embedding"],"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/feature-expansion-for-graph-neural-networks","slug":"feature-expansion-for-graph-neural-networks","title":"Feature Expansion for Graph Neural Networks","date":"2023-05-10","arxiv_id":"2305.06142","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":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/feature-expansion-for-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2305.06142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06142"}},"official":{"repos":["sajqavril/feature-extension-graph-neural-networks"],"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/gnns-you-can-be-stronger-deeper-and-faster","slug":"gnns-you-can-be-stronger-deeper-and-faster","title":"Deep Graph Neural Networks via Posteriori-Sampling-based Node-Adaptive Residual Module","date":"2023-05-09","arxiv_id":"2305.05368","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"4 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gnns-you-can-be-stronger-deeper-and-faster#ran","syntology_url":"https://syntology.ai/paper/2305.05368","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.05368"}},"official":{"repos":["jingbo02/psnr-gnn"],"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/csgcl-community-strength-enhanced-graph","slug":"csgcl-community-strength-enhanced-graph","title":"CSGCL: Community-Strength-Enhanced Graph Contrastive Learning","date":"2023-05-08","arxiv_id":"2305.04658","repositories_listed":1,"syntology":{"n":9,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/csgcl-community-strength-enhanced-graph#ran","syntology_url":"https://syntology.ai/paper/2305.04658","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.04658"}},"official":{"repos":["hanchen-hust/csgcl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/lsgnn-towards-general-graph-neural-network-in","slug":"lsgnn-towards-general-graph-neural-network-in","title":"LSGNN: Towards General Graph Neural Network in Node Classification by Local Similarity","date":"2023-05-07","arxiv_id":"2305.04225","repositories_listed":1,"syntology":null},{"url":"/paper/pgb-a-pubmed-graph-benchmark-for","slug":"pgb-a-pubmed-graph-benchmark-for","title":"PGB: A PubMed Graph Benchmark for Heterogeneous Network Representation Learning","date":"2023-05-04","arxiv_id":"2305.02691","repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-measure-to-identify-influential-nodes","slug":"a-novel-measure-to-identify-influential-nodes","title":"A novel measure to identify influential nodes: Return Random Walk Gravity Centrality","date":"2023-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-label-non-uniformity-for-node","slug":"leveraging-label-non-uniformity-for-node","title":"Leveraging Label Non-Uniformity for Node Classification in Graph Neural Networks","date":"2023-04-29","arxiv_id":"2305.00139","repositories_listed":1,"syntology":null},{"url":"/paper/connector-0-5-a-unified-framework-for-graph","slug":"connector-0-5-a-unified-framework-for-graph","title":"Connector 0.5: A unified framework for graph representation learning","date":"2023-04-25","arxiv_id":"2304.13195","repositories_listed":1,"syntology":null},{"url":"/paper/when-do-graph-neural-networks-help-with-node","slug":"when-do-graph-neural-networks-help-with-node","title":"When Do Graph Neural Networks Help with Node Classification? Investigating the Impact of Homophily Principle on Node Distinguishability","date":"2023-04-25","arxiv_id":"2304.14274","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":4,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 1 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/when-do-graph-neural-networks-help-with-node#ran","syntology_url":"https://syntology.ai/paper/2304.14274","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.14274"}},"official":{"repos":["SitaoLuan/When-Do-GNNs-Help"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/gcnh-a-simple-method-for-representation","slug":"gcnh-a-simple-method-for-representation","title":"GCNH: A Simple Method For Representation Learning On Heterophilous Graphs","date":"2023-04-21","arxiv_id":"2304.10896","repositories_listed":1,"syntology":null},{"url":"/paper/multi-label-node-classification-on-graph","slug":"multi-label-node-classification-on-graph","title":"Multi-label Node Classification On Graph-Structured Data","date":"2023-04-20","arxiv_id":"2304.10398","repositories_listed":1,"syntology":null},{"url":"/paper/train-your-own-gnn-teacher-graph-aware","slug":"train-your-own-gnn-teacher-graph-aware","title":"Train Your Own GNN Teacher: Graph-Aware Distillation on Textual Graphs","date":"2023-04-20","arxiv_id":"2304.10668","repositories_listed":1,"syntology":null},{"url":"/paper/h2tne-temporal-heterogeneous-information","slug":"h2tne-temporal-heterogeneous-information","title":"$\\text{H}^2\\text{TNE}$: Temporal Heterogeneous Information Network Embedding in Hyperbolic Spaces","date":"2023-04-14","arxiv_id":"2304.06970","repositories_listed":1,"syntology":null},{"url":"/paper/rf-gnn-random-forest-boosted-graph-neural","slug":"rf-gnn-random-forest-boosted-graph-neural","title":"RF-GNN: Random Forest Boosted Graph Neural Network for Social Bot Detection","date":"2023-04-14","arxiv_id":"2304.08239","repositories_listed":1,"syntology":null},{"url":"/paper/hyperbolic-geometric-graph-representation","slug":"hyperbolic-geometric-graph-representation","title":"Hyperbolic Geometric Graph Representation Learning for Hierarchy-imbalance Node Classification","date":"2023-04-11","arxiv_id":"2304.05059","repositories_listed":1,"syntology":null},{"url":"/paper/cafin-centrality-aware-fairness-inducing-in","slug":"cafin-centrality-aware-fairness-inducing-in","title":"CAFIN: Centrality Aware Fairness inducing IN-processing for Unsupervised Representation Learning on Graphs","date":"2023-04-10","arxiv_id":"2304.04391","repositories_listed":1,"syntology":null},{"url":"/paper/graph-toolformer-to-empower-llms-with-graph","slug":"graph-toolformer-to-empower-llms-with-graph","title":"Graph-ToolFormer: To Empower LLMs with Graph Reasoning Ability via Prompt Dataset Augmented by ChatGPT","date":"2023-04-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fair-evaluation-of-graph-markov-neural","slug":"fair-evaluation-of-graph-markov-neural","title":"How Graph Structure and Label Dependencies Contribute to Node Classification in a Large Network of Documents","date":"2023-04-03","arxiv_id":"2304.01235","repositories_listed":1,"syntology":null},{"url":"/paper/graf-graph-attention-aware-fusion-networks","slug":"graf-graph-attention-aware-fusion-networks","title":"GRAF: Graph Attention-aware Fusion Networks","date":"2023-03-29","arxiv_id":"2303.16781","repositories_listed":1,"syntology":null},{"url":"/paper/easydgl-encode-train-and-interpret-for","slug":"easydgl-encode-train-and-interpret-for","title":"EasyDGL: Encode, Train and Interpret for Continuous-time Dynamic Graph Learning","date":"2023-03-22","arxiv_id":"2303.12341","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/easydgl-encode-train-and-interpret-for#ran","syntology_url":"https://syntology.ai/paper/2303.12341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.12341"}},"official":{"repos":["cchao0116/EasyDGL"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/unreal-unlabeled-nodes-retrieval-and-labeling","slug":"unreal-unlabeled-nodes-retrieval-and-labeling","title":"UNREAL:Unlabeled Nodes Retrieval and Labeling for Heavily-imbalanced Node Classification","date":"2023-03-18","arxiv_id":"2303.10371","repositories_listed":1,"syntology":{"n":15,"n_ran":10,"n_constructed":4,"n_ran_checked":4,"n_instrument":6,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"10 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; 6 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/unreal-unlabeled-nodes-retrieval-and-labeling#ran","syntology_url":"https://syntology.ai/paper/2303.10371","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.10371"}},"official":{"repos":["yanliang3612/UNREAL"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/exphormer-sparse-transformers-for-graphs","slug":"exphormer-sparse-transformers-for-graphs","title":"Exphormer: Sparse Transformers for Graphs","date":"2023-03-10","arxiv_id":"2303.06147","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/exphormer-sparse-transformers-for-graphs#ran","syntology_url":"https://syntology.ai/paper/2303.06147","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.06147"}},"official":{"repos":["hamed1375/exphormer"],"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/towards-a-gml-enabled-knowledge-graph","slug":"towards-a-gml-enabled-knowledge-graph","title":"Towards a GML-Enabled Knowledge Graph Platform","date":"2023-03-03","arxiv_id":"2303.02166","repositories_listed":1,"syntology":null},{"url":"/paper/igb-addressing-the-gaps-in-labeling-features","slug":"igb-addressing-the-gaps-in-labeling-features","title":"IGB: Addressing The Gaps In Labeling, Features, Heterogeneity, and Size of Public Graph Datasets for Deep Learning Research","date":"2023-02-27","arxiv_id":"2302.13522","repositories_listed":1,"syntology":null},{"url":"/paper/retexo-scalable-neural-network-training-over","slug":"retexo-scalable-neural-network-training-over","title":"Scalable Neural Network Training over Distributed Graphs","date":"2023-02-25","arxiv_id":"2302.13053","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-with-learnable-and","slug":"graph-neural-networks-with-learnable-and","title":"Graph Neural Networks with Learnable and Optimal Polynomial Bases","date":"2023-02-24","arxiv_id":"2302.12432","repositories_listed":1,"syntology":null},{"url":"/paper/graph-construction-using-principal-axis-trees","slug":"graph-construction-using-principal-axis-trees","title":"Graph Construction using Principal Axis Trees for Simple Graph Convolution","date":"2023-02-22","arxiv_id":"2302.12000","repositories_listed":1,"syntology":null},{"url":"/paper/random-projection-forest-initialization-for","slug":"random-projection-forest-initialization-for","title":"Random Projection Forest Initialization for Graph Convolutional Networks","date":"2023-02-22","arxiv_id":"2302.12001","repositories_listed":1,"syntology":null},{"url":"/paper/label-information-enhanced-fraud-detection","slug":"label-information-enhanced-fraud-detection","title":"Label Information Enhanced Fraud Detection against Low Homophily in Graphs","date":"2023-02-21","arxiv_id":"2302.10407","repositories_listed":1,"syntology":null},{"url":"/paper/robust-mid-pass-filtering-graph-convolutional","slug":"robust-mid-pass-filtering-graph-convolutional","title":"Robust Mid-Pass Filtering Graph Convolutional Networks","date":"2023-02-16","arxiv_id":"2302.08048","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/robust-mid-pass-filtering-graph-convolutional#ran","syntology_url":"https://syntology.ai/paper/2302.08048","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08048"}},"official":{"repos":["huangJC0429/Mid-GCN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/unnoticeable-backdoor-attacks-on-graph-neural","slug":"unnoticeable-backdoor-attacks-on-graph-neural","title":"Unnoticeable Backdoor Attacks on Graph Neural Networks","date":"2023-02-11","arxiv_id":"2303.01263","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-node-representation-learning","slug":"self-supervised-node-representation-learning","title":"Self-Supervised Node Representation Learning via Node-to-Neighbourhood Alignment","date":"2023-02-09","arxiv_id":"2302.04626","repositories_listed":1,"syntology":null},{"url":"/paper/on-generalized-degree-fairness-in-graph","slug":"on-generalized-degree-fairness-in-graph","title":"On Generalized Degree Fairness in Graph Neural Networks","date":"2023-02-08","arxiv_id":"2302.03881","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/on-generalized-degree-fairness-in-graph#ran","syntology_url":"https://syntology.ai/paper/2302.03881","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.03881"}},"official":{"repos":["ntkien1904/DegFairGNN"],"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/ordered-gnn-ordering-message-passing-to-deal","slug":"ordered-gnn-ordering-message-passing-to-deal","title":"Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing","date":"2023-02-03","arxiv_id":"2302.01524","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"6 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/ordered-gnn-ordering-message-passing-to-deal#ran","syntology_url":"https://syntology.ai/paper/2302.01524","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01524"}},"official":{"repos":["lumia-group/orderedgnn"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/affinity-uncertainty-based-hard-negative","slug":"affinity-uncertainty-based-hard-negative","title":"Affinity Uncertainty-based Hard Negative Mining in Graph Contrastive Learning","date":"2023-01-31","arxiv_id":"2301.13340","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-classification-with-graph-1","slug":"semi-supervised-classification-with-graph-1","title":"Unsupervised Neighborhood Propagation Kernel Layers for Semi-supervised Node Classification","date":"2023-01-31","arxiv_id":"2301.13764","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/semi-supervised-classification-with-graph-1#ran","syntology_url":"https://syntology.ai/paper/2301.13764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.13764"}},"official":{"repos":["sonnyachten/gckm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-connection-between-mpnn-and-graph","slug":"on-the-connection-between-mpnn-and-graph","title":"On the Connection Between MPNN and Graph Transformer","date":"2023-01-27","arxiv_id":"2301.11956","repositories_listed":1,"syntology":null},{"url":"/paper/feature-selection-key-to-enhance-node","slug":"feature-selection-key-to-enhance-node","title":"Feature Selection: Key to Enhance Node Classification with Graph Neural Networks","date":"2023-01-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/neighborhood-homophily-guided-graph","slug":"neighborhood-homophily-guided-graph","title":"Neighborhood Homophily-based Graph Convolutional Network","date":"2023-01-24","arxiv_id":"2301.09851","repositories_listed":1,"syntology":null},{"url":"/paper/difformer-scalable-graph-transformers-induced","slug":"difformer-scalable-graph-transformers-induced","title":"DIFFormer: Scalable (Graph) Transformers Induced by Energy Constrained Diffusion","date":"2023-01-23","arxiv_id":"2301.09474","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/difformer-scalable-graph-transformers-induced#ran","syntology_url":"https://syntology.ai/paper/2301.09474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.09474"}},"official":{"repos":["qitianwu/difformer"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["community"]}}},{"url":"/paper/gipa-a-general-information-propagation","slug":"gipa-a-general-information-propagation","title":"GIPA: A General Information Propagation Algorithm for Graph Learning","date":"2023-01-19","arxiv_id":"2301.08209","repositories_listed":1,"syntology":null},{"url":"/paper/scene-reasoning-about-traffic-scenes-using","slug":"scene-reasoning-about-traffic-scenes-using","title":"SCENE: Reasoning about Traffic Scenes using Heterogeneous Graph Neural Networks","date":"2023-01-09","arxiv_id":"2301.03512","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-node-classification-with-extremely","slug":"few-shot-node-classification-with-extremely","title":"Few-shot Node Classification with Extremely Weak Supervision","date":"2023-01-06","arxiv_id":"2301.02708","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/few-shot-node-classification-with-extremely#ran","syntology_url":"https://syntology.ai/paper/2301.02708","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.02708"}},"official":{"repos":["songw-sw/x-fnc"],"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/mgtab-a-multi-relational-graph-based-twitter","slug":"mgtab-a-multi-relational-graph-based-twitter","title":"MGTAB: A Multi-Relational Graph-Based Twitter Account Detection Benchmark","date":"2023-01-03","arxiv_id":"2301.01123","repositories_listed":1,"syntology":null},{"url":"/paper/domain-adaptive-graph-infomax-via-conditional","slug":"domain-adaptive-graph-infomax-via-conditional","title":"Domain Adaptive Graph Infomax via Conditional Adversarial Networks","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/ultraprop-principled-and-explainable","slug":"ultraprop-principled-and-explainable","title":"NetEffect: Discovery and Exploitation of Generalized Network Effects","date":"2022-12-31","arxiv_id":"2301.00270","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/ultraprop-principled-and-explainable#ran","syntology_url":"https://syntology.ai/paper/2301.00270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.00270"}},"official":{"repos":["mengchillee/neteffect"],"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/on-the-design-of-quantum-graph-convolutional","slug":"on-the-design-of-quantum-graph-convolutional","title":"On the Design of Quantum Graph Convolutional Neural Network in the NISQ-Era and Beyond","date":"2022-12-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/non-iid-transfer-learning-on-graphs","slug":"non-iid-transfer-learning-on-graphs","title":"Non-IID Transfer Learning on Graphs","date":"2022-12-15","arxiv_id":"2212.08174","repositories_listed":1,"syntology":null},{"url":"/paper/ma-gcl-model-augmentation-tricks-for-graph","slug":"ma-gcl-model-augmentation-tricks-for-graph","title":"MA-GCL: Model Augmentation Tricks for Graph Contrastive Learning","date":"2022-12-14","arxiv_id":"2212.07035","repositories_listed":1,"syntology":null},{"url":"/paper/transductive-linear-probing-a-novel-framework","slug":"transductive-linear-probing-a-novel-framework","title":"Transductive Linear Probing: A Novel Framework for Few-Shot Node Classification","date":"2022-12-11","arxiv_id":"2212.05606","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-weight-perturbation-improves-1","slug":"adversarial-weight-perturbation-improves-1","title":"Adversarial Weight Perturbation Improves Generalization in Graph Neural Networks","date":"2022-12-09","arxiv_id":"2212.04983","repositories_listed":1,"syntology":null},{"url":"/paper/node-oriented-spectral-filtering-for-graph","slug":"node-oriented-spectral-filtering-for-graph","title":"Node-oriented Spectral Filtering for Graph Neural Networks","date":"2022-12-07","arxiv_id":"2212.03654","repositories_listed":1,"syntology":null},{"url":"/paper/dissimilar-nodes-improve-graph-active","slug":"dissimilar-nodes-improve-graph-active","title":"Dissimilar Nodes Improve Graph Active Learning","date":"2022-12-05","arxiv_id":"2212.01968","repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolutional-neural-networks-with","slug":"graph-convolutional-neural-networks-with","title":"Graph Convolutional Neural Networks with Diverse Negative Samples via Decomposed Determinant Point Processes","date":"2022-12-05","arxiv_id":"2212.02055","repositories_listed":1,"syntology":null},{"url":"/paper/hyperbolic-curvature-graph-neural-network","slug":"hyperbolic-curvature-graph-neural-network","title":"kHGCN: Tree-likeness Modeling via Continuous and Discrete Curvature Learning","date":"2022-12-04","arxiv_id":"2212.01793","repositories_listed":1,"syntology":null},{"url":"/paper/distribution-free-prediction-sets-for-node","slug":"distribution-free-prediction-sets-for-node","title":"Distribution Free Prediction Sets for Node Classification","date":"2022-11-26","arxiv_id":"2211.14555","repositories_listed":1,"syntology":null},{"url":"/paper/gread-graph-neural-reaction-diffusion","slug":"gread-graph-neural-reaction-diffusion","title":"GREAD: Graph Neural Reaction-Diffusion Networks","date":"2022-11-25","arxiv_id":"2211.14208","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":4,"phrase":"9 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gread-graph-neural-reaction-diffusion#ran","syntology_url":"https://syntology.ai/paper/2211.14208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14208"}},"official":{"repos":["jeongwhanchoi/gread"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/multi-mask-aggregators-for-graph-neural","slug":"multi-mask-aggregators-for-graph-neural","title":"Multi-Mask Aggregators for Graph Neural Networks","date":"2022-11-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/mecch-metapath-context-convolution-based","slug":"mecch-metapath-context-convolution-based","title":"MECCH: Metapath Context Convolution-based Heterogeneous Graph Neural Networks","date":"2022-11-23","arxiv_id":"2211.12792","repositories_listed":1,"syntology":null},{"url":"/paper/a-robust-feature-reinforcement-framework-for","slug":"a-robust-feature-reinforcement-framework-for","title":"A robust feature reinforcement framework for heterogeneous graphs neural networks","date":"2022-11-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/prototype-based-interpretable-graph-neural","slug":"prototype-based-interpretable-graph-neural","title":"Prototype-based Interpretable Graph Neural Networks","date":"2022-11-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-new-graph-node-classification-benchmark","slug":"a-new-graph-node-classification-benchmark","title":"A New Graph Node Classification Benchmark: Learning Structure from Histology Cell Graphs","date":"2022-11-11","arxiv_id":"2211.06292","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":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) · 1 unverified","sample_list":"/paper/a-new-graph-node-classification-benchmark#ran","syntology_url":"https://syntology.ai/paper/2211.06292","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.06292"}},"official":{"repos":["nellaker-group/placenta"],"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/graph-contrastive-learning-with-implicit","slug":"graph-contrastive-learning-with-implicit","title":"Graph Contrastive Learning with Implicit Augmentations","date":"2022-11-07","arxiv_id":"2211.03710","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-for-community-detection","slug":"graph-neural-networks-for-community-detection","title":"A Spectral Analysis of Graph Neural Networks on Dense and Sparse Graphs","date":"2022-11-06","arxiv_id":"2211.03231","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/graph-neural-networks-for-community-detection#ran","syntology_url":"https://syntology.ai/paper/2211.03231","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.03231"}},"official":{"repos":["nhuang37/gnn_community_detection"],"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/impact-of-missing-data-imputation-on-the","slug":"impact-of-missing-data-imputation-on-the","title":"Impact Of Missing Data Imputation On The Fairness And Accuracy Of Graph Node Classifiers","date":"2022-11-01","arxiv_id":"2211.00783","repositories_listed":1,"syntology":null},{"url":"/paper/towards-relation-centered-pooling-and","slug":"towards-relation-centered-pooling-and","title":"Towards Relation-centered Pooling and Convolution for Heterogeneous Graph Learning Networks","date":"2022-10-31","arxiv_id":"2210.17142","repositories_listed":1,"syntology":null},{"url":"/paper/a-graph-is-more-than-its-nodes-towards","slug":"a-graph-is-more-than-its-nodes-towards","title":"A Graph Is More Than Its Nodes: Towards Structured Uncertainty-Aware Learning on Graphs","date":"2022-10-27","arxiv_id":"2210.15575","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":3,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-graph-is-more-than-its-nodes-towards#ran","syntology_url":"https://syntology.ai/paper/2210.15575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.15575"}},"official":{"repos":["hans66hsu/structured_uncertainty_metrics"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/generalized-laplacian-regularized-framelet","slug":"generalized-laplacian-regularized-framelet","title":"Generalized Laplacian Regularized Framelet Graph Neural Networks","date":"2022-10-27","arxiv_id":"2210.15092","repositories_listed":1,"syntology":null},{"url":"/paper/line-graph-contrastive-learning-for-link","slug":"line-graph-contrastive-learning-for-link","title":"Line Graph Contrastive Learning for Link Prediction","date":"2022-10-25","arxiv_id":"2210.13795","repositories_listed":1,"syntology":null},{"url":"/paper/binary-graph-convolutional-network-with","slug":"binary-graph-convolutional-network-with","title":"Binary Graph Convolutional Network with Capacity Exploration","date":"2022-10-24","arxiv_id":"2210.13149","repositories_listed":1,"syntology":null},{"url":"/paper/graph-few-shot-learning-with-task-specific","slug":"graph-few-shot-learning-with-task-specific","title":"Graph Few-shot Learning with Task-specific Structures","date":"2022-10-21","arxiv_id":"2210.12130","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/graph-few-shot-learning-with-task-specific#ran","syntology_url":"https://syntology.ai/paper/2210.12130","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12130"}},"official":{"repos":["songw-sw/glitter"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/representation-power-of-graph-convolutions","slug":"representation-power-of-graph-convolutions","title":"Analysis of Convolutions, Non-linearity and Depth in Graph Neural Networks using Neural Tangent Kernel","date":"2022-10-18","arxiv_id":"2210.09809","repositories_listed":1,"syntology":null},{"url":"/paper/adagcl-adaptive-subgraph-contrastive-learning","slug":"adagcl-adaptive-subgraph-contrastive-learning","title":"AdaGCL: Adaptive Subgraph Contrastive Learning to Generalize Large-scale Graph Training","date":"2022-10-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/not-all-neighbors-are-friendly-learning-to","slug":"not-all-neighbors-are-friendly-learning-to","title":"Not All Neighbors are Friendly: Learning to Choose Hop Features to Improve Node Classification","date":"2022-10-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/augmentation-free-graph-contrastive-learning-1","slug":"augmentation-free-graph-contrastive-learning-1","title":"Augmentation-Free Graph Contrastive Learning of Invariant-Discriminative Representations","date":"2022-10-15","arxiv_id":"2210.08345","repositories_listed":1,"syntology":null},{"url":"/paper/improving-your-graph-neural-networks-a-high","slug":"improving-your-graph-neural-networks-a-high","title":"Improving Your Graph Neural Networks: A High-Frequency Booster","date":"2022-10-15","arxiv_id":"2210.08251","repositories_listed":1,"syntology":null},{"url":"/paper/mgnni-multiscale-graph-neural-networks-with","slug":"mgnni-multiscale-graph-neural-networks-with","title":"MGNNI: Multiscale Graph Neural Networks with Implicit Layers","date":"2022-10-15","arxiv_id":"2210.08353","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":0,"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/mgnni-multiscale-graph-neural-networks-with#ran","syntology_url":"https://syntology.ai/paper/2210.08353","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.08353"}},"official":{"repos":["liu-jc/mgnni"],"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/metafill-text-infilling-for-meta-path","slug":"metafill-text-infilling-for-meta-path","title":"MetaFill: Text Infilling for Meta-Path Generation on Heterogeneous Information Networks","date":"2022-10-14","arxiv_id":"2210.07488","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-heterophily-for-graph-neural","slug":"revisiting-heterophily-for-graph-neural","title":"Revisiting Heterophily For Graph Neural Networks","date":"2022-10-14","arxiv_id":"2210.07606","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/revisiting-heterophily-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2210.07606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07606"}},"official":{"repos":["SitaoLuan/ACM-GNN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/slendergnn-accurate-robust-and-interpretable","slug":"slendergnn-accurate-robust-and-interpretable","title":"Less is More: SlimG for Accurate, Robust, and Interpretable Graph Mining","date":"2022-10-08","arxiv_id":"2210.04081","repositories_listed":1,"syntology":null},{"url":"/paper/towards-real-time-temporal-graph-learning","slug":"towards-real-time-temporal-graph-learning","title":"Towards Real-Time Temporal Graph Learning","date":"2022-10-08","arxiv_id":"2210.04114","repositories_listed":1,"syntology":null},{"url":"/paper/multi-task-self-supervised-graph-neural","slug":"multi-task-self-supervised-graph-neural","title":"Multi-task Self-supervised Graph Neural Networks Enable Stronger Task Generalization","date":"2022-10-05","arxiv_id":"2210.02016","repositories_listed":1,"syntology":null},{"url":"/paper/gradient-gating-for-deep-multi-rate-learning","slug":"gradient-gating-for-deep-multi-rate-learning","title":"Gradient Gating for Deep Multi-Rate Learning on Graphs","date":"2022-10-02","arxiv_id":"2210.00513","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/gradient-gating-for-deep-multi-rate-learning#ran","syntology_url":"https://syntology.ai/paper/2210.00513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00513"}},"official":{"repos":["tk-rusch/gradientgating"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/spectral-augmentation-for-self-supervised","slug":"spectral-augmentation-for-self-supervised","title":"Spectral Augmentation for Self-Supervised Learning on Graphs","date":"2022-10-02","arxiv_id":"2210.00643","repositories_listed":1,"syntology":null},{"url":"/paper/symbolic-hyperdimensional-vectors-with-sparse","slug":"symbolic-hyperdimensional-vectors-with-sparse","title":"Symbolic Hyperdimensional Vectors with Sparse Graph Convolutional Neural Networks","date":"2022-09-30","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-systematic-evaluation-of-node-embedding","slug":"a-systematic-evaluation-of-node-embedding","title":"A Systematic Evaluation of Node Embedding Robustness","date":"2022-09-16","arxiv_id":"2209.08064","repositories_listed":1,"syntology":null},{"url":"/paper/graph-perceiver-io-a-general-architecture-for","slug":"graph-perceiver-io-a-general-architecture-for","title":"Graph Perceiver IO: A General Architecture for Graph Structured Data","date":"2022-09-14","arxiv_id":"2209.06418","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-inter-group-link-injection","slug":"adversarial-inter-group-link-injection","title":"Adversarial Inter-Group Link Injection Degrades the Fairness of Graph Neural Networks","date":"2022-09-13","arxiv_id":"2209.05957","repositories_listed":1,"syntology":null},{"url":"/paper/towards-sparsification-of-graph-neural","slug":"towards-sparsification-of-graph-neural","title":"Towards Sparsification of Graph Neural Networks","date":"2022-09-11","arxiv_id":"2209.04766","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/towards-sparsification-of-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2209.04766","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.04766"}},"official":{"repos":["harveyp123/iccd_sptrn_slr"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/structure-preserving-graph-representation","slug":"structure-preserving-graph-representation","title":"Structure-Preserving Graph Representation Learning","date":"2022-09-02","arxiv_id":"2209.00793","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-graph-tree-networks","slug":"heterogeneous-graph-tree-networks","title":"Heterogeneous Graph Tree Networks","date":"2022-09-01","arxiv_id":"2209.00610","repositories_listed":1,"syntology":null},{"url":"/paper/lte4g-long-tail-experts-for-graph-neural","slug":"lte4g-long-tail-experts-for-graph-neural","title":"LTE4G: Long-Tail Experts for Graph Neural Networks","date":"2022-08-22","arxiv_id":"2208.10205","repositories_listed":1,"syntology":null},{"url":"/paper/robust-node-classification-on-graphs-jointly","slug":"robust-node-classification-on-graphs-jointly","title":"Robust Node Classification on Graphs: Jointly from Bayesian Label Transition and Topology-based Label Propagation","date":"2022-08-21","arxiv_id":"2208.09779","repositories_listed":1,"syntology":null},{"url":"/paper/scaling-up-dynamic-graph-representation","slug":"scaling-up-dynamic-graph-representation","title":"Scaling Up Dynamic Graph Representation Learning via Spiking Neural Networks","date":"2022-08-15","arxiv_id":"2208.10364","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/scaling-up-dynamic-graph-representation#ran","syntology_url":"https://syntology.ai/paper/2208.10364","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.10364"}},"official":{"repos":["edisonleeeee/spikenet"],"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/gppt-graph-pre-training-and-prompt-tuning-to","slug":"gppt-graph-pre-training-and-prompt-tuning-to","title":"GPPT: Graph Pre-training and Prompt Tuning to Generalize Graph Neural Networks","date":"2022-08-14","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/multiplex-heterogeneous-graph-convolutional","slug":"multiplex-heterogeneous-graph-convolutional","title":"Multiplex Heterogeneous Graph Convolutional Network","date":"2022-08-12","arxiv_id":"2208.06129","repositories_listed":1,"syntology":null},{"url":"/paper/e2eg-end-to-end-node-classification-using","slug":"e2eg-end-to-end-node-classification-using","title":"E2EG: End-to-End Node Classification Using Graph Topology and Text-based Node Attributes","date":"2022-08-09","arxiv_id":"2208.04609","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/e2eg-end-to-end-node-classification-using#ran","syntology_url":"https://syntology.ai/paper/2208.04609","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.04609"}},"official":{"repos":["tuanh23/e2eg"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/generative-subgraph-contrast-for-self","slug":"generative-subgraph-contrast-for-self","title":"Generative Subgraph Contrast for Self-Supervised Graph Representation Learning","date":"2022-07-25","arxiv_id":"2207.11996","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/generative-subgraph-contrast-for-self#ran","syntology_url":"https://syntology.ai/paper/2207.11996","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.11996"}},"official":{"repos":["yh-han/gsc"],"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"]}}}],"record_sha256":"5cb6c51dbaebf12b00d3884e6fae6457a7da2da32e6389d86853a64edebff062","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}