{"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/graph-embedding/papers/2","list_of":"/task/graph-embedding","task":"Graph Embedding","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":12,"rows_per_page":100,"rows":[101,200],"of":1192,"counts":{"archive_papers_tagged":1192,"with_a_code_link":533,"where_syntology_ran_a_sample":92,"not_listed_spam_title":0,"listed":1192,"listed_where_code_ran":92,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":83,"every_run_a_failure_of_syntologys_instrument":9,"listed_with_a_run_with_no_instrument_failure":83,"listed_every_run_a_failure_of_syntologys_instrument":9,"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/graph-embedding","prev":"/task/graph-embedding","next":"/task/graph-embedding/papers/3","papers":[{"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/advsgm-differentially-private-graph-learning","slug":"advsgm-differentially-private-graph-learning","title":"AdvSGM: Differentially Private Graph Learning via Adversarial Skip-gram Model","date":"2025-03-27","arxiv_id":"2503.21426","repositories_listed":1,"syntology":null},{"url":"/paper/multi-dataset-and-transfer-learning-using","slug":"multi-dataset-and-transfer-learning-using","title":"Multi-dataset and Transfer Learning Using Gene Expression Knowledge Graphs","date":"2025-03-26","arxiv_id":"2503.20400","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/k-graph-a-graph-embedding-for-interpretable","slug":"k-graph-a-graph-embedding-for-interpretable","title":"$k$-Graph: A Graph Embedding for Interpretable Time Series Clustering","date":"2025-02-18","arxiv_id":"2502.13049","repositories_listed":1,"syntology":null},{"url":"/paper/lidar-loop-closure-detection-using-semantic","slug":"lidar-loop-closure-detection-using-semantic","title":"LiDAR Loop Closure Detection using Semantic Graphs with Graph Attention Networks","date":"2025-01-31","arxiv_id":"2501.19382","repositories_listed":1,"syntology":null},{"url":"/paper/a-geometric-perspective-for-high-dimensional","slug":"a-geometric-perspective-for-high-dimensional","title":"A Geometric Perspective for High-Dimensional Multiplex Graphs","date":"2025-01-29","arxiv_id":"2501.17374","repositories_listed":1,"syntology":null},{"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/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/gan-tat-a-novel-framework-using-protein","slug":"gan-tat-a-novel-framework-using-protein","title":"GAN-TAT: A Novel Framework Using Protein Interaction Networks in Druggable Gene Identification","date":"2024-12-31","arxiv_id":"2501.01458","repositories_listed":1,"syntology":null},{"url":"/paper/cross-attention-graph-neural-networks-for","slug":"cross-attention-graph-neural-networks-for","title":"Cross-Attention Graph Neural Networks for Inferring Gene Regulatory Networks with Skewed Degree Distribution","date":"2024-12-18","arxiv_id":"2412.16220","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/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/interpreting-single-cell-and-spatial-omics","slug":"interpreting-single-cell-and-spatial-omics","title":"Interpreting single-cell and spatial omics data using deep neural network training dynamics","date":"2024-12-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/gder-safeguarding-efficiency-balancing-and","slug":"gder-safeguarding-efficiency-balancing-and","title":"GDeR: Safeguarding Efficiency, Balancing, and Robustness via Prototypical Graph Pruning","date":"2024-10-17","arxiv_id":"2410.13761","repositories_listed":1,"syntology":{"n":18,"n_ran":12,"n_constructed":4,"n_ran_checked":10,"n_instrument":2,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":18,"phrase":"12 ran (of which 4 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/gder-safeguarding-efficiency-balancing-and#ran","syntology_url":"https://syntology.ai/paper/2410.13761","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.13761"}},"official":{"repos":["ins1stenc3/gder"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":4,"n_ran_no_instrument_failure":10,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-disease-comorbidity-prediction","slug":"improving-disease-comorbidity-prediction","title":"Improving Disease Comorbidity Prediction Based on Human Interactome with Biologically Supervised Graph Embedding","date":"2024-10-08","arxiv_id":"2410.05670","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-embedding-by-normalizing","slug":"knowledge-graph-embedding-by-normalizing","title":"Knowledge Graph Embedding by Normalizing Flows","date":"2024-09-30","arxiv_id":"2409.19977","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/knowledge-graph-embedding-by-normalizing#ran","syntology_url":"https://syntology.ai/paper/2409.19977","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.19977"}},"official":{"repos":["changyi7231/nfe"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/whole-graph-representation-learning-for-the","slug":"whole-graph-representation-learning-for-the","title":"Whole-Graph Representation Learning For the Classification of Signed Networks","date":"2024-09-30","arxiv_id":"2409.20073","repositories_listed":1,"syntology":null},{"url":"/paper/cloudy-with-a-chance-of-anomalies-dynamic","slug":"cloudy-with-a-chance-of-anomalies-dynamic","title":"Cloudy with a Chance of Anomalies: Dynamic Graph Neural Network for Early Detection of Cloud Services' User Anomalies","date":"2024-09-19","arxiv_id":"2409.12726","repositories_listed":1,"syntology":null},{"url":"/paper/the-role-of-graph-topology-in-the-performance","slug":"the-role-of-graph-topology-in-the-performance","title":"The Role of Graph Topology in the Performance of Biomedical Knowledge Graph Completion Models","date":"2024-09-06","arxiv_id":"2409.04103","repositories_listed":1,"syntology":null},{"url":"/paper/gsifn-a-graph-structured-and-interlaced","slug":"gsifn-a-graph-structured-and-interlaced","title":"GSIFN: A Graph-Structured and Interlaced-Masked Multimodal Transformer-based Fusion Network for Multimodal Sentiment Analysis","date":"2024-08-27","arxiv_id":"2408.14809","repositories_listed":1,"syntology":null},{"url":"/paper/single-cell-curriculum-learning-based-deep","slug":"single-cell-curriculum-learning-based-deep","title":"Single-cell Curriculum Learning-based Deep Graph Embedding Clustering","date":"2024-08-20","arxiv_id":"2408.10511","repositories_listed":1,"syntology":null},{"url":"/paper/concept-graph-embedding-models-for-enhanced","slug":"concept-graph-embedding-models-for-enhanced","title":"Concept Graph Embedding Models for Enhanced Accuracy and Interpretability","date":"2024-08-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/simple-but-effective-compound-geometric","slug":"simple-but-effective-compound-geometric","title":"Simple but Effective Compound Geometric Operations for Temporal Knowledge Graph Completion","date":"2024-08-13","arxiv_id":"2408.06603","repositories_listed":1,"syntology":null},{"url":"/paper/cpa-wac-constellation-partitioning-based","slug":"cpa-wac-constellation-partitioning-based","title":"CPa-WAC: Constellation Partitioning-based Scalable Weighted Aggregation Composition for Knowledge Graph Embedding","date":"2024-08-01","arxiv_id":null,"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/unified-interpretation-of-smoothing-methods","slug":"unified-interpretation-of-smoothing-methods","title":"Unified Interpretation of Smoothing Methods for Negative Sampling Loss Functions in Knowledge Graph Embedding","date":"2024-07-05","arxiv_id":"2407.04251","repositories_listed":1,"syntology":null},{"url":"/paper/toward-structure-fairness-in-dynamic-graph","slug":"toward-structure-fairness-in-dynamic-graph","title":"Toward Structure Fairness in Dynamic Graph Embedding: A Trend-aware Dual Debiasing Approach","date":"2024-06-19","arxiv_id":"2406.13201","repositories_listed":1,"syntology":null},{"url":"/paper/uniglm-training-one-unified-language-model","slug":"uniglm-training-one-unified-language-model","title":"UniGLM: Training One Unified Language Model for Text-Attributed Graph Embedding","date":"2024-06-17","arxiv_id":"2406.12052","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/uniglm-training-one-unified-language-model#ran","syntology_url":"https://syntology.ai/paper/2406.12052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12052"}},"official":{"repos":["nyushcs/uniglm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/duplex-dual-gat-for-complex-embedding-of","slug":"duplex-dual-gat-for-complex-embedding-of","title":"DUPLEX: Dual GAT for Complex Embedding of Directed Graphs","date":"2024-06-08","arxiv_id":"2406.05391","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":8,"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) · 0 unverified","sample_list":"/paper/duplex-dual-gat-for-complex-embedding-of#ran","syntology_url":"https://syntology.ai/paper/2406.05391","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.05391"}},"official":{"repos":["alipay/duplex"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/combinatorial-optimization-with-automated","slug":"combinatorial-optimization-with-automated","title":"Combinatorial Optimization with Automated Graph Neural Networks","date":"2024-06-05","arxiv_id":"2406.02872","repositories_listed":1,"syntology":null},{"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/valid-conformal-prediction-for-dynamic-gnns","slug":"valid-conformal-prediction-for-dynamic-gnns","title":"Valid Conformal Prediction for Dynamic GNNs","date":"2024-05-29","arxiv_id":"2405.19230","repositories_listed":1,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":12,"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) · 6 unverified","sample_list":"/paper/valid-conformal-prediction-for-dynamic-gnns#ran","syntology_url":"https://syntology.ai/paper/2405.19230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19230"}},"official":{"repos":["edwarddavis1/valid_conformal_for_dynamic_gnn"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["official"]}}},{"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"]}}},{"url":"/paper/generalizing-knowledge-graph-embedding-with","slug":"generalizing-knowledge-graph-embedding-with","title":"Generalizing Knowledge Graph Embedding with Universal Orthogonal Parameterization","date":"2024-05-14","arxiv_id":"2405.08540","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/generalizing-knowledge-graph-embedding-with#ran","syntology_url":"https://syntology.ai/paper/2405.08540","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.08540"}},"official":{"repos":["xxrep/golde"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-continual-knowledge-graph-embedding","slug":"towards-continual-knowledge-graph-embedding","title":"Towards Continual Knowledge Graph Embedding via Incremental Distillation","date":"2024-05-07","arxiv_id":"2405.04453","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/towards-continual-knowledge-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/2405.04453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.04453"}},"official":{"repos":["seukgcode/incde"],"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/arbitrary-time-information-modeling-via","slug":"arbitrary-time-information-modeling-via","title":"Arbitrary Time Information Modeling via Polynomial Approximation for Temporal Knowledge Graph Embedding","date":"2024-05-01","arxiv_id":"2405.00358","repositories_listed":1,"syntology":null},{"url":"/paper/robustness-of-graph-embedding-methods-for","slug":"robustness-of-graph-embedding-methods-for","title":"Robustness of graph embedding methods for community detection","date":"2024-05-01","arxiv_id":"2405.00636","repositories_listed":1,"syntology":null},{"url":"/paper/sphere-expressive-and-interpretable-knowledge","slug":"sphere-expressive-and-interpretable-knowledge","title":"SpherE: Expressive and Interpretable Knowledge Graph Embedding for Set Retrieval","date":"2024-04-29","arxiv_id":"2404.19130","repositories_listed":1,"syntology":null},{"url":"/paper/are-graph-embeddings-the-panacea-an-empirical","slug":"are-graph-embeddings-the-panacea-an-empirical","title":"Are Graph Embeddings the Panacea? An Empirical Survey from the Data Fitness Perspective","date":"2024-04-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/causaldisco-causal-discovery-using-knowledge","slug":"causaldisco-causal-discovery-using-knowledge","title":"CausalLP: Learning causal relations with weighted knowledge graph link prediction","date":"2024-04-23","arxiv_id":"2405.02327","repositories_listed":1,"syntology":null},{"url":"/paper/sharing-parameter-by-conjugation-for-1","slug":"sharing-parameter-by-conjugation-for-1","title":"Sharing Parameter by Conjugation for Knowledge Graph Embeddings in Complex Space","date":"2024-04-18","arxiv_id":"2404.11809","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-heterogeneity-among-factor-tensors","slug":"mitigating-heterogeneity-among-factor-tensors","title":"Mitigating Heterogeneity among Factor Tensors via Lie Group Manifolds for Tensor Decomposition Based Temporal Knowledge Graph Embedding","date":"2024-04-14","arxiv_id":"2404.09155","repositories_listed":1,"syntology":null},{"url":"/paper/sccdcg-efficient-deep-structural-clustering","slug":"sccdcg-efficient-deep-structural-clustering","title":"scCDCG: Efficient Deep Structural Clustering for single-cell RNA-seq via Deep Cut-informed Graph Embedding","date":"2024-04-09","arxiv_id":"2404.06167","repositories_listed":1,"syntology":null},{"url":"/paper/mpxgat-an-attention-based-deep-learning-model","slug":"mpxgat-an-attention-based-deep-learning-model","title":"MPXGAT: An Attention based Deep Learning Model for Multiplex Graphs Embedding","date":"2024-03-28","arxiv_id":"2403.19246","repositories_listed":1,"syntology":null},{"url":"/paper/testam-a-time-enhanced-spatio-temporal","slug":"testam-a-time-enhanced-spatio-temporal","title":"TESTAM: A Time-Enhanced Spatio-Temporal Attention Model with Mixture of Experts","date":"2024-03-05","arxiv_id":"2403.02600","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/testam-a-time-enhanced-spatio-temporal#ran","syntology_url":"https://syntology.ai/paper/2403.02600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.02600"}},"official":{"repos":["hyunwookl/testam"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/applying-self-supervised-learning-to-network","slug":"applying-self-supervised-learning-to-network","title":"Applying Self-supervised Learning to Network Intrusion Detection for Network Flows with Graph Neural Network","date":"2024-03-03","arxiv_id":"2403.01501","repositories_listed":1,"syntology":null},{"url":"/paper/preroutgnn-for-timing-prediction-with-order","slug":"preroutgnn-for-timing-prediction-with-order","title":"PreRoutGNN for Timing Prediction with Order Preserving Partition: Global Circuit Pre-training, Local Delay Learning and Attentional Cell Modeling","date":"2024-02-27","arxiv_id":"2403.00012","repositories_listed":1,"syntology":null},{"url":"/paper/dgnn-decoupled-graph-neural-networks-with","slug":"dgnn-decoupled-graph-neural-networks-with","title":"DGNN: Decoupled Graph Neural Networks with Structural Consistency between Attribute and Graph Embedding Representations","date":"2024-01-28","arxiv_id":"2401.15584","repositories_listed":1,"syntology":null},{"url":"/paper/gd-caf-graph-dual-stream-convolutional","slug":"gd-caf-graph-dual-stream-convolutional","title":"Graph Dual-stream Convolutional Attention Fusion for Precipitation Nowcasting","date":"2024-01-15","arxiv_id":"2401.07958","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-link-prediction-using-graph","slug":"temporal-link-prediction-using-graph","title":"Temporal Link Prediction Using Graph Embedding Dynamics","date":"2024-01-15","arxiv_id":"2401.07516","repositories_listed":1,"syntology":null},{"url":"/paper/block-diagonal-orthogonal-relation-and-matrix","slug":"block-diagonal-orthogonal-relation-and-matrix","title":"Block-Diagonal Orthogonal Relation and Matrix Entity for Knowledge Graph Embedding","date":"2024-01-11","arxiv_id":"2401.05967","repositories_listed":1,"syntology":null},{"url":"/paper/tumor-micro-environment-interactions-guided","slug":"tumor-micro-environment-interactions-guided","title":"Tumor Micro-environment Interactions Guided Graph Learning for Survival Analysis of Human Cancers from Whole-slide Pathological Images","date":"2024-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-aggregations-for-high","slug":"hierarchical-aggregations-for-high","title":"Hierarchical Aggregations for High-Dimensional Multiplex Graph Embedding","date":"2023-12-28","arxiv_id":"2312.16834","repositories_listed":1,"syntology":null},{"url":"/paper/lgmrec-local-and-global-graph-learning-for","slug":"lgmrec-local-and-global-graph-learning-for","title":"LGMRec: Local and Global Graph Learning for Multimodal Recommendation","date":"2023-12-27","arxiv_id":"2312.16400","repositories_listed":1,"syntology":null},{"url":"/paper/do-similar-entities-have-similar-embeddings","slug":"do-similar-entities-have-similar-embeddings","title":"Do Similar Entities have Similar Embeddings?","date":"2023-12-16","arxiv_id":"2312.10370","repositories_listed":1,"syntology":null},{"url":"/paper/ocgec-one-class-graph-embedding","slug":"ocgec-one-class-graph-embedding","title":"OCGEC: One-class Graph Embedding Classification for DNN Backdoor Detection","date":"2023-12-04","arxiv_id":"2312.01585","repositories_listed":1,"syntology":null},{"url":"/paper/graph-coordinates-and-conventional-neural","slug":"graph-coordinates-and-conventional-neural","title":"Graph Coordinates and Conventional Neural Networks -- An Alternative for Graph Neural Networks","date":"2023-12-03","arxiv_id":"2312.01342","repositories_listed":1,"syntology":null},{"url":"/paper/normed-spaces-for-graph-embedding","slug":"normed-spaces-for-graph-embedding","title":"Normed Spaces for Graph Embedding","date":"2023-12-03","arxiv_id":"2312.01502","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":5,"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/normed-spaces-for-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/2312.01502","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.01502"}},"official":{"repos":["andyweizhao/graphs-normed-spaces"],"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/vexir2vec-an-architecture-neutral-embedding","slug":"vexir2vec-an-architecture-neutral-embedding","title":"VEXIR2Vec: An Architecture-Neutral Embedding Framework for Binary Similarity","date":"2023-12-01","arxiv_id":"2312.00507","repositories_listed":1,"syntology":null},{"url":"/paper/visualizing-dna-reaction-trajectories-with","slug":"visualizing-dna-reaction-trajectories-with","title":"Visualizing DNA reaction trajectories with deep graph embedding approaches","date":"2023-11-06","arxiv_id":"2311.03409","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/visualizing-dna-reaction-trajectories-with#ran","syntology_url":"https://syntology.ai/paper/2311.03409","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.03409"}},"official":{"repos":["chenwei-zhang/ViDa"],"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/contrastive-deep-nonnegative-matrix","slug":"contrastive-deep-nonnegative-matrix","title":"Contrastive Deep Nonnegative Matrix Factorization for Community Detection","date":"2023-11-04","arxiv_id":"2311.02357","repositories_listed":1,"syntology":null},{"url":"/paper/identifying-conspiracy-theories-news-based-on","slug":"identifying-conspiracy-theories-news-based-on","title":"Identifying Conspiracy Theories News based on Event Relation Graph","date":"2023-10-28","arxiv_id":"2310.18545","repositories_listed":1,"syntology":null},{"url":"/paper/a-study-on-knowledge-graph-embeddings-and","slug":"a-study-on-knowledge-graph-embeddings-and","title":"A Study on Knowledge Graph Embeddings and Graph Neural Networks for Web Of Things","date":"2023-10-23","arxiv_id":"2310.14866","repositories_listed":1,"syntology":null},{"url":"/paper/universal-knowledge-graph-embeddings","slug":"universal-knowledge-graph-embeddings","title":"Universal Knowledge Graph Embeddings","date":"2023-10-23","arxiv_id":"2310.14899","repositories_listed":1,"syntology":null},{"url":"/paper/item-graph2vec-a-efficient-and-effective","slug":"item-graph2vec-a-efficient-and-effective","title":"Item-Graph2vec: a Efficient and Effective Approach using Item Co-occurrence Graph Embedding for Collaborative Filtering","date":"2023-10-22","arxiv_id":"2310.14215","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-the-performance-of-automated-grade","slug":"enhancing-the-performance-of-automated-grade","title":"Enhancing the Performance of Automated Grade Prediction in MOOC using Graph Representation Learning","date":"2023-10-18","arxiv_id":"2310.12281","repositories_listed":1,"syntology":null},{"url":"/paper/efficiently-visualizing-large-graphs","slug":"efficiently-visualizing-large-graphs","title":"Efficiently Visualizing Large Graphs","date":"2023-10-17","arxiv_id":"2310.11186","repositories_listed":1,"syntology":null},{"url":"/paper/locally-differentially-private-graph","slug":"locally-differentially-private-graph","title":"Privacy-Preserving Graph Embedding based on Local Differential Privacy","date":"2023-10-17","arxiv_id":"2310.11060","repositories_listed":1,"syntology":null},{"url":"/paper/node-based-knowledge-graph-contrastive","slug":"node-based-knowledge-graph-contrastive","title":"Node-based Knowledge Graph Contrastive Learning for Medical Relationship Prediction","date":"2023-10-16","arxiv_id":"2310.10138","repositories_listed":1,"syntology":null},{"url":"/paper/negative-sampling-with-adaptive-denoising","slug":"negative-sampling-with-adaptive-denoising","title":"Negative Sampling with Adaptive Denoising Mixup for Knowledge Graph Embedding","date":"2023-10-15","arxiv_id":"2310.09781","repositories_listed":1,"syntology":null},{"url":"/paper/cp-kgc-constrained-prompt-knowledge-graph","slug":"cp-kgc-constrained-prompt-knowledge-graph","title":"Enhancing Text-based Knowledge Graph Completion with Zero-Shot Large Language Models: A Focus on Semantic Enhancement","date":"2023-10-12","arxiv_id":"2310.08279","repositories_listed":1,"syntology":null},{"url":"/paper/incorporating-domain-knowledge-graph-into","slug":"incorporating-domain-knowledge-graph-into","title":"Incorporating Domain Knowledge Graph into Multimodal Movie Genre Classification with Self-Supervised Attention and Contrastive Learning","date":"2023-10-12","arxiv_id":"2310.08032","repositories_listed":1,"syntology":null},{"url":"/paper/enhanced-graph-neural-networks-with-ego","slug":"enhanced-graph-neural-networks-with-ego","title":"Enhanced Graph Neural Networks with Ego-Centric Spectral Subgraph Embeddings Augmentation","date":"2023-10-10","arxiv_id":"2310.12169","repositories_listed":1,"syntology":null},{"url":"/paper/contextualized-structural-self-supervised","slug":"contextualized-structural-self-supervised","title":"Contextualized Structural Self-supervised Learning for Ontology Matching","date":"2023-10-05","arxiv_id":"2310.03840","repositories_listed":1,"syntology":null},{"url":"/paper/model-based-subsampling-for-knowledge-graph","slug":"model-based-subsampling-for-knowledge-graph","title":"Model-based Subsampling for Knowledge Graph Completion","date":"2023-09-17","arxiv_id":"2309.09296","repositories_listed":1,"syntology":null},{"url":"/paper/topological-node2vec-enhanced-graph-embedding","slug":"topological-node2vec-enhanced-graph-embedding","title":"Topological Node2vec: Enhanced Graph Embedding via Persistent Homology","date":"2023-09-15","arxiv_id":"2309.08241","repositories_listed":1,"syntology":null},{"url":"/paper/2309-05865","slug":"2309-05865","title":"Force-directed graph embedding with hops distance","date":"2023-09-11","arxiv_id":"2309.05865","repositories_listed":1,"syntology":null},{"url":"/paper/extending-transductive-knowledge-graph","slug":"extending-transductive-knowledge-graph","title":"Extending Transductive Knowledge Graph Embedding Models for Inductive Logical Relational Inference","date":"2023-09-07","arxiv_id":"2309.03773","repositories_listed":1,"syntology":null},{"url":"/paper/learning-a-patent-informed-biomedical","slug":"learning-a-patent-informed-biomedical","title":"Learning a Patent-Informed Biomedical Knowledge Graph Reveals Technological Potential of Drug Repositioning Candidates","date":"2023-09-04","arxiv_id":"2309.03227","repositories_listed":1,"syntology":null},{"url":"/paper/balancing-between-the-local-and-global","slug":"balancing-between-the-local-and-global","title":"Balancing between the Local and Global Structures (LGS) in Graph Embedding","date":"2023-08-31","arxiv_id":"2308.16403","repositories_listed":1,"syntology":null},{"url":"/paper/companion-animal-disease-diagnostics-based-on","slug":"companion-animal-disease-diagnostics-based-on","title":"Companion Animal Disease Diagnostics based on Literal-aware Medical Knowledge Graph Representation Learning","date":"2023-08-31","arxiv_id":"2309.03219","repositories_listed":1,"syntology":null},{"url":"/paper/speed-streaming-partition-and-parallel","slug":"speed-streaming-partition-and-parallel","title":"SPEED: Streaming Partition and Parallel Acceleration for Temporal Interaction Graph Embedding","date":"2023-08-27","arxiv_id":"2308.14129","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"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) · 2 unverified","sample_list":"/paper/speed-streaming-partition-and-parallel#ran","syntology_url":"https://syntology.ai/paper/2308.14129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.14129"}},"official":{"repos":["chenxi1228/SPEED"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-isomorphism-unet","slug":"graph-isomorphism-unet","title":"Graph isomorphism UNet","date":"2023-08-23","arxiv_id":null,"repositories_listed":1,"syntology":null},{"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/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/a-comprehensive-study-on-knowledge-graph","slug":"a-comprehensive-study-on-knowledge-graph","title":"A Comprehensive Study on Knowledge Graph Embedding over Relational Patterns Based on Rule Learning","date":"2023-08-15","arxiv_id":"2308.07889","repositories_listed":1,"syntology":null},{"url":"/paper/biomedical-knowledge-graph-embeddings-with","slug":"biomedical-knowledge-graph-embeddings-with","title":"Biomedical Knowledge Graph Embeddings with Negative Statements","date":"2023-08-07","arxiv_id":"2308.03447","repositories_listed":1,"syntology":null},{"url":"/paper/cause-towards-causal-knowledge-graph","slug":"cause-towards-causal-knowledge-graph","title":"CausE: Towards Causal Knowledge Graph Embedding","date":"2023-07-21","arxiv_id":"2307.11610","repositories_listed":1,"syntology":null},{"url":"/paper/graph-embedded-intuitionistic-fuzzy-rvfl-for","slug":"graph-embedded-intuitionistic-fuzzy-rvfl-for","title":"Graph Embedded Intuitionistic Fuzzy Random Vector Functional Link Neural Network for Class Imbalance Learning","date":"2023-07-15","arxiv_id":"2307.07881","repositories_listed":1,"syntology":null},{"url":"/paper/gran-is-superior-to-graphrnn-node-orderings","slug":"gran-is-superior-to-graphrnn-node-orderings","title":"GRAN is superior to GraphRNN: node orderings, kernel- and graph embeddings-based metrics for graph generators","date":"2023-07-13","arxiv_id":"2307.06709","repositories_listed":1,"syntology":null},{"url":"/paper/intelligraphs-datasets-for-benchmarking","slug":"intelligraphs-datasets-for-benchmarking","title":"IntelliGraphs: Datasets for Benchmarking Knowledge Graph Generation","date":"2023-07-13","arxiv_id":"2307.06698","repositories_listed":1,"syntology":null},{"url":"/paper/improving-heterogeneous-graph-learning-with","slug":"improving-heterogeneous-graph-learning-with","title":"Improving Heterogeneous Graph Learning with Weighted Mixed-Curvature Product Manifold","date":"2023-07-10","arxiv_id":"2307.04514","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/improving-heterogeneous-graph-learning-with#ran","syntology_url":"https://syntology.ai/paper/2307.04514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.04514"}},"official":{"repos":["sharecodesubmission/weighted_product_manifold"],"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/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/re-think-and-re-design-graph-neural-networks","slug":"re-think-and-re-design-graph-neural-networks","title":"Re-Think and Re-Design Graph Neural Networks in Spaces of Continuous Graph Diffusion Functionals","date":"2023-07-01","arxiv_id":"2307.00222","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/re-think-and-re-design-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2307.00222","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.00222"}},"official":{"repos":["Dandy5721/GNN-PDE-COV"],"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/a-decade-of-scholarly-research-on-open","slug":"a-decade-of-scholarly-research-on-open","title":"A Decade of Scholarly Research on Open Knowledge Graphs","date":"2023-06-22","arxiv_id":"2306.13186","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/gpinn-physics-informed-neural-network-with","slug":"gpinn-physics-informed-neural-network-with","title":"GPINN: Physics-informed Neural Network with Graph Embedding","date":"2023-06-16","arxiv_id":"2306.09792","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/hetregat-fc-heterogeneous-residual-graph","slug":"hetregat-fc-heterogeneous-residual-graph","title":"HetReGAT-FC: heterogeneous residual graph attention network via feature completion","date":"2023-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null}],"record_sha256":"722122972f68b744f200d4d7087d3955dc2461e1811e060cb810a2681b432959","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}