{"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/3","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":3,"pages_in_order":20,"rows_per_page":100,"rows":[201,300],"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/2","next":"/task/link-prediction/papers/4","papers":[{"url":"/paper/abg-nas-adaptive-bayesian-genetic-neural","slug":"abg-nas-adaptive-bayesian-genetic-neural","title":"ABG-NAS: Adaptive Bayesian Genetic Neural Architecture Search for Graph Representation Learning","date":"2025-04-30","arxiv_id":"2504.21254","repositories_listed":1,"syntology":null},{"url":"/paper/msgcn-multiplex-spatial-graph-convolution","slug":"msgcn-multiplex-spatial-graph-convolution","title":"MSGCN: Multiplex Spatial Graph Convolution Network for Interlayer Link Weight Prediction","date":"2025-04-24","arxiv_id":"2504.17749","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-vector-quantized-graph","slug":"hierarchical-vector-quantized-graph","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","date":"2025-04-17","arxiv_id":"2504.12715","repositories_listed":1,"syntology":null},{"url":"/paper/balancing-graph-embedding-smoothness-in-self","slug":"balancing-graph-embedding-smoothness-in-self","title":"Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition","date":"2025-04-16","arxiv_id":"2504.12011","repositories_listed":1,"syntology":null},{"url":"/paper/integrating-structural-and-semantic-signals","slug":"integrating-structural-and-semantic-signals","title":"Integrating Structural and Semantic Signals in Text-Attributed Graphs with BiGTex","date":"2025-04-16","arxiv_id":"2504.12474","repositories_listed":1,"syntology":null},{"url":"/paper/trajectory-encoding-temporal-graph-networks","slug":"trajectory-encoding-temporal-graph-networks","title":"Trajectory Encoding Temporal Graph Networks","date":"2025-04-15","arxiv_id":"2504.11386","repositories_listed":1,"syntology":null},{"url":"/paper/transfer-learning-for-temporal-link","slug":"transfer-learning-for-temporal-link","title":"Transfer Learning for Temporal Link Prediction","date":"2025-04-15","arxiv_id":"2504.10925","repositories_listed":1,"syntology":null},{"url":"/paper/a-systematic-evaluation-of-knowledge-graph","slug":"a-systematic-evaluation-of-knowledge-graph","title":"A Systematic Evaluation of Knowledge Graph Embeddings for Gene-Disease Association Prediction","date":"2025-04-11","arxiv_id":"2504.08445","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-meta-learning-based-poisoning","slug":"exploiting-meta-learning-based-poisoning","title":"Exploiting Meta-Learning-based Poisoning Attacks for Graph Link Prediction","date":"2025-04-08","arxiv_id":"2504.06492","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-completion-with-relation","slug":"knowledge-graph-completion-with-relation","title":"Knowledge Graph Completion with Relation-Aware Anchor Enhancement","date":"2025-04-08","arxiv_id":"2504.06129","repositories_listed":1,"syntology":null},{"url":"/paper/optimal-embedding-guided-negative-sample","slug":"optimal-embedding-guided-negative-sample","title":"Optimal Embedding Guided Negative Sample Generation for Knowledge Graph Link Prediction","date":"2025-04-04","arxiv_id":"2504.03327","repositories_listed":1,"syntology":null},{"url":"/paper/graph-attention-for-heterogeneous-graphs-with","slug":"graph-attention-for-heterogeneous-graphs-with","title":"Graph Attention for Heterogeneous Graphs with Positional Encoding","date":"2025-04-03","arxiv_id":"2504.02938","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-completion-with-mixed","slug":"knowledge-graph-completion-with-mixed","title":"Knowledge Graph Completion with Mixed Geometry Tensor Factorization","date":"2025-04-03","arxiv_id":"2504.02589","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-link-prediction-on-n-ary-relational","slug":"inductive-link-prediction-on-n-ary-relational","title":"Inductive Link Prediction on N-ary Relational Facts via Semantic Hypergraph Reasoning","date":"2025-03-26","arxiv_id":"2503.20676","repositories_listed":1,"syntology":null},{"url":"/paper/finsler-multi-dimensional-scaling-manifold","slug":"finsler-multi-dimensional-scaling-manifold","title":"Finsler Multi-Dimensional Scaling: Manifold Learning for Asymmetric Dimensionality Reduction and Embedding","date":"2025-03-23","arxiv_id":"2503.18010","repositories_listed":1,"syntology":null},{"url":"/paper/contextgnn-goes-to-elliot-towards","slug":"contextgnn-goes-to-elliot-towards","title":"ContextGNN goes to Elliot: Towards Benchmarking Relational Deep Learning for Static Link Prediction (aka Personalized Item Recommendation)","date":"2025-03-20","arxiv_id":"2503.16661","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-and-privacy-preserved-link","slug":"efficient-and-privacy-preserved-link","title":"Efficient and Privacy-Preserved Link Prediction via Condensed Graphs","date":"2025-03-15","arxiv_id":"2503.12156","repositories_listed":1,"syntology":null},{"url":"/paper/leap-inductive-link-prediction-via-learnable","slug":"leap-inductive-link-prediction-via-learnable","title":"Leap: Inductive Link Prediction via Learnable TopologyAugmentation","date":"2025-03-05","arxiv_id":"2503.03331","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-network-embedding-with","slug":"adversarial-network-embedding-with","title":"Adversarial network embedding with bootstrapped representations for sparse networks","date":"2025-03-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/how-low-can-you-go-searching-for-the","slug":"how-low-can-you-go-searching-for-the","title":"How Low Can You Go? Searching for the Intrinsic Dimensionality of Complex Networks using Metric Node Embeddings","date":"2025-03-03","arxiv_id":"2503.01723","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":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/how-low-can-you-go-searching-for-the#ran","syntology_url":"https://syntology.ai/paper/2503.01723","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.01723"}},"official":{"repos":["AndreasLF/HowLowCanYouGo"],"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/exploring-graph-tasks-with-pure-llms-a","slug":"exploring-graph-tasks-with-pure-llms-a","title":"Exploring Graph Tasks with Pure LLMs: A Comprehensive Benchmark and Investigation","date":"2025-02-26","arxiv_id":"2502.18771","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/exploring-graph-tasks-with-pure-llms-a#ran","syntology_url":"https://syntology.ai/paper/2502.18771","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.18771"}},"official":{"repos":["myflashbarry/LLM-benchmarking"],"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/make-literature-based-discovery-great-again","slug":"make-literature-based-discovery-great-again","title":"Make Literature-Based Discovery Great Again through Reproducible Pipelines","date":"2025-02-23","arxiv_id":"2502.16450","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-link-prediction-for-directed","slug":"rethinking-link-prediction-for-directed","title":"Rethinking Link Prediction for Directed Graphs","date":"2025-02-08","arxiv_id":"2502.05724","repositories_listed":1,"syntology":null},{"url":"/paper/tgb-seq-benchmark-challenging-temporal-gnns","slug":"tgb-seq-benchmark-challenging-temporal-gnns","title":"TGB-Seq Benchmark: Challenging Temporal GNNs with Complex Sequential Dynamics","date":"2025-02-05","arxiv_id":"2502.02975","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/tgb-seq-benchmark-challenging-temporal-gnns#ran","syntology_url":"https://syntology.ai/paper/2502.02975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.02975"}},"official":{"repos":["TGB-Seq/TGB-Seq"],"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/leveraging-joint-predictive-embedding-and","slug":"leveraging-joint-predictive-embedding-and","title":"Leveraging Joint Predictive Embedding and Bayesian Inference in Graph Self Supervised Learning","date":"2025-02-02","arxiv_id":"2502.01684","repositories_listed":1,"syntology":null},{"url":"/paper/pathe-leveraging-entity-agnostic-paths-for","slug":"pathe-leveraging-entity-agnostic-paths-for","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","date":"2025-01-31","arxiv_id":"2501.19095","repositories_listed":1,"syntology":null},{"url":"/paper/random-walk-guided-hyperbolic-graph","slug":"random-walk-guided-hyperbolic-graph","title":"Random Walk Guided Hyperbolic Graph Distillation","date":"2025-01-26","arxiv_id":"2501.15696","repositories_listed":1,"syntology":null},{"url":"/paper/community-aware-temporal-walks-parameter-free","slug":"community-aware-temporal-walks-parameter-free","title":"Community-Aware Temporal Walks: Parameter-Free Representation Learning on Continuous-Time Dynamic Graphs","date":"2025-01-21","arxiv_id":"2501.11880","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-spatiotemporal-augmentation-for","slug":"adaptive-spatiotemporal-augmentation-for","title":"Adaptive Spatiotemporal Augmentation for Improving Dynamic Graph Learning","date":"2025-01-17","arxiv_id":"2501.10010","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-graph-representation-learning-with-1","slug":"enhancing-graph-representation-learning-with-1","title":"Enhancing Graph Representation Learning with Localized Topological Features","date":"2025-01-15","arxiv_id":"2501.09178","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/enhancing-graph-representation-learning-with-1#ran","syntology_url":"https://syntology.ai/paper/2501.09178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.09178"}},"official":{"repos":["pkuyzy/TLC-GNN"],"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/structure-preference-enabled-graph-embedding","slug":"structure-preference-enabled-graph-embedding","title":"Structure-Preference Enabled Graph Embedding Generation under Differential Privacy","date":"2025-01-07","arxiv_id":"2501.03451","repositories_listed":1,"syntology":null},{"url":"/paper/diffgraph-heterogeneous-graph-diffusion-model","slug":"diffgraph-heterogeneous-graph-diffusion-model","title":"DiffGraph: Heterogeneous Graph Diffusion Model","date":"2025-01-04","arxiv_id":"2501.02313","repositories_listed":1,"syntology":null},{"url":"/paper/multimodal-contrastive-representation","slug":"multimodal-contrastive-representation","title":"Multimodal Contrastive Representation Learning in Augmented Biomedical Knowledge Graphs","date":"2025-01-03","arxiv_id":"2501.01644","repositories_listed":1,"syntology":null},{"url":"/paper/lase-learned-adjacency-spectral-embeddings","slug":"lase-learned-adjacency-spectral-embeddings","title":"LASE: Learned Adjacency Spectral Embeddings","date":"2024-12-23","arxiv_id":"2412.17734","repositories_listed":1,"syntology":null},{"url":"/paper/a-deep-probabilistic-framework-for-continuous","slug":"a-deep-probabilistic-framework-for-continuous","title":"A Deep Probabilistic Framework for Continuous Time Dynamic Graph Generation","date":"2024-12-20","arxiv_id":"2412.15582","repositories_listed":1,"syntology":null},{"url":"/paper/two-layer-walk-a-community-aware-graph","slug":"two-layer-walk-a-community-aware-graph","title":"Two Layer Walk: A Community-Aware Graph Embedding","date":"2024-12-17","arxiv_id":"2412.12933","repositories_listed":1,"syntology":null},{"url":"/paper/multi-class-and-multi-task-strategies-for","slug":"multi-class-and-multi-task-strategies-for","title":"Multi-Class and Multi-Task Strategies for Neural Directed Link Prediction","date":"2024-12-14","arxiv_id":"2412.10895","repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-robust-integrating-method-by-high","slug":"a-novel-robust-integrating-method-by-high","title":"A novel robust integrating method by high-order proximity for self-supervised attribute network embedding","date":"2024-12-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hyperedge-anomaly-detection-with-hypergraph","slug":"hyperedge-anomaly-detection-with-hypergraph","title":"Hyperedge Anomaly Detection with Hypergraph Neural Network","date":"2024-12-07","arxiv_id":"2412.05641","repositories_listed":1,"syntology":null},{"url":"/paper/expath-explaining-knowledge-graph-link","slug":"expath-explaining-knowledge-graph-link","title":"eXpath: Explaining Knowledge Graph Link Prediction with Ontological Closed Path Rules","date":"2024-12-06","arxiv_id":"2412.04846","repositories_listed":1,"syntology":null},{"url":"/paper/distance-adaptive-quaternion-knowledge-graph","slug":"distance-adaptive-quaternion-knowledge-graph","title":"Distance-Adaptive Quaternion Knowledge Graph Embedding with Bidirectional Rotation","date":"2024-12-05","arxiv_id":"2412.04076","repositories_listed":1,"syntology":null},{"url":"/paper/training-mlps-on-graphs-without-supervision","slug":"training-mlps-on-graphs-without-supervision","title":"Training MLPs on Graphs without Supervision","date":"2024-12-05","arxiv_id":"2412.03864","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/training-mlps-on-graphs-without-supervision#ran","syntology_url":"https://syntology.ai/paper/2412.03864","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.03864"}},"official":{"repos":["zehong-wang/simmlp"],"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/sa-gnas-seed-architecture-expansion-for","slug":"sa-gnas-seed-architecture-expansion-for","title":"SA-GNAS: Seed Architecture Expansion for Efficient Large-scale Graph Neural Architecture Search","date":"2024-12-03","arxiv_id":"2412.02196","repositories_listed":1,"syntology":null},{"url":"/paper/tgtod-a-global-temporal-graph-transformer-for","slug":"tgtod-a-global-temporal-graph-transformer-for","title":"TGTOD: A Global Temporal Graph Transformer for Outlier Detection at Scale","date":"2024-12-01","arxiv_id":"2412.00984","repositories_listed":1,"syntology":null},{"url":"/paper/contextgnn-beyond-two-tower-recommendation","slug":"contextgnn-beyond-two-tower-recommendation","title":"ContextGNN: Beyond Two-Tower Recommendation Systems","date":"2024-11-29","arxiv_id":"2411.19513","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/contextgnn-beyond-two-tower-recommendation#ran","syntology_url":"https://syntology.ai/paper/2411.19513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.19513"}},"official":{"repos":["kumo-ai/ContextGNN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/integrating-social-determinants-of-health","slug":"integrating-social-determinants-of-health","title":"Integrating Social Determinants of Health into Knowledge Graphs: Evaluating Prediction Bias and Fairness in Healthcare","date":"2024-11-29","arxiv_id":"2412.00245","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-ai-and-science-implications-from-a","slug":"bridging-ai-and-science-implications-from-a","title":"Bridging AI and Science: Implications from a Large-Scale Literature Analysis of AI4Science","date":"2024-11-27","arxiv_id":"2412.09628","repositories_listed":1,"syntology":null},{"url":"/paper/tangnn-a-concise-scalable-and-effective-graph","slug":"tangnn-a-concise-scalable-and-effective-graph","title":"TANGNN: a Concise, Scalable and Effective Graph Neural Networks with Top-m Attention Mechanism for Graph Representation Learning","date":"2024-11-23","arxiv_id":"2411.15458","repositories_listed":1,"syntology":null},{"url":"/paper/can-gnns-learn-link-heuristics-a-concise","slug":"can-gnns-learn-link-heuristics-a-concise","title":"Can GNNs Learn Link Heuristics? A Concise Review and Evaluation of Link Prediction Methods","date":"2024-11-22","arxiv_id":"2411.14711","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":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/can-gnns-learn-link-heuristics-a-concise#ran","syntology_url":"https://syntology.ai/paper/2411.14711","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.14711"}},"official":{"repos":["astroming/GNNHE"],"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/unihr-hierarchical-representation-learning","slug":"unihr-hierarchical-representation-learning","title":"UniHR: Hierarchical Representation Learning for Unified Knowledge Graph Link Prediction","date":"2024-11-11","arxiv_id":"2411.07019","repositories_listed":1,"syntology":null},{"url":"/paper/discovering-emergent-connections-in-quantum","slug":"discovering-emergent-connections-in-quantum","title":"Discovering emergent connections in quantum physics research via dynamic word embeddings","date":"2024-11-10","arxiv_id":"2411.06577","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-the-expressivity-of-temporal-graph","slug":"enhancing-the-expressivity-of-temporal-graph","title":"Enhancing the Expressivity of Temporal Graph Networks through Source-Target Identification","date":"2024-11-06","arxiv_id":"2411.03596","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/enhancing-the-expressivity-of-temporal-graph#ran","syntology_url":"https://syntology.ai/paper/2411.03596","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.03596"}},"official":{"repos":["batjandra/TGNv2-NeurReps"],"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/pagerank-bandits-for-link-prediction","slug":"pagerank-bandits-for-link-prediction","title":"PageRank Bandits for Link Prediction","date":"2024-11-03","arxiv_id":"2411.01410","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pagerank-bandits-for-link-prediction#ran","syntology_url":"https://syntology.ai/paper/2411.01410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.01410"}},"official":{"repos":["jiaruzouu/prb"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-unified-approach-to-link-prediction-in","slug":"an-unified-approach-to-link-prediction-in","title":"An unified approach to link prediction in collaboration networks","date":"2024-11-01","arxiv_id":"2411.01066","repositories_listed":1,"syntology":null},{"url":"/paper/ragraph-a-general-retrieval-augmented-graph","slug":"ragraph-a-general-retrieval-augmented-graph","title":"RAGraph: A General Retrieval-Augmented Graph Learning Framework","date":"2024-10-31","arxiv_id":"2410.23855","repositories_listed":1,"syntology":null},{"url":"/paper/csgdn-contrastive-signed-graph-diffusion","slug":"csgdn-contrastive-signed-graph-diffusion","title":"CSGDN: Contrastive Signed Graph Diffusion Network for Predicting Crop Gene-phenotype Associations","date":"2024-10-10","arxiv_id":"2410.07511","repositories_listed":1,"syntology":null},{"url":"/paper/diffusing-to-the-top-boost-graph-neural","slug":"diffusing-to-the-top-boost-graph-neural","title":"Diffusing to the Top: Boost Graph Neural Networks with Minimal Hyperparameter Tuning","date":"2024-10-08","arxiv_id":"2410.05697","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-future-link-prediction-in-quantum","slug":"enhancing-future-link-prediction-in-quantum","title":"Enhancing Future Link Prediction in Quantum Computing Semantic Networks through LLM-Initiated Node Features","date":"2024-10-05","arxiv_id":"2410.04251","repositories_listed":1,"syntology":null},{"url":"/paper/improving-temporal-link-prediction-via","slug":"improving-temporal-link-prediction-via","title":"Improving Temporal Link Prediction via Temporal Walk Matrix Projection","date":"2024-10-05","arxiv_id":"2410.04013","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/improving-temporal-link-prediction-via#ran","syntology_url":"https://syntology.ai/paper/2410.04013","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.04013"}},"official":{"repos":["lxd99/tpnet"],"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/leveraging-social-determinants-of-health-in","slug":"leveraging-social-determinants-of-health-in","title":"Leveraging Social Determinants of Health in Alzheimer's Research Using LLM-Augmented Literature Mining and Knowledge Graphs","date":"2024-10-04","arxiv_id":"2410.09080","repositories_listed":1,"syntology":null},{"url":"/paper/proxi-challenging-the-gnns-for-link","slug":"proxi-challenging-the-gnns-for-link","title":"PROXI: Challenging the GNNs for Link Prediction","date":"2024-10-02","arxiv_id":"2410.01802","repositories_listed":1,"syntology":null},{"url":"/paper/replacing-paths-with-connection-biased","slug":"replacing-paths-with-connection-biased","title":"Replacing Paths with Connection-Biased Attention for Knowledge Graph Completion","date":"2024-10-01","arxiv_id":"2410.00876","repositories_listed":1,"syntology":null},{"url":"/paper/reevaluation-of-inductive-link-prediction","slug":"reevaluation-of-inductive-link-prediction","title":"Reevaluation of Inductive Link Prediction","date":"2024-09-30","arxiv_id":"2409.20130","repositories_listed":1,"syntology":null},{"url":"/paper/explainable-enrichment-driven-graph-reasoner","slug":"explainable-enrichment-driven-graph-reasoner","title":"Explainable Enrichment-Driven GrAph Reasoner (EDGAR) for Large Knowledge Graphs with Applications in Drug Repurposing","date":"2024-09-27","arxiv_id":"2409.18659","repositories_listed":1,"syntology":null},{"url":"/paper/supra-laplacian-encoding-for-transformer-on","slug":"supra-laplacian-encoding-for-transformer-on","title":"Supra-Laplacian Encoding for Transformer on Dynamic Graphs","date":"2024-09-26","arxiv_id":"2409.17986","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/supra-laplacian-encoding-for-transformer-on#ran","syntology_url":"https://syntology.ai/paper/2409.17986","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17986"}},"official":{"repos":["ykrmm/slate"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/higher-order-message-passing-for-glycan","slug":"higher-order-message-passing-for-glycan","title":"Higher-Order Message Passing for Glycan Representation Learning","date":"2024-09-20","arxiv_id":"2409.13467","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/higher-order-message-passing-for-glycan#ran","syntology_url":"https://syntology.ai/paper/2409.13467","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.13467"}},"official":{"repos":["bojarlab/gifflar"],"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/towards-understanding-evolution-of-science","slug":"towards-understanding-evolution-of-science","title":"Towards understanding evolution of science through language model series","date":"2024-09-15","arxiv_id":"2409.09636","repositories_listed":1,"syntology":null},{"url":"/paper/reproducibility-study-of-learning-fair-graph","slug":"reproducibility-study-of-learning-fair-graph","title":"Reproducibility Study Of Learning Fair Graph Representations Via Automated Data Augmentations","date":"2024-08-31","arxiv_id":"2409.00421","repositories_listed":1,"syntology":null},{"url":"/paper/learning-granularity-representation-for","slug":"learning-granularity-representation-for","title":"Learning Granularity Representation for Temporal Knowledge Graph Completion","date":"2024-08-27","arxiv_id":"2408.15293","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-representation-learning-for-3","slug":"contrastive-representation-learning-for-3","title":"Contrastive Representation Learning for Dynamic Link Prediction in Temporal Networks","date":"2024-08-22","arxiv_id":"2408.12753","repositories_listed":1,"syntology":null},{"url":"/paper/rcone-rough-cone-embedding-for-multi-hop","slug":"rcone-rough-cone-embedding-for-multi-hop","title":"RConE: Rough Cone Embedding for Multi-Hop Logical Query Answering on Multi-Modal Knowledge Graphs","date":"2024-08-21","arxiv_id":"2408.11526","repositories_listed":1,"syntology":null},{"url":"/paper/wav2graph-a-framework-for-supervised-learning","slug":"wav2graph-a-framework-for-supervised-learning","title":"wav2graph: A Framework for Supervised Learning Knowledge Graph from Speech","date":"2024-08-08","arxiv_id":"2408.04174","repositories_listed":1,"syntology":null},{"url":"/paper/deep-generative-models-for-subgraph","slug":"deep-generative-models-for-subgraph","title":"Deep Generative Models for Subgraph Prediction","date":"2024-08-07","arxiv_id":"2408.04053","repositories_listed":1,"syntology":null},{"url":"/paper/derivation-of-back-propagation-for-graph","slug":"derivation-of-back-propagation-for-graph","title":"Derivation of Back-propagation for Graph Convolutional Networks using Matrix Calculus and its Application to Explainable Artificial Intelligence","date":"2024-08-02","arxiv_id":"2408.01408","repositories_listed":1,"syntology":null},{"url":"/paper/an-analysis-of-novel-money-laundering-data","slug":"an-analysis-of-novel-money-laundering-data","title":"An Analysis of Novel Money Laundering Data Using Heterogeneous Graph Isomorphism Networks. FinCEN Files Case Study","date":"2024-07-26","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/autordf2gml-facilitating-rdf-integration-in","slug":"autordf2gml-facilitating-rdf-integration-in","title":"AutoRDF2GML: Facilitating RDF Integration in Graph Machine Learning","date":"2024-07-26","arxiv_id":"2407.18735","repositories_listed":1,"syntology":null},{"url":"/paper/asep-benchmarking-deep-learning-methods-for","slug":"asep-benchmarking-deep-learning-methods-for","title":"AsEP: Benchmarking Deep Learning Methods for Antibody-specific Epitope Prediction","date":"2024-07-25","arxiv_id":"2407.18184","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-the-role-of-node-diversity-in","slug":"exploring-the-role-of-node-diversity-in","title":"Exploring the Role of Node Diversity in Directed Graph Representation Learning","date":"2024-07-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/numerical-literals-in-link-prediction-a","slug":"numerical-literals-in-link-prediction-a","title":"Numerical Literals in Link Prediction: A Critical Examination of Models and Datasets","date":"2024-07-25","arxiv_id":"2407.18241","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-receptive-field-in-dynamic-graph","slug":"temporal-receptive-field-in-dynamic-graph","title":"Temporal receptive field in dynamic graph learning: A comprehensive analysis","date":"2024-07-17","arxiv_id":"2407.12370","repositories_listed":1,"syntology":null},{"url":"/paper/findkg-dynamic-knowledge-graphs-with-large","slug":"findkg-dynamic-knowledge-graphs-with-large","title":"FinDKG: Dynamic Knowledge Graphs with Large Language Models for Detecting Global Trends in Financial Markets","date":"2024-07-15","arxiv_id":"2407.10909","repositories_listed":1,"syntology":null},{"url":"/paper/graphusion-leveraging-large-language-models","slug":"graphusion-leveraging-large-language-models","title":"Graphusion: Leveraging Large Language Models for Scientific Knowledge Graph Fusion and Construction in NLP Education","date":"2024-07-15","arxiv_id":"2407.10794","repositories_listed":1,"syntology":null},{"url":"/paper/fast-and-continual-knowledge-graph-embedding","slug":"fast-and-continual-knowledge-graph-embedding","title":"Fast and Continual Knowledge Graph Embedding via Incremental LoRA","date":"2024-07-08","arxiv_id":"2407.05705","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"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) · 1 unverified","sample_list":"/paper/fast-and-continual-knowledge-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/2407.05705","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.05705"}},"official":{"repos":["seukgcode/fastkge"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/start-from-zero-triple-set-prediction-for","slug":"start-from-zero-triple-set-prediction-for","title":"Start from Zero: Triple Set Prediction for Automatic Knowledge Graph Completion","date":"2024-06-26","arxiv_id":"2406.18166","repositories_listed":1,"syntology":null},{"url":"/paper/a-pure-transformer-pretraining-framework-on","slug":"a-pure-transformer-pretraining-framework-on","title":"A Pure Transformer Pretraining Framework on Text-attributed Graphs","date":"2024-06-19","arxiv_id":"2406.13873","repositories_listed":1,"syntology":null},{"url":"/paper/self-explainable-temporal-graph-networks","slug":"self-explainable-temporal-graph-networks","title":"Self-Explainable Temporal Graph Networks based on Graph Information Bottleneck","date":"2024-06-19","arxiv_id":"2406.13214","repositories_listed":1,"syntology":null},{"url":"/paper/dtgb-a-comprehensive-benchmark-for-dynamic","slug":"dtgb-a-comprehensive-benchmark-for-dynamic","title":"DTGB: A Comprehensive Benchmark for Dynamic Text-Attributed Graphs","date":"2024-06-17","arxiv_id":"2406.12072","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":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/dtgb-a-comprehensive-benchmark-for-dynamic#ran","syntology_url":"https://syntology.ai/paper/2406.12072","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12072"}},"official":{"repos":["zjs123/DTGB"],"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/edge-classification-on-graphs-new-directions","slug":"edge-classification-on-graphs-new-directions","title":"Edge Classification on Graphs: New Directions in Topological Imbalance","date":"2024-06-17","arxiv_id":"2406.11685","repositories_listed":1,"syntology":null},{"url":"/paper/improving-rule-mining-via-embedding-based","slug":"improving-rule-mining-via-embedding-based","title":"Improving rule mining via embedding-based link prediction","date":"2024-06-14","arxiv_id":"2406.10144","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-neural-common-neighbor-for-temporal","slug":"efficient-neural-common-neighbor-for-temporal","title":"Efficient Neural Common Neighbor for Temporal Graph Link Prediction","date":"2024-06-12","arxiv_id":"2406.07926","repositories_listed":1,"syntology":null},{"url":"/paper/heuristic-learning-with-graph-neural-networks","slug":"heuristic-learning-with-graph-neural-networks","title":"Heuristic Learning with Graph Neural Networks: A Unified Framework for Link Prediction","date":"2024-06-12","arxiv_id":"2406.07979","repositories_listed":1,"syntology":null},{"url":"/paper/moti-mathcal-ve-a-drug-target-interaction","slug":"moti-mathcal-ve-a-drug-target-interaction","title":"MOTIVE: A Drug-Target Interaction Graph For Inductive Link Prediction","date":"2024-06-12","arxiv_id":"2406.08649","repositories_listed":1,"syntology":null},{"url":"/paper/strong-and-weak-random-walks-on-signed","slug":"strong-and-weak-random-walks-on-signed","title":"Strong and Weak Random Walks on Signed Networks","date":"2024-06-12","arxiv_id":"2406.08034","repositories_listed":1,"syntology":null},{"url":"/paper/linkgpt-teaching-large-language-models-to","slug":"linkgpt-teaching-large-language-models-to","title":"LinkGPT: Teaching Large Language Models To Predict Missing Links","date":"2024-06-07","arxiv_id":"2406.04640","repositories_listed":1,"syntology":null},{"url":"/paper/learning-long-range-dependencies-on-graphs","slug":"learning-long-range-dependencies-on-graphs","title":"Learning Long Range Dependencies on Graphs via Random Walks","date":"2024-06-05","arxiv_id":"2406.03386","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-long-range-dependencies-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2406.03386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03386"}},"official":{"repos":["borgwardtlab/neuralwalker"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/linklogic-a-new-method-and-benchmark-for","slug":"linklogic-a-new-method-and-benchmark-for","title":"LinkLogic: A New Method and Benchmark for Explainable Knowledge Graph Predictions","date":"2024-06-02","arxiv_id":"2406.00855","repositories_listed":1,"syntology":null},{"url":"/paper/towards-a-general-gnn-framework-for","slug":"towards-a-general-gnn-framework-for","title":"Towards a General Recipe for Combinatorial Optimization with Multi-Filter GNNs","date":"2024-05-31","arxiv_id":"2405.20543","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":13,"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) · 3 unverified","sample_list":"/paper/towards-a-general-gnn-framework-for#ran","syntology_url":"https://syntology.ai/paper/2405.20543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20543"}},"official":{"repos":["wenkelf/copt"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/sig-efficient-self-interpretable-graph-neural","slug":"sig-efficient-self-interpretable-graph-neural","title":"SIG: Efficient Self-Interpretable Graph Neural Network for Continuous-time Dynamic Graphs","date":"2024-05-29","arxiv_id":"2405.19062","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-the-performance-of-continuous-time","slug":"exploring-the-performance-of-continuous-time","title":"Exploring the Performance of Continuous-Time Dynamic Link Prediction Algorithms","date":"2024-05-27","arxiv_id":"2405.17182","repositories_listed":1,"syntology":null},{"url":"/paper/kg-fit-knowledge-graph-fine-tuning-upon-open","slug":"kg-fit-knowledge-graph-fine-tuning-upon-open","title":"KG-FIT: Knowledge Graph Fine-Tuning Upon Open-World Knowledge","date":"2024-05-26","arxiv_id":"2405.16412","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/kg-fit-knowledge-graph-fine-tuning-upon-open#ran","syntology_url":"https://syntology.ai/paper/2405.16412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16412"}},"official":{"repos":["pat-jj/KG-FIT"],"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"]}}}],"record_sha256":"1e1021ae52b9a732cbf2d1a3f9beb49968921bb233dea8f8c6f8f44608b7f5ad","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}