{"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/9","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":9,"pages_in_order":19,"rows_per_page":100,"rows":[801,900],"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/8","next":"/task/node-classification/papers/10","papers":[{"url":"/paper/active-learning-for-node-classification-the","slug":"active-learning-for-node-classification-the","title":"LSCALE: Latent Space Clustering-Based Active Learning for Node Classification","date":"2020-12-13","arxiv_id":"2012.07065","repositories_listed":1,"syntology":null},{"url":"/paper/graph-random-neural-networks-for-semi","slug":"graph-random-neural-networks-for-semi","title":"Graph Random Neural Networks for Semi-Supervised Learning on Graphs","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-stochastic-neural-networks-for-semi","slug":"graph-stochastic-neural-networks-for-semi","title":"Graph Stochastic Neural Networks for Semi-supervised Learning","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/self-expressive-graph-neural-network-for","slug":"self-expressive-graph-neural-network-for","title":"Unsupervised Constrained Community Detection via Self-Expressive Graph Neural Network","date":"2020-11-28","arxiv_id":"2011.14078","repositories_listed":1,"syntology":null},{"url":"/paper/revisit-graph-neural-networks-and-distance","slug":"revisit-graph-neural-networks-and-distance","title":"Revisiting graph neural networks and distance encoding from a practical view","date":"2020-11-22","arxiv_id":"2011.12228","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-drop-robust-graph-neural-network","slug":"learning-to-drop-robust-graph-neural-network","title":"Learning to Drop: Robust Graph Neural Network via Topological Denoising","date":"2020-11-13","arxiv_id":"2011.07057","repositories_listed":1,"syntology":null},{"url":"/paper/two-stage-training-of-graph-neural-networks","slug":"two-stage-training-of-graph-neural-networks","title":"Two-stage Training of Graph Neural Networks for Graph Classification","date":"2020-11-10","arxiv_id":"2011.05097","repositories_listed":1,"syntology":null},{"url":"/paper/hyperbolic-graph-embedding-with-enhanced-semi","slug":"hyperbolic-graph-embedding-with-enhanced-semi","title":"Hyperbolic Graph Embedding with Enhanced Semi-Implicit Variational Inference","date":"2020-10-31","arxiv_id":"2011.00194","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-impact-of-communities-on-semi","slug":"on-the-impact-of-communities-on-semi","title":"On the Impact of Communities on Semi-supervised Classification Using Graph Neural Networks","date":"2020-10-30","arxiv_id":"2010.16245","repositories_listed":1,"syntology":null},{"url":"/paper/gripnet-graph-information-propagation-on","slug":"gripnet-graph-information-propagation-on","title":"GripNet: Graph Information Propagation on Supergraph for Heterogeneous Graphs","date":"2020-10-29","arxiv_id":"2010.15914","repositories_listed":1,"syntology":null},{"url":"/paper/geometric-scattering-attention-networks","slug":"geometric-scattering-attention-networks","title":"Geometric Scattering Attention Networks","date":"2020-10-28","arxiv_id":"2010.15010","repositories_listed":1,"syntology":null},{"url":"/paper/anti-perturbation-of-online-social-networks","slug":"anti-perturbation-of-online-social-networks","title":"Deperturbation of Online Social Networks via Bayesian Label Transition","date":"2020-10-27","arxiv_id":"2010.14121","repositories_listed":1,"syntology":null},{"url":"/paper/graph-contrastive-learning-with-adaptive","slug":"graph-contrastive-learning-with-adaptive","title":"Graph Contrastive Learning with Adaptive Augmentation","date":"2020-10-27","arxiv_id":"2010.14945","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-enhanced-heterogeneous","slug":"reinforcement-learning-enhanced-heterogeneous","title":"Personalised Meta-path Generation for Heterogeneous GNNs","date":"2020-10-26","arxiv_id":"2010.13735","repositories_listed":1,"syntology":null},{"url":"/paper/pathfinder-discovery-networks-for-neural","slug":"pathfinder-discovery-networks-for-neural","title":"Pathfinder Discovery Networks for Neural Message Passing","date":"2020-10-24","arxiv_id":"2010.12878","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-aware-semi-supervised-learning-on","slug":"uncertainty-aware-semi-supervised-learning-on","title":"Uncertainty Aware Semi-Supervised Learning on Graph Data","date":"2020-10-24","arxiv_id":"2010.12783","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":1,"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) · 2 unverified","sample_list":"/paper/uncertainty-aware-semi-supervised-learning-on#ran","syntology_url":"https://syntology.ai/paper/2010.12783","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12783"}},"official":{"repos":["zxj32/uncertainty-GNN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/graph-geometry-interaction-learning","slug":"graph-geometry-interaction-learning","title":"Graph Geometry Interaction Learning","date":"2020-10-23","arxiv_id":"2010.12135","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-equivalence-of-decoupled-graph","slug":"on-the-equivalence-of-decoupled-graph","title":"On the Equivalence of Decoupled Graph Convolution Network and Label Propagation","date":"2020-10-23","arxiv_id":"2010.12408","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":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) · 1 unverified","sample_list":"/paper/on-the-equivalence-of-decoupled-graph#ran","syntology_url":"https://syntology.ai/paper/2010.12408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12408"}},"official":{"repos":["DongHande/PT_propagation_then_training"],"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/should-graph-convolution-trust-neighbors-a","slug":"should-graph-convolution-trust-neighbors-a","title":"Should Graph Convolution Trust Neighbors? A Simple Causal Inference Method","date":"2020-10-22","arxiv_id":"2010.11797","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-attention-modules","slug":"bayesian-attention-modules","title":"Bayesian Attention Modules","date":"2020-10-20","arxiv_id":"2010.10604","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/bayesian-attention-modules#ran","syntology_url":"https://syntology.ai/paper/2010.10604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.10604"}},"official":{"repos":["zhougroup/BAM"],"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/factorizable-graph-convolutional-networks","slug":"factorizable-graph-convolutional-networks","title":"Factorizable Graph Convolutional Networks","date":"2020-10-12","arxiv_id":"2010.05421","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/factorizable-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2010.05421","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05421"}},"official":{"repos":["ihollywhy/FactorGCN.PyTorch"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/direct-multi-hop-attention-based-graph-neural","slug":"direct-multi-hop-attention-based-graph-neural","title":"Multi-hop Attention Graph Neural Network","date":"2020-09-29","arxiv_id":"2009.14332","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/direct-multi-hop-attention-based-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2009.14332","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.14332"}},"official":{"repos":["xjtuwgt/gnn-magna"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/framework-for-designing-filters-of-spectral","slug":"framework-for-designing-filters-of-spectral","title":"Framework for Designing Filters of Spectral Graph Convolutional Neural Networks in the Context of Regularization Theory","date":"2020-09-29","arxiv_id":"2009.13801","repositories_listed":1,"syntology":null},{"url":"/paper/new-gcnn-based-architecture-for-semi","slug":"new-gcnn-based-architecture-for-semi","title":"Semi-Supervised Node Classification by Graph Convolutional Networks and Extracted Side Information","date":"2020-09-29","arxiv_id":"2009.13734","repositories_listed":1,"syntology":null},{"url":"/paper/learning-graph-normalization-for-graph-neural","slug":"learning-graph-normalization-for-graph-neural","title":"Learning Graph Normalization for Graph Neural Networks","date":"2020-09-24","arxiv_id":"2009.11746","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/learning-graph-normalization-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2009.11746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.11746"}},"official":{"repos":["cyh1112/GraphNormalization"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/force2vec-parallel-force-directed-graph","slug":"force2vec-parallel-force-directed-graph","title":"Force2Vec: Parallel force-directed graph embedding","date":"2020-09-17","arxiv_id":"2009.10035","repositories_listed":1,"syntology":null},{"url":"/paper/catgcn-graph-convolutional-networks-with","slug":"catgcn-graph-convolutional-networks-with","title":"CatGCN: Graph Convolutional Networks with Categorical Node Features","date":"2020-09-11","arxiv_id":"2009.05303","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-coarsening-for-embedding-large","slug":"understanding-coarsening-for-embedding-large","title":"Understanding Coarsening for Embedding Large-Scale Graphs","date":"2020-09-10","arxiv_id":"2009.04925","repositories_listed":1,"syntology":null},{"url":"/paper/walk-extraction-strategies-for-node","slug":"walk-extraction-strategies-for-node","title":"Walk Extraction Strategies for Node Embeddings with RDF2Vec in Knowledge Graphs","date":"2020-09-09","arxiv_id":"2009.04404","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-message-passing-graph-neural","slug":"hierarchical-message-passing-graph-neural","title":"Hierarchical Message-Passing Graph Neural Networks","date":"2020-09-08","arxiv_id":"2009.03717","repositories_listed":1,"syntology":null},{"url":"/paper/snore-scalable-unsupervised-learning-of","slug":"snore-scalable-unsupervised-learning-of","title":"SNoRe: Scalable Unsupervised Learning of Symbolic Node Representations","date":"2020-09-08","arxiv_id":"2009.04535","repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-and-general-graph-neural-network","slug":"a-simple-and-general-graph-neural-network","title":"Permutation-equivariant and Proximity-aware Graph Neural Networks with Stochastic Message Passing","date":"2020-09-05","arxiv_id":"2009.02562","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-graph-regularization-for-graph","slug":"rethinking-graph-regularization-for-graph","title":"Rethinking Graph Regularization for Graph Neural Networks","date":"2020-09-04","arxiv_id":"2009.02027","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-observed-connections-link-injection","slug":"beyond-observed-connections-link-injection","title":"Beyond Observed Connections : Link Injection","date":"2020-09-02","arxiv_id":"2009.04447","repositories_listed":1,"syntology":null},{"url":"/paper/mutual-teaching-for-graph-convolutional","slug":"mutual-teaching-for-graph-convolutional","title":"Mutual Teaching for Graph Convolutional Networks","date":"2020-09-02","arxiv_id":"2009.00952","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-evasion-attacks-to-graph-neural","slug":"efficient-evasion-attacks-to-graph-neural","title":"Efficient, Direct, and Restricted Black-Box Graph Evasion Attacks to Any-Layer Graph Neural Networks via Influence Function","date":"2020-09-01","arxiv_id":"2009.00203","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-privacy-preserving-graph","slug":"adversarial-privacy-preserving-graph","title":"Adversarial Privacy Preserving Graph Embedding against Inference Attack","date":"2020-08-30","arxiv_id":"2008.13072","repositories_listed":1,"syntology":null},{"url":"/paper/decoupled-variational-embedding-for-signed","slug":"decoupled-variational-embedding-for-signed","title":"Decoupled Variational Embedding for Signed Directed Networks","date":"2020-08-28","arxiv_id":"2008.12450","repositories_listed":1,"syntology":null},{"url":"/paper/learning-robust-node-representation-on-graphs","slug":"learning-robust-node-representation-on-graphs","title":"Learning Node Representations against Perturbations","date":"2020-08-26","arxiv_id":"2008.11416","repositories_listed":1,"syntology":null},{"url":"/paper/multiverse-a-multiplex-and-multiplex","slug":"multiverse-a-multiplex-and-multiplex","title":"MultiVERSE: a multiplex and multiplex-heterogeneous network embedding approach","date":"2020-08-23","arxiv_id":"2008.10085","repositories_listed":1,"syntology":null},{"url":"/paper/optimization-of-graph-neural-networks-with","slug":"optimization-of-graph-neural-networks-with","title":"Optimization of Graph Neural Networks with Natural Gradient Descent","date":"2020-08-21","arxiv_id":"2008.09624","repositories_listed":1,"syntology":null},{"url":"/paper/graphreach-locality-aware-graph-neural","slug":"graphreach-locality-aware-graph-neural","title":"GraphReach: Position-Aware Graph Neural Network using Reachability Estimations","date":"2020-08-19","arxiv_id":"2008.09657","repositories_listed":1,"syntology":null},{"url":"/paper/quaternion-graph-neural-networks","slug":"quaternion-graph-neural-networks","title":"Quaternion Graph Neural Networks","date":"2020-08-12","arxiv_id":"2008.05089","repositories_listed":1,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/quaternion-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2008.05089","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.05089"}},"official":{"repos":["daiquocnguyen/QGNN"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/panrep-universal-node-embeddings-for","slug":"panrep-universal-node-embeddings-for","title":"PanRep: Graph neural networks for extracting universal node embeddings in heterogeneous graphs","date":"2020-07-20","arxiv_id":"2007.10445","repositories_listed":1,"syntology":null},{"url":"/paper/second-order-pooling-for-graph-neural","slug":"second-order-pooling-for-graph-neural","title":"Second-Order Pooling for Graph Neural Networks","date":"2020-07-20","arxiv_id":"2007.10467","repositories_listed":1,"syntology":null},{"url":"/paper/fuzzy-graph-neural-network-for-few-shot","slug":"fuzzy-graph-neural-network-for-few-shot","title":"Fuzzy Graph Neural Network for Few-Shot Learning","date":"2020-07-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-auxiliary-learning-with-meta","slug":"self-supervised-auxiliary-learning-with-meta","title":"Self-supervised Auxiliary Learning with Meta-paths for Heterogeneous Graphs","date":"2020-07-16","arxiv_id":"2007.08294","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-for-abstract-argumentation","slug":"deep-learning-for-abstract-argumentation","title":"Deep Learning for Abstract Argumentation Semantics","date":"2020-07-15","arxiv_id":"2007.07629","repositories_listed":1,"syntology":null},{"url":"/paper/faster-graph-embeddings-via-coarsening","slug":"faster-graph-embeddings-via-coarsening","title":"Faster Graph Embeddings via Coarsening","date":"2020-07-06","arxiv_id":"2007.02817","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/faster-graph-embeddings-via-coarsening#ran","syntology_url":"https://syntology.ai/paper/2007.02817","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02817"}},"official":null}},{"url":"/paper/node-classification-on-graphs-with-few-shot","slug":"node-classification-on-graphs-with-few-shot","title":"Node Classification on Graphs with Few-Shot Novel Labels via Meta Transformed Network Embedding","date":"2020-07-06","arxiv_id":"2007.02914","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/node-classification-on-graphs-with-few-shot#ran","syntology_url":"https://syntology.ai/paper/2007.02914","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02914"}},"official":{"repos":["llan-ml/MetaTNE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/wiki-cs-a-wikipedia-based-benchmark-for-graph","slug":"wiki-cs-a-wikipedia-based-benchmark-for-graph","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","date":"2020-07-06","arxiv_id":"2007.02901","repositories_listed":1,"syntology":null},{"url":"/paper/aegcn-an-autoencoder-constrained-graph","slug":"aegcn-an-autoencoder-constrained-graph","title":"AEGCN: An Autoencoder-Constrained Graph Convolutional Network","date":"2020-07-03","arxiv_id":"2007.03424","repositories_listed":1,"syntology":null},{"url":"/paper/maximizing-cohesion-and-separation-in-graph","slug":"maximizing-cohesion-and-separation-in-graph","title":"Maximizing Cohesion and Separation in Graph Representation Learning: A Distance-aware Negative Sampling Approach","date":"2020-07-02","arxiv_id":"2007.01423","repositories_listed":1,"syntology":null},{"url":"/paper/policy-gnn-aggregation-optimization-for-graph","slug":"policy-gnn-aggregation-optimization-for-graph","title":"Policy-GNN: Aggregation Optimization for Graph Neural Networks","date":"2020-06-26","arxiv_id":"2006.15097","repositories_listed":1,"syntology":null},{"url":"/paper/incremental-training-of-graph-neural-networks","slug":"incremental-training-of-graph-neural-networks","title":"Lifelong Learning of Graph Neural Networks for Open-World Node Classification","date":"2020-06-25","arxiv_id":"2006.14422","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/incremental-training-of-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2006.14422","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14422"}},"official":{"repos":["lgalke/lifelong-learning"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gaining-insight-into-sars-cov-2-infection-and","slug":"gaining-insight-into-sars-cov-2-infection-and","title":"Gaining Insight into SARS-CoV-2 Infection and COVID-19 Severity Using Self-supervised Edge Features and Graph Neural Networks","date":"2020-06-23","arxiv_id":"2006.12971","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-edge-features-for-improved","slug":"self-supervised-edge-features-for-improved","title":"Self-supervised edge features for improved Graph Neural Network training","date":"2020-06-23","arxiv_id":"2007.04777","repositories_listed":1,"syntology":null},{"url":"/paper/a-self-attention-network-based-node-embedding","slug":"a-self-attention-network-based-node-embedding","title":"A Self-Attention Network based Node Embedding Model","date":"2020-06-22","arxiv_id":"2006.12100","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-in-tensorflow-and-keras","slug":"graph-neural-networks-in-tensorflow-and-keras","title":"Graph Neural Networks in TensorFlow and Keras with Spektral","date":"2020-06-22","arxiv_id":"2006.12138","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":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) · 2 unverified","sample_list":"/paper/graph-neural-networks-in-tensorflow-and-keras#ran","syntology_url":"https://syntology.ai/paper/2006.12138","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12138"}},"official":{"repos":["danielegrattarola/spektral"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/joint-adaptive-feature-smoothing-and-topology","slug":"joint-adaptive-feature-smoothing-and-topology","title":"Adaptive Universal Generalized PageRank Graph Neural Network","date":"2020-06-14","arxiv_id":"2006.07988","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/joint-adaptive-feature-smoothing-and-topology#ran","syntology_url":"https://syntology.ai/paper/2006.07988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07988"}},"official":{"repos":["jianhao2016/GPRGNN"],"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/when-differential-privacy-meets-graph-neural","slug":"when-differential-privacy-meets-graph-neural","title":"Locally Private Graph Neural Networks","date":"2020-06-09","arxiv_id":"2006.05535","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":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) · 2 unverified","sample_list":"/paper/when-differential-privacy-meets-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2006.05535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05535"}},"official":{"repos":["sisaman/lpgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-representation-learning-network-via","slug":"graph-representation-learning-network-via","title":"Graph Representation Learning Network via Adaptive Sampling","date":"2020-06-08","arxiv_id":"2006.04637","repositories_listed":1,"syntology":null},{"url":"/paper/little-ball-of-fur-a-python-library-for-graph","slug":"little-ball-of-fur-a-python-library-for-graph","title":"Little Ball of Fur: A Python Library for Graph Sampling","date":"2020-06-08","arxiv_id":"2006.04311","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-graph-neural-networks-from","slug":"understanding-graph-neural-networks-from","title":"Understanding Graph Neural Networks from Graph Signal Denoising Perspectives","date":"2020-06-08","arxiv_id":"2006.04386","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-graph-neural-networks-with-adaptive","slug":"bayesian-graph-neural-networks-with-adaptive","title":"Bayesian Graph Neural Networks with Adaptive Connection Sampling","date":"2020-06-07","arxiv_id":"2006.04064","repositories_listed":1,"syntology":null},{"url":"/paper/network-together-node-classification-via","slug":"network-together-node-classification-via","title":"Network Together: Node Classification via Cross-Network Deep Network Embedding","date":"2020-06-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/non-local-graph-neural-networks","slug":"non-local-graph-neural-networks","title":"Non-Local Graph Neural Networks","date":"2020-05-29","arxiv_id":"2005.14612","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/non-local-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2005.14612","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14612"}},"official":{"repos":["divelab/Non-Local-GNN"],"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/learning-representations-using-spectral","slug":"learning-representations-using-spectral","title":"Learning Representations using Spectral-Biased Random Walks on Graphs","date":"2020-05-19","arxiv_id":"2005.09752","repositories_listed":1,"syntology":null},{"url":"/paper/hypergraph-learning-with-line-expansion","slug":"hypergraph-learning-with-line-expansion","title":"Semi-supervised Hypergraph Node Classification on Hypergraph Line Expansion","date":"2020-05-11","arxiv_id":"2005.04843","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/hypergraph-learning-with-line-expansion#ran","syntology_url":"https://syntology.ai/paper/2005.04843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.04843"}},"official":{"repos":["ycq091044/legcn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-unified-non-negative-matrix-factorization","slug":"a-unified-non-negative-matrix-factorization","title":"A Unified Non-Negative Matrix Factorization Framework for Semi-Supervised Learning on Graphs","date":"2020-04-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/modeling-dynamic-heterogeneous-network-for","slug":"modeling-dynamic-heterogeneous-network-for","title":"Modeling Dynamic Heterogeneous Network for Link Prediction using Hierarchical Attention with Temporal RNN","date":"2020-04-01","arxiv_id":"2004.01024","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":8,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 1 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/modeling-dynamic-heterogeneous-network-for#ran","syntology_url":"https://syntology.ai/paper/2004.01024","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01024"}},"official":{"repos":["skx300/DyHATR"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/temporal-network-representation-learning-via","slug":"temporal-network-representation-learning-via","title":"Temporal Network Representation Learning via Historical Neighborhoods Aggregation","date":"2020-03-30","arxiv_id":"2003.13212","repositories_listed":1,"syntology":null},{"url":"/paper/progressive-graph-convolutional-networks-for","slug":"progressive-graph-convolutional-networks-for","title":"Progressive Graph Convolutional Networks for Semi-Supervised Node Classification","date":"2020-03-27","arxiv_id":"2003.12277","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-entity-classification-on","slug":"end-to-end-entity-classification-on","title":"End-to-End Entity Classification on Multimodal Knowledge Graphs","date":"2020-03-25","arxiv_id":"2003.12383","repositories_listed":1,"syntology":null},{"url":"/paper/scattering-gcn-overcoming-oversmoothness-in","slug":"scattering-gcn-overcoming-oversmoothness-in","title":"Scattering GCN: Overcoming Oversmoothness in Graph Convolutional Networks","date":"2020-03-18","arxiv_id":"2003.08414","repositories_listed":1,"syntology":null},{"url":"/paper/factorized-graph-representations-for-semi","slug":"factorized-graph-representations-for-semi","title":"Factorized Graph Representations for Semi-Supervised Learning from Sparse Data","date":"2020-03-05","arxiv_id":"2003.02829","repositories_listed":1,"syntology":null},{"url":"/paper/pushnet-efficient-and-adaptive-neural-message","slug":"pushnet-efficient-and-adaptive-neural-message","title":"PushNet: Efficient and Adaptive Neural Message Passing","date":"2020-03-04","arxiv_id":"2003.02228","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/pushnet-efficient-and-adaptive-neural-message#ran","syntology_url":"https://syntology.ai/paper/2003.02228","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.02228"}},"official":{"repos":["buschju/pushnet"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/self-enhanced-gnn-improving-graph-neural","slug":"self-enhanced-gnn-improving-graph-neural","title":"Self-Enhanced GNN: Improving Graph Neural Networks Using Model Outputs","date":"2020-02-18","arxiv_id":"2002.07518","repositories_listed":1,"syntology":{"n":5,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 5 unverified","sample_list":"/paper/self-enhanced-gnn-improving-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2002.07518","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07518"}},"official":{"repos":["yang-han/Self-Enhanced_GNN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":[]}}},{"url":"/paper/disease-state-prediction-from-single-cell","slug":"disease-state-prediction-from-single-cell","title":"Disease State Prediction From Single-Cell Data Using Graph Attention Networks","date":"2020-02-14","arxiv_id":"2002.07128","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"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, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/disease-state-prediction-from-single-cell#ran","syntology_url":"https://syntology.ai/paper/2002.07128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07128"}},"official":{"repos":["vandijklab/scGAT"],"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/vertex-reinforced-random-walk-for-network","slug":"vertex-reinforced-random-walk-for-network","title":"Vertex-reinforced Random Walk for Network Embedding","date":"2020-02-11","arxiv_id":"2002.04497","repositories_listed":1,"syntology":null},{"url":"/paper/bilinear-graph-neural-network-with-node","slug":"bilinear-graph-neural-network-with-node","title":"Bilinear Graph Neural Network with Neighbor Interactions","date":"2020-02-10","arxiv_id":"2002.03575","repositories_listed":1,"syntology":null},{"url":"/paper/graph-representation-learning-via-graphical","slug":"graph-representation-learning-via-graphical","title":"Graph Representation Learning via Graphical Mutual Information Maximization","date":"2020-02-04","arxiv_id":"2002.01169","repositories_listed":1,"syntology":null},{"url":"/paper/louvainne-hierarchical-louvain-method-for-1","slug":"louvainne-hierarchical-louvain-method-for-1","title":"LouvainNE: Hierarchical Louvain Method for High Quality and Scalable Network Embedding","date":"2020-02-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/which-way-direction-aware-attributed-graph","slug":"which-way-direction-aware-attributed-graph","title":"Which way? Direction-Aware Attributed Graph Embedding","date":"2020-01-30","arxiv_id":"2001.11297","repositories_listed":1,"syntology":null},{"url":"/paper/louvainne-hierarchical-louvain-method-for","slug":"louvainne-hierarchical-louvain-method-for","title":"LouvainNE: Hierarchical Louvain Method for High Quality and Scalable Network Embedding.","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/robust-graph-representation-learning-via","slug":"robust-graph-representation-learning-via","title":"Robust Graph Representation Learning via Neural Sparsification","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/neural-subgraph-isomorphism-counting-1","slug":"neural-subgraph-isomorphism-counting-1","title":"Neural Subgraph Isomorphism Counting","date":"2019-12-25","arxiv_id":"1912.11589","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":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) · 0 unverified","sample_list":"/paper/neural-subgraph-isomorphism-counting-1#ran","syntology_url":"https://syntology.ai/paper/1912.11589","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.11589"}},"official":{"repos":["HKUST-KnowComp/NeuralSubgraphCounting"],"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/a-non-negative-symmetric-encoder-decoder","slug":"a-non-negative-symmetric-encoder-decoder","title":"A Non-negative Symmetric Encoder-Decoder Approach for Community Detection","date":"2019-12-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/an-attention-based-graph-neural-network-for","slug":"an-attention-based-graph-neural-network-for","title":"An Attention-based Graph Neural Network for Heterogeneous Structural Learning","date":"2019-12-19","arxiv_id":"1912.10832","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/an-attention-based-graph-neural-network-for#ran","syntology_url":"https://syntology.ai/paper/1912.10832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.10832"}},"official":{"repos":["didi/hetsann"],"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/bridging-the-gap-between-community-and-node","slug":"bridging-the-gap-between-community-and-node","title":"Bridging the Gap between Community and Node Representations: Graph Embedding via Community Detection","date":"2019-12-17","arxiv_id":"1912.08808","repositories_listed":1,"syntology":null},{"url":"/paper/continuous-graph-neural-networks","slug":"continuous-graph-neural-networks","title":"Continuous Graph Neural Networks","date":"2019-12-02","arxiv_id":"1912.00967","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/continuous-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1912.00967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.00967"}},"official":null}},{"url":"/paper/gaussian-embedding-of-large-scale-attributed","slug":"gaussian-embedding-of-large-scale-attributed","title":"Gaussian Embedding of Large-scale Attributed Graphs","date":"2019-12-02","arxiv_id":"1912.00536","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-graph-attention-networks","slug":"sparse-graph-attention-networks","title":"Sparse Graph Attention Networks","date":"2019-12-02","arxiv_id":"1912.00552","repositories_listed":1,"syntology":null},{"url":"/paper/graph-agreement-models-for-semi-supervised","slug":"graph-agreement-models-for-semi-supervised","title":"Graph Agreement Models for Semi-Supervised Learning","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sgas-sequential-greedy-architecture-search","slug":"sgas-sequential-greedy-architecture-search","title":"SGAS: Sequential Greedy Architecture Search","date":"2019-11-30","arxiv_id":"1912.00195","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"3 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; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/sgas-sequential-greedy-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1912.00195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.00195"}},"official":null}},{"url":"/paper/heterogeneous-deep-graph-infomax","slug":"heterogeneous-deep-graph-infomax","title":"Heterogeneous Deep Graph Infomax","date":"2019-11-19","arxiv_id":"1911.08538","repositories_listed":1,"syntology":null},{"url":"/paper/asap-adaptive-structure-aware-pooling-for","slug":"asap-adaptive-structure-aware-pooling-for","title":"ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph Representations","date":"2019-11-18","arxiv_id":"1911.07979","repositories_listed":1,"syntology":null},{"url":"/paper/layer-dependent-importance-sampling-for-1","slug":"layer-dependent-importance-sampling-for-1","title":"Layer-Dependent Importance Sampling for Training Deep and Large Graph Convolutional Networks","date":"2019-11-17","arxiv_id":"1911.07323","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/layer-dependent-importance-sampling-for-1#ran","syntology_url":"https://syntology.ai/paper/1911.07323","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.07323"}},"official":{"repos":["acbull/LADIES"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/a-capsule-network-based-model-for-learning","slug":"a-capsule-network-based-model-for-learning","title":"A Capsule Network-based Model for Learning Node Embeddings","date":"2019-11-12","arxiv_id":"1911.04822","repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolutional-networks-meet-with-high","slug":"graph-convolutional-networks-meet-with-high","title":"Graph Convolutional Networks Meet with High Dimensionality Reduction","date":"2019-11-07","arxiv_id":"1911.02928","repositories_listed":1,"syntology":null}],"record_sha256":"9331e513cae5a3aaf1bdbaa3093f0d5723d49b310716440e64f425263cae876b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}