{"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/graph-learning/papers/6","list_of":"/task/graph-learning","task":"Graph Learning","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":16,"rows_per_page":100,"rows":[501,600],"of":1570,"counts":{"archive_papers_tagged":1570,"with_a_code_link":686,"where_syntology_ran_a_sample":193,"not_listed_spam_title":0,"listed":1570,"listed_where_code_ran":193,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":162,"every_run_a_failure_of_syntologys_instrument":31,"listed_with_a_run_with_no_instrument_failure":162,"listed_every_run_a_failure_of_syntologys_instrument":31,"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/graph-learning","prev":"/task/graph-learning/papers/5","next":"/task/graph-learning/papers/7","papers":[{"url":"/paper/on-the-surprising-behaviour-of-node2vec","slug":"on-the-surprising-behaviour-of-node2vec","title":"On the Surprising Behaviour of node2vec","date":"2022-06-16","arxiv_id":"2206.08252","repositories_listed":1,"syntology":{"n":10,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/on-the-surprising-behaviour-of-node2vec#ran","syntology_url":"https://syntology.ai/paper/2206.08252","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08252"}},"official":{"repos":["aidos-lab/node2vec-surprises"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/universally-expressive-communication-in-multi","slug":"universally-expressive-communication-in-multi","title":"Universally Expressive Communication in Multi-Agent Reinforcement Learning","date":"2022-06-14","arxiv_id":"2206.06758","repositories_listed":1,"syntology":null},{"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/gretel-a-unified-framework-for-graph","slug":"gretel-a-unified-framework-for-graph","title":"GRETEL: A unified framework for Graph Counterfactual Explanation Evaluation","date":"2022-06-07","arxiv_id":"2206.02957","repositories_listed":1,"syntology":null},{"url":"/paper/approximate-network-motif-mining-via-graph","slug":"approximate-network-motif-mining-via-graph","title":"Approximate Network Motif Mining Via Graph Learning","date":"2022-06-02","arxiv_id":"2206.01008","repositories_listed":1,"syntology":null},{"url":"/paper/crosscbr-cross-view-contrastive-learning-for","slug":"crosscbr-cross-view-contrastive-learning-for","title":"CrossCBR: Cross-view Contrastive Learning for Bundle Recommendation","date":"2022-06-01","arxiv_id":"2206.00242","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/temporal-multiresolution-graph-neural","slug":"temporal-multiresolution-graph-neural","title":"Temporal Multiresolution Graph Neural Networks For Epidemic Prediction","date":"2022-05-30","arxiv_id":"2205.14831","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-graph-learning-based-on-hierarchical","slug":"dynamic-graph-learning-based-on-hierarchical","title":"Dynamic Graph Learning Based on Hierarchical Memory for Origin-Destination Demand Prediction","date":"2022-05-29","arxiv_id":"2205.14593","repositories_listed":1,"syntology":null},{"url":"/paper/deep-ensembles-for-graphs-with-higher-order","slug":"deep-ensembles-for-graphs-with-higher-order","title":"Deep Ensembles for Graphs with Higher-order Dependencies","date":"2022-05-27","arxiv_id":"2205.13988","repositories_listed":1,"syntology":null},{"url":"/paper/spatio-temporal-graph-few-shot-learning-with","slug":"spatio-temporal-graph-few-shot-learning-with","title":"Spatio-Temporal Graph Few-Shot Learning with Cross-City Knowledge Transfer","date":"2022-05-27","arxiv_id":"2205.13947","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"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) · 0 unverified","sample_list":"/paper/spatio-temporal-graph-few-shot-learning-with#ran","syntology_url":"https://syntology.ai/paper/2205.13947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13947"}},"official":{"repos":["robinlu1209/st-gfsl"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sparse-graph-learning-for-spatiotemporal-time","slug":"sparse-graph-learning-for-spatiotemporal-time","title":"Sparse Graph Learning from Spatiotemporal Time Series","date":"2022-05-26","arxiv_id":"2205.13492","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sparse-graph-learning-for-spatiotemporal-time#ran","syntology_url":"https://syntology.ai/paper/2205.13492","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13492"}},"official":{"repos":["andreacini/sparse-graph-learning"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-based-methods-for-discrete-choice","slug":"graph-based-methods-for-discrete-choice","title":"Graph-Based Methods for Discrete Choice","date":"2022-05-23","arxiv_id":"2205.11365","repositories_listed":1,"syntology":null},{"url":"/paper/weisfeiler-and-leman-go-walking-random-walk","slug":"weisfeiler-and-leman-go-walking-random-walk","title":"Weisfeiler and Leman Go Walking: Random Walk Kernels Revisited","date":"2022-05-22","arxiv_id":"2205.10914","repositories_listed":1,"syntology":null},{"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/graphhd-efficient-graph-classification-using","slug":"graphhd-efficient-graph-classification-using","title":"GraphHD: Efficient graph classification using hyperdimensional computing","date":"2022-05-16","arxiv_id":"2205.07826","repositories_listed":1,"syntology":null},{"url":"/paper/discovering-the-representation-bottleneck-of","slug":"discovering-the-representation-bottleneck-of","title":"Discovering and Explaining the Representation Bottleneck of Graph Neural Networks from Multi-order Interactions","date":"2022-05-15","arxiv_id":"2205.07266","repositories_listed":1,"syntology":null},{"url":"/paper/unseen-anomaly-detection-on-networks-via","slug":"unseen-anomaly-detection-on-networks-via","title":"Unseen Anomaly Detection on Networks via Multi-Hypersphere Learning","date":"2022-04-30","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/gtnet-a-tree-based-deep-graph-learning","slug":"gtnet-a-tree-based-deep-graph-learning","title":"GTNet: A Tree-Based Deep Graph Learning Architecture","date":"2022-04-27","arxiv_id":"2204.12802","repositories_listed":1,"syntology":null},{"url":"/paper/euler-detecting-network-lateral-movement-via","slug":"euler-detecting-network-lateral-movement-via","title":"Euler: Detecting Network Lateral Movement via Scalable Temporal Link Prediction","date":"2022-04-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-and-attention-based-cnn","slug":"graph-neural-networks-and-attention-based-cnn","title":"Graph neural networks and attention-based CNN-LSTM for protein classification","date":"2022-04-20","arxiv_id":"2204.09486","repositories_listed":1,"syntology":null},{"url":"/paper/two-stream-graph-convolutional-network-for","slug":"two-stream-graph-convolutional-network-for","title":"Two-Stream Graph Convolutional Network for Intra-oral Scanner Image Segmentation","date":"2022-04-19","arxiv_id":"2204.08797","repositories_listed":1,"syntology":null},{"url":"/paper/joint-multi-view-unsupervised-feature","slug":"joint-multi-view-unsupervised-feature","title":"Joint Multi-view Unsupervised Feature Selection and Graph Learning","date":"2022-04-18","arxiv_id":"2204.08247","repositories_listed":1,"syntology":null},{"url":"/paper/federatedscope-gnn-towards-a-unified","slug":"federatedscope-gnn-towards-a-unified","title":"FederatedScope-GNN: Towards a Unified, Comprehensive and Efficient Package for Federated Graph Learning","date":"2022-04-12","arxiv_id":"2204.05562","repositories_listed":1,"syntology":null},{"url":"/paper/entailment-graph-learning-with-textual-1","slug":"entailment-graph-learning-with-textual-1","title":"Entailment Graph Learning with Textual Entailment and Soft Transitivity","date":"2022-04-07","arxiv_id":"2204.03286","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/cgc-contrastive-graph-clustering-for","slug":"cgc-contrastive-graph-clustering-for","title":"CGC: Contrastive Graph Clustering for Community Detection and Tracking","date":"2022-04-05","arxiv_id":"2204.08504","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/graph-based-active-learning-for-semi","slug":"graph-based-active-learning-for-semi","title":"Graph-based Active Learning for Semi-supervised Classification of SAR Data","date":"2022-03-31","arxiv_id":"2204.00005","repositories_listed":1,"syntology":null},{"url":"/paper/orphicx-a-causality-inspired-latent-variable","slug":"orphicx-a-causality-inspired-latent-variable","title":"OrphicX: A Causality-Inspired Latent Variable Model for Interpreting Graph Neural Networks","date":"2022-03-29","arxiv_id":"2203.15209","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/orphicx-a-causality-inspired-latent-variable#ran","syntology_url":"https://syntology.ai/paper/2203.15209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15209"}},"official":{"repos":["wanyugroup/cvpr2022-orphicx"],"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/contrastive-graph-learning-for-population","slug":"contrastive-graph-learning-for-population","title":"Contrastive Graph Learning for Population-based fMRI Classification","date":"2022-03-26","arxiv_id":"2203.14044","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-graph-learning-meets","slug":"semi-supervised-graph-learning-meets","title":"Semi-Supervised Graph Learning Meets Dimensionality Reduction","date":"2022-03-23","arxiv_id":"2203.12522","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-graph-representation-learning-1","slug":"hierarchical-graph-representation-learning-1","title":"Hierarchical Graph Representation Learning for the Prediction of Drug-Target Binding Affinity","date":"2022-03-22","arxiv_id":"2203.11458","repositories_listed":1,"syntology":null},{"url":"/paper/fine-tuning-graph-neural-networks-via-graph","slug":"fine-tuning-graph-neural-networks-via-graph","title":"Fine-Tuning Graph Neural Networks via Graph Topology induced Optimal Transport","date":"2022-03-20","arxiv_id":"2203.10453","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/fine-tuning-graph-neural-networks-via-graph#ran","syntology_url":"https://syntology.ai/paper/2203.10453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10453"}},"official":{"repos":["youjibiying/gtot-tuning"],"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/graph-augmentation-learning","slug":"graph-augmentation-learning","title":"Graph Augmentation Learning","date":"2022-03-17","arxiv_id":"2203.09020","repositories_listed":1,"syntology":null},{"url":"/paper/pdns-net-a-large-heterogeneous-graph","slug":"pdns-net-a-large-heterogeneous-graph","title":"PDNS-Net: A Large Heterogeneous Graph Benchmark Dataset of Network Resolutions for Graph Learning","date":"2022-03-15","arxiv_id":"2203.07969","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/multi-modal-graph-learning-for-disease-1","slug":"multi-modal-graph-learning-for-disease-1","title":"Multi-modal Graph Learning for Disease Prediction","date":"2022-03-11","arxiv_id":"2203.05880","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-modal-graph-learning-for-disease-1#ran","syntology_url":"https://syntology.ai/paper/2203.05880","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.05880"}},"official":{"repos":["ssgood/mmgl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/zero-shot-domain-adaptation-of-heterogeneous","slug":"zero-shot-domain-adaptation-of-heterogeneous","title":"Zero-shot Transfer Learning within a Heterogeneous Graph via Knowledge Transfer Networks","date":"2022-03-03","arxiv_id":"2203.02018","repositories_listed":1,"syntology":null},{"url":"/paper/an-effective-graph-learning-based-approach","slug":"an-effective-graph-learning-based-approach","title":"An Effective Graph Learning based Approach for Temporal Link Prediction: The First Place of WSDM Cup 2022","date":"2022-03-01","arxiv_id":"2203.01820","repositories_listed":1,"syntology":null},{"url":"/paper/hyperbolic-graph-neural-networks-a-review-of","slug":"hyperbolic-graph-neural-networks-a-review-of","title":"Hyperbolic Graph Neural Networks: A Review of Methods and Applications","date":"2022-02-28","arxiv_id":"2202.13852","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/hyperbolic-graph-neural-networks-a-review-of#ran","syntology_url":"https://syntology.ai/paper/2202.13852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.13852"}},"official":{"repos":["marlin-codes/HIE"],"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/data-augmentation-for-deep-graph-learning-a","slug":"data-augmentation-for-deep-graph-learning-a","title":"Data Augmentation for Deep Graph Learning: A Survey","date":"2022-02-16","arxiv_id":"2202.08235","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/graph-neural-network-for-local-corruption","slug":"graph-neural-network-for-local-corruption","title":"Robust Graph Representation Learning for Local Corruption Recovery","date":"2022-02-10","arxiv_id":"2202.04936","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/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/a-higher-order-semantic-dependency-parser","slug":"a-higher-order-semantic-dependency-parser","title":"A Higher-Order Semantic Dependency Parser","date":"2022-01-27","arxiv_id":"2201.11312","repositories_listed":1,"syntology":null},{"url":"/paper/powergear-early-stage-power-estimation-in","slug":"powergear-early-stage-power-estimation-in","title":"PowerGear: Early-Stage Power Estimation in FPGA HLS via Heterogeneous Edge-Centric GNNs","date":"2022-01-25","arxiv_id":"2201.10114","repositories_listed":1,"syntology":null},{"url":"/paper/what-s-wrong-with-deep-learning-in-tree","slug":"what-s-wrong-with-deep-learning-in-tree","title":"What's Wrong with Deep Learning in Tree Search for Combinatorial Optimization","date":"2022-01-25","arxiv_id":"2201.10494","repositories_listed":1,"syntology":null},{"url":"/paper/learning-sparse-and-continuous-graph","slug":"learning-sparse-and-continuous-graph","title":"Balanced Graph Structure Learning for Multivariate Time Series Forecasting","date":"2022-01-24","arxiv_id":"2201.09686","repositories_listed":1,"syntology":null},{"url":"/paper/fine-grained-graph-learning-for-multi-view","slug":"fine-grained-graph-learning-for-multi-view","title":"Fine-grained Graph Learning for Multi-view Subspace Clustering","date":"2022-01-12","arxiv_id":"2201.04604","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/stratified-graph-spectra","slug":"stratified-graph-spectra","title":"Stratified Graph Spectra","date":"2022-01-10","arxiv_id":"2201.03696","repositories_listed":1,"syntology":null},{"url":"/paper/automated-graph-machine-learning-approaches","slug":"automated-graph-machine-learning-approaches","title":"Automated Graph Machine Learning: Approaches, Libraries, Benchmarks and Directions","date":"2022-01-04","arxiv_id":"2201.01288","repositories_listed":1,"syntology":null},{"url":"/paper/bringing-your-own-view-graph-contrastive","slug":"bringing-your-own-view-graph-contrastive","title":"Bringing Your Own View: Graph Contrastive Learning without Prefabricated Data Augmentations","date":"2022-01-04","arxiv_id":"2201.01702","repositories_listed":1,"syntology":null},{"url":"/paper/appearance-and-structure-aware-robust-deep","slug":"appearance-and-structure-aware-robust-deep","title":"Appearance and Structure Aware Robust Deep Visual Graph Matching: Attack, Defense and Beyond","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/dual-hierarchical-attention-networks-for-bi","slug":"dual-hierarchical-attention-networks-for-bi","title":"Learning Bi-typed Multi-relational Heterogeneous Graph via Dual Hierarchical Attention Networks","date":"2021-12-24","arxiv_id":"2112.13078","repositories_listed":1,"syntology":null},{"url":"/paper/gcod-graph-convolutional-network-acceleration","slug":"gcod-graph-convolutional-network-acceleration","title":"GCoD: Graph Convolutional Network Acceleration via Dedicated Algorithm and Accelerator Co-Design","date":"2021-12-22","arxiv_id":"2112.11594","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"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, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/gcod-graph-convolutional-network-acceleration#ran","syntology_url":"https://syntology.ai/paper/2112.11594","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.11594"}},"official":{"repos":["rice-eic/gcod"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"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/meta-propagation-networks-for-graph-few-shot","slug":"meta-propagation-networks-for-graph-few-shot","title":"Meta Propagation Networks for Graph Few-shot Semi-supervised Learning","date":"2021-12-18","arxiv_id":"2112.09810","repositories_listed":1,"syntology":null},{"url":"/paper/scale-aware-neural-architecture-search-for","slug":"scale-aware-neural-architecture-search-for","title":"Scale-Aware Neural Architecture Search for Multivariate Time Series Forecasting","date":"2021-12-14","arxiv_id":"2112.07459","repositories_listed":1,"syntology":null},{"url":"/paper/bscnets-block-simplicial-complex-neural","slug":"bscnets-block-simplicial-complex-neural","title":"BScNets: Block Simplicial Complex Neural Networks","date":"2021-12-13","arxiv_id":"2112.06826","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-graph-learning-neural-network-for","slug":"dynamic-graph-learning-neural-network-for","title":"Dynamic Graph Learning-Neural Network for Multivariate Time Series Modeling","date":"2021-12-06","arxiv_id":"2112.03273","repositories_listed":1,"syntology":null},{"url":"/paper/hyfactor-hydrogen-count-labelled-graph-based","slug":"hyfactor-hydrogen-count-labelled-graph-based","title":"HyFactor: Hydrogen-count labelled graph-based defactorization Autoencoder","date":"2021-12-06","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-adaptive-propagation-graph-neural","slug":"contrastive-adaptive-propagation-graph-neural","title":"Contrastive Adaptive Propagation Graph Neural Networks for Efficient Graph Learning","date":"2021-12-02","arxiv_id":"2112.01110","repositories_listed":1,"syntology":null},{"url":"/paper/pooling-by-sliced-wasserstein-embedding","slug":"pooling-by-sliced-wasserstein-embedding","title":"Pooling by Sliced-Wasserstein Embedding","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/inferring-halo-masses-with-graph-neural","slug":"inferring-halo-masses-with-graph-neural","title":"Inferring halo masses with Graph Neural Networks","date":"2021-11-16","arxiv_id":"2111.08683","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-transform-forms-scalable-transformer","slug":"spectral-transform-forms-scalable-transformer","title":"Spectral Transform Forms Scalable Transformer","date":"2021-11-15","arxiv_id":"2111.07602","repositories_listed":1,"syntology":null},{"url":"/paper/threatrace-detecting-and-tracing-host-based","slug":"threatrace-detecting-and-tracing-host-based","title":"threaTrace: Detecting and Tracing Host-based Threats in Node Level Through Provenance Graph Learning","date":"2021-11-08","arxiv_id":"2111.04333","repositories_listed":1,"syntology":null},{"url":"/paper/graph-structural-attack-by-spectral-distanc","slug":"graph-structural-attack-by-spectral-distanc","title":"Graph Structural Attack by Perturbing Spectral Distance","date":"2021-11-01","arxiv_id":"2111.00684","repositories_listed":1,"syntology":null},{"url":"/paper/node-dependent-local-smoothing-for-scalable","slug":"node-dependent-local-smoothing-for-scalable","title":"Node Dependent Local Smoothing for Scalable Graph Learning","date":"2021-10-27","arxiv_id":"2110.14377","repositories_listed":1,"syntology":null},{"url":"/paper/ace-hgnn-adaptive-curvature-exploration","slug":"ace-hgnn-adaptive-curvature-exploration","title":"ACE-HGNN: Adaptive Curvature Exploration Hyperbolic Graph Neural Network","date":"2021-10-15","arxiv_id":"2110.07888","repositories_listed":1,"syntology":null},{"url":"/paper/towards-open-world-feature-extrapolation-an","slug":"towards-open-world-feature-extrapolation-an","title":"Towards Open-World Feature Extrapolation: An Inductive Graph Learning Approach","date":"2021-10-09","arxiv_id":"2110.04514","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"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) · 1 unverified","sample_list":"/paper/towards-open-world-feature-extrapolation-an#ran","syntology_url":"https://syntology.ai/paper/2110.04514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.04514"}},"official":{"repos":["qitianwu/FATE"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/3d-infomax-improves-gnns-for-molecular","slug":"3d-infomax-improves-gnns-for-molecular","title":"3D Infomax improves GNNs for Molecular Property Prediction","date":"2021-10-08","arxiv_id":"2110.04126","repositories_listed":1,"syntology":null},{"url":"/paper/light-field-saliency-detection-with-dual","slug":"light-field-saliency-detection-with-dual","title":"Light Field Saliency Detection with Dual Local Graph Learning andReciprocative Guidance","date":"2021-10-02","arxiv_id":"2110.00698","repositories_listed":1,"syntology":null},{"url":"/paper/a-new-perspective-on-how-graph-neural","slug":"a-new-perspective-on-how-graph-neural","title":"A New Perspective on \"How Graph Neural Networks Go Beyond Weisfeiler-Lehman?\"","date":"2021-09-29","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/blindness-to-modality-helps-entailment-graph","slug":"blindness-to-modality-helps-entailment-graph","title":"Blindness to Modality Helps Entailment Graph Mining","date":"2021-09-21","arxiv_id":"2109.10227","repositories_listed":1,"syntology":null},{"url":"/paper/learning-through-structure-towards-deep","slug":"learning-through-structure-towards-deep","title":"Learning through structure: towards deep neuromorphic knowledge graph embeddings","date":"2021-09-21","arxiv_id":"2109.10376","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-attentive-graph-learning-for-image","slug":"dynamic-attentive-graph-learning-for-image","title":"Dynamic Attentive Graph Learning for Image Restoration","date":"2021-09-14","arxiv_id":"2109.06620","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"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; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dynamic-attentive-graph-learning-for-image#ran","syntology_url":"https://syntology.ai/paper/2109.06620","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.06620"}},"official":{"repos":["jianzhangcs/dagl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/geneannotator-a-semi-automatic-annotation","slug":"geneannotator-a-semi-automatic-annotation","title":"GeneAnnotator: A Semi-automatic Annotation Tool for Visual Scene Graph","date":"2021-09-06","arxiv_id":"2109.02226","repositories_listed":1,"syntology":null},{"url":"/paper/roadscene2vec-a-tool-for-extracting-and","slug":"roadscene2vec-a-tool-for-extracting-and","title":"roadscene2vec: A Tool for Extracting and Embedding Road Scene-Graphs","date":"2021-09-02","arxiv_id":"2109.01183","repositories_listed":1,"syntology":null},{"url":"/paper/whole-brain-vessel-graphs-a-dataset-and","slug":"whole-brain-vessel-graphs-a-dataset-and","title":"Whole Brain Vessel Graphs: A Dataset and Benchmark for Graph Learning and Neuroscience (VesselGraph)","date":"2021-08-30","arxiv_id":"2108.13233","repositories_listed":1,"syntology":null},{"url":"/paper/ccgl-contrastive-cascade-graph-learning","slug":"ccgl-contrastive-cascade-graph-learning","title":"CCGL: Contrastive Cascade Graph Learning","date":"2021-07-27","arxiv_id":"2107.12576","repositories_listed":1,"syntology":null},{"url":"/paper/rgl-net-a-recurrent-graph-learning-framework","slug":"rgl-net-a-recurrent-graph-learning-framework","title":"RGL-NET: A Recurrent Graph Learning framework for Progressive Part Assembly","date":"2021-07-27","arxiv_id":"2107.12859","repositories_listed":1,"syntology":null},{"url":"/paper/hw2vec-a-graph-learning-tool-for-automating","slug":"hw2vec-a-graph-learning-tool-for-automating","title":"HW2VEC: A Graph Learning Tool for Automating Hardware Security","date":"2021-07-26","arxiv_id":"2107.12328","repositories_listed":1,"syntology":null},{"url":"/paper/rod-reception-aware-online-distillation-for","slug":"rod-reception-aware-online-distillation-for","title":"ROD: Reception-aware Online Distillation for Sparse Graphs","date":"2021-07-25","arxiv_id":"2107.11789","repositories_listed":1,"syntology":null},{"url":"/paper/gcn-based-linkage-prediction-for-face","slug":"gcn-based-linkage-prediction-for-face","title":"A Linkage-based Doubly Imbalanced Graph Learning Framework for Face Clustering","date":"2021-07-06","arxiv_id":"2107.02477","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-the-representational-power-of-graph","slug":"exploring-the-representational-power-of-graph","title":"Exploring the Representational Power of Graph Autoencoder","date":"2021-06-22","arxiv_id":"2106.12005","repositories_listed":1,"syntology":null},{"url":"/paper/grand-graph-neural-diffusion","slug":"grand-graph-neural-diffusion","title":"GRAND: Graph Neural Diffusion","date":"2021-06-21","arxiv_id":"2106.10934","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/grand-graph-neural-diffusion#ran","syntology_url":"https://syntology.ai/paper/2106.10934","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10934"}},"official":{"repos":["twitter-research/graph-neural-pde"],"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/regularization-of-mixture-models-for-robust","slug":"regularization-of-mixture-models-for-robust","title":"Regularization of Mixture Models for Robust Principal Graph Learning","date":"2021-06-16","arxiv_id":"2106.09035","repositories_listed":1,"syntology":null},{"url":"/paper/pi-gnn-a-novel-perspective-on-semi-supervised","slug":"pi-gnn-a-novel-perspective-on-semi-supervised","title":"Noise-robust Graph Learning by Estimating and Leveraging Pairwise Interactions","date":"2021-06-14","arxiv_id":"2106.07451","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-with-local-graph","slug":"graph-neural-networks-with-local-graph","title":"Graph Neural Networks with Local Graph Parameters","date":"2021-06-12","arxiv_id":"2106.06707","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/graph-neural-networks-with-local-graph#ran","syntology_url":"https://syntology.ai/paper/2106.06707","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06707"}},"official":{"repos":["LGP-GNN-2021/LGP-GNN"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/breaking-the-limit-of-graph-neural-networks","slug":"breaking-the-limit-of-graph-neural-networks","title":"Breaking the Limit of Graph Neural Networks by Improving the Assortativity of Graphs with Local Mixing Patterns","date":"2021-06-11","arxiv_id":"2106.06586","repositories_listed":1,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"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) · 6 unverified","sample_list":"/paper/breaking-the-limit-of-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2106.06586","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06586"}},"official":{"repos":["susheels/gnns-and-local-assortativity"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/self-supervised-graph-learning-with","slug":"self-supervised-graph-learning-with","title":"Self-Supervised Graph Learning with Hyperbolic Embedding for Temporal Health Event Prediction","date":"2021-06-09","arxiv_id":"2106.04751","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-supervised-graph-learning-with#ran","syntology_url":"https://syntology.ai/paper/2106.04751","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04751"}},"official":{"repos":["LuChang-CS/sherbet"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/context-aware-sparse-deep-coordination-graphs","slug":"context-aware-sparse-deep-coordination-graphs","title":"Context-Aware Sparse Deep Coordination Graphs","date":"2021-06-05","arxiv_id":"2106.02886","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-graph-learning-for-link","slug":"counterfactual-graph-learning-for-link","title":"Learning from Counterfactual Links for Link Prediction","date":"2021-06-03","arxiv_id":"2106.02172","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/counterfactual-graph-learning-for-link#ran","syntology_url":"https://syntology.ai/paper/2106.02172","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02172"}},"official":{"repos":["DM2-ND/CFLP"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-clause-representation-from","slug":"learning-clause-representation-from","title":"Learning Clause Representation from Dependency-Anchor Graph for Connective Prediction","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/mixup-for-node-and-graph-classification","slug":"mixup-for-node-and-graph-classification","title":"Mixup for Node and Graph Classification","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/local-global-and-scale-dependent-node-roles","slug":"local-global-and-scale-dependent-node-roles","title":"Local, global and scale-dependent node roles","date":"2021-05-26","arxiv_id":"2105.12598","repositories_listed":1,"syntology":null}],"record_sha256":"09171a16685e9f1874b552db330500b2696d7c93b86446cd8e0449e507bd03d1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}