{"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/12","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":12,"pages_in_order":20,"rows_per_page":100,"rows":[1101,1200],"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/11","next":"/task/link-prediction/papers/13","papers":[{"url":null,"slug":"utg-towards-a-unified-view-of-snapshot-and","title":"UTG: Towards a Unified View of Snapshot and Event Based Models for Temporal Graphs","date":"2024-07-17","arxiv_id":"2407.12269","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-hyperbolic-representations-via","title":"Improving Hyperbolic Representations via Gromov-Wasserstein Regularization","date":"2024-07-15","arxiv_id":"2407.10495","repositories_listed":0,"syntology":null},{"url":null,"slug":"sf-gnn-self-filter-for-message-lossless","title":"SF-GNN: Self Filter for Message Lossless Propagation in Deep Graph Neural Network","date":"2024-07-03","arxiv_id":"2407.02762","repositories_listed":0,"syntology":null},{"url":null,"slug":"actionable-cyber-threat-intelligence-using","title":"Actionable Cyber Threat Intelligence using Knowledge Graphs and Large Language Models","date":"2024-06-30","arxiv_id":"2407.02528","repositories_listed":0,"syntology":null},{"url":null,"slug":"conformalized-link-prediction-on-graph-neural","title":"Conformalized Link Prediction on Graph Neural Networks","date":"2024-06-26","arxiv_id":"2406.18763","repositories_listed":0,"syntology":null},{"url":null,"slug":"kolmogorov-arnold-graph-neural-networks","title":"Kolmogorov-Arnold Graph Neural Networks","date":"2024-06-26","arxiv_id":"2406.18354","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-with-untrained-message","title":"Link Prediction with Untrained Message Passing Layers","date":"2024-06-24","arxiv_id":"2406.16687","repositories_listed":0,"syntology":null},{"url":null,"slug":"disentangled-hyperbolic-representation","title":"Disentangled Hyperbolic Representation Learning for Heterogeneous Graphs","date":"2024-06-14","arxiv_id":"2406.10367","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-the-generalizability-of-link","title":"Understanding the Generalizability of Link Predictors Under Distribution Shifts on Graphs","date":"2024-06-13","arxiv_id":"2406.08788","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphfm-a-comprehensive-benchmark-for-graph","title":"GraphFM: A Comprehensive Benchmark for Graph Foundation Model","date":"2024-06-12","arxiv_id":"2406.08310","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-parallel-multi-hop-reasoning-a","title":"Efficient Parallel Multi-Hop Reasoning: A Scalable Approach for Knowledge Graph Analysis","date":"2024-06-11","arxiv_id":"2406.07727","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-human-understandable-explanations","title":"Generating Human Understandable Explanations for Node Embeddings","date":"2024-06-11","arxiv_id":"2406.07642","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-in-bipartite-networks","title":"Link Prediction in Bipartite Networks","date":"2024-06-10","arxiv_id":"2406.06658","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-link-prediction-to-forecasting","title":"From Link Prediction to Forecasting: Information Loss in Batch-based Temporal Graph Learning","date":"2024-06-07","arxiv_id":"2406.04897","repositories_listed":0,"syntology":null},{"url":null,"slug":"genie-watermarking-graph-neural-networks-for","title":"GENIE: Watermarking Graph Neural Networks for Link Prediction","date":"2024-06-07","arxiv_id":"2406.04805","repositories_listed":0,"syntology":null},{"url":null,"slug":"gnnanatomy-systematic-generation-and","title":"GNNAnatomy: Rethinking Model-Level Explanations for Graph Neural Networks","date":"2024-06-06","arxiv_id":"2406.04548","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-the-resilience-of-graph-neural","title":"Enhancing the Resilience of Graph Neural Networks to Topological Perturbations in Sparse Graphs","date":"2024-06-05","arxiv_id":"2406.03097","repositories_listed":0,"syntology":null},{"url":null,"slug":"continuous-geometry-aware-graph-diffusion-via","title":"Continuous Geometry-Aware Graph Diffusion via Hyperbolic Neural PDE","date":"2024-06-03","arxiv_id":"2406.01282","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-temporal-knowledge-graph-reasoning","title":"A Unified Temporal Knowledge Graph Reasoning Model Towards Interpolation and Extrapolation","date":"2024-05-28","arxiv_id":"2405.18106","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-global-awareness-of-linkset","title":"Improving global awareness of linkset predictions using Cross-Attentive Modulation tokens","date":"2024-05-28","arxiv_id":"2405.19375","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-from-a-different-perspective-in-re","title":"Predicting from a Different Perspective: A Re-ranking Model for Inductive Knowledge Graph Completion","date":"2024-05-27","arxiv_id":"2405.16902","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-spectral-training-and-inference-on","title":"Sparse Spectral Training and Inference on Euclidean and Hyperbolic Neural Networks","date":"2024-05-24","arxiv_id":"2405.15481","repositories_listed":0,"syntology":null},{"url":null,"slug":"dygprompt-learning-feature-and-time-prompts","title":"Node-Time Conditional Prompt Learning In Dynamic Graphs","date":"2024-05-22","arxiv_id":"2405.13937","repositories_listed":0,"syntology":null},{"url":null,"slug":"harmonizing-human-insights-and-ai-precision","title":"Harmonizing Human Insights and AI Precision: Hand in Hand for Advancing Knowledge Graph Task","date":"2024-05-15","arxiv_id":"2405.09477","repositories_listed":0,"syntology":null},{"url":null,"slug":"benchmarking-retrieval-augmented-large","title":"Benchmarking Retrieval-Augmented Large Language Models in Biomedical NLP: Application, Robustness, and Self-Awareness","date":"2024-05-13","arxiv_id":"2405.08151","repositories_listed":0,"syntology":null},{"url":null,"slug":"ctrl-continuous-time-representation-learning","title":"CTRL: Continuous-Time Representation Learning on Temporal Heterogeneous Information Network","date":"2024-05-11","arxiv_id":"2405.08013","repositories_listed":0,"syntology":null},{"url":null,"slug":"input-snapshots-fusion-for-scalable-discrete","title":"Input Snapshots Fusion for Scalable Discrete Dynamic Graph Nerual Networks","date":"2024-05-11","arxiv_id":"2405.06975","repositories_listed":0,"syntology":null},{"url":null,"slug":"conditional-local-feature-encoding-for-graph","title":"Conditional Local Feature Encoding for Graph Neural Networks","date":"2024-05-08","arxiv_id":"2405.04755","repositories_listed":0,"syntology":null},{"url":null,"slug":"untargeted-adversarial-attack-on-knowledge","title":"Untargeted Adversarial Attack on Knowledge Graph Embeddings","date":"2024-05-08","arxiv_id":"2405.10970","repositories_listed":0,"syntology":null},{"url":null,"slug":"subgraph2vec-a-random-walk-based-algorithm","title":"Subgraph2vec: A random walk-based algorithm for embedding knowledge graphs","date":"2024-05-03","arxiv_id":"2405.02240","repositories_listed":0,"syntology":null},{"url":null,"slug":"somer-multi-view-user-representation-learning","title":"SoMeR: Multi-View User Representation Learning for Social Media","date":"2024-05-02","arxiv_id":"2405.05275","repositories_listed":0,"syntology":null},{"url":null,"slug":"re-visiting-skip-gram-negative-sampling","title":"Bypassing Skip-Gram Negative Sampling: Dimension Regularization as a More Efficient Alternative for Graph Embeddings","date":"2024-04-30","arxiv_id":"2405.00172","repositories_listed":0,"syntology":null},{"url":null,"slug":"parameter-efficient-tuning-large-language","title":"Parameter-Efficient Tuning Large Language Models for Graph Representation Learning","date":"2024-04-28","arxiv_id":"2404.18271","repositories_listed":0,"syntology":null},{"url":null,"slug":"interaction-event-forecasting-in-multi","title":"Deep Representation Learning for Forecasting Recursive and Multi-Relational Events in Temporal Networks","date":"2024-04-27","arxiv_id":"2404.17943","repositories_listed":0,"syntology":null},{"url":null,"slug":"phlp-sole-persistent-homology-for-link","title":"PHLP: Sole Persistent Homology for Link Prediction - Interpretable Feature Extraction","date":"2024-04-23","arxiv_id":"2404.15225","repositories_listed":0,"syntology":null},{"url":null,"slug":"core-data-augmentation-for-link-prediction","title":"CORE: Data Augmentation for Link Prediction via Information Bottleneck","date":"2024-04-17","arxiv_id":"2404.11032","repositories_listed":0,"syntology":null},{"url":null,"slug":"binder-hierarchical-concept-representation","title":"Binder: Hierarchical Concept Representation through Order Embedding of Binary Vectors","date":"2024-04-16","arxiv_id":"2404.10924","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-graph-neural-network-with-supervised","title":"Fair Graph Neural Network with Supervised Contrastive Regularization","date":"2024-04-09","arxiv_id":"2404.06090","repositories_listed":0,"syntology":null},{"url":null,"slug":"construction-of-functional-materials","title":"Construction and Application of Materials Knowledge Graph in Multidisciplinary Materials Science via Large Language Model","date":"2024-04-03","arxiv_id":"2404.03080","repositories_listed":0,"syntology":null},{"url":null,"slug":"heteromile-a-multi-level-graph-representation","title":"HeteroMILE: a Multi-Level Graph Representation Learning Framework for Heterogeneous Graphs","date":"2024-03-31","arxiv_id":"2404.00816","repositories_listed":0,"syntology":null},{"url":null,"slug":"instruction-based-hypergraph-pretraining","title":"Instruction-based Hypergraph Pretraining","date":"2024-03-28","arxiv_id":"2403.19063","repositories_listed":0,"syntology":null},{"url":null,"slug":"directed-criteria-citation-recommendation-and","title":"Directed Criteria Citation Recommendation and Ranking Through Link Prediction","date":"2024-03-18","arxiv_id":"2403.18855","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-relational-graph-neural-network-for-out","title":"Multi-Relational Graph Neural Network for Out-of-Domain Link Prediction","date":"2024-03-17","arxiv_id":"2403.11292","repositories_listed":0,"syntology":null},{"url":null,"slug":"xlp-explainable-link-prediction-for-master","title":"xLP: Explainable Link Prediction for Master Data Management","date":"2024-03-14","arxiv_id":"2403.09806","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-for-social-networks-using","title":"Link Prediction for Social Networks using Representation Learning and Heuristic-based Features","date":"2024-03-13","arxiv_id":"2403.08613","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graph-large-language-model-kg-llm","title":"Knowledge Graph Large Language Model (KG-LLM) for Link Prediction","date":"2024-03-12","arxiv_id":"2403.07311","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-differential-geometric-view-and","title":"A Differential Geometric View and Explainability of GNN on Evolving Graphs","date":"2024-03-11","arxiv_id":"2403.06425","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-chain-to-tree-refining-chain-like-rules","title":"From Chain to Tree: Refining Chain-like Rules into Tree-like Rules on Knowledge Graphs","date":"2024-03-08","arxiv_id":"2403.05130","repositories_listed":0,"syntology":null},{"url":null,"slug":"in-n-out-calibrating-graph-neural-networks","title":"In-n-Out: Calibrating Graph Neural Networks for Link Prediction","date":"2024-03-07","arxiv_id":"2403.04605","repositories_listed":0,"syntology":null},{"url":null,"slug":"rcoco-contrastive-collective-link-prediction","title":"RCoCo: Contrastive Collective Link Prediction across Multiplex Network in Riemannian Space","date":"2024-03-04","arxiv_id":"2403.01864","repositories_listed":0,"syntology":null},{"url":null,"slug":"unveiling-hidden-links-between-unseen","title":"Unveiling Hidden Links Between Unseen Security Entities","date":"2024-03-04","arxiv_id":"2403.02014","repositories_listed":0,"syntology":null},{"url":null,"slug":"negative-sampling-in-knowledge-graph","title":"Negative Sampling in Knowledge Graph Representation Learning: A Review","date":"2024-02-29","arxiv_id":"2402.19195","repositories_listed":0,"syntology":null},{"url":null,"slug":"scaling-up-dynamic-edge-partition-models-via","title":"Scaling up Dynamic Edge Partition Models via Stochastic Gradient MCMC","date":"2024-02-29","arxiv_id":"2403.00044","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-shot-graph-representation-learning-using","title":"Hyperdimensional Representation Learning for Node Classification and Link Prediction","date":"2024-02-26","arxiv_id":"2402.17073","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-relation-interactive-approach-for-message","title":"A Relation-Interactive Approach for Message Passing in Hyper-relational Knowledge Graphs","date":"2024-02-23","arxiv_id":"2402.15140","repositories_listed":0,"syntology":null},{"url":null,"slug":"automating-psychological-hypothesis","title":"Automating psychological hypothesis generation with AI: when large language models meet causal graph","date":"2024-02-22","arxiv_id":"2402.14424","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-under-heterophily-a-physics","title":"Link Prediction with Physics-Inspired Graph Neural Networks","date":"2024-02-22","arxiv_id":"2402.14802","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-condensed-transition-graph-framework-for","title":"A Condensed Transition Graph Framework for Zero-shot Link Prediction with Large Language Models","date":"2024-02-16","arxiv_id":"2402.10779","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-we-soft-prompt-llms-for-graph-learning","title":"Can we Soft Prompt LLMs for Graph Learning Tasks?","date":"2024-02-15","arxiv_id":"2402.10359","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphcbal-class-balanced-active-learning-for","title":"Class-Balanced and Reinforced Active Learning on Graphs","date":"2024-02-15","arxiv_id":"2402.10074","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-training-of-temporal-gnns-using","title":"Robust Training of Temporal GNNs using Nearest Neighbours based Hard Negatives","date":"2024-02-14","arxiv_id":"2402.09239","repositories_listed":0,"syntology":null},{"url":null,"slug":"bert4fca-a-method-for-bipartite-link","title":"BERT4FCA: A Method for Bipartite Link Prediction using Formal Concept Analysis and BERT","date":"2024-02-13","arxiv_id":"2402.08236","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-link-predictor-by-in-context","title":"Universal Link Predictor By In-Context Learning on Graphs","date":"2024-02-12","arxiv_id":"2402.07738","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-with-relational-hypergraphs","title":"Link Prediction with Relational Hypergraphs","date":"2024-02-06","arxiv_id":"2402.04062","repositories_listed":0,"syntology":null},{"url":null,"slug":"mquine-a-cure-for-z-paradox-in-knowledge","title":"MQuinE: a cure for \"Z-paradox\" in knowledge graph embedding models","date":"2024-02-05","arxiv_id":"2402.03583","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-guarantees-for-link-prediction","title":"Statistical Guarantees for Link Prediction using Graph Neural Networks","date":"2024-02-05","arxiv_id":"2402.02692","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-graph-model-for-cross-domain-dynamic-link","title":"Enhancing Cross-domain Link Prediction via Evolution Process Modeling","date":"2024-02-03","arxiv_id":"2402.02168","repositories_listed":0,"syntology":null},{"url":null,"slug":"phenolinker-phenotype-gene-link-prediction","title":"PhenoLinker: Phenotype-Gene Link Prediction and Explanation using Heterogeneous Graph Neural Networks","date":"2024-02-02","arxiv_id":"2402.01809","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphviz2vec-a-structure-aware-feature","title":"GraphViz2Vec: A Structure-aware Feature Generation Model to Improve Classification in GNNs","date":"2024-01-30","arxiv_id":"2401.17178","repositories_listed":0,"syntology":null},{"url":null,"slug":"type-based-neural-link-prediction-adapter-for","title":"Type-based Neural Link Prediction Adapter for Complex Query Answering","date":"2024-01-29","arxiv_id":"2401.16045","repositories_listed":0,"syntology":null},{"url":null,"slug":"mtrgl-effective-temporal-correlation","title":"MTRGL:Effective Temporal Correlation Discerning through Multi-modal Temporal Relational Graph Learning","date":"2024-01-25","arxiv_id":"2401.14199","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-link-prediction-on-large-scale","title":"LPNL: Scalable Link Prediction with Large Language Models","date":"2024-01-24","arxiv_id":"2401.13227","repositories_listed":0,"syntology":null},{"url":null,"slug":"chain-of-history-learning-and-forecasting","title":"Chain of History: Learning and Forecasting with LLMs for Temporal Knowledge Graph Completion","date":"2024-01-11","arxiv_id":"2401.06072","repositories_listed":0,"syntology":null},{"url":null,"slug":"introducing-new-node-prediction-in-graph","title":"Introducing New Node Prediction in Graph Mining: Predicting All Links from Isolated Nodes with Graph Neural Networks","date":"2024-01-10","arxiv_id":"2401.05468","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-the-structure-of-dynamic-graphs","title":"Predicting the structure of dynamic graphs","date":"2024-01-08","arxiv_id":"2401.04280","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-backdoor-attack-against-link-prediction","title":"Effective backdoor attack on graph neural networks in link prediction tasks","date":"2024-01-05","arxiv_id":"2401.02663","repositories_listed":0,"syntology":null},{"url":null,"slug":"docgraphlm-documental-graph-language-model","title":"DocGraphLM: Documental Graph Language Model for Information Extraction","date":"2024-01-05","arxiv_id":"2401.02823","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-community-detection-and-graph-neural","title":"A Community Detection and Graph Neural Network Based Link Prediction Approach for Scientific Literature","date":"2024-01-04","arxiv_id":"2401.02542","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-scalable-structural-representations","title":"Learning Scalable Structural Representations for Link Prediction with Bloom Signatures","date":"2023-12-28","arxiv_id":"2312.16784","repositories_listed":0,"syntology":null},{"url":null,"slug":"continuous-time-graph-representation-with","title":"Continuous-time Graph Representation with Sequential Survival Process","date":"2023-12-20","arxiv_id":"2312.13068","repositories_listed":0,"syntology":null},{"url":null,"slug":"concept-prerequisite-relation-prediction-by","title":"Concept Prerequisite Relation Prediction by Using Permutation-Equivariant Directed Graph Neural Networks","date":"2023-12-15","arxiv_id":"2312.09802","repositories_listed":0,"syntology":null},{"url":null,"slug":"isomorphic-consistent-variational-graph-auto","title":"Isomorphic-Consistent Variational Graph Auto-Encoders for Multi-Level Graph Representation Learning","date":"2023-12-09","arxiv_id":"2312.05519","repositories_listed":0,"syntology":null},{"url":null,"slug":"redefining-developer-assistance-through-large","title":"Redefining Developer Assistance: Through Large Language Models in Software Ecosystem","date":"2023-12-09","arxiv_id":"2312.05626","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-transduction-a-survey-on-inductive-few","title":"Beyond Transduction: A Survey on Inductive, Few Shot, and Zero Shot Link Prediction in Knowledge Graphs","date":"2023-12-08","arxiv_id":"2312.04997","repositories_listed":0,"syntology":null},{"url":null,"slug":"not-all-negatives-areworth-attending-to-meta","title":"Not All Negatives Are Worth Attending to: Meta-Bootstrapping Negative Sampling Framework for Link Prediction","date":"2023-12-08","arxiv_id":"2312.04815","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-review-of-link-prediction-applications-in","title":"A Review of Link Prediction Applications in Network Biology","date":"2023-12-03","arxiv_id":"2312.01275","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graph-reasoning-based-on-attention","title":"Knowledge Graph Reasoning Based on Attention GCN","date":"2023-12-02","arxiv_id":"2312.10049","repositories_listed":0,"syntology":null},{"url":null,"slug":"location-sensitive-embedding-for-knowledge","title":"Location Sensitive Embedding for Knowledge Graph Reasoning","date":"2023-12-01","arxiv_id":"2401.10893","repositories_listed":0,"syntology":null},{"url":null,"slug":"hot-higher-order-dynamic-graph-representation","title":"HOT: Higher-Order Dynamic Graph Representation Learning with Efficient Transformers","date":"2023-11-30","arxiv_id":"2311.18526","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-pretraining-for-heterogeneous","title":"Self-Supervised Pretraining for Heterogeneous Hypergraph Neural Networks","date":"2023-11-19","arxiv_id":"2311.11368","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graphs-are-not-created-equal","title":"Knowledge Graphs are not Created Equal: Exploring the Properties and Structure of Real KGs","date":"2023-11-10","arxiv_id":"2311.06414","repositories_listed":0,"syntology":null},{"url":null,"slug":"unifying-structure-and-language-semantic-for","title":"Unifying Structure and Language Semantic for Efficient Contrastive Knowledge Graph Completion with Structured Entity Anchors","date":"2023-11-07","arxiv_id":"2311.04250","repositories_listed":0,"syntology":null},{"url":"/paper/edge2node-reducing-edge-prediction-to-node","slug":"edge2node-reducing-edge-prediction-to-node","title":"Edge2Node: Reducing Edge Prediction to Node Classification","date":"2023-11-06","arxiv_id":"2311.02921","repositories_listed":0,"syntology":null},{"url":"/paper/hyperbolic-graph-neural-networks-at-scale-a","slug":"hyperbolic-graph-neural-networks-at-scale-a","title":"Hyperbolic Graph Neural Networks at Scale: A Meta Learning Approach","date":"2023-10-29","arxiv_id":"2310.18918","repositories_listed":0,"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":6,"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/hyperbolic-graph-neural-networks-at-scale-a#ran","syntology_url":"https://syntology.ai/paper/2310.18918","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18918"}},"official":null}},{"url":null,"slug":"community-detection-and-classification","title":"Community Detection Guarantees Using Embeddings Learned by Node2Vec","date":"2023-10-26","arxiv_id":"2310.17712","repositories_listed":0,"syntology":null},{"url":null,"slug":"balancing-augmentation-with-edge-utility","title":"Balancing Augmentation with Edge-Utility Filter for Signed GNNs","date":"2023-10-25","arxiv_id":"2310.16862","repositories_listed":0,"syntology":null},{"url":null,"slug":"dyexplainer-explainable-dynamic-graph-neural","title":"DyExplainer: Explainable Dynamic Graph Neural Networks","date":"2023-10-25","arxiv_id":"2310.16375","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-agent-explicit-reasoning-agent-for","title":"Graph Agent: Explicit Reasoning Agent for Graphs","date":"2023-10-25","arxiv_id":"2310.16421","repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-and-contrastive-paradigms-are","title":"Generative and Contrastive Paradigms Are Complementary for Graph Self-Supervised Learning","date":"2023-10-24","arxiv_id":"2310.15523","repositories_listed":0,"syntology":null},{"url":null,"slug":"emulating-the-human-mind-a-neural-symbolic","title":"Emulating the Human Mind: A Neural-symbolic Link Prediction Model with Fast and Slow Reasoning and Filtered Rules","date":"2023-10-21","arxiv_id":"2310.13996","repositories_listed":0,"syntology":null}],"record_sha256":"18e7ed7987323990f5e40ea79de7ba910ff90b97d3e98ec5150773e9338f9a79","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}