{"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/19","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":19,"pages_in_order":19,"rows_per_page":100,"rows":[1801,1860],"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/18","next":null,"papers":[{"url":null,"slug":"semi-supervised-graph-embedding-for-multi","title":"Semi-Supervised Graph Embedding for Multi-Label Graph Node Classification","date":"2019-07-12","arxiv_id":"1907.05743","repositories_listed":0,"syntology":null},{"url":null,"slug":"haar-transforms-for-graph-neural-networks","title":"Fast Haar Transforms for Graph Neural Networks","date":"2019-07-10","arxiv_id":"1907.04786","repositories_listed":0,"syntology":null},{"url":null,"slug":"label-aware-graph-convolutional-network-not","title":"Label-Aware Graph Convolutional Networks","date":"2019-07-10","arxiv_id":"1907.04707","repositories_listed":0,"syntology":null},{"url":"/paper/structure-fusion-based-on-graph-convolutional","slug":"structure-fusion-based-on-graph-convolutional","title":"Structure fusion based on graph convolutional networks for semi-supervised classification","date":"2019-07-02","arxiv_id":"1907.02586","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-auto-encoder-for-attributed-network","title":"ANAE: Learning Node Context Representation for Attributed Network Embedding","date":"2019-06-20","arxiv_id":"1906.08745","repositories_listed":0,"syntology":null},{"url":null,"slug":"homogeneous-network-embedding-for-massive","title":"Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank","date":"2019-06-17","arxiv_id":"1906.06826","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-illicit-accounts-in-large-scale-e","title":"Identifying Illicit Accounts in Large Scale E-payment Networks -- A Graph Representation Learning Approach","date":"2019-06-13","arxiv_id":"1906.05546","repositories_listed":0,"syntology":null},{"url":null,"slug":"heterogeneous-network-approach-to-predict","title":"Heterogeneous network approach to predict individuals' mental health","date":"2019-06-11","arxiv_id":"1906.04346","repositories_listed":0,"syntology":null},{"url":null,"slug":"attacking-graph-convolutional-networks-via","title":"Attacking Graph Convolutional Networks via Rewiring","date":"2019-06-10","arxiv_id":"1906.03750","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-sampling-for-graph-based-unsupervised","title":"Coresets for Estimating Means and Mean Square Error with Limited Greedy Samples","date":"2019-06-03","arxiv_id":"1906.01021","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-edge-features-for-graph-neural","title":"Exploiting Edge Features for Graph Neural Networks","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"triple2vec-learning-triple-embeddings-from","title":"Triple2Vec: Learning Triple Embeddings from Knowledge Graphs","date":"2019-05-28","arxiv_id":"1905.11691","repositories_listed":0,"syntology":null},{"url":null,"slug":"relation-structure-aware-heterogeneous","title":"Relation Structure-Aware Heterogeneous Information Network Embedding","date":"2019-05-15","arxiv_id":"1905.08027","repositories_listed":0,"syntology":null},{"url":null,"slug":"cgnf-conditional-graph-neural-fields","title":"CGNF: Conditional Graph Neural Fields","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"few-shot-classification-on-graphs-with","title":"Few-shot Classification on Graphs with Structural Regularized GCNs","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/graph-optimized-convolutional-networks","slug":"graph-optimized-convolutional-networks","title":"Robust Graph Data Learning via Latent Graph Convolutional Representation","date":"2019-04-26","arxiv_id":"1904.11883","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-graph-learning-for-semi-supervised","title":"Exploring Structure-Adaptive Graph Learning for Robust Semi-Supervised Classification","date":"2019-04-23","arxiv_id":"1904.10146","repositories_listed":0,"syntology":null},{"url":null,"slug":"compositional-network-embedding","title":"Compositional Network Embedding","date":"2019-04-17","arxiv_id":"1904.08157","repositories_listed":0,"syntology":null},{"url":null,"slug":"190407787","title":"Topological based classification of paper domains using graph convolutional networks","date":"2019-04-10","arxiv_id":"1904.07787","repositories_listed":0,"syntology":null},{"url":"/paper/quantum-based-subgraph-convolutional-neural","slug":"quantum-based-subgraph-convolutional-neural","title":"Quantum-based subgraph convolutional neural networks","date":"2019-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comprehensive-comparison-of-unsupervised","title":"A Comparative Study for Unsupervised Network Representation Learning","date":"2019-03-19","arxiv_id":"1903.07902","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpreting-and-understanding-graph","title":"Interpreting and Understanding Graph Convolutional Neural Network using Gradient-based Attribution Method","date":"2019-03-09","arxiv_id":"1903.03768","repositories_listed":0,"syntology":null},{"url":null,"slug":"virtual-adversarial-training-on-graph","title":"Virtual Adversarial Training on Graph Convolutional Networks in Node Classification","date":"2019-02-28","arxiv_id":"1902.11045","repositories_listed":0,"syntology":null},{"url":null,"slug":"batch-virtual-adversarial-training-for-graph","title":"Batch Virtual Adversarial Training for Graph Convolutional Networks","date":"2019-02-25","arxiv_id":"1902.09192","repositories_listed":0,"syntology":null},{"url":null,"slug":"network-lens-node-classification-in","title":"Network Lens: Node Classification in Topologically Heterogeneous Networks","date":"2019-01-15","arxiv_id":"1901.09681","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-representation-learning-for-directed","title":"Node Representation Learning for Directed Graphs","date":"2018-10-22","arxiv_id":"1810.09176","repositories_listed":0,"syntology":null},{"url":null,"slug":"tne-a-latent-model-for-representation","title":"TNE: A Latent Model for Representation Learning on Networks","date":"2018-10-16","arxiv_id":"1810.06917","repositories_listed":0,"syntology":null},{"url":null,"slug":"attention-models-with-random-features-for","title":"Attention Models with Random Features for Multi-layered Graph Embeddings","date":"2018-10-02","arxiv_id":"1810.01405","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-u-net","title":"Graph U-Net","date":"2018-09-27","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-network-representation-for","title":"Universal Network Representation for Heterogeneous Information Networks","date":"2018-09-26","arxiv_id":"1811.12157","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-deep-embeddings-for-inferencing-with","title":"Improved Deep Embeddings for Inferencing with Multi-Layered Networks","date":"2018-09-20","arxiv_id":"1811.12156","repositories_listed":0,"syntology":null},{"url":null,"slug":"higher-order-graph-convolutional-networks","title":"Higher-order Graph Convolutional Networks","date":"2018-09-12","arxiv_id":"1809.07697","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-feature-learning-of-multi-network","title":"Deep Feature Learning of Multi-Network Topology for Node Classification","date":"2018-09-07","arxiv_id":"1809.02394","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-edge-features-in-graph-neural","title":"Exploiting Edge Features in Graph Neural Networks","date":"2018-09-07","arxiv_id":"1809.02709","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-embeddings-of-directed-networks-with","title":"Learning Embeddings of Directed Networks with Text-Associated Nodes---with Applications in Software Package Dependency Networks","date":"2018-09-07","arxiv_id":"1809.02270","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffusion-based-network-embedding","title":"Diffusion Based Network Embedding","date":"2018-05-09","arxiv_id":"1805.03504","repositories_listed":0,"syntology":null},{"url":null,"slug":"recs-robust-graph-embedding-using-connection","title":"RECS: Robust Graph Embedding Using Connection Subgraphs","date":"2018-05-03","arxiv_id":"1805.01509","repositories_listed":0,"syntology":null},{"url":null,"slug":"t-pine-tensor-based-predictable-and","title":"t-PINE: Tensor-based Predictable and Interpretable Node Embeddings","date":"2018-05-03","arxiv_id":"1805.01889","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-learning-on-graphs-based-on","title":"Semi-Supervised Learning on Graphs Based on Local Label Distributions","date":"2018-02-15","arxiv_id":"1802.05563","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-node-embeddings-learning-ego-centric","title":"Fast Node Embeddings: Learning Ego-Centric Representations","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graphgan-generating-graphs-via-random-walks","title":"GraphGAN: Generating Graphs via Random Walks","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"network-of-graph-convolutional-networks","title":"Network of Graph Convolutional Networks Trained on Random Walks","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-network-embedding","title":"Adversarial Network Embedding","date":"2017-11-21","arxiv_id":"1711.07838","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-diffusion-convolutional-neural","title":"Sparse Diffusion-Convolutional Neural Networks","date":"2017-10-26","arxiv_id":"1710.09813","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-embedding-with-rich-information-through","title":"Graph Embedding with Rich Information through Heterogeneous Network","date":"2017-10-18","arxiv_id":"1710.06879","repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-q-walk-for-learning-vector","title":"Supervised Q-walk for Learning Vector Representation of Nodes in Networks","date":"2017-10-03","arxiv_id":"1710.00978","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comprehensive-survey-of-graph-embedding","title":"A Comprehensive Survey of Graph Embedding: Problems, Techniques and Applications","date":"2017-09-22","arxiv_id":"1709.07604","repositories_listed":0,"syntology":null},{"url":null,"slug":"network-vector-distributed-representations-of","title":"Network Vector: Distributed Representations of Networks with Global Context","date":"2017-09-07","arxiv_id":"1709.02448","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-convolution-a-high-order-and-adaptive","title":"Graph Convolution: A High-Order and Adaptive Approach","date":"2017-06-29","arxiv_id":"1706.09916","repositories_listed":0,"syntology":null},{"url":null,"slug":"attributed-network-embedding-for-learning-in","title":"Attributed Network Embedding for Learning in a Dynamic Environment","date":"2017-06-06","arxiv_id":"1706.01860","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-deep-matrix-representations","title":"Learning Deep Matrix Representations","date":"2017-03-04","arxiv_id":"1703.01454","repositories_listed":0,"syntology":null},{"url":"/paper/distributed-representation-of-subgraphs","slug":"distributed-representation-of-subgraphs","title":"Distributed Representation of Subgraphs","date":"2017-02-22","arxiv_id":"1702.06921","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-stacked-generalization-for-node","title":"Dynamic Stacked Generalization for Node Classification on Networks","date":"2016-10-16","arxiv_id":"1610.04804","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-general-framework-for-content-enhanced","title":"A General Framework for Content-enhanced Network Representation Learning","date":"2016-10-10","arxiv_id":"1610.02906","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-tutorial-on-online-supervised-learning-with","title":"A Tutorial on Online Supervised Learning with Applications to Node Classification in Social Networks","date":"2016-08-31","arxiv_id":"1608.09014","repositories_listed":0,"syntology":null},{"url":null,"slug":"empty-category-detection-using-path-features","title":"Empty Category Detection using Path Features and Distributed Case Frames","date":"2015-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-linearization-of-belief-propagation-on","title":"The Linearization of Belief Propagation on Pairwise Markov Networks","date":"2015-02-17","arxiv_id":"1502.04956","repositories_listed":0,"syntology":null},{"url":"/paper/10000-times-accelerated-robust-subset","slug":"10000-times-accelerated-robust-subset","title":"10,000+ Times Accelerated Robust Subset Selection (ARSS)","date":"2014-09-12","arxiv_id":"1409.3660","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-classification-in-uncertain-graphs","title":"Node Classification in Uncertain Graphs","date":"2014-05-22","arxiv_id":"1405.5829","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-discovery-of-network-roles-for","title":"Active Discovery of Network Roles for Predicting the Classes of Network Nodes","date":"2013-12-27","arxiv_id":"1312.7258","repositories_listed":0,"syntology":null}],"record_sha256":"90aea00c567d740d2c4620fc99a8d509a00e7cd28b6799b02b90c463c38f88ea","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}