{"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/7","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":7,"pages_in_order":20,"rows_per_page":100,"rows":[601,700],"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/6","next":"/task/link-prediction/papers/8","papers":[{"url":"/paper/skipnode-on-alleviating-over-smoothing-for","slug":"skipnode-on-alleviating-over-smoothing-for","title":"SkipNode: On Alleviating Performance Degradation for Deep Graph Convolutional Networks","date":"2021-12-22","arxiv_id":"2112.11628","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/skipnode-on-alleviating-over-smoothing-for#ran","syntology_url":"https://syntology.ai/paper/2112.11628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.11628"}},"official":{"repos":["weiganglu/skipnode"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/self-attention-presents-low-dimensional","slug":"self-attention-presents-low-dimensional","title":"Self-attention Presents Low-dimensional Knowledge Graph Embeddings for Link Prediction","date":"2021-12-20","arxiv_id":"2112.10644","repositories_listed":1,"syntology":null},{"url":"/paper/degreembed-incorporating-entity-embedding","slug":"degreembed-incorporating-entity-embedding","title":"DegreEmbed: incorporating entity embedding into logic rule learning for knowledge graph reasoning","date":"2021-12-18","arxiv_id":"2112.09933","repositories_listed":1,"syntology":null},{"url":"/paper/tlogic-temporal-logical-rules-for-explainable","slug":"tlogic-temporal-logical-rules-for-explainable","title":"TLogic: Temporal Logical Rules for Explainable Link Forecasting on Temporal Knowledge Graphs","date":"2021-12-15","arxiv_id":"2112.08025","repositories_listed":1,"syntology":null},{"url":"/paper/bscnets-block-simplicial-complex-neural","slug":"bscnets-block-simplicial-complex-neural","title":"BScNets: Block Simplicial Complex Neural Networks","date":"2021-12-13","arxiv_id":"2112.06826","repositories_listed":1,"syntology":null},{"url":"/paper/autogel-an-automated-graph-neural-network-1","slug":"autogel-an-automated-graph-neural-network-1","title":"AutoGEL: An Automated Graph Neural Network with Explicit Link Information","date":"2021-12-02","arxiv_id":"2112.01064","repositories_listed":1,"syntology":null},{"url":"/paper/hgate-heterogeneous-graph-attention-auto","slug":"hgate-heterogeneous-graph-attention-auto","title":"HGATE: Heterogeneous Graph Attention Auto-Encoders","date":"2021-11-28","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/transformation-of-node-to-knowledge-graph","slug":"transformation-of-node-to-knowledge-graph","title":"Transformation of Node to Knowledge Graph Embeddings for Faster Link Prediction in Social Networks","date":"2021-11-17","arxiv_id":"2111.09308","repositories_listed":1,"syntology":null},{"url":"/paper/qubite-qubit-embedding-for-knowledge-graph","slug":"qubite-qubit-embedding-for-knowledge-graph","title":"QubitE: Qubit Embedding for Knowledge Graph Completion","date":"2021-11-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/time-in-a-box-advancing-knowledge-graph","slug":"time-in-a-box-advancing-knowledge-graph","title":"Time in a Box: Advancing Knowledge Graph Completion with Temporal Scopes","date":"2021-11-12","arxiv_id":"2111.06854","repositories_listed":1,"syntology":null},{"url":"/paper/poisoning-knowledge-graph-embeddings-via-1","slug":"poisoning-knowledge-graph-embeddings-via-1","title":"Poisoning Knowledge Graph Embeddings via Relation Inference Patterns","date":"2021-11-11","arxiv_id":"2111.06345","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/poisoning-knowledge-graph-embeddings-via-1#ran","syntology_url":"https://syntology.ai/paper/2111.06345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.06345"}},"official":{"repos":["perubhardwaj/inferenceattack"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/wasserstein-adversarially-regularized-graph","slug":"wasserstein-adversarially-regularized-graph","title":"Wasserstein Adversarially Regularized Graph Autoencoder","date":"2021-11-09","arxiv_id":"2111.04981","repositories_listed":1,"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/wasserstein-adversarially-regularized-graph#ran","syntology_url":"https://syntology.ai/paper/2111.04981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.04981"}},"official":{"repos":["LeonResearch/WARGA"],"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"]}}},{"url":"/paper/adversarial-attacks-on-knowledge-graph-1","slug":"adversarial-attacks-on-knowledge-graph-1","title":"Adversarial Attacks on Knowledge Graph Embeddings via Instance Attribution Methods","date":"2021-11-04","arxiv_id":"2111.03120","repositories_listed":1,"syntology":null},{"url":"/paper/open-domain-contextual-link-prediction-and","slug":"open-domain-contextual-link-prediction-and","title":"Open-Domain Contextual Link Prediction and its Complementarity with Entailment Graphs","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/parallel-training-of-knowledge-graph","slug":"parallel-training-of-knowledge-graph","title":"Parallel Training of Knowledge Graph Embedding Models: A Comparison of Techniques","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/the-cat-set-on-the-mat-cross-attention-for","slug":"the-cat-set-on-the-mat-cross-attention-for","title":"The CAT SET on the MAT: Cross Attention for Set Matching in Bipartite Hypergraphs","date":"2021-10-30","arxiv_id":"2111.00243","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-heterogeneous-hierarchies-with","slug":"modeling-heterogeneous-hierarchies-with","title":"Modeling Heterogeneous Hierarchies with Relation-specific Hyperbolic Cones","date":"2021-10-28","arxiv_id":"2110.14923","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 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","sample_list":"/paper/modeling-heterogeneous-hierarchies-with#ran","syntology_url":"https://syntology.ai/paper/2110.14923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14923"}},"official":{"repos":["snap-stanford/ConE"],"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"]}}},{"url":"/paper/standing-on-the-shoulders-of-predecessors","slug":"standing-on-the-shoulders-of-predecessors","title":"Meta-Knowledge Transfer for Inductive Knowledge Graph Embedding","date":"2021-10-27","arxiv_id":"2110.14170","repositories_listed":1,"syntology":null},{"url":"/paper/vq-gnn-a-universal-framework-to-scale-up","slug":"vq-gnn-a-universal-framework-to-scale-up","title":"VQ-GNN: A Universal Framework to Scale up Graph Neural Networks using Vector Quantization","date":"2021-10-27","arxiv_id":"2110.14363","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/a-broader-picture-of-random-walk-based-graph","slug":"a-broader-picture-of-random-walk-based-graph","title":"A Broader Picture of Random-walk Based Graph Embedding","date":"2021-10-24","arxiv_id":"2110.12344","repositories_listed":1,"syntology":null},{"url":"/paper/drug-similarity-and-link-prediction-using","slug":"drug-similarity-and-link-prediction-using","title":"Drug Similarity and Link Prediction Using Graph Embeddings on Medical Knowledge Graphs","date":"2021-10-22","arxiv_id":"2110.13047","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-graph-embedding-on-a-single-gpu","slug":"boosting-graph-embedding-on-a-single-gpu","title":"Boosting Graph Embedding on a Single GPU","date":"2021-10-19","arxiv_id":"2110.10049","repositories_listed":1,"syntology":null},{"url":"/paper/pole-polarized-embedding-for-signed-networks","slug":"pole-polarized-embedding-for-signed-networks","title":"POLE: Polarized Embedding for Signed Networks","date":"2021-10-17","arxiv_id":"2110.09899","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-the-network-formation-pattern","slug":"understanding-the-network-formation-pattern","title":"Understanding the network formation pattern for better link prediction","date":"2021-10-17","arxiv_id":"2110.08850","repositories_listed":1,"syntology":null},{"url":"/paper/prix-lm-pretraining-for-multilingual","slug":"prix-lm-pretraining-for-multilingual","title":"Prix-LM: Pretraining for Multilingual Knowledge Base Construction","date":"2021-10-16","arxiv_id":"2110.08443","repositories_listed":1,"syntology":null},{"url":"/paper/residual2vec-debiasing-graph-embedding-with","slug":"residual2vec-debiasing-graph-embedding-with","title":"Residual2Vec: Debiasing graph embedding with random graphs","date":"2021-10-14","arxiv_id":"2110.07654","repositories_listed":1,"syntology":null},{"url":"/paper/neural-link-prediction-with-walk-pooling-1","slug":"neural-link-prediction-with-walk-pooling-1","title":"Neural Link Prediction with Walk Pooling","date":"2021-10-08","arxiv_id":"2110.04375","repositories_listed":1,"syntology":null},{"url":"/paper/relation-prediction-as-an-auxiliary-training","slug":"relation-prediction-as-an-auxiliary-training","title":"Relation Prediction as an Auxiliary Training Objective for Improving Multi-Relational Graph Representations","date":"2021-10-06","arxiv_id":"2110.02834","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-representation-learning-in-temporal","slug":"inductive-representation-learning-in-temporal","title":"Inductive Representation Learning in Temporal Networks via Mining Neighborhood and Community Influences","date":"2021-10-01","arxiv_id":"2110.00267","repositories_listed":1,"syntology":null},{"url":"/paper/how-neural-processes-improve-graph-link","slug":"how-neural-processes-improve-graph-link","title":"How Neural Processes Improve Graph Link Prediction","date":"2021-09-30","arxiv_id":"2109.14894","repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-graph-neural-networks-on-dynamic","slug":"benchmarking-graph-neural-networks-on-dynamic","title":"Benchmarking Graph Neural Networks on Dynamic Link Prediction","date":"2021-09-29","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/how-does-knowledge-graph-embedding","slug":"how-does-knowledge-graph-embedding","title":"How Does Knowledge Graph Embedding Extrapolate to Unseen Data: A Semantic Evidence View","date":"2021-09-24","arxiv_id":"2109.11800","repositories_listed":1,"syntology":null},{"url":"/paper/safran-an-interpretable-rule-based-link","slug":"safran-an-interpretable-rule-based-link","title":"SAFRAN: An interpretable, rule-based link prediction method outperforming embedding models","date":"2021-09-16","arxiv_id":"2109.08002","repositories_listed":1,"syntology":null},{"url":"/paper/hemi-multi-view-embedding-in-heterogeneous","slug":"hemi-multi-view-embedding-in-heterogeneous","title":"HeMI: Multi-view Embedding in Heterogeneous Graphs","date":"2021-09-14","arxiv_id":"2109.07008","repositories_listed":1,"syntology":null},{"url":"/paper/graph-algorithms-for-multiparallel-word","slug":"graph-algorithms-for-multiparallel-word","title":"Graph Algorithms for Multiparallel Word Alignment","date":"2021-09-13","arxiv_id":"2109.06283","repositories_listed":1,"syntology":null},{"url":"/paper/timetraveler-reinforcement-learning-for","slug":"timetraveler-reinforcement-learning-for","title":"TimeTraveler: Reinforcement Learning for Temporal Knowledge Graph Forecasting","date":"2021-09-09","arxiv_id":"2109.04101","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"3 ran (of which 3 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) · 2 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/timetraveler-reinforcement-learning-for#ran","syntology_url":"https://syntology.ai/paper/2109.04101","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.04101"}},"official":{"repos":["jhl-hust/titer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/influence-guided-data-augmentation-for-neural","slug":"influence-guided-data-augmentation-for-neural","title":"Influence-guided Data Augmentation for Neural Tensor Completion","date":"2021-08-23","arxiv_id":"2108.10248","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-perceived-multi-modal-pretraining","slug":"knowledge-perceived-multi-modal-pretraining","title":"Knowledge Perceived Multi-modal Pretraining in E-commerce","date":"2021-08-20","arxiv_id":"2109.00895","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":0,"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/knowledge-perceived-multi-modal-pretraining#ran","syntology_url":"https://syntology.ai/paper/2109.00895","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.00895"}},"official":{"repos":["yushanzhu/k3m"],"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"]}}},{"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/variational-graph-normalized-auto-encoders","slug":"variational-graph-normalized-auto-encoders","title":"Variational Graph Normalized Auto-Encoders","date":"2021-08-18","arxiv_id":"2108.08046","repositories_listed":1,"syntology":null},{"url":"/paper/hopfe-knowledge-graph-representation-learning","slug":"hopfe-knowledge-graph-representation-learning","title":"HopfE: Knowledge Graph Representation Learning using Inverse Hopf Fibrations","date":"2021-08-12","arxiv_id":"2108.05774","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-detection-of-covid-19-vaccine","slug":"automatic-detection-of-covid-19-vaccine","title":"Automatic Detection of COVID-19 Vaccine Misinformation with Graph Link Prediction","date":"2021-08-04","arxiv_id":"2108.02314","repositories_listed":1,"syntology":null},{"url":"/paper/cold-start-similar-artists-ranking-with","slug":"cold-start-similar-artists-ranking-with","title":"Cold Start Similar Artists Ranking with Gravity-Inspired Graph Autoencoders","date":"2021-08-02","arxiv_id":"2108.01053","repositories_listed":1,"syntology":null},{"url":"/paper/okgit-open-knowledge-graph-link-prediction-1","slug":"okgit-open-knowledge-graph-link-prediction-1","title":"OKGIT: Open Knowledge Graph Link Prediction with Implicit Types","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/rod-reception-aware-online-distillation-for","slug":"rod-reception-aware-online-distillation-for","title":"ROD: Reception-aware Online Distillation for Sparse Graphs","date":"2021-07-25","arxiv_id":"2107.11789","repositories_listed":1,"syntology":null},{"url":"/paper/relational-graph-convolutional-networks-a","slug":"relational-graph-convolutional-networks-a","title":"Relational Graph Convolutional Networks: A Closer Look","date":"2021-07-21","arxiv_id":"2107.10015","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/universal-multilayer-network-exploration-by","slug":"universal-multilayer-network-exploration-by","title":"Universal Multilayer Network Exploration by Random Walk with Restart","date":"2021-07-09","arxiv_id":"2107.04565","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/on-generalization-of-graph-autoencoders-with","slug":"on-generalization-of-graph-autoencoders-with","title":"On Generalization of Graph Autoencoders with Adversarial Training","date":"2021-07-06","arxiv_id":"2107.02658","repositories_listed":1,"syntology":null},{"url":"/paper/okgit-open-knowledge-graph-link-prediction","slug":"okgit-open-knowledge-graph-link-prediction","title":"OKGIT: Open Knowledge Graph Link Prediction with Implicit Types","date":"2021-06-24","arxiv_id":"2106.12806","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 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) · 3 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/okgit-open-knowledge-graph-link-prediction#ran","syntology_url":"https://syntology.ai/paper/2106.12806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12806"}},"official":{"repos":["Chandrahasd/OKGIT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-deep-latent-space-model-for-graph","slug":"a-deep-latent-space-model-for-graph","title":"A Deep Latent Space Model for Graph Representation Learning","date":"2021-06-22","arxiv_id":"2106.11721","repositories_listed":1,"syntology":null},{"url":"/paper/neural-concept-formation-in-knowledge-graphs","slug":"neural-concept-formation-in-knowledge-graphs","title":"Neural Concept Formation in Knowledge Graphs","date":"2021-06-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/convdysat-deep-neural-representation-learning","slug":"convdysat-deep-neural-representation-learning","title":"ConvDySAT: Deep Neural Representation Learning on Dynamic Graphs via Self-Attention and Convolutional Neural Networks","date":"2021-06-21","arxiv_id":"2106.11430","repositories_listed":1,"syntology":null},{"url":"/paper/scientific-language-models-for-biomedical","slug":"scientific-language-models-for-biomedical","title":"Scientific Language Models for Biomedical Knowledge Base Completion: An Empirical Study","date":"2021-06-17","arxiv_id":"2106.09700","repositories_listed":1,"syntology":null},{"url":"/paper/query-embedding-on-hyper-relational-knowledge","slug":"query-embedding-on-hyper-relational-knowledge","title":"Query Embedding on Hyper-relational Knowledge Graphs","date":"2021-06-15","arxiv_id":"2106.08166","repositories_listed":1,"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":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) · 3 unverified","sample_list":"/paper/query-embedding-on-hyper-relational-knowledge#ran","syntology_url":"https://syntology.ai/paper/2106.08166","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.08166"}},"official":{"repos":["DimitrisAlivas/StarQE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/unified-interpretation-of-softmax-cross","slug":"unified-interpretation-of-softmax-cross","title":"Unified Interpretation of Softmax Cross-Entropy and Negative Sampling: With Case Study for Knowledge Graph Embedding","date":"2021-06-14","arxiv_id":"2106.07250","repositories_listed":1,"syntology":null},{"url":"/paper/correcting-exposure-bias-for-link","slug":"correcting-exposure-bias-for-link","title":"Correcting Exposure Bias for Link Recommendation","date":"2021-06-13","arxiv_id":"2106.07041","repositories_listed":1,"syntology":null},{"url":"/paper/dyglip-a-dynamic-graph-model-with-link","slug":"dyglip-a-dynamic-graph-model-with-link","title":"DyGLIP: A Dynamic Graph Model with Link Prediction for Accurate Multi-Camera Multiple Object Tracking","date":"2021-06-12","arxiv_id":"2106.06856","repositories_listed":1,"syntology":null},{"url":"/paper/inter-domain-multi-relational-link-prediction","slug":"inter-domain-multi-relational-link-prediction","title":"Inter-domain Multi-relational Link Prediction","date":"2021-06-11","arxiv_id":"2106.06171","repositories_listed":1,"syntology":null},{"url":"/paper/learning-based-proximity-matrix-factorization","slug":"learning-based-proximity-matrix-factorization","title":"Learning Based Proximity Matrix Factorization for Node Embedding","date":"2021-06-10","arxiv_id":"2106.05476","repositories_listed":1,"syntology":null},{"url":"/paper/multiple-kernel-representation-learning-on","slug":"multiple-kernel-representation-learning-on","title":"Multiple Kernel Representation Learning on Networks","date":"2021-06-09","arxiv_id":"2106.05057","repositories_listed":1,"syntology":null},{"url":"/paper/semi-riemannian-graph-convolutional-networks","slug":"semi-riemannian-graph-convolutional-networks","title":"Pseudo-Riemannian Graph Convolutional Networks","date":"2021-06-06","arxiv_id":"2106.03134","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":1,"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/semi-riemannian-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2106.03134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03134"}},"official":{"repos":["xiongbo010/qgcn"],"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/a-systematic-investigation-of-kb-text","slug":"a-systematic-investigation-of-kb-text","title":"A Systematic Investigation of KB-Text Embedding Alignment at Scale","date":"2021-06-03","arxiv_id":"2106.01586","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-graph-learning-for-link","slug":"counterfactual-graph-learning-for-link","title":"Learning from Counterfactual Links for Link Prediction","date":"2021-06-03","arxiv_id":"2106.02172","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":3,"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 3 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; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/counterfactual-graph-learning-for-link#ran","syntology_url":"https://syntology.ai/paper/2106.02172","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02172"}},"official":{"repos":["DM2-ND/CFLP"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/embedding-knowledge-graphs-attentive-to","slug":"embedding-knowledge-graphs-attentive-to","title":"Embedding Knowledge Graphs Attentive to Positional and Centrality Qualities","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/temporal-knowledge-graph-completion-using-a","slug":"temporal-knowledge-graph-completion-using-a","title":"Temporal Knowledge Graph Completion using a Linear Temporal Regularizer and Multivector Embeddings","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hashing-accelerated-graph-neural-networks-for","slug":"hashing-accelerated-graph-neural-networks-for","title":"Hashing-Accelerated Graph Neural Networks for Link Prediction","date":"2021-05-29","arxiv_id":"2105.14280","repositories_listed":1,"syntology":null},{"url":"/paper/out-of-vocabulary-entities-in-link-prediction","slug":"out-of-vocabulary-entities-in-link-prediction","title":"Out-of-Vocabulary Entities in Link Prediction","date":"2021-05-26","arxiv_id":"2105.12524","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-graph-representation-learning-2","slug":"self-supervised-graph-representation-learning-2","title":"Self-Supervised Graph Representation Learning via Topology Transformations","date":"2021-05-25","arxiv_id":"2105.11689","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-graph-representation-learning","slug":"heterogeneous-graph-representation-learning","title":"Heterogeneous Graph Representation Learning with Relation Awareness","date":"2021-05-24","arxiv_id":"2105.11122","repositories_listed":1,"syntology":null},{"url":"/paper/position-sensing-graph-neural-networks","slug":"position-sensing-graph-neural-networks","title":"Position-Sensing Graph Neural Networks: Proactively Learning Nodes Relative Positions","date":"2021-05-24","arxiv_id":"2105.11346","repositories_listed":1,"syntology":null},{"url":"/paper/a-robust-and-generalized-framework-for","slug":"a-robust-and-generalized-framework-for","title":"A Robust and Generalized Framework for Adversarial Graph Embedding","date":"2021-05-22","arxiv_id":"2105.10651","repositories_listed":1,"syntology":null},{"url":"/paper/distance-enhanced-graph-neural-network-for","slug":"distance-enhanced-graph-neural-network-for","title":"Distance-Enhanced Graph Neural Network for Link Prediction","date":"2021-05-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/free-energy-node-embedding-via-generalized","slug":"free-energy-node-embedding-via-generalized","title":"Free Energy Node Embedding via Generalized Skip-gram with Negative Sampling","date":"2021-05-19","arxiv_id":"2105.09182","repositories_listed":1,"syntology":null},{"url":"/paper/quatde-dynamic-quaternion-embedding-for","slug":"quatde-dynamic-quaternion-embedding-for","title":"QuatDE: Dynamic Quaternion Embedding for Knowledge Graph Completion","date":"2021-05-19","arxiv_id":"2105.09002","repositories_listed":1,"syntology":null},{"url":"/paper/link-prediction-on-n-ary-relational-facts-a","slug":"link-prediction-on-n-ary-relational-facts-a","title":"Link Prediction on N-ary Relational Facts: A Graph-based Approach","date":"2021-05-18","arxiv_id":"2105.08476","repositories_listed":1,"syntology":null},{"url":"/paper/machine-learning-on-knowledge-graphs-for","slug":"machine-learning-on-knowledge-graphs-for","title":"Machine learning on knowledge graphs for context-aware security monitoring","date":"2021-05-18","arxiv_id":"2105.08741","repositories_listed":1,"syntology":null},{"url":"/paper/federated-knowledge-graphs-embedding","slug":"federated-knowledge-graphs-embedding","title":"Differentially Private Federated Knowledge Graphs Embedding","date":"2021-05-17","arxiv_id":"2105.07615","repositories_listed":1,"syntology":null},{"url":"/paper/frequent-pattern-mining-in-continuous-time","slug":"frequent-pattern-mining-in-continuous-time","title":"Frequent Pattern Mining in Continuous-time Temporal Networks","date":"2021-05-12","arxiv_id":"2105.06399","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/crosswalk-fairness-enhanced-node#ran","syntology_url":"https://syntology.ai/paper/2105.02725","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.02725"}},"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"]}}},{"url":"/paper/neurallog-a-neural-logic-language-1","slug":"neurallog-a-neural-logic-language-1","title":"NeuralLog: a Neural Logic Language","date":"2021-05-04","arxiv_id":"2105.01442","repositories_listed":1,"syntology":null},{"url":"/paper/biased-edge-dropout-for-enhancing-fairness-in","slug":"biased-edge-dropout-for-enhancing-fairness-in","title":"FairDrop: Biased Edge Dropout for Enhancing Fairness in Graph Representation Learning","date":"2021-04-29","arxiv_id":"2104.14210","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/biased-edge-dropout-for-enhancing-fairness-in#ran","syntology_url":"https://syntology.ai/paper/2104.14210","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14210"}},"official":null}},{"url":"/paper/unsupervised-deep-manifold-attributed-graph","slug":"unsupervised-deep-manifold-attributed-graph","title":"Unsupervised Deep Manifold Attributed Graph Embedding","date":"2021-04-27","arxiv_id":"2104.13048","repositories_listed":1,"syntology":null},{"url":"/paper/link-prediction-on-n-ary-relational-data","slug":"link-prediction-on-n-ary-relational-data","title":"Link Prediction on N-ary Relational Data Based on Relatedness Evaluation","date":"2021-04-21","arxiv_id":"2104.10424","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-graph-neural-networks-for-sequential","slug":"dynamic-graph-neural-networks-for-sequential","title":"Dynamic Graph Neural Networks for Sequential Recommendation","date":"2021-04-15","arxiv_id":"2104.07368","repositories_listed":1,"syntology":null},{"url":"/paper/neptune-neural-powered-tucker-network-for","slug":"neptune-neural-powered-tucker-network-for","title":"NePTuNe: Neural Powered Tucker Network for Knowledge Graph Completion","date":"2021-04-15","arxiv_id":"2104.07824","repositories_listed":1,"syntology":null},{"url":"/paper/node-co-occurrence-based-graph-neural","slug":"node-co-occurrence-based-graph-neural","title":"Node Co-occurrence based Graph Neural Networks for Knowledge Graph Link Prediction","date":"2021-04-15","arxiv_id":"2104.07396","repositories_listed":1,"syntology":null},{"url":"/paper/is-multi-hop-reasoning-really-explainable","slug":"is-multi-hop-reasoning-really-explainable","title":"Is Multi-Hop Reasoning Really Explainable? Towards Benchmarking Reasoning Interpretability","date":"2021-04-14","arxiv_id":"2104.06751","repositories_listed":1,"syntology":null},{"url":"/paper/multiple-run-ensemble-learning-withlow","slug":"multiple-run-ensemble-learning-withlow","title":"Multiple Run Ensemble Learning with Low-Dimensional Knowledge Graph Embeddings","date":"2021-04-11","arxiv_id":"2104.05003","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/the-unknown-knowns-a-graph-based-approach-for","slug":"the-unknown-knowns-a-graph-based-approach-for","title":"The unknown knowns: a graph-based approach for temporal COVID-19 literature mining","date":"2021-03-23","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/demographic-aware-probabilistic-medical","slug":"demographic-aware-probabilistic-medical","title":"Demographic Aware Probabilistic Medical Knowledge Graph Embeddings of Electronic Medical Records","date":"2021-03-22","arxiv_id":"2103.11951","repositories_listed":1,"syntology":null},{"url":"/paper/deepened-graph-auto-encoders-help-stabilize","slug":"deepened-graph-auto-encoders-help-stabilize","title":"Deepened Graph Auto-Encoders Help Stabilize and Enhance Link Prediction","date":"2021-03-21","arxiv_id":"2103.11414","repositories_listed":1,"syntology":null},{"url":"/paper/a-neural-network-for-semigroups","slug":"a-neural-network-for-semigroups","title":"A Neural Network for Semigroups","date":"2021-03-12","arxiv_id":"2103.07388","repositories_listed":1,"syntology":null},{"url":"/paper/topology-aware-correlations-between-relations","slug":"topology-aware-correlations-between-relations","title":"Topology-Aware Correlations Between Relations for Inductive Link Prediction in Knowledge Graphs","date":"2021-03-05","arxiv_id":"2103.03642","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"4 ran (of which 4 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) · 2 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/topology-aware-correlations-between-relations#ran","syntology_url":"https://syntology.ai/paper/2103.03642","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.03642"}},"official":{"repos":["MIRALab-USTC/KG-TACT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/oag-bert-pre-train-heterogeneous-entity","slug":"oag-bert-pre-train-heterogeneous-entity","title":"OAG-BERT: Towards A Unified Backbone Language Model For Academic Knowledge Services","date":"2021-03-03","arxiv_id":"2103.02410","repositories_listed":1,"syntology":null},{"url":"/paper/cogdl-an-extensive-toolkit-for-deep-learning","slug":"cogdl-an-extensive-toolkit-for-deep-learning","title":"CogDL: A Comprehensive Library for Graph Deep Learning","date":"2021-03-01","arxiv_id":"2103.00959","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-auxiliary-learning-for-graph","slug":"self-supervised-auxiliary-learning-for-graph","title":"Self-supervised Auxiliary Learning for Graph Neural Networks via Meta-Learning","date":"2021-03-01","arxiv_id":"2103.00771","repositories_listed":1,"syntology":null}],"record_sha256":"fba1e0b4f4112b01aba6c8e335cfede8fb00d3ac4037f8baed7dbc5a2507910b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}