{"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/5","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":5,"pages_in_order":20,"rows_per_page":100,"rows":[401,500],"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/4","next":"/task/link-prediction/papers/6","papers":[{"url":"/paper/development-of-a-knowledge-graph-embeddings","slug":"development-of-a-knowledge-graph-embeddings","title":"Development of a Knowledge Graph Embeddings Model for Pain","date":"2023-08-17","arxiv_id":"2308.08904","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-edge-features-with-deep-bayesian","slug":"modeling-edge-features-with-deep-bayesian","title":"Modeling Edge Features with Deep Bayesian Graph Networks","date":"2023-08-17","arxiv_id":"2308.09087","repositories_listed":1,"syntology":null},{"url":"/paper/independent-distribution-regularization-for","slug":"independent-distribution-regularization-for","title":"Independent Distribution Regularization for Private Graph Embedding","date":"2023-08-16","arxiv_id":"2308.08360","repositories_listed":1,"syntology":null},{"url":"/paper/towards-temporal-edge-regression-a-case-study","slug":"towards-temporal-edge-regression-a-case-study","title":"Towards Temporal Edge Regression: A Case Study on Agriculture Trade Between Nations","date":"2023-08-15","arxiv_id":"2308.07883","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-knowledge-graph-completion-with","slug":"inductive-knowledge-graph-completion-with","title":"Inductive Knowledge Graph Completion with GNNs and Rules: An Analysis","date":"2023-08-14","arxiv_id":"2308.07942","repositories_listed":1,"syntology":null},{"url":"/paper/context-aware-event-forecasting-via-graph","slug":"context-aware-event-forecasting-via-graph","title":"Context-aware Event Forecasting via Graph Disentanglement","date":"2023-08-12","arxiv_id":"2308.06480","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-link-prediction-explanations-for","slug":"evaluating-link-prediction-explanations-for","title":"Evaluating Link Prediction Explanations for Graph Neural Networks","date":"2023-08-03","arxiv_id":"2308.01682","repositories_listed":1,"syntology":null},{"url":"/paper/addressing-the-impact-of-localized-training","slug":"addressing-the-impact-of-localized-training","title":"Addressing the Impact of Localized Training Data in Graph Neural Networks","date":"2023-07-24","arxiv_id":"2307.12689","repositories_listed":1,"syntology":null},{"url":"/paper/anticipating-technical-expertise-and","slug":"anticipating-technical-expertise-and","title":"Anticipating Technical Expertise and Capability Evolution in Research Communities using Dynamic Graph Transformers","date":"2023-07-18","arxiv_id":"2307.09665","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-link-prediction-over-hyper","slug":"exploring-link-prediction-over-hyper","title":"Temporal Fact Reasoning over Hyper-Relational Knowledge Graphs","date":"2023-07-14","arxiv_id":"2307.10219","repositories_listed":1,"syntology":null},{"url":"/paper/learning-from-heterogeneity-a-dynamic","slug":"learning-from-heterogeneity-a-dynamic","title":"Learning from Heterogeneity: A Dynamic Learning Framework for Hypergraphs","date":"2023-07-07","arxiv_id":"2307.03411","repositories_listed":1,"syntology":null},{"url":"/paper/transformerg2g-adaptive-time-stepping-for","slug":"transformerg2g-adaptive-time-stepping-for","title":"TransformerG2G: Adaptive time-stepping for learning temporal graph embeddings using transformers","date":"2023-07-05","arxiv_id":"2307.02588","repositories_listed":1,"syntology":null},{"url":"/paper/random-walk-on-multiple-networks","slug":"random-walk-on-multiple-networks","title":"Random Walk on Multiple Networks","date":"2023-07-04","arxiv_id":"2307.01637","repositories_listed":1,"syntology":null},{"url":"/paper/sagess-sampling-graph-denoising-diffusion","slug":"sagess-sampling-graph-denoising-diffusion","title":"SaGess: Sampling Graph Denoising Diffusion Model for Scalable Graph Generation","date":"2023-06-29","arxiv_id":"2306.16827","repositories_listed":1,"syntology":null},{"url":"/paper/mydigitalfootprint-an-extensive-context","slug":"mydigitalfootprint-an-extensive-context","title":"MyDigitalFootprint: an extensive context dataset for pervasive computing applications at the edge","date":"2023-06-28","arxiv_id":"2306.15990","repositories_listed":1,"syntology":null},{"url":"/paper/conformal-link-prediction-to-control-the","slug":"conformal-link-prediction-to-control-the","title":"Conformal link prediction for false discovery rate control","date":"2023-06-26","arxiv_id":"2306.14693","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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/conformal-link-prediction-to-control-the#ran","syntology_url":"https://syntology.ai/paper/2306.14693","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.14693"}},"official":{"repos":["arianemarandon/linkpredconf"],"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/towards-few-shot-inductive-link-prediction-on","slug":"towards-few-shot-inductive-link-prediction-on","title":"Towards Few-shot Inductive Link Prediction on Knowledge Graphs: A Relational Anonymous Walk-guided Neural Process Approach","date":"2023-06-26","arxiv_id":"2307.01204","repositories_listed":1,"syntology":null},{"url":"/paper/torsion-graph-neural-networks","slug":"torsion-graph-neural-networks","title":"Torsion Graph Neural Networks","date":"2023-06-23","arxiv_id":"2306.13541","repositories_listed":1,"syntology":null},{"url":"/paper/tuckerdncaching-high-quality-negative","slug":"tuckerdncaching-high-quality-negative","title":"TuckerDNCaching: high-quality negative sampling with tucker decomposition","date":"2023-06-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-graph-neural-networks-for-link","slug":"evaluating-graph-neural-networks-for-link","title":"Evaluating Graph Neural Networks for Link Prediction: Current Pitfalls and New Benchmarking","date":"2023-06-18","arxiv_id":"2306.10453","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/evaluating-graph-neural-networks-for-link#ran","syntology_url":"https://syntology.ai/paper/2306.10453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.10453"}},"official":{"repos":["juanhui28/heart"],"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/accelerating-dynamic-network-embedding-with","slug":"accelerating-dynamic-network-embedding-with","title":"Accelerating Dynamic Network Embedding with Billions of Parameter Updates to Milliseconds","date":"2023-06-15","arxiv_id":"2306.08967","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/accelerating-dynamic-network-embedding-with#ran","syntology_url":"https://syntology.ai/paper/2306.08967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08967"}},"official":{"repos":["zjunet/damf"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/time-aware-graph-structure-learning-via","slug":"time-aware-graph-structure-learning-via","title":"Time-aware Graph Structure Learning via Sequence Prediction on Temporal Graphs","date":"2023-06-13","arxiv_id":"2306.07699","repositories_listed":1,"syntology":null},{"url":"/paper/bioblp-a-modular-framework-for-learning-on","slug":"bioblp-a-modular-framework-for-learning-on","title":"BioBLP: A Modular Framework for Learning on Multimodal Biomedical Knowledge Graphs","date":"2023-06-06","arxiv_id":"2306.03606","repositories_listed":1,"syntology":null},{"url":"/paper/schema-first-learn-versatile-knowledge-graph","slug":"schema-first-learn-versatile-knowledge-graph","title":"Schema First! Learn Versatile Knowledge Graph Embeddings by Capturing Semantics with MASCHInE","date":"2023-06-06","arxiv_id":"2306.03659","repositories_listed":1,"syntology":null},{"url":"/paper/learning-probabilistic-symmetrization-for-1","slug":"learning-probabilistic-symmetrization-for-1","title":"Learning Probabilistic Symmetrization for Architecture Agnostic Equivariance","date":"2023-06-05","arxiv_id":"2306.02866","repositories_listed":1,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-probabilistic-symmetrization-for-1#ran","syntology_url":"https://syntology.ai/paper/2306.02866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02866"}},"official":{"repos":["jw9730/lps"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-and-verbalizing-academic-ideas-by","slug":"exploring-and-verbalizing-academic-ideas-by","title":"Exploring and Verbalizing Academic Ideas by Concept Co-occurrence","date":"2023-06-04","arxiv_id":"2306.02282","repositories_listed":1,"syntology":null},{"url":"/paper/shrinking-embeddings-for-hyper-relational","slug":"shrinking-embeddings-for-hyper-relational","title":"Shrinking Embeddings for Hyper-Relational Knowledge Graphs","date":"2023-06-03","arxiv_id":"2306.02199","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-embeddings-in-the-biomedical","slug":"knowledge-graph-embeddings-in-the-biomedical","title":"Knowledge Graph Embeddings in the Biomedical Domain: Are They Useful? A Look at Link Prediction, Rule Learning, and Downstream Polypharmacy Tasks","date":"2023-05-31","arxiv_id":"2305.19979","repositories_listed":1,"syntology":null},{"url":"/paper/an-amr-based-link-prediction-approach-for","slug":"an-amr-based-link-prediction-approach-for","title":"An AMR-based Link Prediction Approach for Document-level Event Argument Extraction","date":"2023-05-30","arxiv_id":"2305.19162","repositories_listed":1,"syntology":null},{"url":"/paper/node-embedding-from-neural-hamiltonian-orbits","slug":"node-embedding-from-neural-hamiltonian-orbits","title":"Node Embedding from Neural Hamiltonian Orbits in Graph Neural Networks","date":"2023-05-30","arxiv_id":"2305.18965","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/node-embedding-from-neural-hamiltonian-orbits#ran","syntology_url":"https://syntology.ai/paper/2305.18965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18965"}},"official":{"repos":["zknus/hamiltonian-gnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/dothash-estimating-set-similarity-metrics-for","slug":"dothash-estimating-set-similarity-metrics-for","title":"DotHash: Estimating Set Similarity Metrics for Link Prediction and Document Deduplication","date":"2023-05-27","arxiv_id":"2305.17310","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":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) · 0 unverified","sample_list":"/paper/dothash-estimating-set-similarity-metrics-for#ran","syntology_url":"https://syntology.ai/paper/2305.17310","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.17310"}},"official":{"repos":["mikeheddes/dothash"],"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/confidence-based-feature-imputation-for","slug":"confidence-based-feature-imputation-for","title":"Confidence-Based Feature Imputation for Graphs with Partially Known Features","date":"2023-05-26","arxiv_id":"2305.16618","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":5,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/confidence-based-feature-imputation-for#ran","syntology_url":"https://syntology.ai/paper/2305.16618","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.16618"}},"official":{"repos":["daehoum1/pcfi"],"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/how-to-turn-your-knowledge-graph-embeddings-1","slug":"how-to-turn-your-knowledge-graph-embeddings-1","title":"How to Turn Your Knowledge Graph Embeddings into Generative Models","date":"2023-05-25","arxiv_id":"2305.15944","repositories_listed":1,"syntology":null},{"url":"/paper/congrat-self-supervised-contrastive","slug":"congrat-self-supervised-contrastive","title":"ConGraT: Self-Supervised Contrastive Pretraining for Joint Graph and Text Embeddings","date":"2023-05-23","arxiv_id":"2305.14321","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-generate-novel-scientific","slug":"learning-to-generate-novel-scientific","title":"SciMON: Scientific Inspiration Machines Optimized for Novelty","date":"2023-05-23","arxiv_id":"2305.14259","repositories_listed":1,"syntology":null},{"url":"/paper/to-copy-rather-than-memorize-a-vertical","slug":"to-copy-rather-than-memorize-a-vertical","title":"To Copy Rather Than Memorize: A Vertical Learning Paradigm for Knowledge Graph Completion","date":"2023-05-23","arxiv_id":"2305.14126","repositories_listed":1,"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":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/to-copy-rather-than-memorize-a-vertical#ran","syntology_url":"https://syntology.ai/paper/2305.14126","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14126"}},"official":{"repos":["rui9812/vlp"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/friendly-neighbors-contextualized-sequence-to","slug":"friendly-neighbors-contextualized-sequence-to","title":"Friendly Neighbors: Contextualized Sequence-to-Sequence Link Prediction","date":"2023-05-22","arxiv_id":"2305.13059","repositories_listed":1,"syntology":null},{"url":"/paper/llms-for-knowledge-graph-construction-and","slug":"llms-for-knowledge-graph-construction-and","title":"LLMs for Knowledge Graph Construction and Reasoning: Recent Capabilities and Future Opportunities","date":"2023-05-22","arxiv_id":"2305.13168","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/llms-for-knowledge-graph-construction-and#ran","syntology_url":"https://syntology.ai/paper/2305.13168","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.13168"}},"official":{"repos":["zjunlp/autokg"],"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/logical-entity-representation-in-knowledge","slug":"logical-entity-representation-in-knowledge","title":"Logical Entity Representation in Knowledge-Graphs for Differentiable Rule Learning","date":"2023-05-22","arxiv_id":"2305.12738","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/logical-entity-representation-in-knowledge#ran","syntology_url":"https://syntology.ai/paper/2305.12738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12738"}},"official":{"repos":["glaciohound/lerp"],"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/iteratively-learning-representations-for","slug":"iteratively-learning-representations-for","title":"Iteratively Learning Representations for Unseen Entities with Inter-Rule Correlations","date":"2023-05-17","arxiv_id":"2305.10531","repositories_listed":1,"syntology":null},{"url":"/paper/drew-dynamically-rewired-message-passing-with","slug":"drew-dynamically-rewired-message-passing-with","title":"DRew: Dynamically Rewired Message Passing with Delay","date":"2023-05-13","arxiv_id":"2305.08018","repositories_listed":1,"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/drew-dynamically-rewired-message-passing-with#ran","syntology_url":"https://syntology.ai/paper/2305.08018","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.08018"}},"official":{"repos":["bengutteridge/drew"],"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/hahe-hierarchical-attention-for-hyper","slug":"hahe-hierarchical-attention-for-hyper","title":"HAHE: Hierarchical Attention for Hyper-Relational Knowledge Graphs in Global and Local Level","date":"2023-05-11","arxiv_id":"2305.06588","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":3,"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 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/hahe-hierarchical-attention-for-hyper#ran","syntology_url":"https://syntology.ai/paper/2305.06588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06588"}},"official":{"repos":["lhrlab/hahe"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/csgcl-community-strength-enhanced-graph","slug":"csgcl-community-strength-enhanced-graph","title":"CSGCL: Community-Strength-Enhanced Graph Contrastive Learning","date":"2023-05-08","arxiv_id":"2305.04658","repositories_listed":1,"syntology":{"n":9,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/csgcl-community-strength-enhanced-graph#ran","syntology_url":"https://syntology.ai/paper/2305.04658","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.04658"}},"official":{"repos":["hanchen-hust/csgcl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/algorithms-for-social-justice-affirmative","slug":"algorithms-for-social-justice-affirmative","title":"Structural Group Unfairness: Measurement and Mitigation by means of the Effective Resistance","date":"2023-05-05","arxiv_id":"2305.03223","repositories_listed":1,"syntology":null},{"url":"/paper/musical-voice-separation-as-link-prediction","slug":"musical-voice-separation-as-link-prediction","title":"Musical Voice Separation as Link Prediction: Modeling a Musical Perception Task as a Multi-Trajectory Tracking Problem","date":"2023-04-28","arxiv_id":"2304.14848","repositories_listed":1,"syntology":null},{"url":"/paper/connector-0-5-a-unified-framework-for-graph","slug":"connector-0-5-a-unified-framework-for-graph","title":"Connector 0.5: A unified framework for graph representation learning","date":"2023-04-25","arxiv_id":"2304.13195","repositories_listed":1,"syntology":null},{"url":"/paper/transition-propagation-graph-neural-networks","slug":"transition-propagation-graph-neural-networks","title":"Transition Propagation Graph Neural Networks for Temporal Networks","date":"2023-04-15","arxiv_id":"2304.07501","repositories_listed":1,"syntology":null},{"url":"/paper/h2tne-temporal-heterogeneous-information","slug":"h2tne-temporal-heterogeneous-information","title":"$\\text{H}^2\\text{TNE}$: Temporal Heterogeneous Information Network Embedding in Hyperbolic Spaces","date":"2023-04-14","arxiv_id":"2304.06970","repositories_listed":1,"syntology":null},{"url":"/paper/hgwavenet-a-hyperbolic-graph-neural-network","slug":"hgwavenet-a-hyperbolic-graph-neural-network","title":"HGWaveNet: A Hyperbolic Graph Neural Network for Temporal Link Prediction","date":"2023-04-14","arxiv_id":"2304.07302","repositories_listed":1,"syntology":null},{"url":"/paper/cafin-centrality-aware-fairness-inducing-in","slug":"cafin-centrality-aware-fairness-inducing-in","title":"CAFIN: Centrality Aware Fairness inducing IN-processing for Unsupervised Representation Learning on Graphs","date":"2023-04-10","arxiv_id":"2304.04391","repositories_listed":1,"syntology":null},{"url":"/paper/sheaf-neural-networks-for-graph-based","slug":"sheaf-neural-networks-for-graph-based","title":"Sheaf4Rec: Sheaf Neural Networks for Graph-based Recommender Systems","date":"2023-04-07","arxiv_id":"2304.09097","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-learning-on-graphs-a-survey","slug":"counterfactual-learning-on-graphs-a-survey","title":"Counterfactual Learning on Graphs: A Survey","date":"2023-04-03","arxiv_id":"2304.01391","repositories_listed":1,"syntology":null},{"url":"/paper/improving-few-shot-inductive-learning-on","slug":"improving-few-shot-inductive-learning-on","title":"Improving Few-Shot Inductive Learning on Temporal Knowledge Graphs using Confidence-Augmented Reinforcement Learning","date":"2023-04-02","arxiv_id":"2304.00613","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-embedding-with-3d-compound","slug":"knowledge-graph-embedding-with-3d-compound","title":"Knowledge Graph Embedding with 3D Compound Geometric Transformations","date":"2023-04-01","arxiv_id":"2304.00378","repositories_listed":1,"syntology":null},{"url":"/paper/a-source-separation-approach-to-temporal","slug":"a-source-separation-approach-to-temporal","title":"A source separation approach to temporal graph modelling for computer networks","date":"2023-03-28","arxiv_id":"2303.15950","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-graph-embedding-with-information","slug":"distributed-graph-embedding-with-information","title":"Distributed Graph Embedding with Information-Oriented Random Walks","date":"2023-03-28","arxiv_id":"2303.15702","repositories_listed":1,"syntology":null},{"url":"/paper/cocon-a-data-set-on-combined-contextualized","slug":"cocon-a-data-set-on-combined-contextualized","title":"CoCon: A Data Set on Combined Contextualized Research Artifact Use","date":"2023-03-27","arxiv_id":"2303.15193","repositories_listed":1,"syntology":null},{"url":"/paper/neural-graph-reasoning-complex-logical-query","slug":"neural-graph-reasoning-complex-logical-query","title":"Neural Graph Reasoning: Complex Logical Query Answering Meets Graph Databases","date":"2023-03-26","arxiv_id":"2303.14617","repositories_listed":1,"syntology":null},{"url":"/paper/link-prediction-for-flow-driven-spatial","slug":"link-prediction-for-flow-driven-spatial","title":"Link Prediction for Flow-Driven Spatial Networks","date":"2023-03-25","arxiv_id":"2303.14501","repositories_listed":1,"syntology":null},{"url":"/paper/easydgl-encode-train-and-interpret-for","slug":"easydgl-encode-train-and-interpret-for","title":"EasyDGL: Encode, Train and Interpret for Continuous-time Dynamic Graph Learning","date":"2023-03-22","arxiv_id":"2303.12341","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/easydgl-encode-train-and-interpret-for#ran","syntology_url":"https://syntology.ai/paper/2303.12341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.12341"}},"official":{"repos":["cchao0116/EasyDGL"],"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/imf-interactive-multimodal-fusion-model-for","slug":"imf-interactive-multimodal-fusion-model-for","title":"IMF: Interactive Multimodal Fusion Model for Link Prediction","date":"2023-03-20","arxiv_id":"2303.10816","repositories_listed":1,"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":3,"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/imf-interactive-multimodal-fusion-model-for#ran","syntology_url":"https://syntology.ai/paper/2303.10816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.10816"}},"official":{"repos":["hestiasky/imf-pytorch"],"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/micro-video-tagging-via-jointly-modeling","slug":"micro-video-tagging-via-jointly-modeling","title":"Micro-video Tagging via Jointly Modeling Social Influence and Tag Relation","date":"2023-03-15","arxiv_id":"2303.08318","repositories_listed":1,"syntology":null},{"url":"/paper/ness-learning-node-embeddings-from-static","slug":"ness-learning-node-embeddings-from-static","title":"NESS: Node Embeddings from Static SubGraphs","date":"2023-03-15","arxiv_id":"2303.08958","repositories_listed":1,"syntology":null},{"url":"/paper/exphormer-sparse-transformers-for-graphs","slug":"exphormer-sparse-transformers-for-graphs","title":"Exphormer: Sparse Transformers for Graphs","date":"2023-03-10","arxiv_id":"2303.06147","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exphormer-sparse-transformers-for-graphs#ran","syntology_url":"https://syntology.ai/paper/2303.06147","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.06147"}},"official":{"repos":["hamed1375/exphormer"],"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/towards-a-gml-enabled-knowledge-graph","slug":"towards-a-gml-enabled-knowledge-graph","title":"Towards a GML-Enabled Knowledge Graph Platform","date":"2023-03-03","arxiv_id":"2303.02166","repositories_listed":1,"syntology":null},{"url":"/paper/you-only-transfer-what-you-share-intersection","slug":"you-only-transfer-what-you-share-intersection","title":"You Only Transfer What You Share: Intersection-Induced Graph Transfer Learning for Link Prediction","date":"2023-02-27","arxiv_id":"2302.14189","repositories_listed":1,"syntology":null},{"url":"/paper/page-link-path-based-graph-neural-network","slug":"page-link-path-based-graph-neural-network","title":"PaGE-Link: Path-based Graph Neural Network Explanation for Heterogeneous Link Prediction","date":"2023-02-24","arxiv_id":"2302.12465","repositories_listed":1,"syntology":null},{"url":"/paper/gtrl-an-entity-group-aware-temporal-knowledge","slug":"gtrl-an-entity-group-aware-temporal-knowledge","title":"GTRL: An Entity Group-Aware Temporal Knowledge Graph Representation Learning Method","date":"2023-02-22","arxiv_id":"2302.11091","repositories_listed":1,"syntology":null},{"url":"/paper/edgeformers-graph-empowered-transformers-for","slug":"edgeformers-graph-empowered-transformers-for","title":"Edgeformers: Graph-Empowered Transformers for Representation Learning on Textual-Edge Networks","date":"2023-02-21","arxiv_id":"2302.11050","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/edgeformers-graph-empowered-transformers-for#ran","syntology_url":"https://syntology.ai/paper/2302.11050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.11050"}},"official":{"repos":["petergriffinjin/edgeformers"],"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/link-prediction-on-latent-heterogeneous","slug":"link-prediction-on-latent-heterogeneous","title":"Link Prediction on Latent Heterogeneous Graphs","date":"2023-02-21","arxiv_id":"2302.10432","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-polypharmacy-and-predicting-drug","slug":"modeling-polypharmacy-and-predicting-drug","title":"Modeling Polypharmacy and Predicting Drug-Drug Interactions using Deep Generative Models on Multimodal Graphs","date":"2023-02-17","arxiv_id":"2302.08680","repositories_listed":1,"syntology":null},{"url":"/paper/nnkgc-improving-knowledge-graph-completion","slug":"nnkgc-improving-knowledge-graph-completion","title":"NNKGC: Improving Knowledge Graph Completion with Node Neighborhoods","date":"2023-02-13","arxiv_id":"2302.06132","repositories_listed":1,"syntology":null},{"url":"/paper/user-unsupervised-structural-entropy-based","slug":"user-unsupervised-structural-entropy-based","title":"USER: Unsupervised Structural Entropy-based Robust Graph Neural Network","date":"2023-02-12","arxiv_id":"2302.05889","repositories_listed":1,"syntology":null},{"url":"/paper/learning-representations-of-bi-level","slug":"learning-representations-of-bi-level","title":"Learning Representations of Bi-level Knowledge Graphs for Reasoning beyond Link Prediction","date":"2023-02-06","arxiv_id":"2302.02601","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/learning-representations-of-bi-level#ran","syntology_url":"https://syntology.ai/paper/2302.02601","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.02601"}},"official":{"repos":["bdi-lab/bive"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-theory-of-link-prediction-via-relational-1","slug":"a-theory-of-link-prediction-via-relational-1","title":"A Theory of Link Prediction via Relational Weisfeiler-Leman on Knowledge Graphs","date":"2023-02-04","arxiv_id":"2302.02209","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/a-theory-of-link-prediction-via-relational-1#ran","syntology_url":"https://syntology.ai/paper/2302.02209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.02209"}},"official":{"repos":["hxyscotthuang/cmpnn"],"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/entity-agnostic-representation-learning-for","slug":"entity-agnostic-representation-learning-for","title":"Entity-Agnostic Representation Learning for Parameter-Efficient Knowledge Graph Embedding","date":"2023-02-03","arxiv_id":"2302.01849","repositories_listed":1,"syntology":null},{"url":"/paper/double-permutation-equivariance-for-knowledge","slug":"double-permutation-equivariance-for-knowledge","title":"Double Equivariance for Inductive Link Prediction for Both New Nodes and New Relation Types","date":"2023-02-02","arxiv_id":"2302.01313","repositories_listed":1,"syntology":{"n":6,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 6 unverified","sample_list":"/paper/double-permutation-equivariance-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2302.01313","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01313"}},"official":{"repos":["purdueminds/isdea"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":[]}}},{"url":"/paper/neural-common-neighbor-with-completion-for","slug":"neural-common-neighbor-with-completion-for","title":"Neural Common Neighbor with Completion for Link Prediction","date":"2023-02-02","arxiv_id":"2302.00890","repositories_listed":1,"syntology":null},{"url":"/paper/who-should-i-engage-with-at-what-time-a","slug":"who-should-i-engage-with-at-what-time-a","title":"Who Should I Engage with At What Time? A Missing Event Aware Temporal Graph Neural Network","date":"2023-01-20","arxiv_id":"2301.08399","repositories_listed":1,"syntology":null},{"url":"/paper/gipa-a-general-information-propagation","slug":"gipa-a-general-information-propagation","title":"GIPA: A General Information Propagation Algorithm for Graph Learning","date":"2023-01-19","arxiv_id":"2301.08209","repositories_listed":1,"syntology":null},{"url":"/paper/imkga-sm-interpretable-multimodal-knowledge","slug":"imkga-sm-interpretable-multimodal-knowledge","title":"IMKGA-SM: Interpretable Multimodal Knowledge Graph Answer Prediction via Sequence Modeling","date":"2023-01-06","arxiv_id":"2301.02445","repositories_listed":1,"syntology":null},{"url":"/paper/analogical-inference-enhanced-knowledge-graph","slug":"analogical-inference-enhanced-knowledge-graph","title":"Analogical Inference Enhanced Knowledge Graph Embedding","date":"2023-01-03","arxiv_id":"2301.00982","repositories_listed":1,"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/analogical-inference-enhanced-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2301.00982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.00982"}},"official":{"repos":["zjukg/ankge"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/irt2-inductive-linking-and-ranking-in","slug":"irt2-inductive-linking-and-ranking-in","title":"IRT2: Inductive Linking and Ranking in Knowledge Graphs of Varying Scale","date":"2023-01-02","arxiv_id":"2301.00716","repositories_listed":1,"syntology":null},{"url":"/paper/generative-graph-neural-networks-for-link","slug":"generative-graph-neural-networks-for-link","title":"Generative Graph Neural Networks for Link Prediction","date":"2022-12-31","arxiv_id":"2301.00169","repositories_listed":1,"syntology":null},{"url":"/paper/bring-your-own-view-graph-neural-networks-for","slug":"bring-your-own-view-graph-neural-networks-for","title":"Bring Your Own View: Graph Neural Networks for Link Prediction with Personalized Subgraph Selection","date":"2022-12-23","arxiv_id":"2212.12488","repositories_listed":1,"syntology":null},{"url":"/paper/a-retrieve-and-read-framework-for-knowledge","slug":"a-retrieve-and-read-framework-for-knowledge","title":"A Retrieve-and-Read Framework for Knowledge Graph Link Prediction","date":"2022-12-19","arxiv_id":"2212.09724","repositories_listed":1,"syntology":null},{"url":"/paper/non-iid-transfer-learning-on-graphs","slug":"non-iid-transfer-learning-on-graphs","title":"Non-IID Transfer Learning on Graphs","date":"2022-12-15","arxiv_id":"2212.08174","repositories_listed":1,"syntology":null},{"url":"/paper/hyperbolic-curvature-graph-neural-network","slug":"hyperbolic-curvature-graph-neural-network","title":"kHGCN: Tree-likeness Modeling via Continuous and Discrete Curvature Learning","date":"2022-12-04","arxiv_id":"2212.01793","repositories_listed":1,"syntology":null},{"url":"/paper/fakeedge-alleviate-dataset-shift-in-link","slug":"fakeedge-alleviate-dataset-shift-in-link","title":"FakeEdge: Alleviate Dataset Shift in Link Prediction","date":"2022-11-29","arxiv_id":"2211.15899","repositories_listed":1,"syntology":null},{"url":"/paper/link-prediction-with-non-contrastive-learning","slug":"link-prediction-with-non-contrastive-learning","title":"Link Prediction with Non-Contrastive Learning","date":"2022-11-25","arxiv_id":"2211.14394","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":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/link-prediction-with-non-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2211.14394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14394"}},"official":{"repos":["snap-research/non-contrastive-link-prediction"],"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/mecch-metapath-context-convolution-based","slug":"mecch-metapath-context-convolution-based","title":"MECCH: Metapath Context Convolution-based Heterogeneous Graph Neural Networks","date":"2022-11-23","arxiv_id":"2211.12792","repositories_listed":1,"syntology":null},{"url":"/paper/search-behavior-prediction-a-hypergraph","slug":"search-behavior-prediction-a-hypergraph","title":"Search Behavior Prediction: A Hypergraph Perspective","date":"2022-11-23","arxiv_id":"2211.13328","repositories_listed":1,"syntology":null},{"url":"/paper/raild-towards-leveraging-relation-features","slug":"raild-towards-leveraging-relation-features","title":"RAILD: Towards Leveraging Relation Features for Inductive Link Prediction In Knowledge Graphs","date":"2022-11-21","arxiv_id":"2211.11407","repositories_listed":1,"syntology":null},{"url":"/paper/reinform-selecting-paths-with-reinforcement","slug":"reinform-selecting-paths-with-reinforcement","title":"ReInform: Selecting paths with reinforcement learning for contextualized link prediction","date":"2022-11-19","arxiv_id":"2211.10688","repositories_listed":1,"syntology":null},{"url":"/paper/new-frontiers-in-graph-autoencoders-joint","slug":"new-frontiers-in-graph-autoencoders-joint","title":"New Frontiers in Graph Autoencoders: Joint Community Detection and Link Prediction","date":"2022-11-16","arxiv_id":"2211.08972","repositories_listed":1,"syntology":null},{"url":"/paper/graph-sequential-neural-ode-process-for-link","slug":"graph-sequential-neural-ode-process-for-link","title":"Graph Sequential Neural ODE Process for Link Prediction on Dynamic and Sparse Graphs","date":"2022-11-15","arxiv_id":"2211.08568","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-sequential-neural-ode-process-for-link#ran","syntology_url":"https://syntology.ai/paper/2211.08568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.08568"}},"official":{"repos":["rmanluo/gsnop"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/self-supervised-graph-structure-refinement","slug":"self-supervised-graph-structure-refinement","title":"Self-Supervised Graph Structure Refinement for Graph Neural Networks","date":"2022-11-12","arxiv_id":"2211.06545","repositories_listed":1,"syntology":null},{"url":"/paper/kglm-integrating-knowledge-graph-structure-in","slug":"kglm-integrating-knowledge-graph-structure-in","title":"KGLM: Integrating Knowledge Graph Structure in Language Models for Link Prediction","date":"2022-11-04","arxiv_id":"2211.02744","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/kglm-integrating-knowledge-graph-structure-in#ran","syntology_url":"https://syntology.ai/paper/2211.02744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.02744"}},"official":{"repos":["ibpa/kglm"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-the-positive-role-of-cluster","slug":"rethinking-the-positive-role-of-cluster","title":"Rethinking the positive role of cluster structure in complex networks for link prediction tasks","date":"2022-11-04","arxiv_id":"2211.02396","repositories_listed":1,"syntology":null},{"url":"/paper/search-to-pass-messages-for-temporal","slug":"search-to-pass-messages-for-temporal","title":"Search to Pass Messages for Temporal Knowledge Graph Completion","date":"2022-10-30","arxiv_id":"2210.16740","repositories_listed":1,"syntology":null}],"record_sha256":"bedd7c9796c89901c1f2cd91a082eb491da9c4dfdc0836e45f9f38bafd44ac66","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}