{"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/2","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":2,"pages_in_order":20,"rows_per_page":100,"rows":[101,200],"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","next":"/task/link-prediction/papers/3","papers":[{"url":"/paper/mlpinit-embarrassingly-simple-gnn-training","slug":"mlpinit-embarrassingly-simple-gnn-training","title":"MLPInit: Embarrassingly Simple GNN Training Acceleration with MLP Initialization","date":"2022-09-30","arxiv_id":"2210.00102","repositories_listed":2,"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/mlpinit-embarrassingly-simple-gnn-training#ran","syntology_url":"https://syntology.ai/paper/2210.00102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00102"}},"official":{"repos":["snap-research/MLPInit-for-GNNs"],"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/predicting-the-future-of-ai-with-ai-high","slug":"predicting-the-future-of-ai-with-ai-high","title":"Predicting the Future of AI with AI: High-quality link prediction in an exponentially growing knowledge network","date":"2022-09-23","arxiv_id":"2210.00881","repositories_listed":2,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/predicting-the-future-of-ai-with-ai-high#ran","syntology_url":"https://syntology.ai/paper/2210.00881","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00881"}},"official":{"repos":["artificial-scientist-lab/futureofaiviaai","mariokrenn6240/futureofaiviaai"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/neighborhood-aware-scalable-temporal-network","slug":"neighborhood-aware-scalable-temporal-network","title":"Neighborhood-aware Scalable Temporal Network Representation Learning","date":"2022-09-02","arxiv_id":"2209.01084","repositories_listed":2,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/neighborhood-aware-scalable-temporal-network#ran","syntology_url":"https://syntology.ai/paper/2209.01084","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.01084"}},"official":{"repos":["graph-com/neighborhood-aware-temporal-network"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/roland-graph-learning-framework-for-dynamic","slug":"roland-graph-learning-framework-for-dynamic","title":"ROLAND: Graph Learning Framework for Dynamic Graphs","date":"2022-08-15","arxiv_id":"2208.07239","repositories_listed":2,"syntology":null},{"url":"/paper/start-small-think-big-on-hyperparameter","slug":"start-small-think-big-on-hyperparameter","title":"Start Small, Think Big: On Hyperparameter Optimization for Large-Scale Knowledge Graph Embeddings","date":"2022-07-11","arxiv_id":"2207.04979","repositories_listed":2,"syntology":null},{"url":"/paper/nafs-a-simple-yet-tough-to-beat-baseline-for-1","slug":"nafs-a-simple-yet-tough-to-beat-baseline-for-1","title":"NAFS: A Simple yet Tough-to-beat Baseline for Graph Representation Learning","date":"2022-06-17","arxiv_id":"2206.08583","repositories_listed":2,"syntology":null},{"url":"/paper/long-range-graph-benchmark","slug":"long-range-graph-benchmark","title":"Long Range Graph Benchmark","date":"2022-06-16","arxiv_id":"2206.08164","repositories_listed":2,"syntology":null},{"url":"/paper/maskgae-masked-graph-modeling-meets-graph","slug":"maskgae-masked-graph-modeling-meets-graph","title":"What's Behind the Mask: Understanding Masked Graph Modeling for Graph Autoencoders","date":"2022-05-20","arxiv_id":"2205.10053","repositories_listed":2,"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/maskgae-masked-graph-modeling-meets-graph#ran","syntology_url":"https://syntology.ai/paper/2205.10053","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10053"}},"official":{"repos":["edisonleeeee/maskgae","pyg-team/pytorch_geometric"],"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/pie-a-parameter-and-inference-efficient","slug":"pie-a-parameter-and-inference-efficient","title":"PIE: a Parameter and Inference Efficient Solution for Large Scale Knowledge Graph Embedding Reasoning","date":"2022-04-29","arxiv_id":"2204.13957","repositories_listed":2,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/pie-a-parameter-and-inference-efficient#ran","syntology_url":"https://syntology.ai/paper/2204.13957","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.13957"}},"official":{"repos":["alipay/parameter_inference_efficient_pie"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/tgl-a-general-framework-for-temporal-gnn","slug":"tgl-a-general-framework-for-temporal-gnn","title":"TGL: A General Framework for Temporal GNN Training on Billion-Scale Graphs","date":"2022-03-28","arxiv_id":"2203.14883","repositories_listed":2,"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":5,"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/tgl-a-general-framework-for-temporal-gnn#ran","syntology_url":"https://syntology.ai/paper/2203.14883","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.14883"}},"official":{"repos":["amazon-research/tgl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a-unified-framework-for-rank-based-evaluation","slug":"a-unified-framework-for-rank-based-evaluation","title":"A Unified Framework for Rank-based Evaluation Metrics for Link Prediction in Knowledge Graphs","date":"2022-03-14","arxiv_id":"2203.07544","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/a-unified-framework-for-rank-based-evaluation#ran","syntology_url":"https://syntology.ai/paper/2203.07544","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.07544"}},"official":{"repos":["pykeen/pykeen","pykeen/ranking-metrics-manuscript"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/simkgc-simple-contrastive-knowledge-graph","slug":"simkgc-simple-contrastive-knowledge-graph","title":"SimKGC: Simple Contrastive Knowledge Graph Completion with Pre-trained Language Models","date":"2022-03-04","arxiv_id":"2203.02167","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":3,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/simkgc-simple-contrastive-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2203.02167","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.02167"}},"official":{"repos":["intfloat/simkgc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/pairwise-learning-for-neural-link-prediction","slug":"pairwise-learning-for-neural-link-prediction","title":"Pairwise Learning for Neural Link Prediction","date":"2021-12-06","arxiv_id":"2112.02936","repositories_listed":2,"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":3,"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/pairwise-learning-for-neural-link-prediction#ran","syntology_url":"https://syntology.ai/paper/2112.02936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.02936"}},"official":{"repos":["zhitao-wang/plnlp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/rot-pro-modeling-transitivity-by-projection","slug":"rot-pro-modeling-transitivity-by-projection","title":"Rot-Pro: Modeling Transitivity by Projection in Knowledge Graph Embedding","date":"2021-10-27","arxiv_id":"2110.14450","repositories_listed":2,"syntology":null},{"url":"/paper/a-probabilistic-framework-for-knowledge-graph","slug":"a-probabilistic-framework-for-knowledge-graph","title":"A Probabilistic Framework for Knowledge Graph Data Augmentation","date":"2021-10-25","arxiv_id":"2110.13205","repositories_listed":2,"syntology":null},{"url":"/paper/grape-fast-and-scalable-graph-processing-and","slug":"grape-fast-and-scalable-graph-processing-and","title":"GRAPE for Fast and Scalable Graph Processing and random walk-based Embedding","date":"2021-10-12","arxiv_id":"2110.06196","repositories_listed":2,"syntology":null},{"url":"/paper/fuzzy-logic-based-logical-query-answering-on","slug":"fuzzy-logic-based-logical-query-answering-on","title":"Fuzzy Logic Based Logical Query Answering on Knowledge Graphs","date":"2021-08-05","arxiv_id":"2108.02390","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":3,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"8 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; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fuzzy-logic-based-logical-query-answering-on#ran","syntology_url":"https://syntology.ai/paper/2108.02390","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.02390"}},"official":null}},{"url":"/paper/local2global-scaling-global-representation","slug":"local2global-scaling-global-representation","title":"Local2Global: Scaling global representation learning on graphs via local training","date":"2021-07-26","arxiv_id":"2107.12224","repositories_listed":2,"syntology":null},{"url":"/paper/improving-inductive-link-prediction-using","slug":"improving-inductive-link-prediction-using","title":"Improving Inductive Link Prediction Using Hyper-Relational Facts","date":"2021-07-10","arxiv_id":"2107.04894","repositories_listed":2,"syntology":null},{"url":"/paper/asymptotics-of-network-embeddings-learned-via","slug":"asymptotics-of-network-embeddings-learned-via","title":"Asymptotics of Network Embeddings Learned via Subsampling","date":"2021-07-06","arxiv_id":"2107.02363","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/asymptotics-of-network-embeddings-learned-via#ran","syntology_url":"https://syntology.ai/paper/2107.02363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.02363"}},"official":{"repos":["aday651/embed-asym-exeriments","aday651/embed-asym-experiments"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/edge-proposal-sets-for-link-prediction","slug":"edge-proposal-sets-for-link-prediction","title":"Edge Proposal Sets for Link Prediction","date":"2021-06-30","arxiv_id":"2106.15810","repositories_listed":2,"syntology":null},{"url":"/paper/convolutional-hypercomplex-embeddings-for","slug":"convolutional-hypercomplex-embeddings-for","title":"Convolutional Hypercomplex Embeddings for Link Prediction","date":"2021-06-29","arxiv_id":"2106.15230","repositories_listed":2,"syntology":null},{"url":"/paper/multiresolution-graph-variational-autoencoder","slug":"multiresolution-graph-variational-autoencoder","title":"Multiresolution Equivariant Graph Variational Autoencoder","date":"2021-06-02","arxiv_id":"2106.00967","repositories_listed":2,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":5,"n_honours":3,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 3 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/multiresolution-graph-variational-autoencoder#ran","syntology_url":"https://syntology.ai/paper/2106.00967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.00967"}},"official":{"repos":["hytruongson/mgvae"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/gipa-general-information-propagation","slug":"gipa-general-information-propagation","title":"GIPA: General Information Propagation Algorithm for Graph Learning","date":"2021-05-13","arxiv_id":"2105.06035","repositories_listed":2,"syntology":null},{"url":"/paper/neural-multi-hop-reasoning-with-logical-rules","slug":"neural-multi-hop-reasoning-with-logical-rules","title":"Neural Multi-Hop Reasoning With Logical Rules on Biomedical Knowledge Graphs","date":"2021-03-18","arxiv_id":"2103.10367","repositories_listed":2,"syntology":null},{"url":"/paper/evaluating-node-embeddings-of-complex","slug":"evaluating-node-embeddings-of-complex","title":"Evaluating Node Embeddings of Complex Networks","date":"2021-02-16","arxiv_id":"2102.08275","repositories_listed":2,"syntology":null},{"url":"/paper/a-unified-lottery-ticket-hypothesis-for-graph","slug":"a-unified-lottery-ticket-hypothesis-for-graph","title":"A Unified Lottery Ticket Hypothesis for Graph Neural Networks","date":"2021-02-12","arxiv_id":"2102.06790","repositories_listed":2,"syntology":null},{"url":"/paper/memory-associated-differential-learning","slug":"memory-associated-differential-learning","title":"Memory-Associated Differential Learning","date":"2021-02-10","arxiv_id":"2102.05246","repositories_listed":2,"syntology":null},{"url":"/paper/cleora-a-simple-strong-and-scalable-graph","slug":"cleora-a-simple-strong-and-scalable-graph","title":"Cleora: A Simple, Strong and Scalable Graph Embedding Scheme","date":"2021-02-03","arxiv_id":"2102.02302","repositories_listed":2,"syntology":null},{"url":"/paper/xerte-explainable-reasoning-on-temporal","slug":"xerte-explainable-reasoning-on-temporal","title":"xERTE: Explainable Reasoning on Temporal Knowledge Graphs for Forecasting Future Links","date":"2020-12-31","arxiv_id":"2012.15537","repositories_listed":2,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":7,"phrase":"3 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/xerte-explainable-reasoning-on-temporal#ran","syntology_url":"https://syntology.ai/paper/2012.15537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.15537"}},"official":{"repos":["TemporalKGTeam/xERTE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/pairre-knowledge-graph-embeddings-via-paired","slug":"pairre-knowledge-graph-embeddings-via-paired","title":"PairRE: Knowledge Graph Embeddings via Paired Relation Vectors","date":"2020-11-07","arxiv_id":"2011.03798","repositories_listed":2,"syntology":null},{"url":"/paper/revisiting-graph-neural-networks-for-link-1","slug":"revisiting-graph-neural-networks-for-link-1","title":"Labeling Trick: A Theory of Using Graph Neural Networks for Multi-Node Representation Learning","date":"2020-10-30","arxiv_id":"2010.16103","repositories_listed":2,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/revisiting-graph-neural-networks-for-link-1#ran","syntology_url":"https://syntology.ai/paper/2010.16103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.16103"}},"official":{"repos":["facebookresearch/SEAL_OGB"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/line-graph-neural-networks-for-link","slug":"line-graph-neural-networks-for-link","title":"Line Graph Neural Networks for Link Prediction","date":"2020-10-20","arxiv_id":"2010.10046","repositories_listed":2,"syntology":null},{"url":"/paper/inductive-entity-representations-from-text","slug":"inductive-entity-representations-from-text","title":"Inductive Entity Representations from Text via Link Prediction","date":"2020-10-07","arxiv_id":"2010.03496","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/inductive-entity-representations-from-text#ran","syntology_url":"https://syntology.ai/paper/2010.03496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03496"}},"official":{"repos":["dfdazac/blp"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tero-a-time-aware-knowledge-graph-embedding","slug":"tero-a-time-aware-knowledge-graph-embedding","title":"TeRo: A Time-aware Knowledge Graph Embedding via Temporal Rotation","date":"2020-10-02","arxiv_id":"2010.01029","repositories_listed":2,"syntology":null},{"url":"/paper/codex-a-comprehensive-knowledge-graph","slug":"codex-a-comprehensive-knowledge-graph","title":"CoDEx: A Comprehensive Knowledge Graph Completion Benchmark","date":"2020-09-16","arxiv_id":"2009.07810","repositories_listed":2,"syntology":null},{"url":"/paper/graph-infoclust-leveraging-cluster-level-node","slug":"graph-infoclust-leveraging-cluster-level-node","title":"Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learning","date":"2020-09-15","arxiv_id":"2009.06946","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-infoclust-leveraging-cluster-level-node#ran","syntology_url":"https://syntology.ai/paper/2009.06946","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.06946"}},"official":null}},{"url":"/paper/distance-encoding-design-provably-more","slug":"distance-encoding-design-provably-more","title":"Distance Encoding: Design Provably More Powerful Neural Networks for Graph Representation Learning","date":"2020-08-31","arxiv_id":"2009.00142","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/distance-encoding-design-provably-more#ran","syntology_url":"https://syntology.ai/paper/2009.00142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.00142"}},"official":{"repos":["snap-stanford/distance-encoding"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/relational-reflection-entity-alignment","slug":"relational-reflection-entity-alignment","title":"Relational Reflection Entity Alignment","date":"2020-08-18","arxiv_id":"2008.07962","repositories_listed":2,"syntology":null},{"url":"/paper/convolutional-complex-knowledge-graph","slug":"convolutional-complex-knowledge-graph","title":"Convolutional Complex Knowledge Graph Embeddings","date":"2020-08-07","arxiv_id":"2008.03130","repositories_listed":2,"syntology":null},{"url":"/paper/pykeen-1-0-a-python-library-for-training-and","slug":"pykeen-1-0-a-python-library-for-training-and","title":"PyKEEN 1.0: A Python Library for Training and Evaluating Knowledge Graph Embeddings","date":"2020-07-28","arxiv_id":"2007.14175","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/pykeen-1-0-a-python-library-for-training-and#ran","syntology_url":"https://syntology.ai/paper/2007.14175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.14175"}},"official":{"repos":["pykeen/pykeen"],"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/learning-reasoning-strategies-in-end-to-end","slug":"learning-reasoning-strategies-in-end-to-end","title":"Learning Reasoning Strategies in End-to-End Differentiable Proving","date":"2020-07-13","arxiv_id":"2007.06477","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"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) · 2 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/learning-reasoning-strategies-in-end-to-end#ran","syntology_url":"https://syntology.ai/paper/2007.06477","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.06477"}},"official":{"repos":["uclnlp/ctp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-convolutional-networks-for-graphs","slug":"graph-convolutional-networks-for-graphs","title":"Graph Convolutional Networks for Graphs Containing Missing Features","date":"2020-07-09","arxiv_id":"2007.04583","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/graph-convolutional-networks-for-graphs#ran","syntology_url":"https://syntology.ai/paper/2007.04583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04583"}},"official":{"repos":["marblet/GCNmf"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-multi-hop-question-answering-over","slug":"improving-multi-hop-question-answering-over","title":"Improving Multi-hop Question Answering over Knowledge Graphs using Knowledge Base Embeddings","date":"2020-07-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/multi-partition-embedding-interaction-with","slug":"multi-partition-embedding-interaction-with","title":"Multi-Partition Embedding Interaction with Block Term Format for Knowledge Graph Completion","date":"2020-06-29","arxiv_id":"2006.16365","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/you-can-teach-an-old-dog-new-tricks-on","slug":"you-can-teach-an-old-dog-new-tricks-on","title":"You CAN Teach an Old Dog New Tricks! On Training Knowledge Graph Embeddings","date":"2020-05-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/tensor-decompositions-for-temporal-knowledge-1","slug":"tensor-decompositions-for-temporal-knowledge-1","title":"Tensor Decompositions for temporal knowledge base completion","date":"2020-04-10","arxiv_id":"2004.04926","repositories_listed":2,"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/tensor-decompositions-for-temporal-knowledge-1#ran","syntology_url":"https://syntology.ai/paper/2004.04926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.04926"}},"official":{"repos":["facebookresearch/tkbc"],"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/a-survey-of-adversarial-learning-on-graphs","slug":"a-survey-of-adversarial-learning-on-graphs","title":"A Survey of Adversarial Learning on Graphs","date":"2020-03-10","arxiv_id":"2003.05730","repositories_listed":2,"syntology":null},{"url":"/paper/end-to-end-emotion-cause-pair-extraction-via","slug":"end-to-end-emotion-cause-pair-extraction-via","title":"End-to-end Emotion-Cause Pair Extraction via Learning to Link","date":"2020-02-25","arxiv_id":"2002.10710","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"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 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) · 0 unverified","sample_list":"/paper/end-to-end-emotion-cause-pair-extraction-via#ran","syntology_url":"https://syntology.ai/paper/2002.10710","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10710"}},"official":{"repos":["shl5133/E2EECPE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/magnn-metapath-aggregated-graph-neural","slug":"magnn-metapath-aggregated-graph-neural","title":"MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding","date":"2020-02-05","arxiv_id":"2002.01680","repositories_listed":2,"syntology":null},{"url":"/paper/exem-expert-embedding-using-dominating-set","slug":"exem-expert-embedding-using-dominating-set","title":"ExEm: Expert Embedding using dominating set theory with deep learning approaches","date":"2020-01-16","arxiv_id":"2001.08503","repositories_listed":2,"syntology":null},{"url":"/paper/reasoning-on-knowledge-graphs-with-debate","slug":"reasoning-on-knowledge-graphs-with-debate","title":"Reasoning on Knowledge Graphs with Debate Dynamics","date":"2020-01-02","arxiv_id":"2001.00461","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/reasoning-on-knowledge-graphs-with-debate#ran","syntology_url":"https://syntology.ai/paper/2001.00461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.00461"}},"official":{"repos":["m-hildebrandt/R2D2"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/temporal-knowledge-graph-embedding-model","slug":"temporal-knowledge-graph-embedding-model","title":"Temporal Knowledge Graph Embedding Model based on Additive Time Series Decomposition","date":"2019-11-18","arxiv_id":"1911.07893","repositories_listed":2,"syntology":null},{"url":"/paper/a-re-evaluation-of-knowledge-graph-completion","slug":"a-re-evaluation-of-knowledge-graph-completion","title":"A Re-evaluation of Knowledge Graph Completion Methods","date":"2019-11-10","arxiv_id":"1911.03903","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-re-evaluation-of-knowledge-graph-completion#ran","syntology_url":"https://syntology.ai/paper/1911.03903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03903"}},"official":{"repos":["svjan5/kg-reeval"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-graph-embedding-methods-for-natural","slug":"neural-graph-embedding-methods-for-natural","title":"Neural Graph Embedding Methods for Natural Language Processing","date":"2019-11-08","arxiv_id":"1911.03042","repositories_listed":2,"syntology":null},{"url":"/paper/stacking-models-for-nearly-optimal-link","slug":"stacking-models-for-nearly-optimal-link","title":"Stacking Models for Nearly Optimal Link Prediction in Complex Networks","date":"2019-09-17","arxiv_id":"1909.07578","repositories_listed":2,"syntology":null},{"url":"/paper/variational-graph-recurrent-neural-networks","slug":"variational-graph-recurrent-neural-networks","title":"Variational Graph Recurrent Neural Networks","date":"2019-08-26","arxiv_id":"1908.09710","repositories_listed":2,"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/variational-graph-recurrent-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1908.09710","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.09710"}},"official":{"repos":["VGraphRNN/VGRNN"],"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/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/position-aware-graph-neural-networks","slug":"position-aware-graph-neural-networks","title":"Position-aware Graph Neural Networks","date":"2019-06-11","arxiv_id":"1906.04817","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/position-aware-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1906.04817","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.04817"}},"official":{"repos":["JiaxuanYou/P-GNN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-attention-based-embeddings-for","slug":"learning-attention-based-embeddings-for","title":"Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs","date":"2019-06-04","arxiv_id":"1906.01195","repositories_listed":2,"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/learning-attention-based-embeddings-for#ran","syntology_url":"https://syntology.ai/paper/1906.01195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01195"}},"official":{"repos":["deepakn97/relationPrediction"],"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/mde-multi-distance-embeddings-for-link","slug":"mde-multi-distance-embeddings-for-link","title":"MDE: Multiple Distance Embeddings for Link Prediction in Knowledge Graphs","date":"2019-05-25","arxiv_id":"1905.10702","repositories_listed":2,"syntology":null},{"url":"/paper/neighborhood-enlargement-in-graph-neural","slug":"neighborhood-enlargement-in-graph-neural","title":"Mutual Information Maximization in Graph Neural Networks","date":"2019-05-21","arxiv_id":"1905.08509","repositories_listed":2,"syntology":null},{"url":"/paper/correlated-variational-auto-encoders","slug":"correlated-variational-auto-encoders","title":"Correlated Variational Auto-Encoders","date":"2019-05-14","arxiv_id":"1905.05335","repositories_listed":2,"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":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/correlated-variational-auto-encoders#ran","syntology_url":"https://syntology.ai/paper/1905.05335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05335"}},"official":{"repos":["datang1992/Correlated-VAEs"],"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/is-a-single-embedding-enough-learning-node","slug":"is-a-single-embedding-enough-learning-node","title":"Is a Single Embedding Enough? Learning Node Representations that Capture Multiple Social Contexts","date":"2019-05-06","arxiv_id":"1905.02138","repositories_listed":2,"syntology":null},{"url":"/paper/dyrep-learning-representations-over-dynamic","slug":"dyrep-learning-representations-over-dynamic","title":"DyRep: Learning Representations over Dynamic Graphs","date":"2019-05-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/recurrent-event-network-for-reasoning-over","slug":"recurrent-event-network-for-reasoning-over","title":"Recurrent Event Network: Autoregressive Structure Inference over Temporal Knowledge Graphs","date":"2019-04-11","arxiv_id":"1904.05530","repositories_listed":2,"syntology":null},{"url":"/paper/dynamic-graph-representation-learning-via","slug":"dynamic-graph-representation-learning-via","title":"Dynamic Graph Representation Learning via Self-Attention Networks","date":"2018-12-22","arxiv_id":"1812.09430","repositories_listed":2,"syntology":null},{"url":"/paper/a-simple-yet-effective-baseline-for-non","slug":"a-simple-yet-effective-baseline-for-non","title":"A simple yet effective baseline for non-attributed graph classification","date":"2018-11-08","arxiv_id":"1811.03508","repositories_listed":2,"syntology":null},{"url":"/paper/streaming-graph-neural-networks","slug":"streaming-graph-neural-networks","title":"Streaming Graph Neural Networks","date":"2018-10-24","arxiv_id":"1810.10627","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/embedding-multimodal-relational-data-for","slug":"embedding-multimodal-relational-data-for","title":"Embedding Multimodal Relational Data for Knowledge Base Completion","date":"2018-09-05","arxiv_id":"1809.01341","repositories_listed":2,"syntology":null},{"url":"/paper/a-capsule-network-based-embedding-model-for-1","slug":"a-capsule-network-based-embedding-model-for-1","title":"A Capsule Network-based Embedding Model for Knowledge Graph Completion and Search Personalization","date":"2018-08-13","arxiv_id":"1808.04122","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-capsule-network-based-embedding-model-for-1#ran","syntology_url":"https://syntology.ai/paper/1808.04122","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.04122"}},"official":{"repos":["daiquocnguyen/CapsE"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/jack-the-reader-a-machine-reading-framework","slug":"jack-the-reader-a-machine-reading-framework","title":"Jack the Reader - A Machine Reading Framework","date":"2018-06-20","arxiv_id":"1806.08727","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/verse-versatile-graph-embeddings-from","slug":"verse-versatile-graph-embeddings-from","title":"VERSE: Versatile Graph Embeddings from Similarity Measures","date":"2018-03-13","arxiv_id":"1803.04742","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/verse-versatile-graph-embeddings-from#ran","syntology_url":"https://syntology.ai/paper/1803.04742","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.04742"}},"official":{"repos":["xgfs/verse"],"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/netgan-generating-graphs-via-random-walks","slug":"netgan-generating-graphs-via-random-walks","title":"NetGAN: Generating Graphs via Random Walks","date":"2018-03-02","arxiv_id":"1803.00816","repositories_listed":2,"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/netgan-generating-graphs-via-random-walks#ran","syntology_url":"https://syntology.ai/paper/1803.00816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.00816"}},"official":null}},{"url":"/paper/learning-to-make-predictions-on-graphs-with","slug":"learning-to-make-predictions-on-graphs-with","title":"Learning to Make Predictions on Graphs with Autoencoders","date":"2018-02-23","arxiv_id":"1802.08352","repositories_listed":2,"syntology":null},{"url":"/paper/simplicial-closure-and-higher-order-link","slug":"simplicial-closure-and-higher-order-link","title":"Simplicial Closure and higher-order link prediction","date":"2018-02-20","arxiv_id":"1802.06916","repositories_listed":2,"syntology":null},{"url":"/paper/simple-embedding-for-link-prediction-in","slug":"simple-embedding-for-link-prediction-in","title":"SimplE Embedding for Link Prediction in Knowledge Graphs","date":"2018-02-13","arxiv_id":"1802.04868","repositories_listed":2,"syntology":null},{"url":"/paper/a-novel-embedding-model-for-knowledge-base","slug":"a-novel-embedding-model-for-knowledge-base","title":"A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Network","date":"2017-12-06","arxiv_id":"1712.02121","repositories_listed":2,"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/a-novel-embedding-model-for-knowledge-base#ran","syntology_url":"https://syntology.ai/paper/1712.02121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.02121"}},"official":{"repos":["daiquocnguyen/ConvKB"],"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/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/watch-your-step-learning-node-embeddings-via","slug":"watch-your-step-learning-node-embeddings-via","title":"Watch Your Step: Learning Node Embeddings via Graph Attention","date":"2017-10-26","arxiv_id":"1710.09599","repositories_listed":2,"syntology":null},{"url":"/paper/an-overview-of-embedding-models-of-entities","slug":"an-overview-of-embedding-models-of-entities","title":"A survey of embedding models of entities and relationships for knowledge graph completion","date":"2017-03-23","arxiv_id":"1703.08098","repositories_listed":2,"syntology":null},{"url":"/paper/knowledge-graph-completion-via-complex-tensor","slug":"knowledge-graph-completion-via-complex-tensor","title":"Knowledge Graph Completion via Complex Tensor Factorization","date":"2017-02-22","arxiv_id":"1702.06879","repositories_listed":2,"syntology":null},{"url":"/paper/inferring-networks-of-substitutable-and","slug":"inferring-networks-of-substitutable-and","title":"Inferring Networks of Substitutable and Complementary Products","date":"2015-06-29","arxiv_id":"1506.08839","repositories_listed":2,"syntology":null},{"url":"/paper/combining-two-and-three-way-embeddings-models","slug":"combining-two-and-three-way-embeddings-models","title":"Combining Two And Three-Way Embeddings Models for Link Prediction in Knowledge Bases","date":"2015-06-02","arxiv_id":"1506.00999","repositories_listed":2,"syntology":null},{"url":"/paper/learning-entity-and-relation-embeddings-for","slug":"learning-entity-and-relation-embeddings-for","title":"Learning Entity and Relation Embeddings for Knowledge Graph Completion","date":"2015-01-25","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/graph-collaborative-attention-network-for","slug":"graph-collaborative-attention-network-for","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","date":"2025-07-05","arxiv_id":"2507.03947","repositories_listed":1,"syntology":null},{"url":"/paper/demystifying-distributed-training-of-graph","slug":"demystifying-distributed-training-of-graph","title":"Demystifying Distributed Training of Graph Neural Networks for Link Prediction","date":"2025-06-25","arxiv_id":"2506.20818","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-of-link-prediction-in-n-ary","slug":"a-survey-of-link-prediction-in-n-ary","title":"A Survey of Link Prediction in N-ary Knowledge Graphs","date":"2025-06-10","arxiv_id":"2506.08970","repositories_listed":1,"syntology":null},{"url":"/paper/learnable-spatial-temporal-positional","slug":"learnable-spatial-temporal-positional","title":"Learnable Spatial-Temporal Positional Encoding for Link Prediction","date":"2025-06-10","arxiv_id":"2506.08309","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learnable-spatial-temporal-positional#ran","syntology_url":"https://syntology.ai/paper/2506.08309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.08309"}},"official":{"repos":["kthrn22/l-step"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/invariant-link-selector-for-spatial-temporal","slug":"invariant-link-selector-for-spatial-temporal","title":"Invariant Link Selector for Spatial-Temporal Out-of-Distribution Problem","date":"2025-05-30","arxiv_id":"2505.24178","repositories_listed":1,"syntology":null},{"url":"/paper/genic-an-llm-based-framework-for-instance","slug":"genic-an-llm-based-framework-for-instance","title":"GenIC: An LLM-Based Framework for Instance Completion in Knowledge Graphs","date":"2025-05-29","arxiv_id":"2505.24036","repositories_listed":1,"syntology":null},{"url":"/paper/broad-spectrum-structure-discovery-in-large","slug":"broad-spectrum-structure-discovery-in-large","title":"Broad Spectrum Structure Discovery in Large-Scale Higher-Order Networks","date":"2025-05-27","arxiv_id":"2505.21748","repositories_listed":1,"syntology":null},{"url":"/paper/future-link-prediction-without-memory-or","slug":"future-link-prediction-without-memory-or","title":"Future Link Prediction Without Memory or Aggregation","date":"2025-05-26","arxiv_id":"2505.19408","repositories_listed":1,"syntology":null},{"url":"/paper/2505-11185","slug":"2505-11185","title":"VitaGraph: Building a Knowledge Graph for Biologically Relevant Learning Tasks","date":"2025-05-16","arxiv_id":"2505.11185","repositories_listed":1,"syntology":null},{"url":"/paper/must-multi-scale-structural-temporal-link","slug":"must-multi-scale-structural-temporal-link","title":"MUST: Multi-Scale Structural-Temporal Link Prediction Model for UAV Ad Hoc Networks","date":"2025-05-14","arxiv_id":"2505.09331","repositories_listed":1,"syntology":null},{"url":"/paper/social-biases-in-knowledge-representations-of","slug":"social-biases-in-knowledge-representations-of","title":"Social Biases in Knowledge Representations of Wikidata separates Global North from Global South","date":"2025-05-05","arxiv_id":"2505.02352","repositories_listed":1,"syntology":null}],"record_sha256":"a8d5fcf2bb40836670b20359d9ec5aab83ea62486910376100757adcd2405d3b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}