{"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/10","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":10,"pages_in_order":19,"rows_per_page":100,"rows":[901,1000],"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/9","next":"/task/node-classification/papers/11","papers":[{"url":"/paper/graph-transformer-networks-1","slug":"graph-transformer-networks-1","title":"Graph Transformer Networks","date":"2019-11-06","arxiv_id":"1911.06455","repositories_listed":1,"syntology":null},{"url":"/paper/graphair-graph-representation-learning-with","slug":"graphair-graph-representation-learning-with","title":"GraphAIR: Graph Representation Learning with Neighborhood Aggregation and Interaction","date":"2019-11-05","arxiv_id":"1911.01731","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":4,"n_honours":3,"n_violates":2,"n_no_contract":1,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 2 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/graphair-graph-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/1911.01731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.01731"}},"official":{"repos":["CRIPAC-DIG/GraphAIR"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/semi-supervisedly-co-embedding-attributed","slug":"semi-supervisedly-co-embedding-attributed","title":"Semi-supervisedly Co-embedding Attributed Networks","date":"2019-10-31","arxiv_id":"1910.14491","repositories_listed":1,"syntology":null},{"url":"/paper/shoestring-graph-based-semi-supervised","slug":"shoestring-graph-based-semi-supervised","title":"Shoestring: Graph-Based Semi-Supervised Learning with Severely Limited Labeled Data","date":"2019-10-28","arxiv_id":"1910.12976","repositories_listed":1,"syntology":null},{"url":"/paper/pre-train-and-learn-preserve-global","slug":"pre-train-and-learn-preserve-global","title":"Pre-train and Learn: Preserve Global Information for Graph Neural Networks","date":"2019-10-27","arxiv_id":"1910.12241","repositories_listed":1,"syntology":null},{"url":"/paper/dfnets-spectral-cnns-for-graphs-with-feedback","slug":"dfnets-spectral-cnns-for-graphs-with-feedback","title":"DFNets: Spectral CNNs for Graphs with Feedback-Looped Filters","date":"2019-10-24","arxiv_id":"1910.10866","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/dfnets-spectral-cnns-for-graphs-with-feedback#ran","syntology_url":"https://syntology.ai/paper/1910.10866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10866"}},"official":{"repos":["wokas36/DFNets"],"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/collaborative-graph-walk-for-semi-supervised","slug":"collaborative-graph-walk-for-semi-supervised","title":"Collaborative Graph Walk for Semi-supervised Multi-Label Node Classification","date":"2019-10-22","arxiv_id":"1910.09706","repositories_listed":1,"syntology":null},{"url":"/paper/recurrent-attention-walk-for-semi-supervised","slug":"recurrent-attention-walk-for-semi-supervised","title":"Recurrent Attention Walk for Semi-supervised Classification","date":"2019-10-22","arxiv_id":"1910.10266","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-self-training-framework-for-graph","slug":"dynamic-self-training-framework-for-graph","title":"Effective Stabilized Self-Training on Few-Labeled Graph Data","date":"2019-10-07","arxiv_id":"1910.02684","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/dynamic-self-training-framework-for-graph#ran","syntology_url":"https://syntology.ai/paper/1910.02684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02684"}},"official":null}},{"url":"/paper/graph-few-shot-learning-via-knowledge","slug":"graph-few-shot-learning-via-knowledge","title":"Graph Few-shot Learning via Knowledge Transfer","date":"2019-10-07","arxiv_id":"1910.03053","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-kernel-methods-for-node","slug":"rethinking-kernel-methods-for-node","title":"Rethinking Kernel Methods for Node Representation Learning on Graphs","date":"2019-10-06","arxiv_id":"1910.02548","repositories_listed":1,"syntology":null},{"url":"/paper/gaussian-process-based-dynamic-embedding-for","slug":"gaussian-process-based-dynamic-embedding-for","title":"Dynamic Embedding on Textual Networks via a Gaussian Process","date":"2019-10-05","arxiv_id":"1910.02187","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-equivalence-between-node-embeddings-1","slug":"on-the-equivalence-between-node-embeddings-1","title":"On the Equivalence between Positional Node Embeddings and Structural Graph Representations","date":"2019-10-01","arxiv_id":"1910.00452","repositories_listed":1,"syntology":null},{"url":"/paper/attributed-graph-learning-with-2-d-graph-1","slug":"attributed-graph-learning-with-2-d-graph-1","title":"Dimensionwise Separable 2-D Graph Convolution for Unsupervised and Semi-Supervised Learning on Graphs","date":"2019-09-26","arxiv_id":"1909.12038","repositories_listed":1,"syntology":null},{"url":"/paper/graphmix-regularized-training-of-graph-neural","slug":"graphmix-regularized-training-of-graph-neural","title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","date":"2019-09-25","arxiv_id":"1909.11715","repositories_listed":1,"syntology":null},{"url":"/paper/kernel-node-embeddings","slug":"kernel-node-embeddings","title":"Kernel Node Embeddings","date":"2019-09-08","arxiv_id":"1909.03416","repositories_listed":1,"syntology":null},{"url":"/paper/graph-representation-ensemble-learning","slug":"graph-representation-ensemble-learning","title":"Graph Representation Ensemble Learning","date":"2019-09-06","arxiv_id":"1909.02811","repositories_listed":1,"syntology":null},{"url":"/paper/network-transfer-learning-via-adversarial","slug":"network-transfer-learning-via-adversarial","title":"Graph Transfer Learning via Adversarial Domain Adaptation with Graph Convolution","date":"2019-09-04","arxiv_id":"1909.01541","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-training-methods-for-network","slug":"adversarial-training-methods-for-network","title":"Adversarial Training Methods for Network Embedding","date":"2019-08-30","arxiv_id":"1908.11514","repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolutional-networks-for-road","slug":"graph-convolutional-networks-for-road","title":"Graph Convolutional Networks for Road Networks","date":"2019-08-30","arxiv_id":"1908.11567","repositories_listed":1,"syntology":null},{"url":"/paper/bayes-embedding-bem-refining-representation","slug":"bayes-embedding-bem-refining-representation","title":"Bayes EMbedding (BEM): Refining Representation by Integrating Knowledge Graphs and Behavior-specific Networks","date":"2019-08-28","arxiv_id":"1908.10611","repositories_listed":1,"syntology":null},{"url":"/paper/inducing-a-decision-tree-with-discriminative","slug":"inducing-a-decision-tree-with-discriminative","title":"Inducing a Decision Tree with Discriminative Paths to Classify Entities in a Knowledge Graph","date":"2019-08-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/190807558","slug":"190807558","title":"Transferring Robustness for Graph Neural Network Against Poisoning Attacks","date":"2019-08-20","arxiv_id":"1908.07558","repositories_listed":1,"syntology":null},{"url":"/paper/adagcn-adaboosting-graph-convolutional","slug":"adagcn-adaboosting-graph-convolutional","title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","date":"2019-08-14","arxiv_id":"1908.05081","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-learning-from-complex-multigraphs","slug":"end-to-end-learning-from-complex-multigraphs","title":"End-to-End Learning from Complex Multigraphs with Latent-Graph Convolutional Networks","date":"2019-08-14","arxiv_id":"1908.05365","repositories_listed":1,"syntology":null},{"url":"/paper/snomed2vec-random-walk-and-poincare","slug":"snomed2vec-random-walk-and-poincare","title":"Snomed2Vec: Random Walk and Poincaré Embeddings of a Clinical Knowledge Base for Healthcare Analytics","date":"2019-07-19","arxiv_id":"1907.08650","repositories_listed":1,"syntology":null},{"url":"/paper/k-hop-graph-neural-networks","slug":"k-hop-graph-neural-networks","title":"k-hop Graph Neural Networks","date":"2019-07-13","arxiv_id":"1907.06051","repositories_listed":1,"syntology":null},{"url":"/paper/improving-attention-mechanism-in-graph-neural","slug":"improving-attention-mechanism-in-graph-neural","title":"Improving Attention Mechanism in Graph Neural Networks via Cardinality Preservation","date":"2019-07-04","arxiv_id":"1907.02204","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-attention-mechanism-in-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1907.02204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.02204"}},"official":{"repos":["zetayue/CPA"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/certifiable-robustness-and-robust-training","slug":"certifiable-robustness-and-robust-training","title":"Certifiable Robustness and Robust Training for Graph Convolutional Networks","date":"2019-06-28","arxiv_id":"1906.12269","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/certifiable-robustness-and-robust-training#ran","syntology_url":"https://syntology.ai/paper/1906.12269","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12269"}},"official":null}},{"url":"/paper/signed-graph-attention-networks","slug":"signed-graph-attention-networks","title":"Signed Graph Attention Networks","date":"2019-06-26","arxiv_id":"1906.10958","repositories_listed":1,"syntology":null},{"url":"/paper/graph-star-net-for-generalized-multi-task-1","slug":"graph-star-net-for-generalized-multi-task-1","title":"Graph Star Net for Generalized Multi-Task Learning","date":"2019-06-21","arxiv_id":"1906.12330","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/graph-star-net-for-generalized-multi-task-1#ran","syntology_url":"https://syntology.ai/paper/1906.12330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12330"}},"official":null}},{"url":"/paper/regional-based-query-in-graph-active-learning","slug":"regional-based-query-in-graph-active-learning","title":"Regional based query in graph active learning","date":"2019-06-20","arxiv_id":"1906.08541","repositories_listed":1,"syntology":null},{"url":"/paper/topology-attack-and-defense-for-graph-neural","slug":"topology-attack-and-defense-for-graph-neural","title":"Topology Attack and Defense for Graph Neural Networks: An Optimization Perspective","date":"2019-06-10","arxiv_id":"1906.04214","repositories_listed":1,"syntology":null},{"url":"/paper/break-the-ceiling-stronger-multi-scale-deep","slug":"break-the-ceiling-stronger-multi-scale-deep","title":"Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks","date":"2019-06-05","arxiv_id":"1906.02174","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/break-the-ceiling-stronger-multi-scale-deep#ran","syntology_url":"https://syntology.ai/paper/1906.02174","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02174"}},"official":{"repos":["PwnerHarry/Stronger_GCN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/demo-net-degree-specific-graph-neural","slug":"demo-net-degree-specific-graph-neural","title":"DEMO-Net: Degree-specific Graph Neural Networks for Node and Graph Classification","date":"2019-06-05","arxiv_id":"1906.02319","repositories_listed":1,"syntology":null},{"url":"/paper/graph-learning-network-a-structure-learning-1","slug":"graph-learning-network-a-structure-learning-1","title":"Graph Learning Network: A Structure Learning Algorithm","date":"2019-05-29","arxiv_id":"1905.12665","repositories_listed":1,"syntology":null},{"url":"/paper/on-asymptotic-behaviors-of-graph-cnns-from","slug":"on-asymptotic-behaviors-of-graph-cnns-from","title":"Graph Neural Networks Exponentially Lose Expressive Power for Node Classification","date":"2019-05-27","arxiv_id":"1905.10947","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/on-asymptotic-behaviors-of-graph-cnns-from#ran","syntology_url":"https://syntology.ai/paper/1905.10947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10947"}},"official":{"repos":["delta2323/gnn-asymptotics"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-attention-auto-encoders","slug":"graph-attention-auto-encoders","title":"Graph Attention Auto-Encoders","date":"2019-05-26","arxiv_id":"1905.10715","repositories_listed":1,"syntology":null},{"url":"/paper/meta-gnn-on-few-shot-node-classification-in","slug":"meta-gnn-on-few-shot-node-classification-in","title":"Meta-GNN: On Few-shot Node Classification in Graph Meta-learning","date":"2019-05-23","arxiv_id":"1905.09718","repositories_listed":1,"syntology":null},{"url":"/paper/network-representation-learning-consolidation","slug":"network-representation-learning-consolidation","title":"Network Representation Learning: Consolidation and Renewed Bearing","date":"2019-05-02","arxiv_id":"1905.00987","repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolutional-networks-with","slug":"graph-convolutional-networks-with","title":"Graph Convolutional Networks with EigenPooling","date":"2019-04-30","arxiv_id":"1904.13107","repositories_listed":1,"syntology":null},{"url":"/paper/advancing-graphsage-with-a-data-driven-node","slug":"advancing-graphsage-with-a-data-driven-node","title":"Advancing GraphSAGE with A Data-Driven Node Sampling","date":"2019-04-29","arxiv_id":"1904.12935","repositories_listed":1,"syntology":null},{"url":"/paper/graphnas-graph-neural-architecture-search","slug":"graphnas-graph-neural-architecture-search","title":"GraphNAS: Graph Neural Architecture Search with Reinforcement Learning","date":"2019-04-22","arxiv_id":"1904.09981","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/graphnas-graph-neural-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1904.09981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09981"}},"official":{"repos":["GraphNAS/GraphNAS-simple"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/semi-supervised-graph-classification-a","slug":"semi-supervised-graph-classification-a","title":"Semi-Supervised Graph Classification: A Hierarchical Graph Perspective","date":"2019-04-10","arxiv_id":"1904.05003","repositories_listed":1,"syntology":null},{"url":"/paper/just-jump-dynamic-neighborhood-aggregation-in","slug":"just-jump-dynamic-neighborhood-aggregation-in","title":"Just Jump: Dynamic Neighborhood Aggregation in Graph Neural Networks","date":"2019-04-09","arxiv_id":"1904.04849","repositories_listed":1,"syntology":null},{"url":"/paper/can-gcns-go-as-deep-as-cnns","slug":"can-gcns-go-as-deep-as-cnns","title":"DeepGCNs: Can GCNs Go as Deep as CNNs?","date":"2019-04-07","arxiv_id":"1904.03751","repositories_listed":1,"syntology":null},{"url":"/paper/node-embedding-over-temporal-graphs","slug":"node-embedding-over-temporal-graphs","title":"Node Embedding over Temporal Graphs","date":"2019-03-21","arxiv_id":"1903.08889","repositories_listed":1,"syntology":null},{"url":"/paper/fisher-bures-adversary-graph-convolutional","slug":"fisher-bures-adversary-graph-convolutional","title":"Fisher-Bures Adversary Graph Convolutional Networks","date":"2019-03-11","arxiv_id":"1903.04154","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/fisher-bures-adversary-graph-convolutional#ran","syntology_url":"https://syntology.ai/paper/1903.04154","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.04154"}},"official":{"repos":["stellargraph/FisherGCN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/gated-graph-convolutional-recurrent-neural","slug":"gated-graph-convolutional-recurrent-neural","title":"Gated Graph Convolutional Recurrent Neural Networks","date":"2019-03-05","arxiv_id":"1903.01888","repositories_listed":1,"syntology":null},{"url":"/paper/graphvite-a-high-performance-cpu-gpu-hybrid","slug":"graphvite-a-high-performance-cpu-gpu-hybrid","title":"GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding","date":"2019-03-02","arxiv_id":"1903.00757","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/graphvite-a-high-performance-cpu-gpu-hybrid#ran","syntology_url":"https://syntology.ai/paper/1903.00757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.00757"}},"official":null}},{"url":"/paper/adversarial-attacks-on-graph-neural-networks","slug":"adversarial-attacks-on-graph-neural-networks","title":"Adversarial Attacks on Graph Neural Networks via Meta Learning","date":"2019-02-22","arxiv_id":"1902.08412","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"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) · 1 unverified","sample_list":"/paper/adversarial-attacks-on-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1902.08412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.08412"}},"official":{"repos":["danielzuegner/gnn-meta-attack"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-adversarial-training-dynamically","slug":"graph-adversarial-training-dynamically","title":"Graph Adversarial Training: Dynamically Regularizing Based on Graph Structure","date":"2019-02-20","arxiv_id":"1902.08226","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-node-classification-via","slug":"semi-supervised-node-classification-via","title":"Hierarchical Graph Convolutional Networks for Semi-supervised Node Classification","date":"2019-02-13","arxiv_id":"1902.06667","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":3,"n_honours":3,"n_violates":2,"n_no_contract":3,"n_pointer_only":7,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 3 honoured, 2 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/semi-supervised-node-classification-via#ran","syntology_url":"https://syntology.ai/paper/1902.06667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.06667"}},"official":{"repos":["CRIPAC-DIG/H-GCN"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-node-ranking-an-algorithm-for-structural","slug":"deep-node-ranking-an-algorithm-for-structural","title":"Deep Node Ranking for Neuro-symbolic Structural Node Embedding and Classification","date":"2019-02-11","arxiv_id":"1902.03964","repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-for-heterogeneous","slug":"representation-learning-for-heterogeneous","title":"Representation Learning for Heterogeneous Information Networks via Embedding Events","date":"2019-01-29","arxiv_id":"1901.10234","repositories_listed":1,"syntology":null},{"url":"/paper/hypergraph-convolution-and-hypergraph","slug":"hypergraph-convolution-and-hypergraph","title":"Hypergraph Convolution and Hypergraph Attention","date":"2019-01-23","arxiv_id":"1901.08150","repositories_listed":1,"syntology":null},{"url":"/paper/attributed-network-embedding-via-subspace","slug":"attributed-network-embedding-via-subspace","title":"Attributed Network Embedding via Subspace Discovery","date":"2019-01-14","arxiv_id":"1901.04095","repositories_listed":1,"syntology":null},{"url":"/paper/search-efficient-binary-network-embedding","slug":"search-efficient-binary-network-embedding","title":"Search Efficient Binary Network Embedding","date":"2019-01-14","arxiv_id":"1901.04097","repositories_listed":1,"syntology":null},{"url":"/paper/lanczosnet-multi-scale-deep-graph","slug":"lanczosnet-multi-scale-deep-graph","title":"LanczosNet: Multi-Scale Deep Graph Convolutional Networks","date":"2019-01-06","arxiv_id":"1901.01484","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-with-convolutional-arma","slug":"graph-neural-networks-with-convolutional-arma","title":"Graph Neural Networks with convolutional ARMA filters","date":"2019-01-05","arxiv_id":"1901.01343","repositories_listed":1,"syntology":null},{"url":"/paper/attributed-network-embedding-for-incomplete","slug":"attributed-network-embedding-for-incomplete","title":"Attributed Network Embedding for Incomplete Attributed Networks","date":"2018-11-28","arxiv_id":"1811.11728","repositories_listed":1,"syntology":null},{"url":"/paper/node-embedding-with-adaptive-similarities-for","slug":"node-embedding-with-adaptive-similarities-for","title":"Node Embedding with Adaptive Similarities for Scalable Learning over Graphs","date":"2018-11-27","arxiv_id":"1811.10797","repositories_listed":1,"syntology":null},{"url":"/paper/dynamicgem-a-library-for-dynamic-graph","slug":"dynamicgem-a-library-for-dynamic-graph","title":"DynamicGEM: A Library for Dynamic Graph Embedding Methods","date":"2018-11-26","arxiv_id":"1811.10734","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-multigraph-networks-for-discovering","slug":"spectral-multigraph-networks-for-discovering","title":"Spectral Multigraph Networks for Discovering and Fusing Relationships in Molecules","date":"2018-11-23","arxiv_id":"1811.09595","repositories_listed":1,"syntology":null},{"url":"/paper/multi-layered-graph-embedding-with-graph","slug":"multi-layered-graph-embedding-with-graph","title":"MGCN: Semi-supervised Classification in Multi-layer Graphs with Graph Convolutional Networks","date":"2018-11-21","arxiv_id":"1811.08800","repositories_listed":1,"syntology":null},{"url":"/paper/role-action-embeddings-scalable","slug":"role-action-embeddings-scalable","title":"Role action embeddings: scalable representation of network positions","date":"2018-11-19","arxiv_id":"1811.08019","repositories_listed":1,"syntology":null},{"url":"/paper/multi-task-graph-autoencoders","slug":"multi-task-graph-autoencoders","title":"Multi-Task Graph Autoencoders","date":"2018-11-07","arxiv_id":"1811.02798","repositories_listed":1,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/multi-task-graph-autoencoders#ran","syntology_url":"https://syntology.ai/paper/1811.02798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.02798"}},"official":{"repos":["vuptran/graph-representation-learning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-sparse-hierarchical-graph-classifiers","slug":"towards-sparse-hierarchical-graph-classifiers","title":"Towards Sparse Hierarchical Graph Classifiers","date":"2018-11-03","arxiv_id":"1811.01287","repositories_listed":1,"syntology":null},{"url":"/paper/every-node-counts-self-ensembling-graph","slug":"every-node-counts-self-ensembling-graph","title":"Every Node Counts: Self-Ensembling Graph Convolutional Networks for Semi-Supervised Learning","date":"2018-09-26","arxiv_id":"1809.09925","repositories_listed":1,"syntology":null},{"url":"/paper/biasedwalk-biased-sampling-for-representation","slug":"biasedwalk-biased-sampling-for-representation","title":"BiasedWalk: Biased Sampling for Representation Learning on Graphs","date":"2018-09-07","arxiv_id":"1809.02482","repositories_listed":1,"syntology":null},{"url":"/paper/node-classification-for-signed-social","slug":"node-classification-for-signed-social","title":"Node Classification for Signed Social Networks Using Diffuse Interface Methods","date":"2018-09-07","arxiv_id":"1809.06432","repositories_listed":1,"syntology":null},{"url":"/paper/large-scale-learnable-graph-convolutional","slug":"large-scale-learnable-graph-convolutional","title":"Large-Scale Learnable Graph Convolutional Networks","date":"2018-08-12","arxiv_id":"1808.03965","repositories_listed":1,"syntology":null},{"url":"/paper/empirical-risk-minimization-and-stochastic","slug":"empirical-risk-minimization-and-stochastic","title":"Empirical Risk Minimization and Stochastic Gradient Descent for Relational Data","date":"2018-06-27","arxiv_id":"1806.10701","repositories_listed":1,"syntology":{"n":23,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":14,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/empirical-risk-minimization-and-stochastic#ran","syntology_url":"https://syntology.ai/paper/1806.10701","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.10701"}},"official":{"repos":["wooden-spoon/relational-ERM"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":14,"ran_from_kinds":["official"]}}},{"url":"/paper/spectral-network-embedding-a-fast-and","slug":"spectral-network-embedding-a-fast-and","title":"Spectral Network Embedding: A Fast and Scalable Method via Sparsity","date":"2018-06-07","arxiv_id":"1806.02623","repositories_listed":1,"syntology":null},{"url":"/paper/fusion-graph-convolutional-networks","slug":"fusion-graph-convolutional-networks","title":"Fusion Graph Convolutional Networks","date":"2018-05-31","arxiv_id":"1805.12528","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-attacks-on-neural-networks-for","slug":"adversarial-attacks-on-neural-networks-for","title":"Adversarial Attacks on Neural Networks for Graph Data","date":"2018-05-21","arxiv_id":"1805.07984","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"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) · 3 unverified","sample_list":"/paper/adversarial-attacks-on-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/1805.07984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.07984"}},"official":null}},{"url":"/paper/neural-brane-neural-bayesian-personalized","slug":"neural-brane-neural-bayesian-personalized","title":"Neural-Brane: Neural Bayesian Personalized Ranking for Attributed Network Embedding","date":"2018-04-23","arxiv_id":"1804.08774","repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolutional-neural-networks-via-1","slug":"graph-convolutional-neural-networks-via-1","title":"Graph Convolutional Neural Networks via Scattering","date":"2018-03-31","arxiv_id":"1804.00099","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":3,"n_no_contract":0,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 3 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-convolutional-neural-networks-via-1#ran","syntology_url":"https://syntology.ai/paper/1804.00099","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.00099"}},"official":null}},{"url":"/paper/graphite-iterative-generative-modeling-of","slug":"graphite-iterative-generative-modeling-of","title":"Graphite: Iterative Generative Modeling of Graphs","date":"2018-03-28","arxiv_id":"1803.10459","repositories_listed":1,"syntology":null},{"url":"/paper/gaan-gated-attention-networks-for-learning-on","slug":"gaan-gated-attention-networks-for-learning-on","title":"GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphs","date":"2018-03-20","arxiv_id":"1803.07294","repositories_listed":1,"syntology":null},{"url":"/paper/graph-partition-neural-networks-for-semi","slug":"graph-partition-neural-networks-for-semi","title":"Graph Partition Neural Networks for Semi-Supervised Classification","date":"2018-03-16","arxiv_id":"1803.06272","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/graph-partition-neural-networks-for-semi#ran","syntology_url":"https://syntology.ai/paper/1803.06272","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.06272"}},"official":{"repos":["Microsoft/graph-partition-neural-network-samples"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/gpsp-graph-partition-and-space-projection","slug":"gpsp-graph-partition-and-space-projection","title":"GPSP: Graph Partition and Space Projection based Approach for Heterogeneous Network Embedding","date":"2018-03-07","arxiv_id":"1803.02590","repositories_listed":1,"syntology":null},{"url":"/paper/mile-a-multi-level-framework-for-scalable","slug":"mile-a-multi-level-framework-for-scalable","title":"MILE: A Multi-Level Framework for Scalable Graph Embedding","date":"2018-02-26","arxiv_id":"1802.09612","repositories_listed":1,"syntology":null},{"url":"/paper/n-gcn-multi-scale-graph-convolution-for-semi","slug":"n-gcn-multi-scale-graph-convolution-for-semi","title":"N-GCN: Multi-scale Graph Convolution for Semi-supervised Node Classification","date":"2018-02-24","arxiv_id":"1802.08888","repositories_listed":1,"syntology":null},{"url":"/paper/deeper-insights-into-graph-convolutional","slug":"deeper-insights-into-graph-convolutional","title":"Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learning","date":"2018-01-22","arxiv_id":"1801.07606","repositories_listed":1,"syntology":null},{"url":"/paper/residual-gated-graph-convnets","slug":"residual-gated-graph-convnets","title":"Residual Gated Graph ConvNets","date":"2017-11-20","arxiv_id":"1711.07553","repositories_listed":1,"syntology":null},{"url":"/paper/motif-based-convolutional-neural-network-on","slug":"motif-based-convolutional-neural-network-on","title":"Motif-based Convolutional Neural Network on Graphs","date":"2017-11-15","arxiv_id":"1711.05697","repositories_listed":1,"syntology":null},{"url":"/paper/rdf2vec-rdf-graph-embeddings-and-their","slug":"rdf2vec-rdf-graph-embeddings-and-their","title":"RDF2Vec: RDF Graph Embeddings and Their Applications","date":"2017-11-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/metapath2vec-scalable-representation-learning","slug":"metapath2vec-scalable-representation-learning","title":"metapath2vec: Scalable Representation Learning for Heterogeneous Networks","date":"2017-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deep-gaussian-embedding-of-graphs","slug":"deep-gaussian-embedding-of-graphs","title":"Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking","date":"2017-07-12","arxiv_id":"1707.03815","repositories_listed":1,"syntology":null},{"url":"/paper/active-learning-for-graph-embedding","slug":"active-learning-for-graph-embedding","title":"Active Learning for Graph Embedding","date":"2017-05-15","arxiv_id":"1705.05085","repositories_listed":1,"syntology":null},{"url":null,"slug":"graph-semi-supervised-learning-for-point","title":"Graph Semi-Supervised Learning for Point Classification on Data Manifolds","date":"2025-06-13","arxiv_id":"2506.12197","repositories_listed":0,"syntology":null},{"url":null,"slug":"devil-s-hand-data-poisoning-attacks-to","title":"Devil's Hand: Data Poisoning Attacks to Locally Private Graph Learning Protocols","date":"2025-06-11","arxiv_id":"2506.09803","repositories_listed":0,"syntology":null},{"url":null,"slug":"wasserstein-hypergraph-neural-network","title":"Wasserstein Hypergraph Neural Network","date":"2025-06-11","arxiv_id":"2506.09682","repositories_listed":0,"syntology":null},{"url":null,"slug":"in2v-bringing-transductive-node-embeddings-to","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","date":"2025-06-05","arxiv_id":"2506.05039","repositories_listed":0,"syntology":null},{"url":null,"slug":"mitigating-degree-bias-adaptively-with-hard","title":"Mitigating Degree Bias Adaptively with Hard-to-Learn Nodes in Graph Contrastive Learning","date":"2025-06-05","arxiv_id":"2506.05214","repositories_listed":0,"syntology":null},{"url":null,"slug":"2506-02619","title":"HGOT: Self-supervised Heterogeneous Graph Neural Network with Optimal Transport","date":"2025-06-03","arxiv_id":"2506.02619","repositories_listed":0,"syntology":null},{"url":null,"slug":"weak-supervision-for-real-world-graphs","title":"Weak Supervision for Real World Graphs","date":"2025-06-03","arxiv_id":"2506.02451","repositories_listed":0,"syntology":null},{"url":null,"slug":"deglif-for-label-noise-robust-node","title":"DeGLIF for Label Noise Robust Node Classification using GNNs","date":"2025-05-30","arxiv_id":"2506.00244","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-source-and-target-domains-via-link","title":"Bridging Source and Target Domains via Link Prediction for Unsupervised Domain Adaptation on Graphs","date":"2025-05-29","arxiv_id":"2505.24055","repositories_listed":0,"syntology":null}],"record_sha256":"a1126be65cb5abe91ea8b512e5a483beb7f5ae4fc2d0dea5896608019c518301","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}