{"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/4","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":4,"pages_in_order":10,"rows_per_page":100,"rows":[301,400],"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/3","next":"/task/graph-representation-learning/papers/5","papers":[{"url":"/paper/continuous-time-and-multi-level-graph","slug":"continuous-time-and-multi-level-graph","title":"Continuous-Time and Multi-Level Graph Representation Learning for Origin-Destination Demand Prediction","date":"2022-06-30","arxiv_id":"2206.15005","repositories_listed":1,"syntology":null},{"url":"/paper/a-representation-learning-framework-for-1","slug":"a-representation-learning-framework-for-1","title":"A Representation Learning Framework for Property Graphs","date":"2022-06-27","arxiv_id":"2206.13176","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/a-representation-learning-framework-for-1#ran","syntology_url":"https://syntology.ai/paper/2206.13176","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.13176"}},"official":{"repos":["yifan-h/pge"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/iso-capsnet-isomorphic-capsule-network-for","slug":"iso-capsnet-isomorphic-capsule-network-for","title":"Iso-CapsNet: Isomorphic Capsule Network for Brain Graph Representation Learning","date":"2022-06-27","arxiv_id":"2206.13465","repositories_listed":1,"syntology":null},{"url":"/paper/an-adaptive-graph-learning-method-for","slug":"an-adaptive-graph-learning-method-for","title":"An adaptive graph learning method for automated molecular interactions and properties predictions","date":"2022-06-23","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/comprehensive-analysis-of-negative-sampling","slug":"comprehensive-analysis-of-negative-sampling","title":"Comprehensive Analysis of Negative Sampling in Knowledge Graph Representation Learning","date":"2022-06-21","arxiv_id":"2206.10140","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-graph-structure-learning-with-dummy","slug":"boosting-graph-structure-learning-with-dummy","title":"Boosting Graph Structure Learning with Dummy Nodes","date":"2022-06-17","arxiv_id":"2206.08561","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/boosting-graph-structure-learning-with-dummy#ran","syntology_url":"https://syntology.ai/paper/2206.08561","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08561"}},"official":{"repos":["hkust-knowcomp/dummynode4graphlearning"],"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/taxonomy-of-benchmarks-in-graph","slug":"taxonomy-of-benchmarks-in-graph","title":"Taxonomy of Benchmarks in Graph Representation Learning","date":"2022-06-15","arxiv_id":"2206.07729","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/taxonomy-of-benchmarks-in-graph#ran","syntology_url":"https://syntology.ai/paper/2206.07729","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.07729"}},"official":{"repos":["g-taxonomy-workgroup/gtaxogym"],"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/costa-covariance-preserving-feature","slug":"costa-covariance-preserving-feature","title":"COSTA: Covariance-Preserving Feature Augmentation for Graph Contrastive Learning","date":"2022-06-09","arxiv_id":"2206.04726","repositories_listed":1,"syntology":null},{"url":"/paper/metric-based-few-shot-graph-classification","slug":"metric-based-few-shot-graph-classification","title":"Metric Based Few-Shot Graph Classification","date":"2022-06-08","arxiv_id":"2206.03695","repositories_listed":1,"syntology":null},{"url":"/paper/a-knowledge-graph-representation-learning","slug":"a-knowledge-graph-representation-learning","title":"A knowledge graph representation learning approach to predict novel kinase-substrate interactions","date":"2022-06-05","arxiv_id":"2206.02290","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-and-scaling-up-graph-contrastive","slug":"rethinking-and-scaling-up-graph-contrastive","title":"Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discrimination","date":"2022-06-03","arxiv_id":"2206.01535","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rethinking-and-scaling-up-graph-contrastive#ran","syntology_url":"https://syntology.ai/paper/2206.01535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.01535"}},"official":{"repos":["zyzisastudyreallyhardguy/graph-group-discrimination"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/kpgt-knowledge-guided-pre-training-of-graph","slug":"kpgt-knowledge-guided-pre-training-of-graph","title":"KPGT: Knowledge-Guided Pre-training of Graph Transformer for Molecular Property Prediction","date":"2022-06-02","arxiv_id":"2206.03364","repositories_listed":1,"syntology":null},{"url":"/paper/augmenting-message-passing-by-retrieving","slug":"augmenting-message-passing-by-retrieving","title":"An Empirical Study of Retrieval-enhanced Graph Neural Networks","date":"2022-06-01","arxiv_id":"2206.00362","repositories_listed":1,"syntology":null},{"url":"/paper/embedding-graphs-on-grassmann-manifold","slug":"embedding-graphs-on-grassmann-manifold","title":"Embedding Graphs on Grassmann Manifold","date":"2022-05-30","arxiv_id":"2205.15068","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-graph-learning-based-on-hierarchical","slug":"dynamic-graph-learning-based-on-hierarchical","title":"Dynamic Graph Learning Based on Hierarchical Memory for Origin-Destination Demand Prediction","date":"2022-05-29","arxiv_id":"2205.14593","repositories_listed":1,"syntology":null},{"url":"/paper/relphormer-relational-graph-transformer-for","slug":"relphormer-relational-graph-transformer-for","title":"Relphormer: Relational Graph Transformer for Knowledge Graph Representations","date":"2022-05-22","arxiv_id":"2205.10852","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/relphormer-relational-graph-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2205.10852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10852"}},"official":{"repos":["zjunlp/relphormer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/distribution-aware-graph-representation","slug":"distribution-aware-graph-representation","title":"Distribution-Aware Graph Representation Learning for Transient Stability Assessment of Power System","date":"2022-05-12","arxiv_id":"2205.06576","repositories_listed":1,"syntology":null},{"url":"/paper/using-constraint-programming-and-graph","slug":"using-constraint-programming-and-graph","title":"Using Constraint Programming and Graph Representation Learning for Generating Interpretable Cloud Security Policies","date":"2022-05-02","arxiv_id":"2205.01240","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":4,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":8,"phrase":"4 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/using-constraint-programming-and-graph#ran","syntology_url":"https://syntology.ai/paper/2205.01240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.01240"}},"official":{"repos":["mikhail247/iamax"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/an-effective-and-efficient-entity-alignment","slug":"an-effective-and-efficient-entity-alignment","title":"An Effective and Efficient Entity Alignment Decoding Algorithm via Third-Order Tensor Isomorphism","date":"2022-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/gtnet-a-tree-based-deep-graph-learning","slug":"gtnet-a-tree-based-deep-graph-learning","title":"GTNet: A Tree-Based Deep Graph Learning Architecture","date":"2022-04-27","arxiv_id":"2204.12802","repositories_listed":1,"syntology":null},{"url":"/paper/simplicial-attention-networks-1","slug":"simplicial-attention-networks-1","title":"Simplicial Attention Networks","date":"2022-04-20","arxiv_id":"2204.09455","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/simplicial-attention-networks-1#ran","syntology_url":"https://syntology.ai/paper/2204.09455","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.09455"}},"official":{"repos":["ggoh29/simplicial-neural-network-benchmark"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-hierarchical-block-distance-model-for-ultra","slug":"a-hierarchical-block-distance-model-for-ultra","title":"A Hierarchical Block Distance Model for Ultra Low-Dimensional Graph Representations","date":"2022-04-12","arxiv_id":"2204.05885","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-graph-representation-learning-1","slug":"hierarchical-graph-representation-learning-1","title":"Hierarchical Graph Representation Learning for the Prediction of Drug-Target Binding Affinity","date":"2022-03-22","arxiv_id":"2203.11458","repositories_listed":1,"syntology":null},{"url":"/paper/multi-modal-graph-learning-for-disease-1","slug":"multi-modal-graph-learning-for-disease-1","title":"Multi-modal Graph Learning for Disease Prediction","date":"2022-03-11","arxiv_id":"2203.05880","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-modal-graph-learning-for-disease-1#ran","syntology_url":"https://syntology.ai/paper/2203.05880","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.05880"}},"official":{"repos":["ssgood/mmgl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-open-challenge-for-inductive-link","slug":"an-open-challenge-for-inductive-link","title":"An Open Challenge for Inductive Link Prediction on Knowledge Graphs","date":"2022-03-03","arxiv_id":"2203.01520","repositories_listed":1,"syntology":null},{"url":"/paper/graph-representation-learning-beyond-node-and","slug":"graph-representation-learning-beyond-node-and","title":"Graph Representation Learning Beyond Node and Homophily","date":"2022-03-03","arxiv_id":"2203.01564","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-microbiome-dynamics-via","slug":"understanding-microbiome-dynamics-via","title":"Understanding microbiome dynamics via interpretable graph representation learning","date":"2022-03-02","arxiv_id":"2203.01830","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-graph-contrastive-learning-with","slug":"adversarial-graph-contrastive-learning-with","title":"Adversarial Graph Contrastive Learning with Information Regularization","date":"2022-02-14","arxiv_id":"2202.06491","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-network-for-local-corruption","slug":"graph-neural-network-for-local-corruption","title":"Robust Graph Representation Learning for Local Corruption Recovery","date":"2022-02-10","arxiv_id":"2202.04936","repositories_listed":1,"syntology":null},{"url":"/paper/domain-adversarial-spatial-temporal-network-a","slug":"domain-adversarial-spatial-temporal-network-a","title":"Domain Adversarial Spatial-Temporal Network: A Transferable Framework for Short-term Traffic Forecasting across Cities","date":"2022-02-08","arxiv_id":"2202.03630","repositories_listed":1,"syntology":null},{"url":"/paper/a-variational-edge-partition-model-for","slug":"a-variational-edge-partition-model-for","title":"A Variational Edge Partition Model for Supervised Graph Representation Learning","date":"2022-02-07","arxiv_id":"2202.03233","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":6,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":7,"phrase":"7 ran (of which 6 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) · 0 unverified","sample_list":"/paper/a-variational-edge-partition-model-for#ran","syntology_url":"https://syntology.ai/paper/2202.03233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.03233"}},"official":{"repos":["yh-utmsb/vepm"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":6,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/simgrace-a-simple-framework-for-graph","slug":"simgrace-a-simple-framework-for-graph","title":"SimGRACE: A Simple Framework for Graph Contrastive Learning without Data Augmentation","date":"2022-02-07","arxiv_id":"2202.03104","repositories_listed":1,"syntology":null},{"url":"/paper/memory-based-message-passing-decoupling-the","slug":"memory-based-message-passing-decoupling-the","title":"Memory-based Message Passing: Decoupling the Message for Propogation from Discrimination","date":"2022-02-01","arxiv_id":"2202.00423","repositories_listed":1,"syntology":null},{"url":"/paper/molecular-graph-representation-learning-via-1","slug":"molecular-graph-representation-learning-via-1","title":"Molecular Representation Learning via Heterogeneous Motif Graph Neural Networks","date":"2022-02-01","arxiv_id":"2202.00529","repositories_listed":1,"syntology":null},{"url":"/paper/questions-for-flat-minima-optimization-of","slug":"questions-for-flat-minima-optimization-of","title":"When Do Flat Minima Optimizers Work?","date":"2022-02-01","arxiv_id":"2202.00661","repositories_listed":1,"syntology":null},{"url":"/paper/graph-self-attention-for-learning-graph","slug":"graph-self-attention-for-learning-graph","title":"GRPE: Relative Positional Encoding for Graph Transformer","date":"2022-01-30","arxiv_id":"2201.12787","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graph-self-attention-for-learning-graph#ran","syntology_url":"https://syntology.ai/paper/2201.12787","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12787"}},"official":{"repos":["lenscloth/grpe"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/smgrl-a-scalable-multi-resolution-graph","slug":"smgrl-a-scalable-multi-resolution-graph","title":"SMGRL: Scalable Multi-resolution Graph Representation Learning","date":"2022-01-29","arxiv_id":"2201.12670","repositories_listed":1,"syntology":null},{"url":"/paper/online-change-point-detection-for-weighted","slug":"online-change-point-detection-for-weighted","title":"Online Change Point Detection for Weighted and Directed Random Dot Product Graphs","date":"2022-01-26","arxiv_id":"2201.11222","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-expressiveness-of-transformer","slug":"investigating-expressiveness-of-transformer","title":"How Expressive are Transformers in Spectral Domain for Graphs?","date":"2022-01-23","arxiv_id":"2201.09332","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/investigating-expressiveness-of-transformer#ran","syntology_url":"https://syntology.ai/paper/2201.09332","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.09332"}},"official":{"repos":["ansonb/FeTA_TMLR"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"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/unsupervised-graph-poisoning-attack-via","slug":"unsupervised-graph-poisoning-attack-via","title":"Unsupervised Graph Poisoning Attack via Contrastive Loss Back-propagation","date":"2022-01-20","arxiv_id":"2201.07986","repositories_listed":1,"syntology":null},{"url":"/paper/local2global-a-distributed-approach-for","slug":"local2global-a-distributed-approach-for","title":"Local2Global: A distributed approach for scaling representation learning on graphs","date":"2022-01-12","arxiv_id":"2201.04729","repositories_listed":1,"syntology":null},{"url":"/paper/fairedit-preserving-fairness-in-graph-neural","slug":"fairedit-preserving-fairness-in-graph-neural","title":"FairEdit: Preserving Fairness in Graph Neural Networks through Greedy Graph Editing","date":"2022-01-10","arxiv_id":"2201.03681","repositories_listed":1,"syntology":null},{"url":"/paper/graph-representation-learning-for-multi-task-1","slug":"graph-representation-learning-for-multi-task-1","title":"Graph Representation Learning for Multi-Task Settings: a Meta-Learning Approach","date":"2022-01-10","arxiv_id":"2201.03326","repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-intelligence-for-dynamic-job-shop","slug":"hybrid-intelligence-for-dynamic-job-shop","title":"Hybrid intelligence for dynamic job-shop scheduling with deep reinforcement learning and attention mechanism","date":"2022-01-03","arxiv_id":"2201.00548","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/repbin-constraint-based-graph-representation","slug":"repbin-constraint-based-graph-representation","title":"RepBin: Constraint-based Graph Representation Learning for Metagenomic Binning","date":"2021-12-22","arxiv_id":"2112.11696","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-model-the-relationship-between","slug":"learning-to-model-the-relationship-between","title":"Learning to Model the Relationship Between Brain Structural and Functional Connectomes","date":"2021-12-18","arxiv_id":"2112.09906","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/graph4rec-a-universal-toolkit-with-graph","slug":"graph4rec-a-universal-toolkit-with-graph","title":"Graph4Rec: A Universal Toolkit with Graph Neural Networks for Recommender Systems","date":"2021-12-02","arxiv_id":"2112.01035","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-with-adaptive-residual","slug":"graph-neural-networks-with-adaptive-residual","title":"Graph Neural Networks with Adaptive Residual","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hgate-heterogeneous-graph-attention-auto","slug":"hgate-heterogeneous-graph-attention-auto","title":"HGATE: Heterogeneous Graph Attention Auto-Encoders","date":"2021-11-28","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/implicit-svd-for-graph-representation","slug":"implicit-svd-for-graph-representation","title":"Implicit SVD for Graph Representation Learning","date":"2021-11-11","arxiv_id":"2111.06312","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-graph-contrastive-learning-data","slug":"collaborative-graph-contrastive-learning-data","title":"CGCL: Collaborative Graph Contrastive Learning without Handcrafted Graph Data Augmentations","date":"2021-11-05","arxiv_id":"2111.03262","repositories_listed":1,"syntology":null},{"url":"/paper/rmna-a-neighbor-aggregation-based-knowledge","slug":"rmna-a-neighbor-aggregation-based-knowledge","title":"RMNA: A Neighbor Aggregation-Based Knowledge Graph Representation Learning Model Using Rule Mining","date":"2021-11-01","arxiv_id":"2111.00658","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-heterogeneous-graph","slug":"hierarchical-heterogeneous-graph","title":"Hierarchical Heterogeneous Graph Representation Learning for Short Text Classification","date":"2021-10-30","arxiv_id":"2111.00180","repositories_listed":1,"syntology":null},{"url":"/paper/graph-communal-contrastive-learning","slug":"graph-communal-contrastive-learning","title":"Graph Communal Contrastive Learning","date":"2021-10-28","arxiv_id":"2110.14863","repositories_listed":1,"syntology":null},{"url":"/paper/lmsoc-an-approach-for-socially-sensitive","slug":"lmsoc-an-approach-for-socially-sensitive","title":"LMSOC: An Approach for Socially Sensitive Pretraining","date":"2021-10-20","arxiv_id":"2110.10319","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/smgc-a-complex-valued-graph-convolutional","slug":"smgc-a-complex-valued-graph-convolutional","title":"MGC: A Complex-Valued Graph Convolutional Network for Directed Graphs","date":"2021-10-14","arxiv_id":"2110.07570","repositories_listed":1,"syntology":null},{"url":"/paper/graph-fraudster-adversarial-attacks-on-graph","slug":"graph-fraudster-adversarial-attacks-on-graph","title":"Graph-Fraudster: Adversarial Attacks on Graph Neural Network Based Vertical Federated Learning","date":"2021-10-13","arxiv_id":"2110.06468","repositories_listed":1,"syntology":null},{"url":"/paper/pre-training-molecular-graph-representation-1","slug":"pre-training-molecular-graph-representation-1","title":"Pre-training Molecular Graph Representation with 3D Geometry","date":"2021-10-07","arxiv_id":"2110.07728","repositories_listed":1,"syntology":null},{"url":"/paper/a-topological-view-of-rule-learning-in","slug":"a-topological-view-of-rule-learning-in","title":"Cycle Representation Learning for Inductive Relation Prediction","date":"2021-10-06","arxiv_id":"2110.02510","repositories_listed":1,"syntology":null},{"url":"/paper/relation-prediction-as-an-auxiliary-training","slug":"relation-prediction-as-an-auxiliary-training","title":"Relation Prediction as an Auxiliary Training Objective for Improving Multi-Relational Graph Representations","date":"2021-10-06","arxiv_id":"2110.02834","repositories_listed":1,"syntology":null},{"url":"/paper/wireless-link-scheduling-via-graph","slug":"wireless-link-scheduling-via-graph","title":"Wireless Link Scheduling via Graph Representation Learning: A Comparative Study of Different Supervision Levels","date":"2021-10-04","arxiv_id":"2110.01722","repositories_listed":1,"syntology":null},{"url":"/paper/learning-compact-representations-of-neural","slug":"learning-compact-representations-of-neural","title":"Learning Compact Representations of Neural Networks using DiscriminAtive Masking (DAM)","date":"2021-10-01","arxiv_id":"2110.00684","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-compact-representations-of-neural#ran","syntology_url":"https://syntology.ai/paper/2110.00684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.00684"}},"official":{"repos":["jayroxis/dam-pytorch"],"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","unlocated"]}}},{"url":"/paper/graphgt-machine-learning-datasets-for-graph","slug":"graphgt-machine-learning-datasets-for-graph","title":"GraphGT: Machine Learning Datasets for Graph Generation and Transformation","date":"2021-09-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/autogcl-automated-graph-contrastive-learning","slug":"autogcl-automated-graph-contrastive-learning","title":"AutoGCL: Automated Graph Contrastive Learning via Learnable View Generators","date":"2021-09-21","arxiv_id":"2109.10259","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 1 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) · 0 unverified","sample_list":"/paper/autogcl-automated-graph-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2109.10259","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.10259"}},"official":{"repos":["Somedaywilldo/AutoGCL"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graphine-a-dataset-for-graph-aware","slug":"graphine-a-dataset-for-graph-aware","title":"Graphine: A Dataset for Graph-aware Terminology Definition Generation","date":"2021-09-09","arxiv_id":"2109.04018","repositories_listed":1,"syntology":null},{"url":"/paper/graph-based-incident-aggregation-for-large","slug":"graph-based-incident-aggregation-for-large","title":"Graph-based Incident Aggregation for Large-Scale Online Service Systems","date":"2021-08-27","arxiv_id":"2108.12179","repositories_listed":1,"syntology":null},{"url":"/paper/jointly-learnable-data-augmentations-for-self","slug":"jointly-learnable-data-augmentations-for-self","title":"Jointly Learnable Data Augmentations for Self-Supervised GNNs","date":"2021-08-23","arxiv_id":"2108.10420","repositories_listed":1,"syntology":null},{"url":"/paper/graph-trend-networks-for-recommendations","slug":"graph-trend-networks-for-recommendations","title":"Graph Trend Filtering Networks for Recommendations","date":"2021-08-12","arxiv_id":"2108.05552","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":1,"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/graph-trend-networks-for-recommendations#ran","syntology_url":"https://syntology.ai/paper/2108.05552","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.05552"}},"official":{"repos":["wenqifan03/gtn-sigir2022"],"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/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/self-supervised-consensus-representation","slug":"self-supervised-consensus-representation","title":"Self-supervised Consensus Representation Learning for Attributed Graph","date":"2021-08-10","arxiv_id":"2108.04822","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/ccgl-contrastive-cascade-graph-learning","slug":"ccgl-contrastive-cascade-graph-learning","title":"CCGL: Contrastive Cascade Graph Learning","date":"2021-07-27","arxiv_id":"2107.12576","repositories_listed":1,"syntology":null},{"url":"/paper/large-scale-graph-representation-learning","slug":"large-scale-graph-representation-learning","title":"Large-scale graph representation learning with very deep GNNs and self-supervision","date":"2021-07-20","arxiv_id":"2107.09422","repositories_listed":1,"syntology":null},{"url":"/paper/wikigraphs-a-wikipedia-text-knowledge-graph","slug":"wikigraphs-a-wikipedia-text-knowledge-graph","title":"WikiGraphs: A Wikipedia Text - Knowledge Graph Paired Dataset","date":"2021-07-20","arxiv_id":"2107.09556","repositories_listed":1,"syntology":null},{"url":"/paper/graph-representation-learning-for-road-type","slug":"graph-representation-learning-for-road-type","title":"Graph Representation Learning for Road Type Classification","date":"2021-07-16","arxiv_id":"2107.07791","repositories_listed":1,"syntology":null},{"url":"/paper/a-deep-latent-space-model-for-graph","slug":"a-deep-latent-space-model-for-graph","title":"A Deep Latent Space Model for Graph Representation Learning","date":"2021-06-22","arxiv_id":"2106.11721","repositories_listed":1,"syntology":null},{"url":"/paper/convdysat-deep-neural-representation-learning","slug":"convdysat-deep-neural-representation-learning","title":"ConvDySAT: Deep Neural Representation Learning on Dynamic Graphs via Self-Attention and Convolutional Neural Networks","date":"2021-06-21","arxiv_id":"2106.11430","repositories_listed":1,"syntology":null},{"url":"/paper/mhnf-multi-hop-heterogeneous-neighborhood","slug":"mhnf-multi-hop-heterogeneous-neighborhood","title":"MHNF: Multi-hop Heterogeneous Neighborhood information Fusion graph representation learning","date":"2021-06-17","arxiv_id":"2106.09289","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-modules-in-graph-contrastive","slug":"evaluating-modules-in-graph-contrastive","title":"Evaluating Modules in Graph Contrastive Learning","date":"2021-06-15","arxiv_id":"2106.08171","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/evaluating-modules-in-graph-contrastive#ran","syntology_url":"https://syntology.ai/paper/2106.08171","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.08171"}},"official":{"repos":["thunlp/opengcl"],"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-neural-networks-for-natural-language","slug":"graph-neural-networks-for-natural-language","title":"Graph Neural Networks for Natural Language Processing: A Survey","date":"2021-06-10","arxiv_id":"2106.06090","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/graph-neural-networks-for-natural-language#ran","syntology_url":"https://syntology.ai/paper/2106.06090","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06090"}},"official":{"repos":["graph4ai/graph4nlp"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/self-supervised-graph-level-representation-1","slug":"self-supervised-graph-level-representation-1","title":"Self-supervised Graph-level Representation Learning with Local and Global Structure","date":"2021-06-08","arxiv_id":"2106.04113","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"4 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; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/self-supervised-graph-level-representation-1#ran","syntology_url":"https://syntology.ai/paper/2106.04113","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04113"}},"official":{"repos":["DeepGraphLearning/GraphLoG"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-barlow-twins-a-self-supervised","slug":"graph-barlow-twins-a-self-supervised","title":"Graph Barlow Twins: A self-supervised representation learning framework for graphs","date":"2021-06-04","arxiv_id":"2106.02466","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-graph-representation-learning-2","slug":"self-supervised-graph-representation-learning-2","title":"Self-Supervised Graph Representation Learning via Topology Transformations","date":"2021-05-25","arxiv_id":"2105.11689","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-graph-representation-learning","slug":"heterogeneous-graph-representation-learning","title":"Heterogeneous Graph Representation Learning with Relation Awareness","date":"2021-05-24","arxiv_id":"2105.11122","repositories_listed":1,"syntology":null},{"url":"/paper/maximizing-mutual-information-across-feature","slug":"maximizing-mutual-information-across-feature","title":"Maximizing Mutual Information Across Feature and Topology Views for Learning Graph Representations","date":"2021-05-14","arxiv_id":"2105.06715","repositories_listed":1,"syntology":null},{"url":"/paper/multi-scale-contrastive-siamese-networks-for","slug":"multi-scale-contrastive-siamese-networks-for","title":"Multi-Scale Contrastive Siamese Networks for Self-Supervised Graph Representation Learning","date":"2021-05-12","arxiv_id":"2105.05682","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":3,"n_ran_checked":3,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/multi-scale-contrastive-siamese-networks-for#ran","syntology_url":"https://syntology.ai/paper/2105.05682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.05682"}},"official":{"repos":["GRAND-Lab/MERIT"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-entropy-guided-node-embedding-dimension","slug":"graph-entropy-guided-node-embedding-dimension","title":"Graph Entropy Guided Node Embedding Dimension Selection for Graph Neural Networks","date":"2021-05-07","arxiv_id":"2105.03178","repositories_listed":1,"syntology":null},{"url":"/paper/graph-pooling-via-coarsened-graph-infomax","slug":"graph-pooling-via-coarsened-graph-infomax","title":"Graph Pooling via Coarsened Graph Infomax","date":"2021-05-04","arxiv_id":"2105.01275","repositories_listed":1,"syntology":null},{"url":"/paper/retrieving-complex-tables-with-multi-granular","slug":"retrieving-complex-tables-with-multi-granular","title":"Retrieving Complex Tables with Multi-Granular Graph Representation Learning","date":"2021-05-04","arxiv_id":"2105.01736","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":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/retrieving-complex-tables-with-multi-granular#ran","syntology_url":"https://syntology.ai/paper/2105.01736","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.01736"}},"official":{"repos":["FeiWang96/GTR"],"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/unignn-a-unified-framework-for-graph-and","slug":"unignn-a-unified-framework-for-graph-and","title":"UniGNN: a Unified Framework for Graph and Hypergraph Neural Networks","date":"2021-05-03","arxiv_id":"2105.00956","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unignn-a-unified-framework-for-graph-and#ran","syntology_url":"https://syntology.ai/paper/2105.00956","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.00956"}},"official":{"repos":["OneForward/UniGNN"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/biased-edge-dropout-for-enhancing-fairness-in","slug":"biased-edge-dropout-for-enhancing-fairness-in","title":"FairDrop: Biased Edge Dropout for Enhancing Fairness in Graph Representation Learning","date":"2021-04-29","arxiv_id":"2104.14210","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/biased-edge-dropout-for-enhancing-fairness-in#ran","syntology_url":"https://syntology.ai/paper/2104.14210","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14210"}},"official":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/new-benchmarks-for-learning-on-non","slug":"new-benchmarks-for-learning-on-non","title":"New Benchmarks for Learning on Non-Homophilous Graphs","date":"2021-04-03","arxiv_id":"2104.01404","repositories_listed":1,"syntology":null},{"url":"/paper/catastrophic-forgetting-in-deep-graph","slug":"catastrophic-forgetting-in-deep-graph","title":"Catastrophic Forgetting in Deep Graph Networks: an Introductory Benchmark for Graph Classification","date":"2021-03-22","arxiv_id":"2103.11750","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-represent-the-evolution-of","slug":"learning-to-represent-the-evolution-of","title":"Learning to Represent the Evolution of Dynamic Graphs with Recurrent Models","date":"2021-03-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-graph-disentanglement","slug":"adversarial-graph-disentanglement","title":"Adversarial Graph Disentanglement","date":"2021-03-12","arxiv_id":"2103.07295","repositories_listed":1,"syntology":null}],"record_sha256":"9a46de6bf44a954f7fecef39ec6ca71c5d2c51a88409737bb8d4555c620d9ea1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}