{"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":"/method/deepwalk","slug":"deepwalk","name":"DeepWalk","full_name":"DeepWalk","full_name_withheld":false,"description_markdown":"**DeepWalk** learns embeddings (social representations) of a graph's vertices, by modeling a stream of short random walks. Social representations are latent features of the vertices that capture neighborhood similarity and community membership. These latent representations encode social relations in a continuous vector space with a relatively small number of dimensions. It generalizes neural language models to process a special language composed of a set of randomly-generated walks. \r\n\r\nThe goal is to learn a latent representation, not only a probability distribution of node co-occurrences, and so as to introduce a mapping function $\\Phi \\colon v \\in V \\mapsto \\mathbb{R}^{|V|\\times d}$.\r\nThis mapping $\\Phi$ represents the latent social representation associated with each vertex $v$ in the graph. In practice, $\\Phi$ is represented by a $|V| \\times d$ matrix of free parameters.","description_state":"present","introduced_year":null,"introduced_by":{"title":"DeepWalk: Online Learning of Social Representations","paper":"/paper/deepwalk-online-learning-of-social","first_author":"Bryan Perozzi","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/deepwalk-online-learning-of-social"},"source":{"url":"http://arxiv.org/abs/1403.6652v2","title":"DeepWalk: Online Learning of Social Representations","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Embeddings","url":"/methods/category/graph-embeddings","pwc_aliases":[]}],"n_papers_tagged":67,"archive_num_papers":67,"papers_newest_first":[{"paper":null,"slug":"node-embeddings-via-neighbor-embeddings","title":"Node Embeddings via Neighbor Embeddings","date":"2025-03-31","arxiv_id":"2503.23822","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-quantum-annealing-approach-to-graph-node","title":"A quantum annealing approach to graph node embedding","date":"2025-03-08","arxiv_id":"2503.06332","n_code_links":0,"syntology":null},{"paper":null,"slug":"heterogeneous-graph-pre-training-based-model","title":"Heterogeneous Graph Pre-training Based Model for Secure and Efficient Prediction of Default Risk Propagation among Bond Issuers","date":"2025-01-04","arxiv_id":"2501.03268","n_code_links":0,"syntology":null},{"paper":"/paper/two-layer-walk-a-community-aware-graph","slug":"two-layer-walk-a-community-aware-graph","title":"Two Layer Walk: A Community-Aware Graph Embedding","date":"2024-12-17","arxiv_id":"2412.12933","n_code_links":1,"syntology":null},{"paper":null,"slug":"convergence-guarantees-for-the-deepwalk","title":"Convergence Guarantees for the DeepWalk Embedding on Block Models","date":"2024-10-26","arxiv_id":"2410.20248","n_code_links":0,"syntology":null},{"paper":"/paper/network-analytics-for-anti-money-laundering-a","slug":"network-analytics-for-anti-money-laundering-a","title":"Network Analytics for Anti-Money Laundering -- A Systematic Literature Review and Experimental Evaluation","date":"2024-05-29","arxiv_id":"2405.19383","n_code_links":1,"syntology":null},{"paper":"/paper/robustness-of-graph-embedding-methods-for","slug":"robustness-of-graph-embedding-methods-for","title":"Robustness of graph embedding methods for community detection","date":"2024-05-01","arxiv_id":"2405.00636","n_code_links":1,"syntology":null},{"paper":null,"slug":"hierarchical-information-enhancement-network","title":"Hierarchical Information Enhancement Network for Cascade Prediction in Social Networks","date":"2024-03-22","arxiv_id":"2403.15257","n_code_links":0,"syntology":null},{"paper":null,"slug":"one-shot-graph-representation-learning-using","title":"Hyperdimensional Representation Learning for Node Classification and Link Prediction","date":"2024-02-26","arxiv_id":"2402.17073","n_code_links":0,"syntology":null},{"paper":null,"slug":"frustrated-random-walks-a-fast-method-to","title":"Frustrated Random Walks: A Fast Method to Compute Node Distances on Hypergraphs","date":"2024-01-23","arxiv_id":"2401.13054","n_code_links":0,"syntology":null},{"paper":null,"slug":"reproducibility-study-of-the-fairness","title":"Reproducibility study of the Fairness-enhanced Node Representation Learning","date":"2023-09-21","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"drug-interaction-vectors-neural-network","title":"Drug Interaction Vectors Neural Network: DrIVeNN","date":"2023-08-26","arxiv_id":"2308.13891","n_code_links":0,"syntology":null},{"paper":null,"slug":"generating-post-hoc-explanations-for-skip","title":"Generating Post-hoc Explanations for Skip-gram-based Node Embeddings by Identifying Important Nodes with Bridgeness","date":"2023-04-24","arxiv_id":"2304.12036","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-heuristics-for-the-maximum-clique","title":"Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations","date":"2022-10-30","arxiv_id":"2210.16963","n_code_links":0,"syntology":null},{"paper":"/paper/easyrec-an-easy-to-use-extendable-and","slug":"easyrec-an-easy-to-use-extendable-and","title":"EasyRec: An easy-to-use, extendable and efficient framework for building industrial recommendation systems","date":"2022-09-26","arxiv_id":"2209.12766","n_code_links":2,"syntology":null},{"paper":null,"slug":"large-scale-privacy-preserving-network","title":"Large-Scale Privacy-Preserving Network Embedding against Private Link Inference Attacks","date":"2022-05-28","arxiv_id":"2205.14440","n_code_links":0,"syntology":null},{"paper":"/paper/a-practical-two-stage-ranking-framework-for","slug":"a-practical-two-stage-ranking-framework-for","title":"A Practical Two-stage Ranking Framework for Cross-market Recommendation","date":"2022-04-27","arxiv_id":"2204.12682","n_code_links":1,"syntology":null},{"paper":null,"slug":"biasedwalk-learning-global-aware-node","title":"GlobalWalk: Learning Global-aware Node Embeddings via Biased Sampling","date":"2022-01-22","arxiv_id":"2201.09882","n_code_links":0,"syntology":null},{"paper":"/paper/classic-graph-structural-features-outperform","slug":"classic-graph-structural-features-outperform","title":"Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling","date":"2022-01-20","arxiv_id":"2201.08481","n_code_links":1,"syntology":null},{"paper":"/paper/contrastive-laplacian-eigenmaps-1","slug":"contrastive-laplacian-eigenmaps-1","title":"Contrastive Laplacian Eigenmaps","date":"2022-01-14","arxiv_id":"2201.05493","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 2 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; every one of the 2 samples that ran constructed an object rather than computing a result","official":{"repos":["allenhaozhu/coles"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/asymptotics-of-ell-2-regularized-network","slug":"asymptotics-of-ell-2-regularized-network","title":"Asymptotics of $\\ell_2$ Regularized Network Embeddings","date":"2022-01-05","arxiv_id":"2201.01689","n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-large-scale-network-embedding-from","title":"Learning Large-scale Network Embedding from Representative Subgraph","date":"2021-12-02","arxiv_id":"2112.01442","n_code_links":0,"syntology":null},{"paper":null,"slug":"generalizable-cross-graph-embedding-for-gnn","title":"Generalizable Cross-Graph Embedding for GNN-based Congestion Prediction","date":"2021-11-10","arxiv_id":"2111.05941","n_code_links":0,"syntology":null},{"paper":null,"slug":"community-detection-using-low-dimensional","title":"Community detection using low-dimensional network embedding algorithms","date":"2021-11-04","arxiv_id":"2111.05267","n_code_links":0,"syntology":null},{"paper":"/paper/grape-fast-and-scalable-graph-processing-and","slug":"grape-fast-and-scalable-graph-processing-and","title":"GRAPE for Fast and Scalable Graph Processing and random walk-based Embedding","date":"2021-10-12","arxiv_id":"2110.06196","n_code_links":2,"syntology":null},{"paper":null,"slug":"refine-random-range-finder-for-network","title":"REFINE: Random RangE FInder for Network Embedding","date":"2021-08-24","arxiv_id":"2108.10703","n_code_links":0,"syntology":null},{"paper":null,"slug":"note-solution-for-kdd-cup-2021-wikikg90m-lsc","title":"NOTE: Solution for KDD-CUP 2021 WikiKG90M-LSC","date":"2021-07-05","arxiv_id":"2107.01892","n_code_links":0,"syntology":null},{"paper":"/paper/evaluating-modules-in-graph-contrastive","slug":"evaluating-modules-in-graph-contrastive","title":"Evaluating Modules in Graph Contrastive Learning","date":"2021-06-15","arxiv_id":"2106.08171","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"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","official":{"repos":["thunlp/opengcl"],"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"]}}},{"paper":"/paper/crosswalk-fairness-enhanced-node","slug":"crosswalk-fairness-enhanced-node","title":"CrossWalk: Fairness-enhanced Node Representation Learning","date":"2021-05-06","arxiv_id":"2105.02725","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"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","official":{"repos":["ahmadkhajehnejad/CrossWalk"],"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"]}}},{"paper":"/paper/evaluating-document-representations-for","slug":"evaluating-document-representations-for","title":"Evaluating Document Representations for Content-based Legal Literature Recommendations","date":"2021-04-28","arxiv_id":"2104.13841","n_code_links":1,"syntology":null},{"paper":null,"slug":"persistent-homology-and-graphs-representation-1","title":"Persistent Homology and Graphs Representation Learning","date":"2021-03-08","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"persistent-homology-and-graphs-representation","title":"Persistent Homology and Graphs Representation Learning","date":"2021-02-25","arxiv_id":"2102.12926","n_code_links":0,"syntology":null},{"paper":"/paper/deepwalking-backwards-from-embeddings-back-to","slug":"deepwalking-backwards-from-embeddings-back-to","title":"DeepWalking Backwards: From Embeddings Back to Graphs","date":"2021-02-17","arxiv_id":"2102.08532","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":3,"n_instrument":1,"unverified":0,"pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["konsotirop/Invert_Embeddings"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"consistency-of-random-walk-based-network","title":"Exact Recovery of Community Structures Using DeepWalk and Node2vec","date":"2021-01-18","arxiv_id":"2101.07354","n_code_links":0,"syntology":null},{"paper":null,"slug":"unifying-homophily-and-heterophily-network","title":"Unifying Homophily and Heterophily Network Transformation via Motifs","date":"2020-12-21","arxiv_id":"2012.11400","n_code_links":0,"syntology":null},{"paper":null,"slug":"instantembedding-efficient-local-node-1","title":"InstantEmbedding: Efficient Local Node Representations","date":"2020-10-14","arxiv_id":"2010.06992","n_code_links":0,"syntology":null},{"paper":null,"slug":"div2vec-diversity-emphasized-node-embedding","title":"div2vec: Diversity-Emphasized Node Embedding","date":"2020-09-21","arxiv_id":"2009.09588","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":null},{"paper":null,"slug":"nextdoor-gpu-based-graph-sampling-for","title":"Accelerating Graph Sampling for Graph Machine Learning using GPUs","date":"2020-09-14","arxiv_id":"2009.06693","n_code_links":0,"syntology":null},{"paper":null,"slug":"concentration-bounds-for-co-occurrence","title":"A Matrix Chernoff Bound for Markov Chains and Its Application to Co-occurrence Matrices","date":"2020-08-06","arxiv_id":"2008.02464","n_code_links":0,"syntology":null},{"paper":"/paper/infinitewalk-deep-network-embeddings-as","slug":"infinitewalk-deep-network-embeddings-as","title":"InfiniteWalk: Deep Network Embeddings as Laplacian Embeddings with a Nonlinearity","date":"2020-05-29","arxiv_id":"2006.00094","n_code_links":1,"syntology":null},{"paper":"/paper/embedding-vector-differences-can-be-aligned","slug":"embedding-vector-differences-can-be-aligned","title":"Embedding Vector Differences Can Be Aligned With Uncertain Intensional Logic Differences","date":"2020-05-26","arxiv_id":"2005.12535","n_code_links":1,"syntology":null},{"paper":"/paper/machine-learning-on-graphs-a-model-and","slug":"machine-learning-on-graphs-a-model-and","title":"Machine Learning on Graphs: A Model and Comprehensive Taxonomy","date":"2020-05-07","arxiv_id":"2005.03675","n_code_links":1,"syntology":{"ran":2,"of":8,"n_ran_checked":2,"n_instrument":0,"unverified":6,"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) · 6 unverified","official":{"repos":["google/gcnn-survey-paper"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"characterizing-and-detecting-money-laundering","title":"Characterizing and Detecting Money Laundering Activities on the Bitcoin Network","date":"2019-12-27","arxiv_id":"1912.12060","n_code_links":0,"syntology":null},{"paper":null,"slug":"manela-a-multi-agent-algorithm-for-learning","title":"MANELA: A Multi-Agent Algorithm for Learning Network Embeddings","date":"2019-12-01","arxiv_id":"1912.00303","n_code_links":0,"syntology":null},{"paper":null,"slug":"network-embedding-an-overview","title":"Network Embedding: An Overview","date":"2019-11-26","arxiv_id":"1911.11726","n_code_links":0,"syntology":null},{"paper":"/paper/191013314","slug":"191013314","title":"Symbolic Graph Embedding using Frequent Pattern Mining","date":"2019-10-29","arxiv_id":"1910.13314","n_code_links":1,"syntology":null},{"paper":null,"slug":"tutorial-on-nlp-inspired-network-embedding","title":"Tutorial on NLP-Inspired Network Embedding","date":"2019-10-16","arxiv_id":"1910.07212","n_code_links":0,"syntology":null},{"paper":null,"slug":"distributed-word2vec-using-graph-analytics","title":"Distributed Training of Embeddings using Graph Analytics","date":"2019-09-08","arxiv_id":"1909.03359","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":null},{"paper":"/paper/fast-and-accurate-network-embeddings-via-very","slug":"fast-and-accurate-network-embeddings-via-very","title":"Fast and Accurate Network Embeddings via Very Sparse Random Projection","date":"2019-08-30","arxiv_id":"1908.11512","n_code_links":2,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["GTmac/FastRP"],"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"]}}},{"paper":"/paper/network-embedding-on-compression-and-learning","slug":"network-embedding-on-compression-and-learning","title":"Network Embedding: on Compression and Learning","date":"2019-07-05","arxiv_id":"1907.02811","n_code_links":1,"syntology":null},{"paper":"/paper/netsmf-large-scale-network-embedding-as","slug":"netsmf-large-scale-network-embedding-as","title":"NetSMF: Large-Scale Network Embedding as Sparse Matrix Factorization","date":"2019-06-26","arxiv_id":"1906.11156","n_code_links":1,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":null},{"paper":null,"slug":"data-poisoning-attack-against-unsupervised","title":"Data Poisoning Attack against Unsupervised Node Embedding Methods","date":"2018-10-30","arxiv_id":"1810.12881","n_code_links":0,"syntology":null},{"paper":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","n_code_links":0,"syntology":null},{"paper":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","n_code_links":0,"syntology":null},{"paper":null,"slug":"tge-ps-text-driven-graph-embedding-with-pairs","title":"Sampled in Pairs and Driven by Text: A New Graph Embedding Framework","date":"2018-09-12","arxiv_id":"1809.04234","n_code_links":0,"syntology":null},{"paper":"/paper/learning-role-based-graph-embeddings","slug":"learning-role-based-graph-embeddings","title":"Learning Role-based Graph Embeddings","date":"2018-02-07","arxiv_id":"1802.02896","n_code_links":2,"syntology":null},{"paper":null,"slug":"inductive-representation-learning-in-large","title":"Inductive Representation Learning in Large Attributed Graphs","date":"2017-10-25","arxiv_id":"1710.09471","n_code_links":0,"syntology":null},{"paper":"/paper/network-embedding-as-matrix-factorization","slug":"network-embedding-as-matrix-factorization","title":"Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec","date":"2017-10-09","arxiv_id":"1710.02971","n_code_links":4,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":0,"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","official":{"repos":["xptree/NetMF"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"a-framework-for-generalizing-graph-based","title":"A Framework for Generalizing Graph-based Representation Learning Methods","date":"2017-09-14","arxiv_id":"1709.04596","n_code_links":0,"syntology":null},{"paper":null,"slug":"170404576","title":"NEXT: A Neural Network Framework for Next POI Recommendation","date":"2017-04-15","arxiv_id":"1704.04576","n_code_links":0,"syntology":null},{"paper":"/paper/grarep-learning-graph-representations-with","slug":"grarep-learning-graph-representations-with","title":"GraRep: Learning Graph Representations with Global Structural Information","date":"2015-10-17","arxiv_id":null,"n_code_links":2,"syntology":null},{"paper":"/paper/network-representation-learning-with-rich","slug":"network-representation-learning-with-rich","title":"Network Representation Learning with Rich Text Information","date":"2015-06-24","arxiv_id":null,"n_code_links":3,"syntology":null},{"paper":null,"slug":"comprehend-deepwalk-as-matrix-factorization","title":"Comprehend DeepWalk as Matrix Factorization","date":"2015-01-02","arxiv_id":"1501.00358","n_code_links":0,"syntology":null},{"paper":"/paper/deepwalk-online-learning-of-social","slug":"deepwalk-online-learning-of-social","title":"DeepWalk: Online Learning of Social Representations","date":"2014-03-26","arxiv_id":"1403.6652","n_code_links":14,"syntology":{"ran":2,"of":3,"n_ran_checked":0,"n_instrument":2,"unverified":1,"pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":null}}],"papers_shown":67,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":67,"with_a_code_link":28,"where_syntology_ran_a_sample":8,"not_listed_spam_title":0,"listed":67,"listed_where_code_ran":8,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":6,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":6,"listed_every_run_a_failure_of_syntologys_instrument":2,"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"},"papers_where_code_ran":8,"papers_where_code_ran_first_page":"/method/deepwalk/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/deepwalk/papers/ran/1","json":"/method/deepwalk/papers/ran/1.json","rows":8}],"tasks":[{"task":"/task/representation-learning","name":"Representation Learning","papers":24},{"task":"/task/network-embedding","name":"Network Embedding","papers":19},{"task":"/task/node-classification","name":"Node Classification","papers":17},{"task":"/task/link-prediction","name":"Link Prediction","papers":16},{"task":"/task/graph-embedding","name":"Graph Embedding","papers":12},{"task":"/task/graph-representation-learning","name":"Graph Representation Learning","papers":8},{"task":"/task/community-detection","name":"Community Detection","papers":5},{"task":"/task/recommendation-systems","name":"Recommendation Systems","papers":5},{"task":"/task/machine-learning","name":"BIG-bench Machine Learning","papers":4},{"task":"/task/clustering","name":"Clustering","papers":4},{"task":"/task/classification","name":"General Classification","papers":4},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":4},{"task":"/task/attribute","name":"Attribute","papers":3},{"task":"/task/contrastive-learning","name":"Contrastive Learning","papers":3},{"task":"/task/anomaly-detection","name":"Anomaly Detection","papers":2},{"task":"/task/classification-1","name":"Classification","papers":2},{"task":"/task/dimensionality-reduction","name":"Dimensionality Reduction","papers":2},{"task":"/task/feature-engineering","name":"Feature Engineering","papers":2},{"task":"/task/graph-learning","name":"Graph Learning","papers":2},{"task":"/task/graph-sampling","name":"Graph Sampling","papers":2}],"tasks_shown":20,"n_tasks":57,"usage_by_year":[{"year":"2014","papers":1},{"year":"2015","papers":3},{"year":"2017","papers":4},{"year":"2018","papers":5},{"year":"2019","papers":11},{"year":"2020","papers":9},{"year":"2021","papers":13},{"year":"2022","papers":8},{"year":"2023","papers":3},{"year":"2024","papers":7},{"year":"2025","papers":3}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/deepwalk"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=DeepWalk","read_at":"2026-10-05T00:54:39+00:00","query":"DeepWalk","kind":"paper","have":"unverified_code","tier":"harvested","verified_implementation":false,"level":1,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"1403.6652"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"1403.6652","repositories":{"listed":14,"in_graph":14,"list_truncated":false,"strongest_link":"mentioned_in_github"},"retrieve_with":"get_harvested_code_for_paper(arxiv_id='1403.6652')","name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"1403.6652","citations":10928},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'DeepWalk'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"1403.6652","page":"/paper/deepwalk-online-learning-of-social","syntology_url":"https://syntology.ai/paper/1403.6652","in_graph_layer":true,"samples":3,"ran":2,"n_ran_checked":0,"n_instrument":2,"unverified":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"harvested code stored, below machine verification (unverified_code; harvested), served level V1. Repositories: 14 listed of 14 in the graph, strongest link: mentioned on GitHub. The lookup matched a paper by its title, arXiv:1403.6652, not a method entry. This answer is about arXiv:1403.6652, the paper the archive credits with this method.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results."}},"syntology_have_state":"loaded","record_sha256":"e7a1b4ea5f243a06c55291ef60f2f958e6bbc498cd59fd714f65292471e52377","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}