{"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-representation-learning/papers/5","list_of":"/task/graph-representation-learning","task":"Graph Representation Learning","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":5,"pages_in_order":10,"rows_per_page":100,"rows":[401,500],"of":982,"counts":{"archive_papers_tagged":982,"with_a_code_link":479,"where_syntology_ran_a_sample":129,"not_listed_spam_title":0,"listed":982,"listed_where_code_ran":129,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":115,"every_run_a_failure_of_syntologys_instrument":14,"listed_with_a_run_with_no_instrument_failure":115,"listed_every_run_a_failure_of_syntologys_instrument":14,"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-representation-learning","prev":"/task/graph-representation-learning/papers/4","next":"/task/graph-representation-learning/papers/6","papers":[{"url":"/paper/exploiting-edge-oriented-reasoning-for-3d","slug":"exploiting-edge-oriented-reasoning-for-3d","title":"Exploiting Edge-Oriented Reasoning for 3D Point-based Scene Graph Analysis","date":"2021-03-09","arxiv_id":"2103.05558","repositories_listed":1,"syntology":null},{"url":"/paper/size-invariant-graph-representations-for","slug":"size-invariant-graph-representations-for","title":"Size-Invariant Graph Representations for Graph Classification Extrapolations","date":"2021-03-08","arxiv_id":"2103.05045","repositories_listed":1,"syntology":null},{"url":"/paper/graph-autoencoder-for-graph-compression-and","slug":"graph-autoencoder-for-graph-compression-and","title":"Graph Autoencoder for Graph Compression and Representation Learning","date":"2021-03-04","arxiv_id":null,"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/fast-graph-learning-with-unique-optimal","slug":"fast-graph-learning-with-unique-optimal","title":"Fast Graph Learning with Unique Optimal Solutions","date":"2021-02-17","arxiv_id":"2102.08530","repositories_listed":1,"syntology":null},{"url":"/paper/graph-traversal-with-tensor-functionals-a-1","slug":"graph-traversal-with-tensor-functionals-a-1","title":"Graph Traversal with Tensor Functionals: A Meta-Algorithm for Scalable Learning","date":"2021-02-08","arxiv_id":"2102.04350","repositories_listed":1,"syntology":null},{"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/improving-graph-representation-learning-by","slug":"improving-graph-representation-learning-by","title":"Calibrating and Improving Graph Contrastive Learning","date":"2021-01-27","arxiv_id":"2101.11525","repositories_listed":1,"syntology":null},{"url":"/paper/boost-then-convolve-gradient-boosting-meets-1","slug":"boost-then-convolve-gradient-boosting-meets-1","title":"Boost then Convolve: Gradient Boosting Meets Graph Neural Networks","date":"2021-01-21","arxiv_id":"2101.08543","repositories_listed":1,"syntology":null},{"url":"/paper/sugar-subgraph-neural-network-with","slug":"sugar-subgraph-neural-network-with","title":"SUGAR: Subgraph Neural Network with Reinforcement Pooling and Self-Supervised Mutual Information Mechanism","date":"2021-01-20","arxiv_id":"2101.08170","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-patient-outcomes-with-graph","slug":"predicting-patient-outcomes-with-graph","title":"Predicting Patient Outcomes with Graph Representation Learning","date":"2021-01-11","arxiv_id":"2101.03940","repositories_listed":1,"syntology":null},{"url":"/paper/het-node2vec-second-order-random-walk","slug":"het-node2vec-second-order-random-walk","title":"Het-node2vec: second order random walk sampling for heterogeneous multigraphs embedding","date":"2021-01-05","arxiv_id":"2101.01425","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/a-meta-learning-approach-for-graph","slug":"a-meta-learning-approach-for-graph","title":"A Meta-Learning Approach for Graph Representation Learning in Multi-Task Settings","date":"2020-12-12","arxiv_id":"2012.06755","repositories_listed":1,"syntology":null},{"url":"/paper/decimated-framelet-system-on-graphs-and-fast","slug":"decimated-framelet-system-on-graphs-and-fast","title":"Decimated Framelet System on Graphs and Fast G-Framelet Transforms","date":"2020-12-12","arxiv_id":"2012.06922","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/decimated-framelet-system-on-graphs-and-fast#ran","syntology_url":"https://syntology.ai/paper/2012.06922","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.06922"}},"official":{"repos":["YuGuangWang/FGT"],"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/graph-mixture-density-networks","slug":"graph-mixture-density-networks","title":"Graph Mixture Density Networks","date":"2020-12-05","arxiv_id":"2012.03085","repositories_listed":1,"syntology":null},{"url":"/paper/gl-coarsener-a-graph-representation-learning","slug":"gl-coarsener-a-graph-representation-learning","title":"GL-Coarsener: A Graph representation learning framework to construct coarse grid hierarchy for AMG solvers","date":"2020-11-19","arxiv_id":"2011.09994","repositories_listed":1,"syntology":null},{"url":"/paper/node-similarity-preserving-graph","slug":"node-similarity-preserving-graph","title":"Node Similarity Preserving Graph Convolutional Networks","date":"2020-11-19","arxiv_id":"2011.09643","repositories_listed":1,"syntology":null},{"url":"/paper/distill2vec-dynamic-graph-representation","slug":"distill2vec-dynamic-graph-representation","title":"Distill2Vec: Dynamic Graph Representation Learning with Knowledge Distillation","date":"2020-11-11","arxiv_id":"2011.05664","repositories_listed":1,"syntology":null},{"url":"/paper/egad-evolving-graph-representation-learning","slug":"egad-evolving-graph-representation-learning","title":"EGAD: Evolving Graph Representation Learning with Self-Attention and Knowledge Distillation for Live Video Streaming Events","date":"2020-11-11","arxiv_id":"2011.05705","repositories_listed":1,"syntology":null},{"url":"/paper/vstreamdrls-dynamic-graph-representation","slug":"vstreamdrls-dynamic-graph-representation","title":"VStreamDRLS: Dynamic Graph Representation Learning with Self-Attention for Enterprise Distributed Video Streaming Solutions","date":"2020-11-11","arxiv_id":"2011.05671","repositories_listed":1,"syntology":null},{"url":"/paper/a-step-towards-neural-genome-assembly","slug":"a-step-towards-neural-genome-assembly","title":"A step towards neural genome assembly","date":"2020-11-10","arxiv_id":"2011.05013","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/a-step-towards-neural-genome-assembly#ran","syntology_url":"https://syntology.ai/paper/2011.05013","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.05013"}},"official":{"repos":["lvrcek/NeuralLayout"],"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/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/handling-missing-data-with-graph","slug":"handling-missing-data-with-graph","title":"Handling Missing Data with Graph Representation Learning","date":"2020-10-30","arxiv_id":"2010.16418","repositories_listed":1,"syntology":null},{"url":"/paper/gripnet-graph-information-propagation-on","slug":"gripnet-graph-information-propagation-on","title":"GripNet: Graph Information Propagation on Supergraph for Heterogeneous Graphs","date":"2020-10-29","arxiv_id":"2010.15914","repositories_listed":1,"syntology":null},{"url":"/paper/geometric-scattering-attention-networks","slug":"geometric-scattering-attention-networks","title":"Geometric Scattering Attention Networks","date":"2020-10-28","arxiv_id":"2010.15010","repositories_listed":1,"syntology":null},{"url":"/paper/graph-contrastive-learning-with-adaptive","slug":"graph-contrastive-learning-with-adaptive","title":"Graph Contrastive Learning with Adaptive Augmentation","date":"2020-10-27","arxiv_id":"2010.14945","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-enhanced-heterogeneous","slug":"reinforcement-learning-enhanced-heterogeneous","title":"Personalised Meta-path Generation for Heterogeneous GNNs","date":"2020-10-26","arxiv_id":"2010.13735","repositories_listed":1,"syntology":null},{"url":"/paper/bi-gcn-binary-graph-convolutional-network","slug":"bi-gcn-binary-graph-convolutional-network","title":"Bi-GCN: Binary Graph Convolutional Network","date":"2020-10-15","arxiv_id":"2010.07565","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/bi-gcn-binary-graph-convolutional-network#ran","syntology_url":"https://syntology.ai/paper/2010.07565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07565"}},"official":{"repos":["bywmm/Bi-GCN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-expressive-graph-representation","slug":"towards-expressive-graph-representation","title":"Towards Expressive Graph Representation","date":"2020-10-12","arxiv_id":"2010.05427","repositories_listed":1,"syntology":null},{"url":"/paper/disentangle-based-continual-graph","slug":"disentangle-based-continual-graph","title":"Disentangle-based Continual Graph Representation Learning","date":"2020-10-06","arxiv_id":"2010.02565","repositories_listed":1,"syntology":null},{"url":"/paper/reward-propagation-using-graph-convolutional","slug":"reward-propagation-using-graph-convolutional","title":"Reward Propagation Using Graph Convolutional Networks","date":"2020-10-06","arxiv_id":"2010.02474","repositories_listed":1,"syntology":null},{"url":"/paper/direct-multi-hop-attention-based-graph-neural","slug":"direct-multi-hop-attention-based-graph-neural","title":"Multi-hop Attention Graph Neural Network","date":"2020-09-29","arxiv_id":"2009.14332","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/direct-multi-hop-attention-based-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2009.14332","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.14332"}},"official":{"repos":["xjtuwgt/gnn-magna"],"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/graph-adversarial-networks-protecting","slug":"graph-adversarial-networks-protecting","title":"Information Obfuscation of Graph Neural Networks","date":"2020-09-28","arxiv_id":"2009.13504","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":5,"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 5 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/graph-adversarial-networks-protecting#ran","syntology_url":"https://syntology.ai/paper/2009.13504","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.13504"}},"official":{"repos":["liaopeiyuan/GAL"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":5,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graphnorm-a-principled-approach-to","slug":"graphnorm-a-principled-approach-to","title":"GraphNorm: A Principled Approach to Accelerating Graph Neural Network Training","date":"2020-09-07","arxiv_id":"2009.03294","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/graphnorm-a-principled-approach-to#ran","syntology_url":"https://syntology.ai/paper/2009.03294","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.03294"}},"official":null}},{"url":"/paper/about-graph-degeneracy-representation","slug":"about-graph-degeneracy-representation","title":"About Graph Degeneracy, Representation Learning and Scalability","date":"2020-09-04","arxiv_id":"2009.02085","repositories_listed":1,"syntology":null},{"url":"/paper/edge-aware-graph-representation-learning-and","slug":"edge-aware-graph-representation-learning-and","title":"Edge-aware Graph Representation Learning and Reasoning for Face Parsing","date":"2020-07-22","arxiv_id":"2007.11240","repositories_listed":1,"syntology":null},{"url":"/paper/graph-based-prediction-of-protein-protein","slug":"graph-based-prediction-of-protein-protein","title":"Graph-based prediction of Protein-protein interactions with attributed signed graph embedding","date":"2020-07-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/second-order-pooling-for-graph-neural","slug":"second-order-pooling-for-graph-neural","title":"Second-Order Pooling for Graph Neural Networks","date":"2020-07-20","arxiv_id":"2007.10467","repositories_listed":1,"syntology":null},{"url":"/paper/recent-advances-in-network-based-methods-for","slug":"recent-advances-in-network-based-methods-for","title":"Recent Advances in Network-based Methods for Disease Gene Prediction","date":"2020-07-19","arxiv_id":"2007.10848","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-and-unsupervised-graph","slug":"hierarchical-and-unsupervised-graph","title":"Hierarchical and Unsupervised Graph Representation Learning with Loukas's Coarsening","date":"2020-07-07","arxiv_id":"2007.03373","repositories_listed":1,"syntology":null},{"url":"/paper/maximizing-cohesion-and-separation-in-graph","slug":"maximizing-cohesion-and-separation-in-graph","title":"Maximizing Cohesion and Separation in Graph Representation Learning: A Distance-aware Negative Sampling Approach","date":"2020-07-02","arxiv_id":"2007.01423","repositories_listed":1,"syntology":null},{"url":"/paper/gcn-bmp-investigating-graph-representation","slug":"gcn-bmp-investigating-graph-representation","title":"GCN-BMP: Investigating Graph Representation Learning for DDI Prediction Task","date":"2020-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/time-varying-graph-representation-learning","slug":"time-varying-graph-representation-learning","title":"Time-varying Graph Representation Learning via Higher-Order Skip-Gram with Negative Sampling","date":"2020-06-25","arxiv_id":"2006.14330","repositories_listed":1,"syntology":null},{"url":"/paper/graph-representation-learning-network-via","slug":"graph-representation-learning-network-via","title":"Graph Representation Learning Network via Adaptive Sampling","date":"2020-06-08","arxiv_id":"2006.04637","repositories_listed":1,"syntology":null},{"url":"/paper/m2grl-a-multi-task-multi-view-graph","slug":"m2grl-a-multi-task-multi-view-graph","title":"M2GRL: A Multi-task Multi-view Graph Representation Learning Framework for Web-scale Recommender Systems","date":"2020-05-20","arxiv_id":"2005.10110","repositories_listed":1,"syntology":null},{"url":"/paper/machine-learning-on-graphs-a-model-and","slug":"machine-learning-on-graphs-a-model-and","title":"Machine Learning on Graphs: A Model and Comprehensive Taxonomy","date":"2020-05-07","arxiv_id":"2005.03675","repositories_listed":1,"syntology":{"n":8,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/machine-learning-on-graphs-a-model-and#ran","syntology_url":"https://syntology.ai/paper/2005.03675","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.03675"}},"official":{"repos":["google/gcnn-survey-paper"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/on-detecting-hidden-third-party-web-trackers","slug":"on-detecting-hidden-third-party-web-trackers","title":"Wide-AdGraph: Detecting Ad Trackers with a Wide Dependency Chain Graph","date":"2020-04-29","arxiv_id":"2004.14826","repositories_listed":1,"syntology":null},{"url":"/paper/graph-representation-learning-via-ladder","slug":"graph-representation-learning-via-ladder","title":"Graph Representation Learning via Ladder Gamma Variational Autoencoders","date":"2020-04-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/gossip-and-attend-context-sensitive-graph","slug":"gossip-and-attend-context-sensitive-graph","title":"Gossip and Attend: Context-Sensitive Graph Representation Learning","date":"2020-03-30","arxiv_id":"2004.00413","repositories_listed":1,"syntology":null},{"url":"/paper/k-core-based-temporal-graph-convolutional","slug":"k-core-based-temporal-graph-convolutional","title":"K-Core based Temporal Graph Convolutional Network for Dynamic Graphs","date":"2020-03-22","arxiv_id":"2003.09902","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-hierarchical-graph-1","slug":"unsupervised-hierarchical-graph-1","title":"Unsupervised Hierarchical Graph Representation Learning by Mutual Information Maximization","date":"2020-03-18","arxiv_id":"2003.08420","repositories_listed":1,"syntology":null},{"url":"/paper/deep-graph-mapper-seeing-graphs-through-the","slug":"deep-graph-mapper-seeing-graphs-through-the","title":"Deep Graph Mapper: Seeing Graphs through the Neural Lens","date":"2020-02-10","arxiv_id":"2002.03864","repositories_listed":1,"syntology":null},{"url":"/paper/graph-representation-learning-via-graphical","slug":"graph-representation-learning-via-graphical","title":"Graph Representation Learning via Graphical Mutual Information Maximization","date":"2020-02-04","arxiv_id":"2002.01169","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-knowledge-graphs-representation","slug":"a-survey-on-knowledge-graphs-representation","title":"A Survey on Knowledge Graphs: Representation, Acquisition and Applications","date":"2020-02-02","arxiv_id":"2002.00388","repositories_listed":1,"syntology":null},{"url":"/paper/robust-graph-representation-learning-via","slug":"robust-graph-representation-learning-via","title":"Robust Graph Representation Learning via Neural Sparsification","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/an-attention-based-graph-neural-network-for","slug":"an-attention-based-graph-neural-network-for","title":"An Attention-based Graph Neural Network for Heterogeneous Structural Learning","date":"2019-12-19","arxiv_id":"1912.10832","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/an-attention-based-graph-neural-network-for#ran","syntology_url":"https://syntology.ai/paper/1912.10832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.10832"}},"official":{"repos":["didi/hetsann"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/bridging-the-gap-between-community-and-node","slug":"bridging-the-gap-between-community-and-node","title":"Bridging the Gap between Community and Node Representations: Graph Embedding via Community Detection","date":"2019-12-17","arxiv_id":"1912.08808","repositories_listed":1,"syntology":null},{"url":"/paper/distribution-induced-bidirectional-generative","slug":"distribution-induced-bidirectional-generative","title":"Distribution-induced Bidirectional Generative Adversarial Network for Graph Representation Learning","date":"2019-12-04","arxiv_id":"1912.01899","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-deep-graph-infomax","slug":"heterogeneous-deep-graph-infomax","title":"Heterogeneous Deep Graph Infomax","date":"2019-11-19","arxiv_id":"1911.08538","repositories_listed":1,"syntology":null},{"url":"/paper/graph-transformer-for-graph-to-sequence","slug":"graph-transformer-for-graph-to-sequence","title":"Graph Transformer for Graph-to-Sequence Learning","date":"2019-11-18","arxiv_id":"1911.07470","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graph-transformer-for-graph-to-sequence#ran","syntology_url":"https://syntology.ai/paper/1911.07470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.07470"}},"official":{"repos":["jcyk/gtos"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/hyper-sagnn-a-self-attention-based-graph-1","slug":"hyper-sagnn-a-self-attention-based-graph-1","title":"Hyper-SAGNN: a self-attention based graph neural network for hypergraphs","date":"2019-11-06","arxiv_id":"1911.02613","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/hyper-sagnn-a-self-attention-based-graph-1#ran","syntology_url":"https://syntology.ai/paper/1911.02613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02613"}},"official":{"repos":["ma-compbio/Hyper-SAGNN"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/graphair-graph-representation-learning-with","slug":"graphair-graph-representation-learning-with","title":"GraphAIR: Graph Representation Learning with Neighborhood Aggregation and Interaction","date":"2019-11-05","arxiv_id":"1911.01731","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":4,"n_honours":3,"n_violates":2,"n_no_contract":1,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 2 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/graphair-graph-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/1911.01731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.01731"}},"official":{"repos":["CRIPAC-DIG/GraphAIR"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/is-performance-of-scholars-correlated-to","slug":"is-performance-of-scholars-correlated-to","title":"Is Performance of Scholars Correlated to Their Research Collaboration Patterns?","date":"2019-11-05","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-kernel-methods-for-node","slug":"rethinking-kernel-methods-for-node","title":"Rethinking Kernel Methods for Node Representation Learning on Graphs","date":"2019-10-06","arxiv_id":"1910.02548","repositories_listed":1,"syntology":null},{"url":"/paper/attributed-graph-learning-with-2-d-graph-1","slug":"attributed-graph-learning-with-2-d-graph-1","title":"Dimensionwise Separable 2-D Graph Convolution for Unsupervised and Semi-Supervised Learning on Graphs","date":"2019-09-26","arxiv_id":"1909.12038","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-universal-self-attention-network","slug":"unsupervised-universal-self-attention-network","title":"Universal Graph Transformer Self-Attention Networks","date":"2019-09-26","arxiv_id":"1909.11855","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unsupervised-universal-self-attention-network#ran","syntology_url":"https://syntology.ai/paper/1909.11855","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11855"}},"official":{"repos":["daiquocnguyen/Graph-Transformer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-graph-representation-learning-for","slug":"adaptive-graph-representation-learning-for","title":"Adaptive Graph Representation Learning for Video Person Re-identification","date":"2019-09-05","arxiv_id":"1909.02240","repositories_listed":1,"syntology":null},{"url":"/paper/graph-representation-learning-a-survey","slug":"graph-representation-learning-a-survey","title":"Graph Representation Learning: A Survey","date":"2019-09-03","arxiv_id":"1909.00958","repositories_listed":1,"syntology":null},{"url":"/paper/cross-domain-aspect-category-transfer-and","slug":"cross-domain-aspect-category-transfer-and","title":"Cross-domain Aspect Category Transfer and Detection via Traceable Heterogeneous Graph Representation Learning","date":"2019-08-30","arxiv_id":"1908.11610","repositories_listed":1,"syntology":null},{"url":"/paper/symmetric-graph-convolutional-autoencoder-for","slug":"symmetric-graph-convolutional-autoencoder-for","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","date":"2019-08-07","arxiv_id":"1908.02441","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/symmetric-graph-convolutional-autoencoder-for#ran","syntology_url":"https://syntology.ai/paper/1908.02441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.02441"}},"official":null}},{"url":"/paper/graph-representation-learning-via-hard-and","slug":"graph-representation-learning-via-hard-and","title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","date":"2019-07-05","arxiv_id":"1907.04652","repositories_listed":1,"syntology":null},{"url":"/paper/improving-attention-mechanism-in-graph-neural","slug":"improving-attention-mechanism-in-graph-neural","title":"Improving Attention Mechanism in Graph Neural Networks via Cardinality Preservation","date":"2019-07-04","arxiv_id":"1907.02204","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/improving-attention-mechanism-in-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1907.02204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.02204"}},"official":{"repos":["zetayue/CPA"],"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/graph-convolutional-networks-with","slug":"graph-convolutional-networks-with","title":"Graph Convolutional Networks with EigenPooling","date":"2019-04-30","arxiv_id":"1904.13107","repositories_listed":1,"syntology":null},{"url":"/paper/communitygan-community-detection-with","slug":"communitygan-community-detection-with","title":"CommunityGAN: Community Detection with Generative Adversarial Nets","date":"2019-01-20","arxiv_id":"1901.06631","repositories_listed":1,"syntology":null},{"url":"/paper/deep-network-embedding-for-graph","slug":"deep-network-embedding-for-graph","title":"Deep Network Embedding for Graph Representation Learning in Signed Networks","date":"2019-01-07","arxiv_id":"1901.01718","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-graph-offset-reconstruction-towards","slug":"temporal-graph-offset-reconstruction-towards","title":"Temporal Graph Offset Reconstruction: Towards Temporally Robust Graph Representation Learning","date":"2018-11-20","arxiv_id":"1811.08366","repositories_listed":1,"syntology":null},{"url":"/paper/multi-task-graph-autoencoders","slug":"multi-task-graph-autoencoders","title":"Multi-Task Graph Autoencoders","date":"2018-11-07","arxiv_id":"1811.02798","repositories_listed":1,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/multi-task-graph-autoencoders#ran","syntology_url":"https://syntology.ai/paper/1811.02798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.02798"}},"official":{"repos":["vuptran/graph-representation-learning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/dyngraph2vec-capturing-network-dynamics-using","slug":"dyngraph2vec-capturing-network-dynamics-using","title":"dyngraph2vec: Capturing Network Dynamics using Dynamic Graph Representation Learning","date":"2018-09-07","arxiv_id":"1809.02657","repositories_listed":1,"syntology":null},{"url":null,"slug":"smart-relation-aware-learning-of-geometric","title":"SMART: Relation-Aware Learning of Geometric Representations for Knowledge Graphs","date":"2025-07-17","arxiv_id":"2507.13001","repositories_listed":0,"syntology":null},{"url":null,"slug":"permutation-equivariant-neural-controlled","title":"Permutation Equivariant Neural Controlled Differential Equations for Dynamic Graph Representation Learning","date":"2025-06-25","arxiv_id":"2506.20324","repositories_listed":0,"syntology":null},{"url":null,"slug":"heterogeneous-temporal-hypergraph-neural","title":"Heterogeneous Temporal Hypergraph Neural Network","date":"2025-06-18","arxiv_id":"2506.17312","repositories_listed":0,"syntology":null},{"url":null,"slug":"devil-s-hand-data-poisoning-attacks-to","title":"Devil's Hand: Data Poisoning Attacks to Locally Private Graph Learning Protocols","date":"2025-06-11","arxiv_id":"2506.09803","repositories_listed":0,"syntology":null},{"url":null,"slug":"wasserstein-hypergraph-neural-network","title":"Wasserstein Hypergraph Neural Network","date":"2025-06-11","arxiv_id":"2506.09682","repositories_listed":0,"syntology":null},{"url":null,"slug":"language-embedding-meets-dynamic-graph-a-new","title":"Language Embedding Meets Dynamic Graph: A New Exploration for Neural Architecture Representation Learning","date":"2025-06-09","arxiv_id":"2506.07735","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-persistence-goes-spectral","title":"Graph Persistence goes Spectral","date":"2025-06-06","arxiv_id":"2506.06571","repositories_listed":0,"syntology":null},{"url":null,"slug":"studying-and-improving-graph-neural-network","title":"Studying and Improving Graph Neural Network-based Motif Estimation","date":"2025-05-30","arxiv_id":"2506.15709","repositories_listed":0,"syntology":null},{"url":null,"slug":"simple-yet-effective-graph-distillation-via","title":"Simple yet Effective Graph Distillation via Clustering","date":"2025-05-27","arxiv_id":"2505.20807","repositories_listed":0,"syntology":null},{"url":null,"slug":"convexified-message-passing-graph-neural","title":"Convexified Message-Passing Graph Neural Networks","date":"2025-05-23","arxiv_id":"2505.18289","repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-graph-contrastive-learning-for","title":"Supervised Graph Contrastive Learning for Gene Regulatory Network","date":"2025-05-23","arxiv_id":"2505.17786","repositories_listed":0,"syntology":null},{"url":null,"slug":"mini-game-lifetime-value-prediction-in-wechat","title":"Mini-Game Lifetime Value Prediction in WeChat","date":"2025-05-21","arxiv_id":"2506.11037","repositories_listed":0,"syntology":null},{"url":null,"slug":"dygssm-multi-view-dynamic-graph-embeddings","title":"DyGSSM: Multi-view Dynamic Graph Embeddings with State Space Model Gradient Update","date":"2025-05-13","arxiv_id":"2505.09017","repositories_listed":0,"syntology":null},{"url":null,"slug":"llm-enhancers-for-gnns-an-analysis-from-the","title":"Large Language Model Enhancers for Graph Neural Networks: An Analysis from the Perspective of Causal Mechanism Identification","date":"2025-05-13","arxiv_id":"2505.08265","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-correspondence-between-bounded-graph","title":"The Correspondence Between Bounded Graph Neural Networks and Fragments of First-Order Logic","date":"2025-05-12","arxiv_id":"2505.08021","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-conjoint-graph-representation-learning","title":"A Conjoint Graph Representation Learning Framework for Hypertension Comorbidity Risk Prediction","date":"2025-05-08","arxiv_id":"2505.05094","repositories_listed":0,"syntology":null},{"url":null,"slug":"graffe-graph-representation-learning-via","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","date":"2025-05-08","arxiv_id":"2505.04956","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-temporal-interaction-graph","title":"A Survey on Temporal Interaction Graph Representation Learning: Progress, Challenges, and Opportunities","date":"2025-05-07","arxiv_id":"2505.04461","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-granular-attention-based-heterogeneous","title":"Multi-Granular Attention based Heterogeneous Hypergraph Neural Network","date":"2025-05-07","arxiv_id":"2505.04340","repositories_listed":0,"syntology":null},{"url":"/paper/grape-heterogeneous-graph-representation","slug":"grape-heterogeneous-graph-representation","title":"GRAPE: Heterogeneous Graph Representation Learning for Genetic Perturbation with Coding and Non-Coding Biotype","date":"2025-05-06","arxiv_id":"2505.03853","repositories_listed":0,"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/grape-heterogeneous-graph-representation#ran","syntology_url":"https://syntology.ai/paper/2505.03853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.03853"}},"official":null}},{"url":null,"slug":"multimodal-graph-representation-learning-for","title":"Multimodal Graph Representation Learning for Robust Surgical Workflow Recognition with Adversarial Feature Disentanglement","date":"2025-05-03","arxiv_id":"2505.01766","repositories_listed":0,"syntology":null}],"record_sha256":"413388343a28c1d1e1eb857256e87bb241cca42dc037bef5c288431a1e6dd597","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}