{"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/link-prediction/papers/10","list_of":"/task/link-prediction","task":"Link Prediction","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":10,"pages_in_order":20,"rows_per_page":100,"rows":[901,1000],"of":1949,"counts":{"archive_papers_tagged":1949,"with_a_code_link":974,"where_syntology_ran_a_sample":233,"not_listed_spam_title":0,"listed":1949,"listed_where_code_ran":233,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":206,"every_run_a_failure_of_syntologys_instrument":27,"listed_with_a_run_with_no_instrument_failure":206,"listed_every_run_a_failure_of_syntologys_instrument":27,"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/link-prediction","prev":"/task/link-prediction/papers/9","next":"/task/link-prediction/papers/11","papers":[{"url":"/paper/splitter-learning-node-representations-that","slug":"splitter-learning-node-representations-that","title":"Splitter: Learning Node Representations that Capture Multiple Social Contexts","date":"2019-03-18","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/detecting-drug-drug-interactions-using","slug":"detecting-drug-drug-interactions-using","title":"Detecting drug-drug interactions using artificial neural networks and classic graph similarity measures","date":"2019-03-11","arxiv_id":"1903.04571","repositories_listed":1,"syntology":null},{"url":"/paper/learning-edge-properties-in-graphs-from-path","slug":"learning-edge-properties-in-graphs-from-path","title":"Learning Edge Properties in Graphs from Path Aggregations","date":"2019-03-11","arxiv_id":"1903.04613","repositories_listed":1,"syntology":null},{"url":"/paper/graphvite-a-high-performance-cpu-gpu-hybrid","slug":"graphvite-a-high-performance-cpu-gpu-hybrid","title":"GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding","date":"2019-03-02","arxiv_id":"1903.00757","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graphvite-a-high-performance-cpu-gpu-hybrid#ran","syntology_url":"https://syntology.ai/paper/1903.00757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.00757"}},"official":null}},{"url":"/paper/e-lstm-d-a-deep-learning-framework-for","slug":"e-lstm-d-a-deep-learning-framework-for","title":"E-LSTM-D: A Deep Learning Framework for Dynamic Network Link Prediction","date":"2019-02-22","arxiv_id":"1902.08329","repositories_listed":1,"syntology":null},{"url":"/paper/web-links-prediction-and-category-wise","slug":"web-links-prediction-and-category-wise","title":"Web Links Prediction And Category-Wise Recommendation Based On Browser History","date":"2019-02-21","arxiv_id":"1902.08496","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-sequence-submodularity","slug":"adaptive-sequence-submodularity","title":"Adaptive Sequence Submodularity","date":"2019-02-15","arxiv_id":"1902.05981","repositories_listed":1,"syntology":null},{"url":"/paper/learning-topological-representation-for","slug":"learning-topological-representation-for","title":"Learning Topological Representation for Networks via Hierarchical Sampling","date":"2019-02-15","arxiv_id":"1902.06684","repositories_listed":1,"syntology":null},{"url":"/paper/link-prediction-via-higher-order-motif","slug":"link-prediction-via-higher-order-motif","title":"Link Prediction via Higher-Order Motif Features","date":"2019-02-08","arxiv_id":"1902.06679","repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-for-heterogeneous","slug":"representation-learning-for-heterogeneous","title":"Representation Learning for Heterogeneous Information Networks via Embedding Events","date":"2019-01-29","arxiv_id":"1901.10234","repositories_listed":1,"syntology":null},{"url":"/paper/gcn-gan-a-non-linear-temporal-link-prediction","slug":"gcn-gan-a-non-linear-temporal-link-prediction","title":"GCN-GAN: A Non-linear Temporal Link Prediction Model for Weighted Dynamic Networks","date":"2019-01-26","arxiv_id":"1901.09165","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gcn-gan-a-non-linear-temporal-link-prediction#ran","syntology_url":"https://syntology.ai/paper/1901.09165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09165"}},"official":null}},{"url":"/paper/attributed-network-embedding-via-subspace","slug":"attributed-network-embedding-via-subspace","title":"Attributed Network Embedding via Subspace Discovery","date":"2019-01-14","arxiv_id":"1901.04095","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-autoencoders-with-constant","slug":"adversarial-autoencoders-with-constant","title":"Adversarial Autoencoders with Constant-Curvature Latent Manifolds","date":"2018-12-11","arxiv_id":"1812.04314","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/adversarial-autoencoders-with-constant#ran","syntology_url":"https://syntology.ai/paper/1812.04314","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.04314"}},"official":{"repos":["danielegrattarola/ccm-aae"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-deep-sequential-model-for-discourse-parsing","slug":"a-deep-sequential-model-for-discourse-parsing","title":"A Deep Sequential Model for Discourse Parsing on Multi-Party Dialogues","date":"2018-12-01","arxiv_id":"1812.00176","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/a-deep-sequential-model-for-discourse-parsing#ran","syntology_url":"https://syntology.ai/paper/1812.00176","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.00176"}},"official":{"repos":["shizhouxing/DialogueDiscourseParsing"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/attributed-network-embedding-for-incomplete","slug":"attributed-network-embedding-for-incomplete","title":"Attributed Network Embedding for Incomplete Attributed Networks","date":"2018-11-28","arxiv_id":"1811.11728","repositories_listed":1,"syntology":null},{"url":"/paper/link-prediction-in-networks-with-core-fringe","slug":"link-prediction-in-networks-with-core-fringe","title":"Link Prediction in Networks with Core-Fringe Data","date":"2018-11-28","arxiv_id":"1811.11540","repositories_listed":1,"syntology":null},{"url":"/paper/node-embedding-with-adaptive-similarities-for","slug":"node-embedding-with-adaptive-similarities-for","title":"Node Embedding with Adaptive Similarities for Scalable Learning over Graphs","date":"2018-11-27","arxiv_id":"1811.10797","repositories_listed":1,"syntology":null},{"url":"/paper/dynamicgem-a-library-for-dynamic-graph","slug":"dynamicgem-a-library-for-dynamic-graph","title":"DynamicGEM: A Library for Dynamic Graph Embedding Methods","date":"2018-11-26","arxiv_id":"1811.10734","repositories_listed":1,"syntology":null},{"url":"/paper/multi-layered-graph-embedding-with-graph","slug":"multi-layered-graph-embedding-with-graph","title":"MGCN: Semi-supervised Classification in Multi-layer Graphs with Graph Convolutional Networks","date":"2018-11-21","arxiv_id":"1811.08800","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-graph-offset-reconstruction-towards","slug":"temporal-graph-offset-reconstruction-towards","title":"Temporal Graph Offset Reconstruction: Towards Temporally Robust Graph Representation Learning","date":"2018-11-20","arxiv_id":"1811.08366","repositories_listed":1,"syntology":null},{"url":"/paper/differentiating-concepts-and-instances-for","slug":"differentiating-concepts-and-instances-for","title":"Differentiating Concepts and Instances for Knowledge Graph Embedding","date":"2018-11-12","arxiv_id":"1811.04588","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/differentiating-concepts-and-instances-for#ran","syntology_url":"https://syntology.ai/paper/1811.04588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.04588"}},"official":{"repos":["davidlvxin/TransC"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-structure-aware-convolutional","slug":"end-to-end-structure-aware-convolutional","title":"End-to-end Structure-Aware Convolutional Networks for Knowledge Base Completion","date":"2018-11-11","arxiv_id":"1811.04441","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/end-to-end-structure-aware-convolutional#ran","syntology_url":"https://syntology.ai/paper/1811.04441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.04441"}},"official":{"repos":["JD-AI-Research-Silicon-Valley/SACN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/multi-task-graph-autoencoders","slug":"multi-task-graph-autoencoders","title":"Multi-Task Graph Autoencoders","date":"2018-11-07","arxiv_id":"1811.02798","repositories_listed":1,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/multi-task-graph-autoencoders#ran","syntology_url":"https://syntology.ai/paper/1811.02798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.02798"}},"official":{"repos":["vuptran/graph-representation-learning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-sparse-hierarchical-graph-classifiers","slug":"towards-sparse-hierarchical-graph-classifiers","title":"Towards Sparse Hierarchical Graph Classifiers","date":"2018-11-03","arxiv_id":"1811.01287","repositories_listed":1,"syntology":null},{"url":"/paper/atp-directed-graph-embedding-with-asymmetric","slug":"atp-directed-graph-embedding-with-asymmetric","title":"ATP: Directed Graph Embedding with Asymmetric Transitivity Preservation","date":"2018-11-02","arxiv_id":"1811.00839","repositories_listed":1,"syntology":null},{"url":"/paper/argumentative-link-prediction-using-residual","slug":"argumentative-link-prediction-using-residual","title":"Argumentative Link Prediction using Residual Networks and Multi-Objective Learning","date":"2018-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/classification-using-link-prediction","slug":"classification-using-link-prediction","title":"Classification Using Link Prediction","date":"2018-10-01","arxiv_id":"1810.00717","repositories_listed":1,"syntology":null},{"url":"/paper/encoding-robust-representation-for-graph","slug":"encoding-robust-representation-for-graph","title":"Encoding Robust Representation for Graph Generation","date":"2018-09-28","arxiv_id":"1809.10851","repositories_listed":1,"syntology":null},{"url":"/paper/biasedwalk-biased-sampling-for-representation","slug":"biasedwalk-biased-sampling-for-representation","title":"BiasedWalk: Biased Sampling for Representation Learning on Graphs","date":"2018-09-07","arxiv_id":"1809.02482","repositories_listed":1,"syntology":null},{"url":"/paper/dyngraph2vec-capturing-network-dynamics-using","slug":"dyngraph2vec-capturing-network-dynamics-using","title":"dyngraph2vec: Capturing Network Dynamics using Dynamic Graph Representation Learning","date":"2018-09-07","arxiv_id":"1809.02657","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-semantic-relations-using-global","slug":"predicting-semantic-relations-using-global","title":"Predicting Semantic Relations using Global Graph Properties","date":"2018-08-27","arxiv_id":"1808.08644","repositories_listed":1,"syntology":null},{"url":"/paper/hypernetwork-knowledge-graph-embeddings","slug":"hypernetwork-knowledge-graph-embeddings","title":"Hypernetwork Knowledge Graph Embeddings","date":"2018-08-21","arxiv_id":"1808.07018","repositories_listed":1,"syntology":null},{"url":"/paper/attention-models-in-graphs-a-survey","slug":"attention-models-in-graphs-a-survey","title":"Attention Models in Graphs: A Survey","date":"2018-07-20","arxiv_id":"1807.07984","repositories_listed":1,"syntology":null},{"url":"/paper/learning-deep-network-representations-with","slug":"learning-deep-network-representations-with","title":"Learning Deep Network Representations with Adversarially Regularized Autoencoders","date":"2018-07-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/jack-the-reader-a-a-machine-reading-framework","slug":"jack-the-reader-a-a-machine-reading-framework","title":"Jack the Reader -- A Machine Reading Framework","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/towards-understanding-the-geometry-of","slug":"towards-understanding-the-geometry-of","title":"Towards Understanding the Geometry of Knowledge Graph Embeddings","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/type-sensitive-knowledge-base-inference","slug":"type-sensitive-knowledge-base-inference","title":"Type-Sensitive Knowledge Base Inference Without Explicit Type Supervision","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/spectral-network-embedding-a-fast-and","slug":"spectral-network-embedding-a-fast-and","title":"Spectral Network Embedding: A Fast and Scalable Method via Sparsity","date":"2018-06-07","arxiv_id":"1806.02623","repositories_listed":1,"syntology":null},{"url":"/paper/neural-brane-neural-bayesian-personalized","slug":"neural-brane-neural-bayesian-personalized","title":"Neural-Brane: Neural Bayesian Personalized Ranking for Attributed Network Embedding","date":"2018-04-23","arxiv_id":"1804.08774","repositories_listed":1,"syntology":null},{"url":"/paper/models-for-capturing-temporal-smoothness-in","slug":"models-for-capturing-temporal-smoothness-in","title":"Models for Capturing Temporal Smoothness in Evolving Networks for Learning Latent Representation of Nodes","date":"2018-04-16","arxiv_id":"1804.05816","repositories_listed":1,"syntology":null},{"url":"/paper/graphite-iterative-generative-modeling-of","slug":"graphite-iterative-generative-modeling-of","title":"Graphite: Iterative Generative Modeling of Graphs","date":"2018-03-28","arxiv_id":"1803.10459","repositories_listed":1,"syntology":null},{"url":"/paper/locally-private-bayesian-inference-for-count","slug":"locally-private-bayesian-inference-for-count","title":"Locally Private Bayesian Inference for Count Models","date":"2018-03-22","arxiv_id":"1803.08471","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/locally-private-bayesian-inference-for-count#ran","syntology_url":"https://syntology.ai/paper/1803.08471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.08471"}},"official":null}},{"url":"/paper/expeditious-generation-of-knowledge-graph","slug":"expeditious-generation-of-knowledge-graph","title":"Expeditious Generation of Knowledge Graph Embeddings","date":"2018-03-21","arxiv_id":"1803.07828","repositories_listed":1,"syntology":null},{"url":"/paper/modelling-sparsity-heterogeneity-reciprocity","slug":"modelling-sparsity-heterogeneity-reciprocity","title":"Modelling sparsity, heterogeneity, reciprocity and community structure in temporal interaction data","date":"2018-03-16","arxiv_id":"1803.06070","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-overfit-and-underfit-in-models-of","slug":"evaluating-overfit-and-underfit-in-models-of","title":"Evaluating Overfit and Underfit in Models of Network Community Structure","date":"2018-02-28","arxiv_id":"1802.10582","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-markov-logic-efficient-mining-of","slug":"beyond-markov-logic-efficient-mining-of","title":"Beyond Markov Logic: Efficient Mining of Prediction Rules in Large Graphs","date":"2018-02-10","arxiv_id":"1802.03638","repositories_listed":1,"syntology":null},{"url":"/paper/incorporating-literals-into-knowledge-graph","slug":"incorporating-literals-into-knowledge-graph","title":"Incorporating Literals into Knowledge Graph Embeddings","date":"2018-02-03","arxiv_id":"1802.00934","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-polypharmacy-side-effects-with-graph","slug":"modeling-polypharmacy-side-effects-with-graph","title":"Modeling polypharmacy side effects with graph convolutional networks","date":"2018-02-02","arxiv_id":"1802.00543","repositories_listed":1,"syntology":null},{"url":"/paper/shine-signed-heterogeneous-information","slug":"shine-signed-heterogeneous-information","title":"SHINE: Signed Heterogeneous Information Network Embedding for Sentiment Link Prediction","date":"2017-12-03","arxiv_id":"1712.00732","repositories_listed":1,"syntology":null},{"url":"/paper/prune-preserving-proximity-and-global-ranking","slug":"prune-preserving-proximity-and-global-ranking","title":"PRUNE: Preserving Proximity and Global Ranking for Network Embedding","date":"2017-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-embedding-with-iterative","slug":"knowledge-graph-embedding-with-iterative","title":"Knowledge Graph Embedding with Iterative Guidance from Soft Rules","date":"2017-11-30","arxiv_id":"1711.11231","repositories_listed":1,"syntology":null},{"url":"/paper/open-world-knowledge-graph-completion","slug":"open-world-knowledge-graph-completion","title":"Open-World Knowledge Graph Completion","date":"2017-11-09","arxiv_id":"1711.03438","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/open-world-knowledge-graph-completion#ran","syntology_url":"https://syntology.ai/paper/1711.03438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.03438"}},"official":{"repos":["bxshi/ConMask"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/mandolin-a-knowledge-discovery-framework-for","slug":"mandolin-a-knowledge-discovery-framework-for","title":"Mandolin: A Knowledge Discovery Framework for the Web of Data","date":"2017-11-03","arxiv_id":"1711.01283","repositories_listed":1,"syntology":null},{"url":"/paper/continuous-time-relationship-prediction-in","slug":"continuous-time-relationship-prediction-in","title":"Continuous-Time Relationship Prediction in Dynamic Heterogeneous Information Networks","date":"2017-09-30","arxiv_id":"1710.00818","repositories_listed":1,"syntology":null},{"url":"/paper/analysis-of-the-impact-of-negative-sampling","slug":"analysis-of-the-impact-of-negative-sampling","title":"Analysis of the Impact of Negative Sampling on Link Prediction in Knowledge Graphs","date":"2017-08-22","arxiv_id":"1708.06816","repositories_listed":1,"syntology":null},{"url":"/paper/metapath2vec-scalable-representation-learning","slug":"metapath2vec-scalable-representation-learning","title":"metapath2vec: Scalable Representation Learning for Heterogeneous Networks","date":"2017-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/weisfeiler-lehman-neural-machine-for-link","slug":"weisfeiler-lehman-neural-machine-for-link","title":"Weisfeiler-lehman neural machine for link prediction","date":"2017-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-sets-for-regularising-neural-link","slug":"adversarial-sets-for-regularising-neural-link","title":"Adversarial Sets for Regularising Neural Link Predictors","date":"2017-07-24","arxiv_id":"1707.07596","repositories_listed":1,"syntology":null},{"url":"/paper/deep-gaussian-embedding-of-graphs","slug":"deep-gaussian-embedding-of-graphs","title":"Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking","date":"2017-07-12","arxiv_id":"1707.03815","repositories_listed":1,"syntology":null},{"url":"/paper/cane-context-aware-network-embedding-for","slug":"cane-context-aware-network-embedding-for","title":"CANE: Context-Aware Network Embedding for Relation Modeling","date":"2017-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-node-attributes-for-incomplete","slug":"leveraging-node-attributes-for-incomplete","title":"Leveraging Node Attributes for Incomplete Relational Data","date":"2017-06-14","arxiv_id":"1706.04289","repositories_listed":1,"syntology":null},{"url":"/paper/a-generalized-method-toward-drug-target","slug":"a-generalized-method-toward-drug-target","title":"A generalized method toward drug-target interaction prediction via low-rank matrix projection","date":"2017-06-06","arxiv_id":"1706.01876","repositories_listed":1,"syntology":null},{"url":"/paper/consistencies-and-inconsistencies-between","slug":"consistencies-and-inconsistencies-between","title":"Consistencies and inconsistencies between model selection and link prediction in networks","date":"2017-05-22","arxiv_id":"1705.07967","repositories_listed":1,"syntology":null},{"url":"/paper/learning-edge-representations-via-low-rank","slug":"learning-edge-representations-via-low-rank","title":"Learning Edge Representations via Low-Rank Asymmetric Projections","date":"2017-05-16","arxiv_id":"1705.05615","repositories_listed":1,"syntology":null},{"url":"/paper/analogical-inference-for-multi-relational","slug":"analogical-inference-for-multi-relational","title":"Analogical Inference for Multi-Relational Embeddings","date":"2017-05-06","arxiv_id":"1705.02426","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-parallel-translating-embedding-for","slug":"efficient-parallel-translating-embedding-for","title":"Efficient Parallel Translating Embedding For Knowledge Graphs","date":"2017-03-30","arxiv_id":"1703.10316","repositories_listed":1,"syntology":null},{"url":"/paper/natural-parameter-networks-a-class-of","slug":"natural-parameter-networks-a-class-of","title":"Natural-Parameter Networks: A Class of Probabilistic Neural Networks","date":"2016-11-02","arxiv_id":"1611.00448","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/natural-parameter-networks-a-class-of#ran","syntology_url":"https://syntology.ai/paper/1611.00448","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.00448"}},"official":{"repos":["js05212/PyTorch-for-NPN"],"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/stranse-a-novel-embedding-model-of-entities","slug":"stranse-a-novel-embedding-model-of-entities","title":"STransE: a novel embedding model of entities and relationships in knowledge bases","date":"2016-06-27","arxiv_id":"1606.08140","repositories_listed":1,"syntology":null},{"url":"/paper/discriminative-predicate-path-mining-for-fact","slug":"discriminative-predicate-path-mining-for-fact","title":"Discriminative Predicate Path Mining for Fact Checking in Knowledge Graphs","date":"2015-10-20","arxiv_id":"1510.05911","repositories_listed":1,"syntology":null},{"url":"/paper/estimating-network-edge-probabilities-by","slug":"estimating-network-edge-probabilities-by","title":"Estimating network edge probabilities by neighborhood smoothing","date":"2015-09-29","arxiv_id":"1509.08588","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-embedding-via-dynamic-mapping","slug":"knowledge-graph-embedding-via-dynamic-mapping","title":"Knowledge Graph Embedding via Dynamic Mapping Matrix","date":"2015-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-embedding-by-translating-on","slug":"knowledge-graph-embedding-by-translating-on","title":"Knowledge Graph Embedding by Translating on Hyperplanes","date":"2014-07-27","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/estimation-of-simultaneously-sparse-and-low","slug":"estimation-of-simultaneously-sparse-and-low","title":"Estimation of Simultaneously Sparse and Low Rank Matrices","date":"2012-06-27","arxiv_id":"1206.6474","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/estimation-of-simultaneously-sparse-and-low#ran","syntology_url":"https://syntology.ai/paper/1206.6474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1206.6474"}},"official":null}},{"url":"/paper/temporal-link-prediction-using-matrix-and","slug":"temporal-link-prediction-using-matrix-and","title":"Temporal Link Prediction using Matrix and Tensor Factorizations","date":"2010-05-21","arxiv_id":"1005.4006","repositories_listed":1,"syntology":null},{"url":null,"slug":"topic-modeling-and-link-prediction-for","title":"Topic Modeling and Link-Prediction for Material Property Discovery","date":"2025-07-08","arxiv_id":"2507.06139","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-generalization-in-node-and-link","title":"Understanding Generalization in Node and Link Prediction","date":"2025-07-01","arxiv_id":"2507.00927","repositories_listed":0,"syntology":null},{"url":null,"slug":"context-driven-knowledge-graph-completion","title":"Context-Driven Knowledge Graph Completion with Semantic-Aware Relational Message Passing","date":"2025-06-29","arxiv_id":"2506.23141","repositories_listed":0,"syntology":null},{"url":null,"slug":"directed-link-prediction-using-gnn-with-local","title":"Directed Link Prediction using GNN with Local and Global Feature Fusion","date":"2025-06-25","arxiv_id":"2506.20235","repositories_listed":0,"syntology":null},{"url":null,"slug":"call-me-maybe-enhancing-javascript-call-graph","title":"Call Me Maybe: Enhancing JavaScript Call Graph Construction using Graph Neural Networks","date":"2025-06-22","arxiv_id":"2506.18191","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-transfer-learning-framework-for-multilayer","title":"A Transfer Learning Framework for Multilayer Networks via Model Averaging","date":"2025-06-14","arxiv_id":"2506.12455","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-do-probabilistic-graphical-models-and","title":"How do Probabilistic Graphical Models and Graph Neural Networks Look at Network Data?","date":"2025-06-13","arxiv_id":"2506.11869","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-source-and-target-domains-via-link","title":"Bridging Source and Target Domains via Link Prediction for Unsupervised Domain Adaptation on Graphs","date":"2025-05-29","arxiv_id":"2505.24055","repositories_listed":0,"syntology":null},{"url":null,"slug":"directed-homophily-aware-graph-neural-network","title":"Directed Homophily-Aware Graph Neural Network","date":"2025-05-28","arxiv_id":"2505.22362","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-guided-diffusion-unified-guidance-for","title":"Graph Guided Diffusion: Unified Guidance for Conditional Graph Generation","date":"2025-05-26","arxiv_id":"2505.19685","repositories_listed":0,"syntology":null},{"url":null,"slug":"ocn-effectively-utilizing-higher-order-common","title":"OCN: Effectively Utilizing Higher-Order Common Neighbors for Better Link Prediction","date":"2025-05-26","arxiv_id":"2505.19719","repositories_listed":0,"syntology":null},{"url":null,"slug":"g1-teaching-llms-to-reason-on-graphs-with","title":"G1: Teaching LLMs to Reason on Graphs with Reinforcement Learning","date":"2025-05-24","arxiv_id":"2505.18499","repositories_listed":0,"syntology":null},{"url":null,"slug":"ec-lda-label-distribution-inference-attack","title":"EC-LDA : Label Distribution Inference Attack against Federated Graph Learning with Embedding Compression","date":"2025-05-21","arxiv_id":"2505.15140","repositories_listed":0,"syntology":null},{"url":null,"slug":"higher-order-structure-boosts-link-prediction","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","date":"2025-05-21","arxiv_id":"2505.15746","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-pid-controlled-tensor-wheel-decomposition","title":"A PID-Controlled Tensor Wheel Decomposition Model for Dynamic Link Prediction","date":"2025-05-20","arxiv_id":"2505.14211","repositories_listed":0,"syntology":null},{"url":null,"slug":"unify-graph-learning-with-text-unleashing-llm","title":"Unify Graph Learning with Text: Unleashing LLM Potentials for Session Search","date":"2025-05-20","arxiv_id":"2505.14156","repositories_listed":0,"syntology":null},{"url":null,"slug":"mprm-a-markov-path-based-rule-miner-for","title":"MPRM: A Markov Path-based Rule Miner for Efficient and Interpretable Knowledge Graph Reasoning","date":"2025-05-18","arxiv_id":"2505.12329","repositories_listed":0,"syntology":null},{"url":null,"slug":"vita-versatile-time-representation-learning","title":"VITA: Versatile Time Representation Learning for Temporal Hyper-Relational Knowledge Graphs","date":"2025-05-17","arxiv_id":"2505.11803","repositories_listed":0,"syntology":null},{"url":"/paper/open-the-eyes-of-mpnn-vision-enhances-mpnn-in","slug":"open-the-eyes-of-mpnn-vision-enhances-mpnn-in","title":"Open the Eyes of MPNN: Vision Enhances MPNN in Link Prediction","date":"2025-05-13","arxiv_id":"2505.08266","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/open-the-eyes-of-mpnn-vision-enhances-mpnn-in#ran","syntology_url":"https://syntology.ai/paper/2505.08266","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.08266"}},"official":null}},{"url":null,"slug":"learning-from-samples-inverse-problems-over","title":"Learning from Samples: Inverse Problems over measures via Sharpened Fenchel-Young Losses","date":"2025-05-11","arxiv_id":"2505.07124","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-the-mechanisms-behind","title":"Understanding the Mechanisms Behind Structural Influences on Link Prediction: A Case Study on FB15k-237","date":"2025-05-03","arxiv_id":"2505.01655","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalability-matters-overcoming-challenges-in","title":"Scalability Matters: Overcoming Challenges in InstructGLM with Similarity-Degree-Based Sampling","date":"2025-05-02","arxiv_id":"2505.03799","repositories_listed":0,"syntology":null},{"url":null,"slug":"skill-discovery-for-software-scripting","title":"Skill Discovery for Software Scripting Automation via Offline Simulations with LLMs","date":"2025-04-29","arxiv_id":"2504.20406","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-graph-transformer-framework-for-gene","title":"A Novel Graph Transformer Framework for Gene Regulatory Network Inference","date":"2025-04-23","arxiv_id":"2504.16961","repositories_listed":0,"syntology":null},{"url":null,"slug":"gnn-aclp-graph-neural-networks-based-analog","title":"GNN-ACLP: Graph Neural Networks based Analog Circuit Link Prediction","date":"2025-04-14","arxiv_id":"2504.10240","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-large-scale-evaluation-of-embedding-models","title":"On Large-scale Evaluation of Embedding Models for Knowledge Graph Completion","date":"2025-04-11","arxiv_id":"2504.08970","repositories_listed":0,"syntology":null}],"record_sha256":"ca8f9a85a733313d5ba075d2655dd884210ca0d7fe07a3b3b1b9e2d3eb0d2892","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}