{"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/4","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":4,"pages_in_order":12,"rows_per_page":100,"rows":[301,400],"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/papers/3","next":"/task/graph-embedding/papers/5","papers":[{"url":"/paper/box-embeddings-for-the-description-logic-el","slug":"box-embeddings-for-the-description-logic-el","title":"Faithiful Embeddings for EL++ Knowledge Bases","date":"2022-01-24","arxiv_id":"2201.09919","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-pooling-through-the-lens-of","slug":"revisiting-pooling-through-the-lens-of","title":"Revisiting Global Pooling through the Lens of Optimal Transport","date":"2022-01-23","arxiv_id":"2201.09191","repositories_listed":1,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":13,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/revisiting-pooling-through-the-lens-of#ran","syntology_url":"https://syntology.ai/paper/2201.09191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.09191"}},"official":null}},{"url":"/paper/representing-long-range-context-for-graph-1","slug":"representing-long-range-context-for-graph-1","title":"Representing Long-Range Context for Graph Neural Networks with Global Attention","date":"2022-01-21","arxiv_id":"2201.08821","repositories_listed":1,"syntology":{"n":14,"n_ran":7,"n_constructed":5,"n_ran_checked":6,"n_instrument":1,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/representing-long-range-context-for-graph-1#ran","syntology_url":"https://syntology.ai/paper/2201.08821","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.08821"}},"official":{"repos":["ucbrise/graphtrans"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/classic-graph-structural-features-outperform","slug":"classic-graph-structural-features-outperform","title":"Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling","date":"2022-01-20","arxiv_id":"2201.08481","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-laplacian-eigenmaps-1","slug":"contrastive-laplacian-eigenmaps-1","title":"Contrastive Laplacian Eigenmaps","date":"2022-01-14","arxiv_id":"2201.05493","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/contrastive-laplacian-eigenmaps-1#ran","syntology_url":"https://syntology.ai/paper/2201.05493","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.05493"}},"official":{"repos":["allenhaozhu/coles"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/reasoning-through-memorization-nearest","slug":"reasoning-through-memorization-nearest","title":"Reasoning Through Memorization: Nearest Neighbor Knowledge Graph Embeddings","date":"2022-01-14","arxiv_id":"2201.05575","repositories_listed":1,"syntology":null},{"url":"/paper/stay-positive-knowledge-graph-embedding","slug":"stay-positive-knowledge-graph-embedding","title":"Stay Positive: Knowledge Graph Embedding Without Negative Sampling","date":"2022-01-07","arxiv_id":"2201.02661","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-graph-attention-networks-for","slug":"semi-supervised-graph-attention-networks-for","title":"Semi-Supervised Graph Attention Networks for Event Representation Learning","date":"2022-01-02","arxiv_id":"2201.00363","repositories_listed":1,"syntology":null},{"url":"/paper/motif-graph-neural-network","slug":"motif-graph-neural-network","title":"Motif Graph Neural Network","date":"2021-12-30","arxiv_id":"2112.14900","repositories_listed":1,"syntology":null},{"url":"/paper/cssr-a-context-aware-sequential-software","slug":"cssr-a-context-aware-sequential-software","title":"CSSR: A Context-Aware Sequential Software Service Recommendation Model","date":"2021-12-20","arxiv_id":"2112.10316","repositories_listed":1,"syntology":null},{"url":"/paper/graph-wise-common-latent-factor-extraction","slug":"graph-wise-common-latent-factor-extraction","title":"Graph-wise Common Latent Factor Extraction for Unsupervised Graph Representation Learning","date":"2021-12-16","arxiv_id":"2112.08830","repositories_listed":1,"syntology":null},{"url":"/paper/two-view-graph-neural-networks-for-knowledge","slug":"two-view-graph-neural-networks-for-knowledge","title":"Two-view Graph Neural Networks for Knowledge Graph Completion","date":"2021-12-16","arxiv_id":"2112.09231","repositories_listed":1,"syntology":null},{"url":"/paper/implications-of-topological-imbalance-for","slug":"implications-of-topological-imbalance-for","title":"Implications of Topological Imbalance for Representation Learning on Biomedical Knowledge Graphs","date":"2021-12-13","arxiv_id":"2112.06567","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/implications-of-topological-imbalance-for#ran","syntology_url":"https://syntology.ai/paper/2112.06567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.06567"}},"official":{"repos":["astrazeneca/biomedical-kg-topological-imbalance"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/shgnn-structure-aware-heterogeneous-graph","slug":"shgnn-structure-aware-heterogeneous-graph","title":"SHGNN: Structure-Aware Heterogeneous Graph Neural Network","date":"2021-12-12","arxiv_id":"2112.06244","repositories_listed":1,"syntology":null},{"url":"/paper/airobject-a-temporally-evolving-graph","slug":"airobject-a-temporally-evolving-graph","title":"AirObject: A Temporally Evolving Graph Embedding for Object Identification","date":"2021-11-30","arxiv_id":"2111.15150","repositories_listed":1,"syntology":null},{"url":"/paper/poisoning-knowledge-graph-embeddings-via-1","slug":"poisoning-knowledge-graph-embeddings-via-1","title":"Poisoning Knowledge Graph Embeddings via Relation Inference Patterns","date":"2021-11-11","arxiv_id":"2111.06345","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/poisoning-knowledge-graph-embeddings-via-1#ran","syntology_url":"https://syntology.ai/paper/2111.06345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.06345"}},"official":{"repos":["perubhardwaj/inferenceattack"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/learning-numeracy-a-simple-yet-effective","slug":"learning-numeracy-a-simple-yet-effective","title":"Learning Numeracy: A Simple Yet Effective Number Embedding Approach Using Knowledge Graph","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/parallel-training-of-knowledge-graph","slug":"parallel-training-of-knowledge-graph","title":"Parallel Training of Knowledge Graph Embedding Models: A Comparison of Techniques","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/genurl-a-general-framework-for-unsupervised","slug":"genurl-a-general-framework-for-unsupervised","title":"GenURL: A General Framework for Unsupervised Representation Learning","date":"2021-10-27","arxiv_id":"2110.14553","repositories_listed":1,"syntology":null},{"url":"/paper/standing-on-the-shoulders-of-predecessors","slug":"standing-on-the-shoulders-of-predecessors","title":"Meta-Knowledge Transfer for Inductive Knowledge Graph Embedding","date":"2021-10-27","arxiv_id":"2110.14170","repositories_listed":1,"syntology":null},{"url":"/paper/a-broader-picture-of-random-walk-based-graph","slug":"a-broader-picture-of-random-walk-based-graph","title":"A Broader Picture of Random-walk Based Graph Embedding","date":"2021-10-24","arxiv_id":"2110.12344","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-graph-embedding-on-a-single-gpu","slug":"boosting-graph-embedding-on-a-single-gpu","title":"Boosting Graph Embedding on a Single GPU","date":"2021-10-19","arxiv_id":"2110.10049","repositories_listed":1,"syntology":null},{"url":"/paper/topologically-regularized-data-embeddings-1","slug":"topologically-regularized-data-embeddings-1","title":"Topologically Regularized Data Embeddings","date":"2021-10-18","arxiv_id":"2110.09193","repositories_listed":1,"syntology":null},{"url":"/paper/pg-2-net-personalized-and-group-preferences","slug":"pg-2-net-personalized-and-group-preferences","title":"PG$^2$Net: Personalized and Group Preferences Guided Network for Next Place Prediction","date":"2021-10-15","arxiv_id":"2110.08266","repositories_listed":1,"syntology":null},{"url":"/paper/regvd-revisiting-graph-neural-networks-for-1","slug":"regvd-revisiting-graph-neural-networks-for-1","title":"ReGVD: Revisiting Graph Neural Networks for Vulnerability Detection","date":"2021-10-14","arxiv_id":"2110.07317","repositories_listed":1,"syntology":null},{"url":"/paper/residual2vec-debiasing-graph-embedding-with","slug":"residual2vec-debiasing-graph-embedding-with","title":"Residual2Vec: Debiasing graph embedding with random graphs","date":"2021-10-14","arxiv_id":"2110.07654","repositories_listed":1,"syntology":null},{"url":"/paper/fast-attributed-graph-embedding-via-density","slug":"fast-attributed-graph-embedding-via-density","title":"Fast Attributed Graph Embedding via Density of States","date":"2021-10-11","arxiv_id":"2110.05228","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-sheaves-a-sheaf-theoretic-framework","slug":"knowledge-sheaves-a-sheaf-theoretic-framework","title":"Knowledge Sheaves: A Sheaf-Theoretic Framework for Knowledge Graph Embedding","date":"2021-10-07","arxiv_id":"2110.03789","repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-pointer-networks-for-traveling","slug":"hybrid-pointer-networks-for-traveling","title":"Hybrid Pointer Networks for Traveling Salesman Problems Optimization","date":"2021-10-06","arxiv_id":"2110.03104","repositories_listed":1,"syntology":null},{"url":"/paper/inference-attacks-against-graph-neural","slug":"inference-attacks-against-graph-neural","title":"Inference Attacks Against Graph Neural Networks","date":"2021-10-06","arxiv_id":"2110.02631","repositories_listed":1,"syntology":null},{"url":"/paper/an-energy-based-model-for-neuro-symbolic","slug":"an-energy-based-model-for-neuro-symbolic","title":"An energy-based model for neuro-symbolic reasoning on knowledge graphs","date":"2021-10-04","arxiv_id":"2110.01639","repositories_listed":1,"syntology":null},{"url":"/paper/dyng2g-an-efficient-stochastic-graph","slug":"dyng2g-an-efficient-stochastic-graph","title":"DynG2G: An Efficient Stochastic Graph Embedding Method for Temporal Graphs","date":"2021-09-28","arxiv_id":"2109.13441","repositories_listed":1,"syntology":null},{"url":"/paper/how-does-knowledge-graph-embedding","slug":"how-does-knowledge-graph-embedding","title":"How Does Knowledge Graph Embedding Extrapolate to Unseen Data: A Semantic Evidence View","date":"2021-09-24","arxiv_id":"2109.11800","repositories_listed":1,"syntology":null},{"url":"/paper/learning-through-structure-towards-deep","slug":"learning-through-structure-towards-deep","title":"Learning through structure: towards deep neuromorphic knowledge graph embeddings","date":"2021-09-21","arxiv_id":"2109.10376","repositories_listed":1,"syntology":null},{"url":"/paper/recommender-systems-based-on-graph-embedding","slug":"recommender-systems-based-on-graph-embedding","title":"Recommender systems based on graph embedding techniques: A comprehensive review","date":"2021-09-20","arxiv_id":"2109.09587","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-knowledge-graph-completion-using-box","slug":"temporal-knowledge-graph-completion-using-box","title":"Temporal Knowledge Graph Completion using Box Embeddings","date":"2021-09-18","arxiv_id":"2109.08970","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/temporal-knowledge-graph-completion-using-box#ran","syntology_url":"https://syntology.ai/paper/2109.08970","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.08970"}},"official":null}},{"url":"/paper/learning-grounded-word-meaning","slug":"learning-grounded-word-meaning","title":"Learning grounded word meaning representations on similarity graphs","date":"2021-09-07","arxiv_id":"2109.03084","repositories_listed":1,"syntology":null},{"url":"/paper/detecting-communities-from-heterogeneous","slug":"detecting-communities-from-heterogeneous","title":"Detecting Communities from Heterogeneous Graphs: A Context Path-based Graph Neural Network Model","date":"2021-09-05","arxiv_id":"2109.02058","repositories_listed":1,"syntology":null},{"url":"/paper/roadscene2vec-a-tool-for-extracting-and","slug":"roadscene2vec-a-tool-for-extracting-and","title":"roadscene2vec: A Tool for Extracting and Embedding Road Scene-Graphs","date":"2021-09-02","arxiv_id":"2109.01183","repositories_listed":1,"syntology":null},{"url":"/paper/an-fea-surrogate-model-with-boundary-oriented","slug":"an-fea-surrogate-model-with-boundary-oriented","title":"An FEA surrogate model with Boundary Oriented Graph Embedding approach","date":"2021-08-30","arxiv_id":"2108.13509","repositories_listed":1,"syntology":null},{"url":"/paper/twitter-user-representation-using-weakly","slug":"twitter-user-representation-using-weakly","title":"Twitter User Representation Using Weakly Supervised Graph Embedding","date":"2021-08-20","arxiv_id":"2108.08988","repositories_listed":1,"syntology":null},{"url":"/paper/graph2mda-a-multi-modal-variational-graph","slug":"graph2mda-a-multi-modal-variational-graph","title":"Graph2MDA: a multi-modal variational graph embedding model for predicting microbe-drug associations","date":"2021-08-14","arxiv_id":"2108.06338","repositories_listed":1,"syntology":null},{"url":"/paper/hopfe-knowledge-graph-representation-learning","slug":"hopfe-knowledge-graph-representation-learning","title":"HopfE: Knowledge Graph Representation Learning using Inverse Hopf Fibrations","date":"2021-08-12","arxiv_id":"2108.05774","repositories_listed":1,"syntology":null},{"url":"/paper/hyperparameter-free-and-explainable-whole","slug":"hyperparameter-free-and-explainable-whole","title":"Hyperparameter-free and Explainable Whole Graph Embedding","date":"2021-08-04","arxiv_id":"2108.02113","repositories_listed":1,"syntology":null},{"url":"/paper/eclare-extreme-classification-with-label","slug":"eclare-extreme-classification-with-label","title":"ECLARE: Extreme Classification with Label Graph Correlations","date":"2021-07-31","arxiv_id":"2108.00261","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":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/eclare-extreme-classification-with-label#ran","syntology_url":"https://syntology.ai/paper/2108.00261","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.00261"}},"official":{"repos":["Extreme-classification/ECLARE"],"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/hierarchical-latent-relation-modeling-for","slug":"hierarchical-latent-relation-modeling-for","title":"Hierarchical Latent Relation Modeling for Collaborative Metric Learning","date":"2021-07-26","arxiv_id":"2108.04655","repositories_listed":1,"syntology":null},{"url":"/paper/mimo-mutual-integration-of-patient-journey","slug":"mimo-mutual-integration-of-patient-journey","title":"MIPO: Mutual Integration of Patient Journey and Medical Ontology for Healthcare Representation Learning","date":"2021-07-20","arxiv_id":"2107.09288","repositories_listed":1,"syntology":null},{"url":"/paper/discrete-time-temporal-network-embedding-via","slug":"discrete-time-temporal-network-embedding-via","title":"Discrete-time Temporal Network Embedding via Implicit Hierarchical Learning in Hyperbolic Space","date":"2021-07-08","arxiv_id":"2107.03767","repositories_listed":1,"syntology":null},{"url":"/paper/echoea-echo-information-between-entities-and","slug":"echoea-echo-information-between-entities-and","title":"EchoEA: Echo Information between Entities and Relations for Entity Alignment","date":"2021-07-07","arxiv_id":"2107.03054","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-the-representational-power-of-graph","slug":"exploring-the-representational-power-of-graph","title":"Exploring the Representational Power of Graph Autoencoder","date":"2021-06-22","arxiv_id":"2106.12005","repositories_listed":1,"syntology":null},{"url":"/paper/unified-interpretation-of-softmax-cross","slug":"unified-interpretation-of-softmax-cross","title":"Unified Interpretation of Softmax Cross-Entropy and Negative Sampling: With Case Study for Knowledge Graph Embedding","date":"2021-06-14","arxiv_id":"2106.07250","repositories_listed":1,"syntology":null},{"url":"/paper/relation-order-histograms-as-a-network","slug":"relation-order-histograms-as-a-network","title":"Relation order histograms as a network embedding tool","date":"2021-06-09","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/adversarially-regularized-graph-attention","slug":"adversarially-regularized-graph-attention","title":"Adversarially Regularized Graph Attention Networks for Inductive Learning on Partially Labeled Graphs","date":"2021-06-07","arxiv_id":"2106.03393","repositories_listed":1,"syntology":null},{"url":"/paper/embedding-knowledge-graphs-attentive-to","slug":"embedding-knowledge-graphs-attentive-to","title":"Embedding Knowledge Graphs Attentive to Positional and Centrality Qualities","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/out-of-vocabulary-entities-in-link-prediction","slug":"out-of-vocabulary-entities-in-link-prediction","title":"Out-of-Vocabulary Entities in Link Prediction","date":"2021-05-26","arxiv_id":"2105.12524","repositories_listed":1,"syntology":null},{"url":"/paper/a-robust-and-generalized-framework-for","slug":"a-robust-and-generalized-framework-for","title":"A Robust and Generalized Framework for Adversarial Graph Embedding","date":"2021-05-22","arxiv_id":"2105.10651","repositories_listed":1,"syntology":null},{"url":"/paper/quatde-dynamic-quaternion-embedding-for","slug":"quatde-dynamic-quaternion-embedding-for","title":"QuatDE: Dynamic Quaternion Embedding for Knowledge Graph Completion","date":"2021-05-19","arxiv_id":"2105.09002","repositories_listed":1,"syntology":null},{"url":"/paper/learning-embeddings-from-knowledge-graphs","slug":"learning-embeddings-from-knowledge-graphs","title":"Learning Embeddings from Knowledge Graphs With Numeric Edge Attributes","date":"2021-05-18","arxiv_id":"2105.08683","repositories_listed":1,"syntology":{"n":16,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-embeddings-from-knowledge-graphs#ran","syntology_url":"https://syntology.ai/paper/2105.08683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.08683"}},"official":{"repos":["Accenture/AmpliGraph"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/federated-knowledge-graphs-embedding","slug":"federated-knowledge-graphs-embedding","title":"Differentially Private Federated Knowledge Graphs Embedding","date":"2021-05-17","arxiv_id":"2105.07615","repositories_listed":1,"syntology":null},{"url":"/paper/ontoea-ontology-guided-entity-alignment-via","slug":"ontoea-ontology-guided-entity-alignment-via","title":"OntoEA: Ontology-guided Entity Alignment via Joint Knowledge Graph Embedding","date":"2021-05-17","arxiv_id":"2105.07688","repositories_listed":1,"syntology":null},{"url":"/paper/brain-graph-super-resolution-using","slug":"brain-graph-super-resolution-using","title":"Brain Graph Super-Resolution Using Adversarial Graph Neural Network with Application to Functional Brain Connectivity","date":"2021-05-02","arxiv_id":"2105.00425","repositories_listed":1,"syntology":null},{"url":"/paper/an-adversarial-transfer-network-for-knowledge","slug":"an-adversarial-transfer-network-for-knowledge","title":"An Adversarial Transfer Network for Knowledge Representation Learning","date":"2021-04-30","arxiv_id":"2104.14757","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/an-adversarial-transfer-network-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2104.14757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14757"}},"official":{"repos":["LemonNoel/ATransN"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-embedded-subspace-support-vector-data","slug":"graph-embedded-subspace-support-vector-data","title":"Graph-Embedded Subspace Support Vector Data Description","date":"2021-04-29","arxiv_id":"2104.14370","repositories_listed":1,"syntology":null},{"url":"/paper/spike-spike-based-embeddings-for-multi","slug":"spike-spike-based-embeddings-for-multi","title":"SpikE: spike-based embeddings for multi-relational graph data","date":"2021-04-27","arxiv_id":"2104.13398","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-deep-manifold-attributed-graph","slug":"unsupervised-deep-manifold-attributed-graph","title":"Unsupervised Deep Manifold Attributed Graph Embedding","date":"2021-04-27","arxiv_id":"2104.13048","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-non-sampling-knowledge-graph","slug":"efficient-non-sampling-knowledge-graph","title":"Efficient Non-Sampling Knowledge Graph Embedding","date":"2021-04-21","arxiv_id":"2104.10796","repositories_listed":1,"syntology":null},{"url":"/paper/combining-exogenous-and-endogenous-signals","slug":"combining-exogenous-and-endogenous-signals","title":"Combining exogenous and endogenous signals with a semi-supervised co-attention network for early detection of COVID-19 fake tweets","date":"2021-04-12","arxiv_id":"2104.05321","repositories_listed":1,"syntology":null},{"url":"/paper/modelling-brain-connectivity-networks-by","slug":"modelling-brain-connectivity-networks-by","title":"Modelling Brain Connectivity Networks by Graph Embedding for Dyslexia Diagnosis","date":"2021-04-12","arxiv_id":"2104.05497","repositories_listed":1,"syntology":null},{"url":"/paper/multiple-run-ensemble-learning-withlow","slug":"multiple-run-ensemble-learning-withlow","title":"Multiple Run Ensemble Learning with Low-Dimensional Knowledge Graph Embeddings","date":"2021-04-11","arxiv_id":"2104.05003","repositories_listed":1,"syntology":null},{"url":"/paper/highly-efficient-knowledge-graph-embedding","slug":"highly-efficient-knowledge-graph-embedding","title":"Highly Efficient Knowledge Graph Embedding Learning with Orthogonal Procrustes Analysis","date":"2021-04-10","arxiv_id":"2104.04676","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-box-embeddings-for-uncertain","slug":"probabilistic-box-embeddings-for-uncertain","title":"Probabilistic Box Embeddings for Uncertain Knowledge Graph Reasoning","date":"2021-04-09","arxiv_id":"2104.04597","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/probabilistic-box-embeddings-for-uncertain#ran","syntology_url":"https://syntology.ai/paper/2104.04597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.04597"}},"official":{"repos":["stasl0217/beurre"],"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/embedding-api-dependency-graph-for-neural","slug":"embedding-api-dependency-graph-for-neural","title":"Embedding API Dependency Graph for Neural Code Generation","date":"2021-03-29","arxiv_id":"2103.15361","repositories_listed":1,"syntology":null},{"url":"/paper/the-kl-divergence-between-a-graph-model-and","slug":"the-kl-divergence-between-a-graph-model-and","title":"The KL-Divergence between a Graph Model and its Fair I-Projection as a Fairness Regularizer","date":"2021-03-02","arxiv_id":"2103.01846","repositories_listed":1,"syntology":null},{"url":"/paper/cogdl-an-extensive-toolkit-for-deep-learning","slug":"cogdl-an-extensive-toolkit-for-deep-learning","title":"CogDL: A Comprehensive Library for Graph Deep Learning","date":"2021-03-01","arxiv_id":"2103.00959","repositories_listed":1,"syntology":null},{"url":"/paper/featurenorm-l2-feature-normalization-for","slug":"featurenorm-l2-feature-normalization-for","title":"FeatureNorm: L2 Feature Normalization for Dynamic Graph Embedding","date":"2021-02-27","arxiv_id":"2103.00164","repositories_listed":1,"syntology":null},{"url":"/paper/graph-based-semi-supervised-learning-a","slug":"graph-based-semi-supervised-learning-a","title":"Graph-based Semi-supervised Learning: A Comprehensive Review","date":"2021-02-26","arxiv_id":"2102.13303","repositories_listed":1,"syntology":null},{"url":"/paper/node-proximity-is-all-you-need-unified","slug":"node-proximity-is-all-you-need-unified","title":"Node Proximity Is All You Need: Unified Structural and Positional Node and Graph Embedding","date":"2021-02-26","arxiv_id":"2102.13582","repositories_listed":1,"syntology":null},{"url":"/paper/accurate-learning-of-graph-representations-1","slug":"accurate-learning-of-graph-representations-1","title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","date":"2021-02-23","arxiv_id":"2102.11533","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":4,"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 4 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; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/accurate-learning-of-graph-representations-1#ran","syntology_url":"https://syntology.ai/paper/2102.11533","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11533"}},"official":{"repos":["JinheonBaek/GMT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/modeling-multi-destination-trips-with-sketch","slug":"modeling-multi-destination-trips-with-sketch","title":"Modeling Multi-Destination Trips with Sketch-Based Model","date":"2021-02-22","arxiv_id":"2102.11252","repositories_listed":1,"syntology":null},{"url":"/paper/remod-relation-extraction-for-modeling-online","slug":"remod-relation-extraction-for-modeling-online","title":"REMOD: Relation Extraction for Modeling Online Discourse","date":"2021-02-22","arxiv_id":"2102.11105","repositories_listed":1,"syntology":null},{"url":"/paper/refining-a-nearest-neighbor-graph-for-a","slug":"refining-a-nearest-neighbor-graph-for-a","title":"Refining a -nearest neighbor graph for a computationally efficient spectral clustering","date":"2021-02-06","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/gnn-rl-compression-topology-aware-network","slug":"gnn-rl-compression-topology-aware-network","title":"Topology-Aware Network Pruning using Multi-stage Graph Embedding and Reinforcement Learning","date":"2021-02-05","arxiv_id":"2102.03214","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gnn-rl-compression-topology-aware-network#ran","syntology_url":"https://syntology.ai/paper/2102.03214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.03214"}},"official":{"repos":["yusx-swapp/gnn-rl-model-compression"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-graph-embeddings-for-compositional","slug":"learning-graph-embeddings-for-compositional","title":"Learning Graph Embeddings for Compositional Zero-shot Learning","date":"2021-02-03","arxiv_id":"2102.01987","repositories_listed":1,"syntology":{"n":11,"n_ran":6,"n_constructed":3,"n_ran_checked":3,"n_instrument":3,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":11,"phrase":"6 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-graph-embeddings-for-compositional#ran","syntology_url":"https://syntology.ai/paper/2102.01987","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.01987"}},"official":{"repos":["ExplainableML/czsl"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-multi-resolution-representations-of","slug":"learning-multi-resolution-representations-of","title":"Learning multi-resolution representations of research patterns in bibliographic networks","date":"2021-02-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/re-improving-multi-hop-question-answering","slug":"re-improving-multi-hop-question-answering","title":"[Re] Improving Multi-hop Question Answering over Knowledge Graphs using Knowledge Base Embeddings","date":"2021-01-31","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/relwalk-a-latent-variable-model-approach-to-1","slug":"relwalk-a-latent-variable-model-approach-to-1","title":"RelWalk A Latent Variable Model Approach to Knowledge Graph Embedding","date":"2021-01-25","arxiv_id":"2101.10070","repositories_listed":1,"syntology":null},{"url":"/paper/learning-massive-graph-embeddings-on-a-single","slug":"learning-massive-graph-embeddings-on-a-single","title":"Marius: Learning Massive Graph Embeddings on a Single Machine","date":"2021-01-20","arxiv_id":"2101.08358","repositories_listed":1,"syntology":null},{"url":"/paper/continual-learning-of-knowledge-graph","slug":"continual-learning-of-knowledge-graph","title":"Continual Learning of Knowledge Graph Embeddings","date":"2021-01-14","arxiv_id":"2101.05850","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-graph-representation-learning-with","slug":"dynamic-graph-representation-learning-with","title":"Dynamic Graph Representation Learning with Fourier Temporal State Embedding","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolutional-networks-for-traffic","slug":"graph-convolutional-networks-for-traffic","title":"Graph Convolutional Networks for traffic anomaly","date":"2020-12-25","arxiv_id":"2012.13637","repositories_listed":1,"syntology":null},{"url":"/paper/on-using-classification-datasets-to-evaluate","slug":"on-using-classification-datasets-to-evaluate","title":"On Using Classification Datasets to Evaluate Graph-Level Outlier Detection: Peculiar Observations and New Insights","date":"2020-12-23","arxiv_id":"2012.12931","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-using-classification-datasets-to-evaluate#ran","syntology_url":"https://syntology.ai/paper/2012.12931","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.12931"}},"official":{"repos":["LingxiaoShawn/GLOD-Issues"],"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/bipartite-graph-embedding-via-mutual","slug":"bipartite-graph-embedding-via-mutual","title":"Bipartite Graph Embedding via Mutual Information Maximization","date":"2020-12-10","arxiv_id":"2012.05442","repositories_listed":1,"syntology":null},{"url":"/paper/a-duet-recommendation-algorithm-based-on","slug":"a-duet-recommendation-algorithm-based-on","title":"Unify Local and Global Information for Top-$N$ Recommendation","date":"2020-12-03","arxiv_id":"2012.01635","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-information-diffusion-in-time","slug":"efficient-information-diffusion-in-time","title":"Efficient Information Diffusion in Time-Varying Graphs through Deep Reinforcement Learning","date":"2020-11-27","arxiv_id":"2011.13518","repositories_listed":1,"syntology":null},{"url":"/paper/xfraud-explainable-fraud-transaction","slug":"xfraud-explainable-fraud-transaction","title":"xFraud: Explainable Fraud Transaction Detection","date":"2020-11-24","arxiv_id":"2011.12193","repositories_listed":1,"syntology":null},{"url":"/paper/apan-asynchronous-propagate-attention-network","slug":"apan-asynchronous-propagate-attention-network","title":"APAN: Asynchronous Propagation Attention Network for Real-time Temporal Graph Embedding","date":"2020-11-23","arxiv_id":"2011.11545","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-selection-of-clustering-algorithms","slug":"automatic-selection-of-clustering-algorithms","title":"Automatic selection of clustering algorithms using supervised graph embedding","date":"2020-11-16","arxiv_id":"2011.08225","repositories_listed":1,"syntology":null},{"url":"/paper/fusedmm-a-unified-sddmm-spmm-kernel-for-graph","slug":"fusedmm-a-unified-sddmm-spmm-kernel-for-graph","title":"FusedMM: A Unified SDDMM-SpMM Kernel for Graph Embedding and Graph Neural Networks","date":"2020-11-07","arxiv_id":"2011.06391","repositories_listed":1,"syntology":null},{"url":"/paper/massively-parallel-graph-drawing-and","slug":"massively-parallel-graph-drawing-and","title":"Massively Parallel Graph Drawing and Representation Learning","date":"2020-11-06","arxiv_id":"2011.03479","repositories_listed":1,"syntology":null},{"url":"/paper/hyperbolic-graph-embedding-with-enhanced-semi","slug":"hyperbolic-graph-embedding-with-enhanced-semi","title":"Hyperbolic Graph Embedding with Enhanced Semi-Implicit Variational Inference","date":"2020-10-31","arxiv_id":"2011.00194","repositories_listed":1,"syntology":null}],"record_sha256":"e1f3d4b41bd6e17b243a8aaffeba337e1c872bd5cca06ffededc9689c9173ce0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}