{"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/6","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":6,"pages_in_order":20,"rows_per_page":100,"rows":[501,600],"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/5","next":"/task/link-prediction/papers/7","papers":[{"url":"/paper/line-graph-contrastive-learning-for-link","slug":"line-graph-contrastive-learning-for-link","title":"Line Graph Contrastive Learning for Link Prediction","date":"2022-10-25","arxiv_id":"2210.13795","repositories_listed":1,"syntology":null},{"url":"/paper/palt-parameter-lite-transfer-of-language","slug":"palt-parameter-lite-transfer-of-language","title":"PALT: Parameter-Lite Transfer of Language Models for Knowledge Graph Completion","date":"2022-10-25","arxiv_id":"2210.13715","repositories_listed":1,"syntology":null},{"url":"/paper/rule-neural-symbolic-knowledge-graph","slug":"rule-neural-symbolic-knowledge-graph","title":"RulE: Knowledge Graph Reasoning with Rule Embedding","date":"2022-10-24","arxiv_id":"2210.14905","repositories_listed":1,"syntology":null},{"url":"/paper/dycsc-modeling-the-evolutionary-process-of","slug":"dycsc-modeling-the-evolutionary-process-of","title":"DyCSC: Modeling the Evolutionary Process of Dynamic Networks Based on Cluster Structure","date":"2022-10-23","arxiv_id":"2210.12690","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-graph-counterfactual-explanations","slug":"a-survey-on-graph-counterfactual-explanations","title":"A Survey on Graph Counterfactual Explanations: Definitions, Methods, Evaluation, and Research Challenges","date":"2022-10-21","arxiv_id":"2210.12089","repositories_listed":1,"syntology":null},{"url":"/paper/along-the-time-timeline-traced-embedding-for","slug":"along-the-time-timeline-traced-embedding-for","title":"Along the Time: Timeline-traced Embedding for Temporal Knowledge Graph Completion","date":"2022-10-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/parameter-free-dynamic-graph-embedding-for","slug":"parameter-free-dynamic-graph-embedding-for","title":"Parameter-free Dynamic Graph Embedding for Link Prediction","date":"2022-10-15","arxiv_id":"2210.08189","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/parameter-free-dynamic-graph-embedding-for#ran","syntology_url":"https://syntology.ai/paper/2210.08189","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.08189"}},"official":{"repos":["fudancisl/freegem"],"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/metafill-text-infilling-for-meta-path","slug":"metafill-text-infilling-for-meta-path","title":"MetaFill: Text Infilling for Meta-Path Generation on Heterogeneous Information Networks","date":"2022-10-14","arxiv_id":"2210.07488","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-logical-query-answering-in","slug":"inductive-logical-query-answering-in","title":"Inductive Logical Query Answering in Knowledge Graphs","date":"2022-10-13","arxiv_id":"2210.08008","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 1 unverified","sample_list":"/paper/inductive-logical-query-answering-in#ran","syntology_url":"https://syntology.ai/paper/2210.08008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.08008"}},"official":null}},{"url":"/paper/smile-schema-augmented-multi-level","slug":"smile-schema-augmented-multi-level","title":"SMiLE: Schema-augmented Multi-level Contrastive Learning for Knowledge Graph Link Prediction","date":"2022-10-10","arxiv_id":"2210.04870","repositories_listed":1,"syntology":null},{"url":"/paper/towards-real-time-temporal-graph-learning","slug":"towards-real-time-temporal-graph-learning","title":"Towards Real-Time Temporal Graph Learning","date":"2022-10-08","arxiv_id":"2210.04114","repositories_listed":1,"syntology":null},{"url":"/paper/geodesic-graph-neural-network-for-efficient","slug":"geodesic-graph-neural-network-for-efficient","title":"Geodesic Graph Neural Network for Efficient Graph Representation Learning","date":"2022-10-06","arxiv_id":"2210.02636","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/geodesic-graph-neural-network-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2210.02636","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.02636"}},"official":{"repos":["woodcutter1998/gdgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-task-self-supervised-graph-neural","slug":"multi-task-self-supervised-graph-neural","title":"Multi-task Self-supervised Graph Neural Networks Enable Stronger Task Generalization","date":"2022-10-05","arxiv_id":"2210.02016","repositories_listed":1,"syntology":null},{"url":"/paper/a-framework-for-large-scale-synthetic-graph","slug":"a-framework-for-large-scale-synthetic-graph","title":"A Framework for Large Scale Synthetic Graph Dataset Generation","date":"2022-10-04","arxiv_id":"2210.01944","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-for-link-prediction","slug":"graph-neural-networks-for-link-prediction","title":"Graph Neural Networks for Link Prediction with Subgraph Sketching","date":"2022-09-30","arxiv_id":"2209.15486","repositories_listed":1,"syntology":{"n":19,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":1,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/graph-neural-networks-for-link-prediction#ran","syntology_url":"https://syntology.ai/paper/2209.15486","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.15486"}},"official":{"repos":["melifluos/subgraph-sketching"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/symbolic-hyperdimensional-vectors-with-sparse","slug":"symbolic-hyperdimensional-vectors-with-sparse","title":"Symbolic Hyperdimensional Vectors with Sparse Graph Convolutional Neural Networks","date":"2022-09-30","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sparse-vicious-attacks-on-graph-neural","slug":"sparse-vicious-attacks-on-graph-neural","title":"Sparse Vicious Attacks on Graph Neural Networks","date":"2022-09-20","arxiv_id":"2209.09688","repositories_listed":1,"syntology":null},{"url":"/paper/joint-language-semantic-and-structure","slug":"joint-language-semantic-and-structure","title":"Joint Language Semantic and Structure Embedding for Knowledge Graph Completion","date":"2022-09-19","arxiv_id":"2209.08721","repositories_listed":1,"syntology":null},{"url":"/paper/graph-perceiver-io-a-general-architecture-for","slug":"graph-perceiver-io-a-general-architecture-for","title":"Graph Perceiver IO: A General Architecture for Graph Structured Data","date":"2022-09-14","arxiv_id":"2209.06418","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-drug-drug-interactions-using-deep","slug":"predicting-drug-drug-interactions-using-deep","title":"Predicting Drug-Drug Interactions using Deep Generative Models on Graphs","date":"2022-09-14","arxiv_id":"2209.09941","repositories_listed":1,"syntology":null},{"url":"/paper/towards-sparsification-of-graph-neural","slug":"towards-sparsification-of-graph-neural","title":"Towards Sparsification of Graph Neural Networks","date":"2022-09-11","arxiv_id":"2209.04766","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/towards-sparsification-of-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2209.04766","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.04766"}},"official":{"repos":["harveyp123/iccd_sptrn_slr"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/cross-network-social-user-embedding-with","slug":"cross-network-social-user-embedding-with","title":"Cross-Network Social User Embedding with Hybrid Differential Privacy Guarantees","date":"2022-09-04","arxiv_id":"2209.01539","repositories_listed":1,"syntology":null},{"url":"/paper/disconnected-emerging-knowledge-graph","slug":"disconnected-emerging-knowledge-graph","title":"Disconnected Emerging Knowledge Graph Oriented Inductive Link Prediction","date":"2022-09-03","arxiv_id":"2209.01397","repositories_listed":1,"syntology":null},{"url":"/paper/msgnn-a-spectral-graph-neural-network-based","slug":"msgnn-a-spectral-graph-neural-network-based","title":"MSGNN: A Spectral Graph Neural Network Based on a Novel Magnetic Signed Laplacian","date":"2022-09-01","arxiv_id":"2209.00546","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/msgnn-a-spectral-graph-neural-network-based#ran","syntology_url":"https://syntology.ai/paper/2209.00546","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.00546"}},"official":{"repos":["sherylhyx/msgnn"],"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/greenkgc-a-lightweight-knowledge-graph","slug":"greenkgc-a-lightweight-knowledge-graph","title":"GreenKGC: A Lightweight Knowledge Graph Completion Method","date":"2022-08-19","arxiv_id":"2208.09137","repositories_listed":1,"syntology":null},{"url":"/paper/link-backdoor-backdoor-attack-on-link","slug":"link-backdoor-backdoor-attack-on-link","title":"Link-Backdoor: Backdoor Attack on Link Prediction via Node Injection","date":"2022-08-14","arxiv_id":"2208.06776","repositories_listed":1,"syntology":null},{"url":"/paper/multiplex-heterogeneous-graph-convolutional","slug":"multiplex-heterogeneous-graph-convolutional","title":"Multiplex Heterogeneous Graph Convolutional Network","date":"2022-08-12","arxiv_id":"2208.06129","repositories_listed":1,"syntology":null},{"url":"/paper/path-aware-siamese-graph-neural-network-for","slug":"path-aware-siamese-graph-neural-network-for","title":"Path-aware Siamese Graph Neural Network for Link Prediction","date":"2022-08-10","arxiv_id":"2208.05781","repositories_listed":1,"syntology":null},{"url":"/paper/integrating-knowledge-graph-embedding-and","slug":"integrating-knowledge-graph-embedding-and","title":"Integrating Knowledge Graph embedding and pretrained Language Models in Hypercomplex Spaces","date":"2022-08-04","arxiv_id":"2208.02743","repositories_listed":1,"syntology":null},{"url":"/paper/subgraph-neighboring-relations-infomax-for","slug":"subgraph-neighboring-relations-infomax-for","title":"Subgraph Neighboring Relations Infomax for Inductive Link Prediction on Knowledge Graphs","date":"2022-07-28","arxiv_id":"2208.00850","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":7,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":10,"phrase":"7 ran (of which 7 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) · 3 unverified; every one of the 7 samples that ran constructed an object rather than computing a result","sample_list":"/paper/subgraph-neighboring-relations-infomax-for#ran","syntology_url":"https://syntology.ai/paper/2208.00850","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.00850"}},"official":{"repos":["Tebmer/SNRI"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":7,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/m-text-kg-a-library-for-multi-source","slug":"m-text-kg-a-library-for-multi-source","title":"$μ\\text{KG}$: A Library for Multi-source Knowledge Graph Embeddings and Applications","date":"2022-07-23","arxiv_id":"2207.11442","repositories_listed":1,"syntology":null},{"url":"/paper/towards-better-evaluation-for-dynamic-link","slug":"towards-better-evaluation-for-dynamic-link","title":"Towards Better Evaluation for Dynamic Link Prediction","date":"2022-07-20","arxiv_id":"2207.10128","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-better-evaluation-for-dynamic-link#ran","syntology_url":"https://syntology.ai/paper/2207.10128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10128"}},"official":{"repos":["fpour/dgb"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dhge-dual-view-hyper-relational-knowledge","slug":"dhge-dual-view-hyper-relational-knowledge","title":"DHGE: Dual-View Hyper-Relational Knowledge Graph Embedding for Link Prediction and Entity Typing","date":"2022-07-18","arxiv_id":"2207.08562","repositories_listed":1,"syntology":null},{"url":"/paper/hardware-agnostic-computation-for-large-scale","slug":"hardware-agnostic-computation-for-large-scale","title":"Hardware-agnostic Computation for Large-scale Knowledge Graph Embeddings","date":"2022-07-18","arxiv_id":"2207.08544","repositories_listed":1,"syntology":null},{"url":"/paper/the-dlcc-node-classification-benchmark-for","slug":"the-dlcc-node-classification-benchmark-for","title":"The DLCC Node Classification Benchmark for Analyzing Knowledge Graph Embeddings","date":"2022-07-13","arxiv_id":"2207.06014","repositories_listed":1,"syntology":null},{"url":"/paper/coo-comic-onomatopoeia-dataset-for","slug":"coo-comic-onomatopoeia-dataset-for","title":"COO: Comic Onomatopoeia Dataset for Recognizing Arbitrary or Truncated Texts","date":"2022-07-11","arxiv_id":"2207.04675","repositories_listed":1,"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/coo-comic-onomatopoeia-dataset-for#ran","syntology_url":"https://syntology.ai/paper/2207.04675","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.04675"}},"official":{"repos":["ku21fan/coo-comic-onomatopoeia"],"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/assessing-the-effects-of-hyperparameters-on","slug":"assessing-the-effects-of-hyperparameters-on","title":"Assessing the Effects of Hyperparameters on Knowledge Graph Embedding Quality","date":"2022-07-01","arxiv_id":"2207.00473","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-borrow-relation-representation-2","slug":"learning-to-borrow-relation-representation-2","title":"Learning to Borrow– Relation Representation for Without-Mention Entity-Pairs for Knowledge Graph Completion","date":"2022-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/the-maximum-capability-of-a-topological","slug":"the-maximum-capability-of-a-topological","title":"The maximum capability of a topological feature in link prediction","date":"2022-06-30","arxiv_id":"2206.15101","repositories_listed":1,"syntology":null},{"url":"/paper/comdense-combined-dense-embedding-of-relation","slug":"comdense-combined-dense-embedding-of-relation","title":"ComDensE : Combined Dense Embedding of Relation-aware and Common Features for Knowledge Graph Completion","date":"2022-06-29","arxiv_id":"2206.14925","repositories_listed":1,"syntology":null},{"url":"/paper/a-representation-learning-framework-for-1","slug":"a-representation-learning-framework-for-1","title":"A Representation Learning Framework for Property Graphs","date":"2022-06-27","arxiv_id":"2206.13176","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/a-representation-learning-framework-for-1#ran","syntology_url":"https://syntology.ai/paper/2206.13176","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.13176"}},"official":{"repos":["yifan-h/pge"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/language-models-as-knowledge-embeddings","slug":"language-models-as-knowledge-embeddings","title":"Language Models as Knowledge Embeddings","date":"2022-06-25","arxiv_id":"2206.12617","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"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 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) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/language-models-as-knowledge-embeddings#ran","syntology_url":"https://syntology.ai/paper/2206.12617","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.12617"}},"official":{"repos":["neph0s/lmke"],"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/geometry-interaction-knowledge-graph","slug":"geometry-interaction-knowledge-graph","title":"Geometry Interaction Knowledge Graph Embeddings","date":"2022-06-24","arxiv_id":"2206.12418","repositories_listed":1,"syntology":{"n":14,"n_ran":13,"n_constructed":3,"n_ran_checked":3,"n_instrument":10,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":14,"phrase":"13 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; 10 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/geometry-interaction-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2206.12418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.12418"}},"official":{"repos":["lion-zs/gie"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/sampling-enclosing-subgraphs-for-link","slug":"sampling-enclosing-subgraphs-for-link","title":"Sampling Enclosing Subgraphs for Link Prediction","date":"2022-06-23","arxiv_id":"2206.12004","repositories_listed":1,"syntology":null},{"url":"/paper/two-dimensional-weisfeiler-lehman-graph","slug":"two-dimensional-weisfeiler-lehman-graph","title":"Two-Dimensional Weisfeiler-Lehman Graph Neural Networks for Link Prediction","date":"2022-06-20","arxiv_id":"2206.09567","repositories_listed":1,"syntology":null},{"url":"/paper/autogml-fast-automatic-model-selection-for","slug":"autogml-fast-automatic-model-selection-for","title":"MetaGL: Evaluation-Free Selection of Graph Learning Models via Meta-Learning","date":"2022-06-18","arxiv_id":"2206.09280","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/autogml-fast-automatic-model-selection-for#ran","syntology_url":"https://syntology.ai/paper/2206.09280","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.09280"}},"official":{"repos":["namyongpark/metagl"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tbdfs-temporal-graph-neural-network","slug":"tbdfs-temporal-graph-neural-network","title":"tBDFS: Temporal Graph Neural Network Leveraging DFS","date":"2022-06-12","arxiv_id":"2206.05692","repositories_listed":1,"syntology":null},{"url":"/paper/neo-gnns-neighborhood-overlap-aware-graph-1","slug":"neo-gnns-neighborhood-overlap-aware-graph-1","title":"Neo-GNNs: Neighborhood Overlap-aware Graph Neural Networks for Link Prediction","date":"2022-06-09","arxiv_id":"2206.04216","repositories_listed":1,"syntology":null},{"url":"/paper/pseudo-poincare-a-unification-framework-for","slug":"pseudo-poincare-a-unification-framework-for","title":"A Unification Framework for Euclidean and Hyperbolic Graph Neural Networks","date":"2022-06-09","arxiv_id":"2206.04285","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":2,"n_violates":1,"n_no_contract":7,"n_pointer_only":4,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/pseudo-poincare-a-unification-framework-for#ran","syntology_url":"https://syntology.ai/paper/2206.04285","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04285"}},"official":{"repos":["oom-debugger/ijcai23"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/on-calibration-of-graph-neural-networks-for","slug":"on-calibration-of-graph-neural-networks-for","title":"On Calibration of Graph Neural Networks for Node Classification","date":"2022-06-03","arxiv_id":"2206.01570","repositories_listed":1,"syntology":null},{"url":"/paper/specnfs-a-challenge-dataset-towards","slug":"specnfs-a-challenge-dataset-towards","title":"SpecNFS: A Challenge Dataset Towards Extracting Formal Models from Natural Language Specifications","date":"2022-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/automatic-relation-aware-graph-network","slug":"automatic-relation-aware-graph-network","title":"Automatic Relation-aware Graph Network Proliferation","date":"2022-05-31","arxiv_id":"2205.15678","repositories_listed":1,"syntology":null},{"url":"/paper/ood-link-prediction-generalization","slug":"ood-link-prediction-generalization","title":"OOD Link Prediction Generalization Capabilities of Message-Passing GNNs in Larger Test Graphs","date":"2022-05-30","arxiv_id":"2205.15117","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/ood-link-prediction-generalization#ran","syntology_url":"https://syntology.ai/paper/2205.15117","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.15117"}},"official":{"repos":["yangzez/ood-link-prediction-generalization-mpnn"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/relphormer-relational-graph-transformer-for","slug":"relphormer-relational-graph-transformer-for","title":"Relphormer: Relational Graph Transformer for Knowledge Graph Representations","date":"2022-05-22","arxiv_id":"2205.10852","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/relphormer-relational-graph-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2205.10852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10852"}},"official":{"repos":["zjunlp/relphormer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/heterformer-a-transformer-architecture-for","slug":"heterformer-a-transformer-architecture-for","title":"Heterformer: Transformer-based Deep Node Representation Learning on Heterogeneous Text-Rich Networks","date":"2022-05-20","arxiv_id":"2205.10282","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/heterformer-a-transformer-architecture-for#ran","syntology_url":"https://syntology.ai/paper/2205.10282","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10282"}},"official":{"repos":["petergriffinjin/heterformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/cascader-cross-modal-cascading-for-knowledge","slug":"cascader-cross-modal-cascading-for-knowledge","title":"CascadER: Cross-Modal Cascading for Knowledge Graph Link Prediction","date":"2022-05-16","arxiv_id":"2205.08012","repositories_listed":1,"syntology":null},{"url":"/paper/kronecker-decomposition-for-knowledge-graph","slug":"kronecker-decomposition-for-knowledge-graph","title":"Kronecker Decomposition for Knowledge Graph Embeddings","date":"2022-05-13","arxiv_id":"2205.06560","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-based-knowledge-extrapolation","slug":"meta-learning-based-knowledge-extrapolation","title":"Meta-Learning Based Knowledge Extrapolation for Knowledge Graphs in the Federated Setting","date":"2022-05-10","arxiv_id":"2205.04692","repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-transformer-with-multi-level-fusion","slug":"hybrid-transformer-with-multi-level-fusion","title":"Hybrid Transformer with Multi-level Fusion for Multimodal Knowledge Graph Completion","date":"2022-05-04","arxiv_id":"2205.02357","repositories_listed":1,"syntology":null},{"url":"/paper/do-pre-trained-models-benefit-knowledge-graph-1","slug":"do-pre-trained-models-benefit-knowledge-graph-1","title":"Do Pre-trained Models Benefit Knowledge Graph Completion? A Reliable Evaluation and a Reasonable Approach","date":"2022-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/enhance-ambiguous-community-structure-via","slug":"enhance-ambiguous-community-structure-via","title":"Enhance Ambiguous Community Structure via Multi-strategy Community Related Link Prediction Method with Evolutionary Process","date":"2022-04-28","arxiv_id":"2204.13301","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-borrow-relation-representation-1","slug":"learning-to-borrow-relation-representation-1","title":"Learning to Borrow -- Relation Representation for Without-Mention Entity-Pairs for Knowledge Graph Completion","date":"2022-04-27","arxiv_id":"2204.13097","repositories_listed":1,"syntology":null},{"url":"/paper/transher-translating-knowledge-graph","slug":"transher-translating-knowledge-graph","title":"TranSHER: Translating Knowledge Graph Embedding with Hyper-Ellipsoidal Restriction","date":"2022-04-27","arxiv_id":"2204.13221","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":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/transher-translating-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2204.13221","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.13221"}},"official":{"repos":["yizhilll/transher"],"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/graph-auto-encoders-for-network-completion","slug":"graph-auto-encoders-for-network-completion","title":"Completing Networks by Learning Local Connection Patterns","date":"2022-04-25","arxiv_id":"2204.11852","repositories_listed":1,"syntology":null},{"url":"/paper/euler-detecting-network-lateral-movement-via","slug":"euler-detecting-network-lateral-movement-via","title":"Euler: Detecting Network Lateral Movement via Scalable Temporal Link Prediction","date":"2022-04-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/bsal-a-framework-of-bi-component-structure","slug":"bsal-a-framework-of-bi-component-structure","title":"BSAL: A Framework of Bi-component Structure and Attribute Learning for Link Prediction","date":"2022-04-18","arxiv_id":"2204.09508","repositories_listed":1,"syntology":null},{"url":"/paper/a-hierarchical-n-gram-framework-for-zero-shot","slug":"a-hierarchical-n-gram-framework-for-zero-shot","title":"A Hierarchical N-Gram Framework for Zero-Shot Link Prediction","date":"2022-04-16","arxiv_id":"2204.10293","repositories_listed":1,"syntology":null},{"url":"/paper/telegraph-a-benchmark-dataset-for","slug":"telegraph-a-benchmark-dataset-for","title":"TeleGraph: A Benchmark Dataset for Hierarchical Link Prediction","date":"2022-04-16","arxiv_id":"2204.07703","repositories_listed":1,"syntology":null},{"url":"/paper/a-hierarchical-block-distance-model-for-ultra","slug":"a-hierarchical-block-distance-model-for-ultra","title":"A Hierarchical Block Distance Model for Ultra Low-Dimensional Graph Representations","date":"2022-04-12","arxiv_id":"2204.05885","repositories_listed":1,"syntology":null},{"url":"/paper/synthetic-graph-generation-to-benchmark-graph","slug":"synthetic-graph-generation-to-benchmark-graph","title":"Synthetic Graph Generation to Benchmark Graph Learning","date":"2022-04-04","arxiv_id":"2204.01376","repositories_listed":1,"syntology":null},{"url":"/paper/adagrid-adaptive-grid-search-for-link","slug":"adagrid-adaptive-grid-search-for-link","title":"AdaGrid: Adaptive Grid Search for Link Prediction Training Objective","date":"2022-03-30","arxiv_id":"2203.16162","repositories_listed":1,"syntology":null},{"url":"/paper/augmenting-knowledge-graphs-for-better-link","slug":"augmenting-knowledge-graphs-for-better-link","title":"Augmenting Knowledge Graphs for Better Link Prediction","date":"2022-03-26","arxiv_id":"2203.13965","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/augmenting-knowledge-graphs-for-better-link#ran","syntology_url":"https://syntology.ai/paper/2203.13965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.13965"}},"official":{"repos":["otamio/kga"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/sequence-to-sequence-knowledge-graph-1","slug":"sequence-to-sequence-knowledge-graph-1","title":"Sequence-to-Sequence Knowledge Graph Completion and Question Answering","date":"2022-03-19","arxiv_id":"2203.10321","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/sequence-to-sequence-knowledge-graph-1#ran","syntology_url":"https://syntology.ai/paper/2203.10321","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10321"}},"official":{"repos":["apoorvumang/kgt5"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-federated-learning-on-knowledge","slug":"efficient-federated-learning-on-knowledge","title":"Efficient Federated Learning on Knowledge Graphs via Privacy-preserving Relation Embedding Aggregation","date":"2022-03-17","arxiv_id":"2203.09553","repositories_listed":1,"syntology":null},{"url":"/paper/graph-survival-a-survival-analysis-framework","slug":"graph-survival-a-survival-analysis-framework","title":"SimHawNet: A Modified Hawkes Process for Temporal Network Simulation","date":"2022-03-14","arxiv_id":"2203.07260","repositories_listed":1,"syntology":null},{"url":"/paper/r-gcn-the-r-could-stand-for-random","slug":"r-gcn-the-r-could-stand-for-random","title":"R-GCN: The R Could Stand for Random","date":"2022-03-04","arxiv_id":"2203.02424","repositories_listed":1,"syntology":null},{"url":"/paper/an-open-challenge-for-inductive-link","slug":"an-open-challenge-for-inductive-link","title":"An Open Challenge for Inductive Link Prediction on Knowledge Graphs","date":"2022-03-03","arxiv_id":"2203.01520","repositories_listed":1,"syntology":null},{"url":"/paper/an-effective-graph-learning-based-approach","slug":"an-effective-graph-learning-based-approach","title":"An Effective Graph Learning based Approach for Temporal Link Prediction: The First Place of WSDM Cup 2022","date":"2022-03-01","arxiv_id":"2203.01820","repositories_listed":1,"syntology":null},{"url":"/paper/equivariant-and-stable-positional-encoding-1","slug":"equivariant-and-stable-positional-encoding-1","title":"Equivariant and Stable Positional Encoding for More Powerful Graph Neural Networks","date":"2022-03-01","arxiv_id":"2203.00199","repositories_listed":1,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":13,"n_instrument":2,"n_unverified":2,"n_honours":2,"n_violates":1,"n_no_contract":10,"n_pointer_only":2,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 2 honoured, 1 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/equivariant-and-stable-positional-encoding-1#ran","syntology_url":"https://syntology.ai/paper/2203.00199","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.00199"}},"official":{"repos":["graph-com/peg"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/cake-a-scalable-commonsense-aware-framework","slug":"cake-a-scalable-commonsense-aware-framework","title":"CAKE: A Scalable Commonsense-Aware Framework For Multi-View Knowledge Graph Completion","date":"2022-02-25","arxiv_id":"2202.13785","repositories_listed":1,"syntology":null},{"url":"/paper/directed-graph-auto-encoders","slug":"directed-graph-auto-encoders","title":"Directed Graph Auto-Encoders","date":"2022-02-25","arxiv_id":"2202.12449","repositories_listed":1,"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":2,"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/directed-graph-auto-encoders#ran","syntology_url":"https://syntology.ai/paper/2202.12449","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.12449"}},"official":{"repos":["gidiko/digae"],"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/neuralkg-an-open-source-library-for-diverse","slug":"neuralkg-an-open-source-library-for-diverse","title":"NeuralKG: An Open Source Library for Diverse Representation Learning of Knowledge Graphs","date":"2022-02-25","arxiv_id":"2202.12571","repositories_listed":1,"syntology":null},{"url":"/paper/evokg-jointly-modeling-event-time-and-network","slug":"evokg-jointly-modeling-event-time-and-network","title":"EvoKG: Jointly Modeling Event Time and Network Structure for Reasoning over Temporal Knowledge Graphs","date":"2022-02-15","arxiv_id":"2202.07648","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/evokg-jointly-modeling-event-time-and-network#ran","syntology_url":"https://syntology.ai/paper/2202.07648","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.07648"}},"official":null}},{"url":"/paper/obtaining-dyadic-fairness-by-optimal","slug":"obtaining-dyadic-fairness-by-optimal","title":"Obtaining Dyadic Fairness by Optimal Transport","date":"2022-02-09","arxiv_id":"2202.04520","repositories_listed":1,"syntology":null},{"url":"/paper/graph-self-supervised-learning-with-accurate","slug":"graph-self-supervised-learning-with-accurate","title":"Graph Self-supervised Learning with Accurate Discrepancy Learning","date":"2022-02-07","arxiv_id":"2202.02989","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-self-supervised-learning-with-accurate#ran","syntology_url":"https://syntology.ai/paper/2202.02989","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.02989"}},"official":{"repos":["dongkikim95/d-sla"],"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":["official"]}}},{"url":"/paper/link-prediction-of-artificial-intelligence","slug":"link-prediction-of-artificial-intelligence","title":"Link Prediction of Artificial Intelligence Concepts using Low Computational Power","date":"2022-02-07","arxiv_id":"2202.03393","repositories_listed":1,"syntology":null},{"url":"/paper/from-discrimination-to-generation-knowledge","slug":"from-discrimination-to-generation-knowledge","title":"From Discrimination to Generation: Knowledge Graph Completion with Generative Transformer","date":"2022-02-04","arxiv_id":"2202.02113","repositories_listed":1,"syntology":null},{"url":"/paper/modularity-aware-graph-autoencoders-for-joint","slug":"modularity-aware-graph-autoencoders-for-joint","title":"Modularity-Aware Graph Autoencoders for Joint Community Detection and Link Prediction","date":"2022-02-02","arxiv_id":"2202.00961","repositories_listed":1,"syntology":null},{"url":"/paper/questions-for-flat-minima-optimization-of","slug":"questions-for-flat-minima-optimization-of","title":"When Do Flat Minima Optimizers Work?","date":"2022-02-01","arxiv_id":"2202.00661","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-graph-poisoning-attack-via","slug":"unsupervised-graph-poisoning-attack-via","title":"Unsupervised Graph Poisoning Attack via Contrastive Loss Back-propagation","date":"2022-01-20","arxiv_id":"2201.07986","repositories_listed":1,"syntology":null},{"url":"/paper/decoupling-the-depth-and-scope-of-graph-1","slug":"decoupling-the-depth-and-scope-of-graph-1","title":"Decoupling the Depth and Scope of Graph Neural Networks","date":"2022-01-19","arxiv_id":"2201.07858","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":2,"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/decoupling-the-depth-and-scope-of-graph-1#ran","syntology_url":"https://syntology.ai/paper/2201.07858","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.07858"}},"official":{"repos":["facebookresearch/shaDow_GNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/network-based-link-prediction-of-scientific","slug":"network-based-link-prediction-of-scientific","title":"Network-based link prediction of scientific concepts -- a Science4Cast competition entry","date":"2022-01-18","arxiv_id":"2201.07978","repositories_listed":1,"syntology":null},{"url":"/paper/rgl-a-simple-yet-effective-relation-graph","slug":"rgl-a-simple-yet-effective-relation-graph","title":"RGL: A Simple yet Effective Relation Graph Augmented Prompt-based Tuning Approach for Few-Shot Learning","date":"2022-01-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/reasoning-through-memorization-nearest","slug":"reasoning-through-memorization-nearest","title":"Reasoning Through Memorization: Nearest Neighbor Knowledge Graph Embeddings","date":"2022-01-14","arxiv_id":"2201.05575","repositories_listed":1,"syntology":null},{"url":"/paper/lp-bert-multi-task-pre-training-knowledge","slug":"lp-bert-multi-task-pre-training-knowledge","title":"Multi-task Pre-training Language Model for Semantic Network Completion","date":"2022-01-13","arxiv_id":"2201.04843","repositories_listed":1,"syntology":null},{"url":"/paper/mgae-masked-autoencoders-for-self-supervised","slug":"mgae-masked-autoencoders-for-self-supervised","title":"MGAE: Masked Autoencoders for Self-Supervised Learning on Graphs","date":"2022-01-07","arxiv_id":"2201.02534","repositories_listed":1,"syntology":null},{"url":"/paper/asymptotics-of-ell-2-regularized-network","slug":"asymptotics-of-ell-2-regularized-network","title":"Asymptotics of $\\ell_2$ Regularized Network Embeddings","date":"2022-01-05","arxiv_id":"2201.01689","repositories_listed":1,"syntology":null},{"url":"/paper/cherry-a-computational-method-for-accurate","slug":"cherry-a-computational-method-for-accurate","title":"CHERRY: a Computational metHod for accuratE pRediction of virus-pRokarYotic interactions using a graph encoder-decoder model","date":"2022-01-04","arxiv_id":"2201.01018","repositories_listed":1,"syntology":null},{"url":"/paper/a-cluster-based-trip-prediction-graph-neural","slug":"a-cluster-based-trip-prediction-graph-neural","title":"A Cluster-Based Trip Prediction Graph Neural Network Model for Bike Sharing Systems","date":"2022-01-03","arxiv_id":"2201.00720","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-neighborhood-modeling-and","slug":"investigating-neighborhood-modeling-and","title":"D-HYPR: Harnessing Neighborhood Modeling and Asymmetry Preservation for Digraph Representation Learning","date":"2021-12-22","arxiv_id":"2112.11734","repositories_listed":1,"syntology":null}],"record_sha256":"888ba4b7e06cd3a7593c113efdbde25ba2e56202fb14b1104bc7424b30252b84","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}