{"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-classification/papers/8","list_of":"/task/graph-classification","task":"Graph Classification","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":8,"pages_in_order":10,"rows_per_page":100,"rows":[701,800],"of":927,"counts":{"archive_papers_tagged":927,"with_a_code_link":483,"where_syntology_ran_a_sample":174,"not_listed_spam_title":0,"listed":927,"listed_where_code_ran":174,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":150,"every_run_a_failure_of_syntologys_instrument":24,"listed_with_a_run_with_no_instrument_failure":150,"listed_every_run_a_failure_of_syntologys_instrument":24,"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-classification","prev":"/task/graph-classification/papers/7","next":"/task/graph-classification/papers/9","papers":[{"url":null,"slug":"graph-neural-network-with-curriculum-learning","title":"Graph Neural Network with Curriculum Learning for Imbalanced Node Classification","date":"2022-02-05","arxiv_id":"2202.02529","repositories_listed":0,"syntology":null},{"url":null,"slug":"grapheye-a-novel-solution-for-detecting","title":"GraphEye: A Novel Solution for Detecting Vulnerable Functions Based on Graph Attention Network","date":"2022-02-05","arxiv_id":"2202.02501","repositories_listed":0,"syntology":null},{"url":null,"slug":"investigating-transfer-learning-in-graph","title":"Investigating Transfer Learning in Graph Neural Networks","date":"2022-02-01","arxiv_id":"2202.00740","repositories_listed":0,"syntology":null},{"url":null,"slug":"stability-and-generalization-capabilities-of","title":"Generalization Analysis of Message Passing Neural Networks on Large Random Graphs","date":"2022-02-01","arxiv_id":"2202.00645","repositories_listed":0,"syntology":null},{"url":null,"slug":"image-classification-using-graph-neural","title":"Image Classification using Graph Neural Network and Multiscale Wavelet Superpixels","date":"2022-01-29","arxiv_id":"2201.12633","repositories_listed":0,"syntology":null},{"url":null,"slug":"gps-a-policy-driven-sampling-approach-for","title":"GPS: A Policy-driven Sampling Approach for Graph Representation Learning","date":"2021-12-29","arxiv_id":"2112.14482","repositories_listed":0,"syntology":null},{"url":null,"slug":"flowpool-pooling-graph-representations-with","title":"FlowPool: Pooling Graph Representations with Wasserstein Gradient Flows","date":"2021-12-18","arxiv_id":"2112.09990","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-kernel-neural-networks-1","title":"Graph Kernel Neural Networks","date":"2021-12-14","arxiv_id":"2112.07436","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-scale-graph-convolutional-networks-with","title":"Multi-scale Graph Convolutional Networks with Self-Attention","date":"2021-12-04","arxiv_id":"2112.03262","repositories_listed":0,"syntology":null},{"url":null,"slug":"controversy-detection-a-text-and-graph-neural","title":"Controversy Detection: a Text and Graph Neural Network Based Approach","date":"2021-12-03","arxiv_id":"2112.11445","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-adversarial-self-supervised-learning","title":"Graph Adversarial Self-Supervised Learning","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learnable-structural-semantic-readout-for","title":"Learnable Structural Semantic Readout for Graph Classification","date":"2021-11-22","arxiv_id":"2111.11523","repositories_listed":0,"syntology":null},{"url":null,"slug":"iv-gnn-interval-valued-data-handling-using","title":"IV-GNN : Interval Valued Data Handling Using Graph Neural Network","date":"2021-11-17","arxiv_id":"2111.09194","repositories_listed":0,"syntology":null},{"url":null,"slug":"structure-representation-learning-by-jointly","title":"Structure Representation Learning by Jointly Learning to Pool and Represent","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-transplant-node-saliency-guided-graph","title":"Graph Transplant: Node Saliency-Guided Graph Mixup with Local Structure Preservation","date":"2021-11-10","arxiv_id":"2111.05639","repositories_listed":0,"syntology":null},{"url":null,"slug":"inferential-sir-gn-scalable-graph","title":"Inferential SIR-GN: Scalable Graph Representation Learning","date":"2021-11-08","arxiv_id":"2111.04826","repositories_listed":0,"syntology":null},{"url":null,"slug":"augmentations-in-graph-contrastive-learning","title":"Augmentations in Graph Contrastive Learning: Current Methodological Flaws & Towards Better Practices","date":"2021-11-05","arxiv_id":"2111.03220","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-on-random-balls-is-sufficient-for","title":"Learning on Random Balls is Sufficient for Estimating (Some) Graph Parameters","date":"2021-11-05","arxiv_id":"2111.03317","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-network-infomax-a-pre-training-method","title":"Multi network InfoMax: A pre-training method involving graph convolutional networks","date":"2021-11-01","arxiv_id":"2111.01276","repositories_listed":0,"syntology":null},{"url":null,"slug":"infogcl-information-aware-graph-contrastive","title":"InfoGCL: Information-Aware Graph Contrastive Learning","date":"2021-10-28","arxiv_id":"2110.15438","repositories_listed":0,"syntology":null},{"url":null,"slug":"pairwise-half-graph-discrimination-a-simple","title":"Pairwise Half-graph Discrimination: A Simple Graph-level Self-supervised Strategy for Pre-training Graph Neural Networks","date":"2021-10-26","arxiv_id":"2110.13567","repositories_listed":0,"syntology":null},{"url":null,"slug":"watermarking-graph-neural-networks-based-on","title":"Watermarking Graph Neural Networks based on Backdoor Attacks","date":"2021-10-21","arxiv_id":"2110.11024","repositories_listed":0,"syntology":null},{"url":null,"slug":"capsule-graph-neural-networks-with-em-routing","title":"Capsule Graph Neural Networks with EM Routing","date":"2021-10-18","arxiv_id":"2110.09039","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-convolution-neural-network-for-weakly","title":"Graph Convolution Neural Network For Weakly Supervised Abnormality Localization In Long Capsule Endoscopy Videos","date":"2021-10-18","arxiv_id":"2110.09110","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-partner-neural-networks-for-semi","title":"Graph Partner Neural Networks for Semi-Supervised Learning on Graphs","date":"2021-10-18","arxiv_id":"2110.09182","repositories_listed":0,"syntology":null},{"url":null,"slug":"intrusion-free-graph-mixup-1","title":"ifMixup: Interpolating Graph Pair to Regularize Graph Classification","date":"2021-10-18","arxiv_id":"2110.09344","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-closer-look-at-distribution-shifts-and-out","title":"A Closer Look at Distribution Shifts and Out-of-Distribution Generalization on Graphs","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"bandits-for-black-box-attacks-to-graph-neural","title":"Bandits for Black-box Attacks to Graph Neural Networks with Structure Perturbation","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"g-mixup-graph-augmentation-for-graph","title":"G-Mixup: Graph Augmentation for Graph Classification","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"geometric-random-walk-graph-neural-networks","title":"Geometric Random Walk Graph Neural Networks via Implicit Layers","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-lottery-ticket-learning-for-graph","title":"Inductive Lottery Ticket Learning for Graph Neural Networks","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"intrusion-free-graph-mixup","title":"Intrusion-Free Graph Mixup","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"m-mix-generating-hard-negatives-via-multiple","title":"$m$-mix: Generating hard negatives via multiple samples mixing for contrastive learning","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"metric-learning-on-temporal-graphs-via-few","title":"Metric Learning on Temporal Graphs via Few-Shot Examples","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-virtual-nodes-in-graph-neural","title":"Revisiting Virtual Nodes in Graph Neural Networks for Link Prediction","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-infinite-contextual-graph-markov-model","title":"The Infinite Contextual Graph Markov Model","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"wasserstein-weisfeiler-lehman-subtree","title":"Wasserstein Weisfeiler-Lehman Subtree Distance for Graph-Structured Data","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"edge-but-not-least-cross-view-graph-pooling","title":"Edge but not Least: Cross-View Graph Pooling","date":"2021-09-24","arxiv_id":"2109.11796","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-argument-quality-assessment","title":"Graph-based Argument Quality Assessment","date":"2021-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-convolutional-deep-learning-to-identify","title":"Graph-Convolutional Deep Learning to Identify Optimized Molecular Configurations","date":"2021-08-22","arxiv_id":"2108.09637","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hard-label-black-box-adversarial-attack","title":"A Hard Label Black-box Adversarial Attack Against Graph Neural Networks","date":"2021-08-21","arxiv_id":"2108.09513","repositories_listed":0,"syntology":null},{"url":null,"slug":"blockchain-phishing-scam-detection-via-multi","title":"Blockchain Phishing Scam Detection via Multi-channel Graph Classification","date":"2021-08-19","arxiv_id":"2108.08456","repositories_listed":0,"syntology":null},{"url":null,"slug":"natural-numerical-networks-for-natura-2000","title":"Natural Numerical Networks for Natura 2000 habitats classification by satellite images","date":"2021-08-09","arxiv_id":"2108.04327","repositories_listed":0,"syntology":null},{"url":null,"slug":"compensation-learning","title":"Compensation Learning","date":"2021-07-26","arxiv_id":"2107.11921","repositories_listed":0,"syntology":null},{"url":null,"slug":"gcexplainer-human-in-the-loop-concept-based","title":"GCExplainer: Human-in-the-Loop Concept-based Explanations for Graph Neural Networks","date":"2021-07-25","arxiv_id":"2107.11889","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-graph-learning-via-population-based","title":"Automated Graph Learning via Population Based Self-Tuning GCN","date":"2021-07-09","arxiv_id":"2107.04713","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-graph-convolutional-neural-networks","title":"Quantum Graph Convolutional Neural Networks","date":"2021-07-07","arxiv_id":"2107.03257","repositories_listed":0,"syntology":null},{"url":null,"slug":"attacking-graph-classification-via-bayesian","title":"Attacking Graph Classification via Bayesian Optimisation","date":"2021-06-18","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"message-passing-in-graph-convolution-networks","title":"Message Passing in Graph Convolution Networks via Adaptive Filter Banks","date":"2021-06-18","arxiv_id":"2106.09910","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-domain-adaptation-a-generative-view","title":"Graph Domain Adaptation: A Generative View","date":"2021-06-14","arxiv_id":"2106.07482","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-symbiosis-learning","title":"AKE-GNN: Effective Graph Learning with Adaptive Knowledge Exchange","date":"2021-06-10","arxiv_id":"2106.05455","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph2graph-learning-with-conditional","title":"Graph2Graph Learning with Conditional Autoregressive Models","date":"2021-06-06","arxiv_id":"2106.03236","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-2d-convolutional-neural-networks","title":"Revisiting 2D Convolutional Neural Networks for Graph-based Applications","date":"2021-05-23","arxiv_id":"2105.11016","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-task-graph-convolutional-neural-network","title":"Multi-task Graph Convolutional Neural Network for Calcification Morphology and Distribution Analysis in Mammograms","date":"2021-05-14","arxiv_id":"2105.06822","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-for-inconsistent","title":"Graph Neural Networks for Inconsistent Cluster Detection in Incremental Entity Resolution","date":"2021-05-12","arxiv_id":"2105.05957","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hyperbolic-to-hyperbolic-graph","title":"A Hyperbolic-to-Hyperbolic Graph Convolutional Network","date":"2021-04-14","arxiv_id":"2104.06942","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-adaptive-pooling-by-capturing","title":"Hierarchical Adaptive Pooling by Capturing High-order Dependency for Graph Representation Learning","date":"2021-04-13","arxiv_id":"2104.05960","repositories_listed":0,"syntology":null},{"url":null,"slug":"scaling-up-graph-homomorphism-for","title":"Scaling up graph homomorphism for classification via sampling","date":"2021-04-08","arxiv_id":"2104.04040","repositories_listed":0,"syntology":null},{"url":null,"slug":"gabo-graph-augmentations-with-bi-level","title":"GABO: Graph Augmentations with Bi-level Optimization","date":"2021-04-01","arxiv_id":"2104.00722","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-classification-by-mixture-of-diverse","title":"Graph Classification by Mixture of Diverse Experts","date":"2021-03-29","arxiv_id":"2103.15622","repositories_listed":0,"syntology":null},{"url":null,"slug":"unified-graph-structured-models-for-video","title":"Unified Graph Structured Models for Video Understanding","date":"2021-03-29","arxiv_id":"2103.15662","repositories_listed":0,"syntology":null},{"url":null,"slug":"diversified-multiscale-graph-learning-with","title":"Diversified Multiscale Graph Learning with Graph Self-Correction","date":"2021-03-17","arxiv_id":"2103.09754","repositories_listed":0,"syntology":null},{"url":null,"slug":"should-graph-neural-networks-use-features","title":"Should Graph Neural Networks Use Features, Edges, Or Both?","date":"2021-03-11","arxiv_id":"2103.06857","repositories_listed":0,"syntology":null},{"url":null,"slug":"sanity-check-for-persistence-diagrams","title":"Sanity Check for Persistence Diagrams","date":"2021-03-08","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"scaling-up-graph-homomorphism-features-with","title":"Scaling Up Graph Homomorphism Features with Efficient Data Structures","date":"2021-03-08","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-level-attention-pooling-for-graph","title":"Multi-Level Attention Pooling for Graph Neural Networks: Unifying Graph Representations with Multiple Localities","date":"2021-03-02","arxiv_id":"2103.01488","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphfool-targeted-label-adversarial-attack","title":"Graphfool: Targeted Label Adversarial Attack on Graph Embedding","date":"2021-02-24","arxiv_id":"2102.12284","repositories_listed":0,"syntology":null},{"url":null,"slug":"ego-based-entropy-measures-for-structural-1","title":"Ego-based Entropy Measures for Structural Representations on Graphs","date":"2021-02-17","arxiv_id":"2102.08735","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-for-data-poisoning-on","title":"Reinforcement Learning For Data Poisoning on Graph Neural Networks","date":"2021-02-12","arxiv_id":"2102.06800","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-visual-reasoning-by-exploiting-the","title":"Improving Scene Graph Classification by Exploiting Knowledge from Texts","date":"2021-02-09","arxiv_id":"2102.04760","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-graph-representations","title":"Learning Graph Representations","date":"2021-02-03","arxiv_id":"2102.02026","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-classification-based-on-skeleton-and","title":"Graph Classification Based on Skeleton and Component Features","date":"2021-02-02","arxiv_id":"2102.01428","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimisation-of-spectral-wavelets-for","title":"Optimisation of Spectral Wavelets for Persistence-based Graph Classification","date":"2021-01-10","arxiv_id":"2101.05201","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-graph-network-to-lifelong-learning","title":"Bridging Graph Network to Lifelong Learning with Feature Interaction","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-graph-similarity-network","title":"Graph-Graph Similarity Network","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-pooling-by-edge-cut","title":"Graph Pooling by Edge Cut","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-structural-aggregation-for-explainable","title":"Graph Structural Aggregation for Explainable Learning","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graphsad-learning-graph-representations-with","title":"GraphSAD: Learning Graph Representations with Structure-Attribute Disentanglement","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-from-multiscale-wavelet-superpixels","title":"Learning from multiscale wavelet superpixels using GNN with spatially heterogeneous pooling","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-level-graph-matching-networks-for-deep","title":"Multi-level Graph Matching Networks for Deep and Robust Graph Similarity Learning","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-pooling-for-graph-neural-networks","title":"Neural Pooling for Graph Neural Networks","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-single-environment-extrapolations-in-graph","title":"On Single-environment Extrapolations in Graph Classification and Regression Tasks","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"one-vertex-attack-on-graph-neural-networks","title":"One Vertex Attack on Graph Neural Networks-based Spatiotemporal Forecasting","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"polynomial-graph-convolutional-networks","title":"Polynomial Graph Convolutional Networks","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"topoter-unsupervised-learning-of-topology","title":"TopoTER: Unsupervised Learning of Topology Transformation Equivariant Representations","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"lookhops-light-multi-order-convolution-and","title":"LookHops: light multi-order convolution and pooling for graph classification","date":"2020-12-28","arxiv_id":"2012.15741","repositories_listed":0,"syntology":null},{"url":null,"slug":"power-normalizations-in-fine-grained-image","title":"Power Normalizations in Fine-grained Image, Few-shot Image and Graph Classification","date":"2020-12-27","arxiv_id":"2012.13975","repositories_listed":0,"syntology":null},{"url":null,"slug":"query-free-black-box-adversarial-attacks-on","title":"Blindfolded Attackers Still Threatening: Strict Black-Box Adversarial Attacks on Graphs","date":"2020-12-12","arxiv_id":"2012.06757","repositories_listed":0,"syntology":null},{"url":null,"slug":"commpool-an-interpretable-graph-pooling","title":"CommPOOL: An Interpretable Graph Pooling Framework for Hierarchical Graph Representation Learning","date":"2020-12-10","arxiv_id":"2012.05980","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-similarity-for-deep-learning","title":"A graph similarity for deep learning","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"copt-coordinated-optimal-transport-on-graphs-1","title":"COPT: Coordinated Optimal Transport on Graphs","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"random-walk-graph-neural-networks","title":"Random Walk Graph Neural Networks","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-heterogeneous-graph-embedding","title":"A Survey on Heterogeneous Graph Embedding: Methods, Techniques, Applications and Sources","date":"2020-11-30","arxiv_id":"2011.14867","repositories_listed":0,"syntology":null},{"url":null,"slug":"classification-by-attention-scene-graph","title":"Classification by Attention: Scene Graph Classification with Prior Knowledge","date":"2020-11-19","arxiv_id":"2011.10084","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-neural-network-models-with-1","title":"Graph-Based Neural Network Models with Multiple Self-Supervised Auxiliary Tasks","date":"2020-11-14","arxiv_id":"2011.07267","repositories_listed":0,"syntology":null},{"url":null,"slug":"sampling-and-recovery-of-graph-signals-based","title":"Sampling and Recovery of Graph Signals based on Graph Neural Networks","date":"2020-11-03","arxiv_id":"2011.01412","repositories_listed":0,"syntology":null},{"url":null,"slug":"complexdatalab-at-w-nut-2020-task-2-detecting","title":"ComplexDataLab at W-NUT 2020 Task 2: Detecting Informative COVID-19 Tweets by Attending over Linked Documents","date":"2020-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dark-reciprocal-rank-boosting-graph","title":"Dark Reciprocal-Rank: Boosting Graph-Convolutional Self-Localization Network via Teacher-to-student Knowledge Transfer","date":"2020-11-01","arxiv_id":"2011.00402","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-embedding-using-multi-layer-adjacent","title":"Graph embedding using multi-layer adjacent point merging model","date":"2020-10-28","arxiv_id":"2010.14773","repositories_listed":0,"syntology":null},{"url":"/paper/graphmdn-leveraging-graph-structure-and-deep","slug":"graphmdn-leveraging-graph-structure-and-deep","title":"GraphMDN: Leveraging graph structure and deep learning to solve inverse problems","date":"2020-10-26","arxiv_id":"2010.13668","repositories_listed":0,"syntology":null}],"record_sha256":"5d565616bd75410de385c06c46e50d3502509e25bd5c95a6651c4532b934821d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}