{"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/network-embedding","name":"Network Embedding","slug":"network-embedding","description_markdown":"**Network Embedding**, also known as \"Network Representation Learning\", is a collective term for techniques for mapping graph nodes to vectors of real numbers in a multidimensional space. To be useful, a good embedding should preserve the structure of the graph. The vectors can then be used as input to various network and graph analysis tasks, such as link prediction\r\n\r\n\r\n<span class=\"description-source\">Source: [Tutorial on NLP-Inspired Network Embedding ](https://arxiv.org/abs/1910.07212)</span>","categories":[{"name":"Computer Vision","url":"/area/computer-vision"},{"name":"Methodology","url":"/area/methodology"},{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":403,"papers_with_code":165,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":5,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[{"url":"/dataset/arxiv-astro-ph","name":"arXiv Astro-Ph","full_name":"","num_papers_in_archive":10},{"url":"/dataset/netzschleuder","name":"Netzschleuder","full_name":"network catalogue, repository and centrifuge","num_papers_in_archive":5},{"url":"/dataset/is-a","name":"IS-A","full_name":null,"num_papers_in_archive":4},{"url":"/dataset/birdeep","name":"BIRDeep","full_name":"BIRDeep_AudioAnnotations","num_papers_in_archive":1},{"url":"/dataset/part-of","name":"PART-OF","full_name":null,"num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[{"url":"/task/representation-learning","name":"Representation Learning"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":5,"rows_per_page":100,"shown":100,"of":403,"of_with_code":165,"tagged_in_all":403,"counts":{"archive_papers_tagged":403,"with_a_code_link":165,"where_syntology_ran_a_sample":24,"not_listed_spam_title":0,"listed":403,"listed_where_code_ran":24,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":21,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":21,"listed_every_run_a_failure_of_syntologys_instrument":3,"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"},"items":[{"url":"/paper/line-large-scale-information-network","slug":"line-large-scale-information-network","title":"LINE: Large-scale Information Network Embedding","date":"2015-03-12","arxiv_id":"1503.03578","repositories_listed":9,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/line-large-scale-information-network#ran","syntology_url":"https://syntology.ai/paper/1503.03578","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1503.03578"}},"official":{"repos":["tangjianpku/LINE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/structural-deep-network-embedding","slug":"structural-deep-network-embedding","title":"Structural Deep Network Embedding","date":"2016-06-01","arxiv_id":null,"repositories_listed":6,"syntology":null},{"url":"/paper/multi-scale-attributed-node-embedding","slug":"multi-scale-attributed-node-embedding","title":"Multi-scale Attributed Node Embedding","date":"2019-09-28","arxiv_id":"1909.13021","repositories_listed":5,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-scale-attributed-node-embedding#ran","syntology_url":"https://syntology.ai/paper/1909.13021","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.13021"}},"official":{"repos":["benedekrozemberczki/MUSAE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/struc2vec-learning-node-representations-from","slug":"struc2vec-learning-node-representations-from","title":"struc2vec: Learning Node Representations from Structural Identity","date":"2017-04-11","arxiv_id":"1704.03165","repositories_listed":5,"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":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","sample_list":"/paper/struc2vec-learning-node-representations-from#ran","syntology_url":"https://syntology.ai/paper/1704.03165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.03165"}},"official":{"repos":["leoribeiro/struc2vec"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/fast-sequence-based-embedding-with-diffusion-1","slug":"fast-sequence-based-embedding-with-diffusion-1","title":"Fast Sequence-Based Embedding with Diffusion Graphs","date":"2020-01-21","arxiv_id":"2001.07463","repositories_listed":4,"syntology":null},{"url":"/paper/190501669","slug":"190501669","title":"Representation Learning for Attributed Multiplex Heterogeneous Network","date":"2019-05-05","arxiv_id":"1905.01669","repositories_listed":4,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/190501669#ran","syntology_url":"https://syntology.ai/paper/1905.01669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01669"}},"official":{"repos":["cenyk1230/GATNE"],"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/mvn2vec-preservation-and-collaboration-in","slug":"mvn2vec-preservation-and-collaboration-in","title":"mvn2vec: Preservation and Collaboration in Multi-View Network Embedding","date":"2018-01-19","arxiv_id":"1801.06597","repositories_listed":4,"syntology":null},{"url":"/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","repositories_listed":4,"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":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","sample_list":"/paper/network-embedding-as-matrix-factorization#ran","syntology_url":"https://syntology.ai/paper/1710.02971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.02971"}},"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"]}}},{"url":"/paper/robust-dynamic-network-embedding-via","slug":"robust-dynamic-network-embedding-via","title":"Robust Dynamic Network Embedding via Ensembles","date":"2021-05-30","arxiv_id":"2105.14557","repositories_listed":3,"syntology":null},{"url":"/paper/sub-graph-contrast-for-scalable-self","slug":"sub-graph-contrast-for-scalable-self","title":"Sub-graph Contrast for Scalable Self-Supervised Graph Representation Learning","date":"2020-09-22","arxiv_id":"2009.10273","repositories_listed":3,"syntology":null},{"url":"/paper/multi-view-collaborative-network-embedding","slug":"multi-view-collaborative-network-embedding","title":"Multi-View Collaborative Network Embedding","date":"2020-05-17","arxiv_id":"2005.08189","repositories_listed":3,"syntology":null},{"url":"/paper/outlier-aware-network-embedding-for","slug":"outlier-aware-network-embedding-for","title":"Outlier Aware Network Embedding for Attributed Networks","date":"2018-11-19","arxiv_id":"1811.07609","repositories_listed":3,"syntology":null},{"url":"/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,"repositories_listed":3,"syntology":null},{"url":"/paper/joint-admission-control-and-resource","slug":"joint-admission-control-and-resource","title":"Joint Admission Control and Resource Allocation of Virtual Network Embedding via Hierarchical Deep Reinforcement Learning","date":"2024-06-25","arxiv_id":"2406.17334","repositories_listed":2,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":7,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/joint-admission-control-and-resource#ran","syntology_url":"https://syntology.ai/paper/2406.17334","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17334"}},"official":{"repos":["geminilight/hrl-acra"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/flagvne-a-flexible-and-generalizable","slug":"flagvne-a-flexible-and-generalizable","title":"FlagVNE: A Flexible and Generalizable Reinforcement Learning Framework for Network Resource Allocation","date":"2024-04-19","arxiv_id":"2404.12633","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":6,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/flagvne-a-flexible-and-generalizable#ran","syntology_url":"https://syntology.ai/paper/2404.12633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.12633"}},"official":{"repos":["GeminiLight/flag-vne"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/online-knowledge-distillation-via-mutual","slug":"online-knowledge-distillation-via-mutual","title":"Online Knowledge Distillation via Mutual Contrastive Learning for Visual Recognition","date":"2022-07-23","arxiv_id":"2207.11518","repositories_listed":2,"syntology":null},{"url":"/paper/glodyne-global-topology-preserving-dynamic","slug":"glodyne-global-topology-preserving-dynamic","title":"GloDyNE: Global Topology Preserving Dynamic Network Embedding","date":"2020-08-05","arxiv_id":"2008.01935","repositories_listed":2,"syntology":null},{"url":"/paper/network-embedding-with-completely-imbalanced-1","slug":"network-embedding-with-completely-imbalanced-1","title":"Network Embedding with Completely-imbalanced Labels","date":"2020-07-07","arxiv_id":"2007.03545","repositories_listed":2,"syntology":null},{"url":"/paper/csne-conditional-signed-network-embedding","slug":"csne-conditional-signed-network-embedding","title":"CSNE: Conditional Signed Network Embedding","date":"2020-05-19","arxiv_id":"2005.10701","repositories_listed":2,"syntology":null},{"url":"/paper/fast-network-embedding-enhancement-via-high","slug":"fast-network-embedding-enhancement-via-high","title":"Fast Network Embedding Enhancement via High Order Proximity Approximation","date":"2020-05-13","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/network-representation-learning-for-link","slug":"network-representation-learning-for-link","title":"Benchmarking Network Embedding Models for Link Prediction: Are We Making Progress?","date":"2020-02-25","arxiv_id":"2002.11522","repositories_listed":2,"syntology":null},{"url":"/paper/adversarial-deep-network-embedding-for-cross","slug":"adversarial-deep-network-embedding-for-cross","title":"Adversarial Deep Network Embedding for Cross-network Node Classification","date":"2020-02-18","arxiv_id":"2002.07366","repositories_listed":2,"syntology":{"n":11,"n_ran":8,"n_constructed":7,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":11,"phrase":"8 ran (of which 7 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/adversarial-deep-network-embedding-for-cross#ran","syntology_url":"https://syntology.ai/paper/2002.07366","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07366"}},"official":{"repos":["shenxiaocam/ACDNE"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]}}},{"url":"/paper/unsupervised-attributed-multiplex-network","slug":"unsupervised-attributed-multiplex-network","title":"Unsupervised Attributed Multiplex Network Embedding","date":"2019-11-15","arxiv_id":"1911.06750","repositories_listed":2,"syntology":null},{"url":"/paper/higitclass-keyword-driven-hierarchical","slug":"higitclass-keyword-driven-hierarchical","title":"HiGitClass: Keyword-Driven Hierarchical Classification of GitHub Repositories","date":"2019-10-16","arxiv_id":"1910.07115","repositories_listed":2,"syntology":null},{"url":"/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","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fast-and-accurate-network-embeddings-via-very#ran","syntology_url":"https://syntology.ai/paper/1908.11512","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.11512"}},"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"]}}},{"url":"/paper/dynwalks-global-topology-and-recent-changes-1","slug":"dynwalks-global-topology-and-recent-changes-1","title":"DynWalks: Global Topology and Recent Changes Awareness Dynamic Network Embedding","date":"2019-07-27","arxiv_id":"1907.11968","repositories_listed":2,"syntology":null},{"url":"/paper/190600684","slug":"190600684","title":"DANE: Domain Adaptive Network Embedding","date":"2019-06-03","arxiv_id":"1906.00684","repositories_listed":2,"syntology":null},{"url":"/paper/hahe-hierarchical-attentive-heterogeneous","slug":"hahe-hierarchical-attentive-heterogeneous","title":"HAHE: Hierarchical Attentive Heterogeneous Information Network Embedding","date":"2019-01-31","arxiv_id":"1902.01475","repositories_listed":2,"syntology":null},{"url":"/paper/enhanced-network-embedding-with-text","slug":"enhanced-network-embedding-with-text","title":"Enhanced Network Embedding with Text Information","date":"2018-11-29","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/binarized-attributed-network-embedding","slug":"binarized-attributed-network-embedding","title":"Binarized Attributed Network Embedding","date":"2018-10-22","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/multi-level-network-embedding-with-boosted","slug":"multi-level-network-embedding-with-boosted","title":"Multi-Level Network Embedding with Boosted Low-Rank Matrix Approximation","date":"2018-08-26","arxiv_id":"1808.08627","repositories_listed":2,"syntology":null},{"url":"/paper/billion-scale-network-embedding-with","slug":"billion-scale-network-embedding-with","title":"Billion-scale Network Embedding with Iterative Random Projection","date":"2018-05-07","arxiv_id":"1805.02396","repositories_listed":2,"syntology":null},{"url":"/paper/fusing-structure-and-content-via-non-negative","slug":"fusing-structure-and-content-via-non-negative","title":"Fusing Structure and Content via Non-negative Matrix Factorization for Embedding Information Networks","date":"2018-04-15","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/fast-sequence-based-embedding-with-diffusion","slug":"fast-sequence-based-embedding-with-diffusion","title":"Fast Sequence Based Embedding with Diffusion Graphs","date":"2018-03-20","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/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","repositories_listed":2,"syntology":null},{"url":"/paper/enhancing-network-embedding-with-auxiliary","slug":"enhancing-network-embedding-with-auxiliary","title":"Enhancing Network Embedding with Auxiliary Information: An Explicit Matrix Factorization Perspective","date":"2017-11-11","arxiv_id":"1711.04094","repositories_listed":2,"syntology":null},{"url":"/paper/font-size-community-preserving-network","slug":"font-size-community-preserving-network","title":"Font Size: Community Preserving Network Embedding","date":"2017-02-10","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/name-disambiguation-in-anonymized-graphs","slug":"name-disambiguation-in-anonymized-graphs","title":"Name Disambiguation in Anonymized Graphs using Network Embedding","date":"2017-02-08","arxiv_id":"1702.02287","repositories_listed":2,"syntology":null},{"url":"/paper/garg-aml-against-smurfing-a-scalable-and","slug":"garg-aml-against-smurfing-a-scalable-and","title":"GARG-AML against Smurfing: A Scalable and Interpretable Graph-Based Framework for Anti-Money Laundering","date":"2025-06-04","arxiv_id":"2506.04292","repositories_listed":1,"syntology":null},{"url":"/paper/network-embedding-exploration-tool-neext","slug":"network-embedding-exploration-tool-neext","title":"Network Embedding Exploration Tool (NEExT)","date":"2025-03-20","arxiv_id":"2503.15853","repositories_listed":1,"syntology":null},{"url":"/paper/asd-classification-on-dynamic-brain","slug":"asd-classification-on-dynamic-brain","title":"ASD Classification on Dynamic Brain Connectome using Temporal Random Walk with Transformer-based Dynamic Network Embedding","date":"2025-03-16","arxiv_id":"2503.12366","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-network-embedding-with","slug":"adversarial-network-embedding-with","title":"Adversarial network embedding with bootstrapped representations for sparse networks","date":"2025-03-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-robust-integrating-method-by-high","slug":"a-novel-robust-integrating-method-by-high","title":"A novel robust integrating method by high-order proximity for self-supervised attribute network embedding","date":"2024-12-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/non-euclidean-mixture-model-for-social","slug":"non-euclidean-mixture-model-for-social","title":"Non-Euclidean Mixture Model for Social Network Embedding","date":"2024-11-07","arxiv_id":"2411.04876","repositories_listed":1,"syntology":null},{"url":"/paper/geometry-aware-generative-autoencoders-for","slug":"geometry-aware-generative-autoencoders-for","title":"Geometry-Aware Generative Autoencoders for Warped Riemannian Metric Learning and Generative Modeling on Data Manifolds","date":"2024-10-16","arxiv_id":"2410.12779","repositories_listed":1,"syntology":null},{"url":"/paper/simultaneous-weight-and-architecture","slug":"simultaneous-weight-and-architecture","title":"Simultaneous Weight and Architecture Optimization for Neural Networks","date":"2024-10-10","arxiv_id":"2410.08339","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":8,"phrase":"7 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/simultaneous-weight-and-architecture#ran","syntology_url":"https://syntology.ai/paper/2410.08339","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.08339"}},"official":{"repos":["zitonghuangcynthia/Simultaneous-Weight-and-Architecture-Optimization"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-network-embedding-by-approximate","slug":"efficient-network-embedding-by-approximate","title":"Efficient Network Embedding by Approximate Equitable Partitions","date":"2024-09-16","arxiv_id":"2409.10160","repositories_listed":1,"syntology":null},{"url":"/paper/bluetempnet-a-temporal-multi-network-dataset","slug":"bluetempnet-a-temporal-multi-network-dataset","title":"BlueTempNet: A Temporal Multi-network Dataset of Social Interactions in Bluesky Social","date":"2024-07-24","arxiv_id":"2407.17451","repositories_listed":1,"syntology":null},{"url":"/paper/are-graph-embeddings-the-panacea-an-empirical","slug":"are-graph-embeddings-the-panacea-an-empirical","title":"Are Graph Embeddings the Panacea? An Empirical Survey from the Data Fitness Perspective","date":"2024-04-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/l2g2g-a-scalable-local-to-global-network","slug":"l2g2g-a-scalable-local-to-global-network","title":"L2G2G: a Scalable Local-to-Global Network Embedding with Graph Autoencoders","date":"2024-02-02","arxiv_id":"2402.01614","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/l2g2g-a-scalable-local-to-global-network#ran","syntology_url":"https://syntology.ai/paper/2402.01614","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.01614"}},"official":{"repos":["tonyauyeung/local2gae2global"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bhgnn-rt-network-embedding-for-directed","slug":"bhgnn-rt-network-embedding-for-directed","title":"BHGNN-RT: Network embedding for directed heterogeneous graphs","date":"2023-11-24","arxiv_id":"2311.14404","repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-and-powerful-framework-for-stable","slug":"a-simple-and-powerful-framework-for-stable","title":"A Simple and Powerful Framework for Stable Dynamic Network Embedding","date":"2023-11-14","arxiv_id":"2311.09251","repositories_listed":1,"syntology":null},{"url":"/paper/trustworthiness-driven-graph-convolutional","slug":"trustworthiness-driven-graph-convolutional","title":"Trustworthiness-Driven Graph Convolutional Networks for Signed Network Embedding","date":"2023-09-02","arxiv_id":"2309.00816","repositories_listed":1,"syntology":null},{"url":"/paper/a-hybrid-membership-latent-distance-model-for","slug":"a-hybrid-membership-latent-distance-model-for","title":"A Hybrid Membership Latent Distance Model for Unsigned and Signed Integer Weighted Networks","date":"2023-08-29","arxiv_id":"2308.15293","repositories_listed":1,"syntology":null},{"url":"/paper/gradient-based-spectral-embeddings-of-random","slug":"gradient-based-spectral-embeddings-of-random","title":"Gradient-Based Spectral Embeddings of Random Dot Product Graphs","date":"2023-07-25","arxiv_id":"2307.13818","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-graph-neural-networks-for","slug":"collaborative-graph-neural-networks-for","title":"Collaborative Graph Neural Networks for Attributed Network Embedding","date":"2023-07-22","arxiv_id":"2307.11981","repositories_listed":1,"syntology":null},{"url":"/paper/random-walk-on-multiple-networks","slug":"random-walk-on-multiple-networks","title":"Random Walk on Multiple Networks","date":"2023-07-04","arxiv_id":"2307.01637","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-dynamic-network-embedding-with","slug":"accelerating-dynamic-network-embedding-with","title":"Accelerating Dynamic Network Embedding with Billions of Parameter Updates to Milliseconds","date":"2023-06-15","arxiv_id":"2306.08967","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/accelerating-dynamic-network-embedding-with#ran","syntology_url":"https://syntology.ai/paper/2306.08967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08967"}},"official":{"repos":["zjunet/damf"],"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/h2tne-temporal-heterogeneous-information","slug":"h2tne-temporal-heterogeneous-information","title":"$\\text{H}^2\\text{TNE}$: Temporal Heterogeneous Information Network Embedding in Hyperbolic Spaces","date":"2023-04-14","arxiv_id":"2304.06970","repositories_listed":1,"syntology":null},{"url":"/paper/danes-deep-neural-network-ensemble","slug":"danes-deep-neural-network-ensemble","title":"DANES: Deep Neural Network Ensemble Architecture for Social and Textual Context-aware Fake News Detection","date":"2023-02-01","arxiv_id":"2302.01756","repositories_listed":1,"syntology":null},{"url":"/paper/learning-semantic-relationship-among","slug":"learning-semantic-relationship-among","title":"Learning Semantic Relationship Among Instances for Image-Text Matching","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/dycsc-modeling-the-evolutionary-process-of","slug":"dycsc-modeling-the-evolutionary-process-of","title":"DyCSC: Modeling the Evolutionary Process of Dynamic Networks Based on Cluster Structure","date":"2022-10-23","arxiv_id":"2210.12690","repositories_listed":1,"syntology":null},{"url":"/paper/touplegdd-a-fine-designed-solution-of","slug":"touplegdd-a-fine-designed-solution-of","title":"ToupleGDD: A Fine-Designed Solution of Influence Maximization by Deep Reinforcement Learning","date":"2022-10-14","arxiv_id":"2210.07500","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/touplegdd-a-fine-designed-solution-of#ran","syntology_url":"https://syntology.ai/paper/2210.07500","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07500"}},"official":{"repos":["Dtrycode/ToupleGDD"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/cross-network-social-user-embedding-with","slug":"cross-network-social-user-embedding-with","title":"Cross-Network Social User Embedding with Hybrid Differential Privacy Guarantees","date":"2022-09-04","arxiv_id":"2209.01539","repositories_listed":1,"syntology":null},{"url":"/paper/multiplex-heterogeneous-graph-convolutional","slug":"multiplex-heterogeneous-graph-convolutional","title":"Multiplex Heterogeneous Graph Convolutional Network","date":"2022-08-12","arxiv_id":"2208.06129","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-heterophilous-network-embedding","slug":"unsupervised-heterophilous-network-embedding","title":"Unsupervised Network Embedding Beyond Homophily","date":"2022-03-21","arxiv_id":"2203.10866","repositories_listed":1,"syntology":null},{"url":"/paper/monkey-business-reinforcement-learning-meets","slug":"monkey-business-reinforcement-learning-meets","title":"Monkey Business: Reinforcement learning meets neighborhood search for Virtual Network Embedding","date":"2022-02-28","arxiv_id":"2202.13706","repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-on-heterostructures","slug":"representation-learning-on-heterostructures","title":"Representation Learning on Heterostructures via Heterogeneous Anonymous Walks","date":"2022-01-18","arxiv_id":"2201.06972","repositories_listed":1,"syntology":null},{"url":"/paper/tme-bna-temporal-motif-preserving-network","slug":"tme-bna-temporal-motif-preserving-network","title":"TME-BNA: Temporal Motif-Preserving Network Embedding with Bicomponent Neighbor Aggregation","date":"2021-10-26","arxiv_id":"2110.13596","repositories_listed":1,"syntology":null},{"url":"/paper/vaccine-skepticism-detection-by-network","slug":"vaccine-skepticism-detection-by-network","title":"Vaccine skepticism detection by network embedding","date":"2021-10-20","arxiv_id":"2110.13619","repositories_listed":1,"syntology":null},{"url":"/paper/multi-relation-aware-temporal-interaction","slug":"multi-relation-aware-temporal-interaction","title":"Multi-Relation Aware Temporal Interaction Network Embedding","date":"2021-10-09","arxiv_id":"2110.04503","repositories_listed":1,"syntology":null},{"url":"/paper/signed-bipartite-graph-neural-networks","slug":"signed-bipartite-graph-neural-networks","title":"Signed Bipartite Graph Neural Networks","date":"2021-08-22","arxiv_id":"2108.09638","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/signed-bipartite-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2108.09638","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.09638"}},"official":{"repos":["huangjunjie-cs/SBGNN"],"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"]}}},{"url":"/paper/siren-sign-aware-recommendation-using-graph","slug":"siren-sign-aware-recommendation-using-graph","title":"SiReN: Sign-Aware Recommendation Using Graph Neural Networks","date":"2021-08-19","arxiv_id":"2108.08735","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-graph-network-embedding-with-causal","slug":"temporal-graph-network-embedding-with-causal","title":"Temporal Graph Network Embedding with Causal Anonymous Walks Representations","date":"2021-08-19","arxiv_id":"2108.08754","repositories_listed":1,"syntology":null},{"url":"/paper/textcnn-with-attention-for-text","slug":"textcnn-with-attention-for-text","title":"TextCNN with Attention for Text Classification","date":"2021-08-04","arxiv_id":"2108.01921","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-role-oriented-network-embedding","slug":"a-survey-on-role-oriented-network-embedding","title":"A Survey on Role-Oriented Network Embedding","date":"2021-07-18","arxiv_id":"2107.08379","repositories_listed":1,"syntology":null},{"url":"/paper/discrete-time-temporal-network-embedding-via","slug":"discrete-time-temporal-network-embedding-via","title":"Discrete-time Temporal Network Embedding via Implicit Hierarchical Learning in Hyperbolic Space","date":"2021-07-08","arxiv_id":"2107.03767","repositories_listed":1,"syntology":null},{"url":"/paper/shapes-as-product-differentiation-neural","slug":"shapes-as-product-differentiation-neural","title":"Shapes as Product Differentiation: Neural Network Embedding in the Analysis of Markets for Fonts","date":"2021-07-06","arxiv_id":"2107.02739","repositories_listed":1,"syntology":null},{"url":"/paper/relation-order-histograms-as-a-network","slug":"relation-order-histograms-as-a-network","title":"Relation order histograms as a network embedding tool","date":"2021-06-09","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/imgagn-imbalanced-network-embedding-via","slug":"imgagn-imbalanced-network-embedding-via","title":"ImGAGN:Imbalanced Network Embedding via Generative Adversarial Graph Networks","date":"2021-06-05","arxiv_id":"2106.02817","repositories_listed":1,"syntology":null},{"url":"/paper/gene-global-event-network-embedding","slug":"gene-global-event-network-embedding","title":"GENE: Global Event Network Embedding","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/where-are-we-in-embedding-spaces-a","slug":"where-are-we-in-embedding-spaces-a","title":"Where are we in embedding spaces? A Comprehensive Analysis on Network Embedding Approaches for Recommender Systems","date":"2021-05-19","arxiv_id":"2105.08908","repositories_listed":1,"syntology":null},{"url":"/paper/an-influence-based-approach-for-root-cause","slug":"an-influence-based-approach-for-root-cause","title":"An Influence-based Approach for Root Cause Alarm Discovery in Telecom Networks","date":"2021-05-07","arxiv_id":"2105.03092","repositories_listed":1,"syntology":null},{"url":"/paper/mutual-contrastive-learning-for-visual","slug":"mutual-contrastive-learning-for-visual","title":"Mutual Contrastive Learning for Visual Representation Learning","date":"2021-04-26","arxiv_id":"2104.12565","repositories_listed":1,"syntology":null},{"url":"/paper/edgeless-gnn-unsupervised-inductive-edgeless","slug":"edgeless-gnn-unsupervised-inductive-edgeless","title":"Edgeless-GNN: Unsupervised Representation Learning for Edgeless Nodes","date":"2021-04-12","arxiv_id":"2104.05225","repositories_listed":1,"syntology":null},{"url":"/paper/mshine-a-multiple-meta-paths-simultaneous","slug":"mshine-a-multiple-meta-paths-simultaneous","title":"mSHINE: A Multiple-meta-paths Simultaneous Learning Framework for Heterogeneous Information Network Embedding","date":"2021-04-06","arxiv_id":"2104.02433","repositories_listed":1,"syntology":null},{"url":"/paper/node-proximity-is-all-you-need-unified","slug":"node-proximity-is-all-you-need-unified","title":"Node Proximity Is All You Need: Unified Structural and Positional Node and Graph Embedding","date":"2021-02-26","arxiv_id":"2102.13582","repositories_listed":1,"syntology":null},{"url":"/paper/fast-graph-learning-with-unique-optimal","slug":"fast-graph-learning-with-unique-optimal","title":"Fast Graph Learning with Unique Optimal Solutions","date":"2021-02-17","arxiv_id":"2102.08530","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-attack-on-network-embeddings-via","slug":"adversarial-attack-on-network-embeddings-via","title":"Adversarial Attack on Network Embeddings via Supervised Network Poisoning","date":"2021-02-14","arxiv_id":"2102.07164","repositories_listed":1,"syntology":null},{"url":"/paper/multiplex-bipartite-network-embedding-using","slug":"multiplex-bipartite-network-embedding-using","title":"Multiplex Bipartite Network Embedding using Dual Hypergraph Convolutional Networks","date":"2021-02-12","arxiv_id":"2102.06371","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/multiplex-bipartite-network-embedding-using#ran","syntology_url":"https://syntology.ai/paper/2102.06371","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.06371"}},"official":null}},{"url":"/paper/learning-multi-resolution-representations-of","slug":"learning-multi-resolution-representations-of","title":"Learning multi-resolution representations of research patterns in bibliographic networks","date":"2021-02-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sdgnn-learning-node-representation-for-signed","slug":"sdgnn-learning-node-representation-for-signed","title":"SDGNN: Learning Node Representation for Signed Directed Networks","date":"2021-01-07","arxiv_id":"2101.02390","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-node-content-for-multiview-graph","slug":"exploiting-node-content-for-multiview-graph","title":"Exploiting Node Content for Multiview Graph Convolutional Network and Adversarial Regularization","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/introducing-various-semantic-models-for","slug":"introducing-various-semantic-models-for","title":"Introducing various Semantic Models for Amharic: Experimentation and Evaluation with multiple Tasks and Datasets","date":"2020-11-02","arxiv_id":"2011.01154","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-house-price-predictions-using-geo","slug":"boosting-house-price-predictions-using-geo","title":"Boosting House Price Predictions using Geo-Spatial Network Embedding","date":"2020-09-01","arxiv_id":"2009.00254","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/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/tempnodeemb-temporal-node-embedding","slug":"tempnodeemb-temporal-node-embedding","title":"TempNodeEmb:Temporal Node Embedding considering temporal edge influence matrix","date":"2020-08-16","arxiv_id":"2008.06940","repositories_listed":1,"syntology":null},{"url":"/paper/integrating-network-embedding-and-community","slug":"integrating-network-embedding-and-community","title":"Integrating Network Embedding and Community Outlier Detection via Multiclass Graph Description","date":"2020-07-20","arxiv_id":"2007.10231","repositories_listed":1,"syntology":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"]}}}],"syntology_records":16,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":24,"papers_where_code_ran_first_page":"/task/network-embedding/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":5,"url":"/task/network-embedding/papers/2","json":"/task/network-embedding/papers/2.json","rows":100},{"order":"archive","page":3,"of":5,"url":"/task/network-embedding/papers/3","json":"/task/network-embedding/papers/3.json","rows":100},{"order":"archive","page":4,"of":5,"url":"/task/network-embedding/papers/4","json":"/task/network-embedding/papers/4.json","rows":100},{"order":"archive","page":5,"of":5,"url":"/task/network-embedding/papers/5","json":"/task/network-embedding/papers/5.json","rows":3},{"order":"ran","page":1,"of":1,"url":"/task/network-embedding/papers/ran/1","json":"/task/network-embedding/papers/ran/1.json","rows":24}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"216c6ead4371e729f20dfcfa3da095786374511bd83a0e3568b99f46f2d2bec8","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}