{"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-learning/papers/7","list_of":"/task/graph-learning","task":"Graph 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":7,"pages_in_order":16,"rows_per_page":100,"rows":[601,700],"of":1570,"counts":{"archive_papers_tagged":1570,"with_a_code_link":686,"where_syntology_ran_a_sample":193,"not_listed_spam_title":0,"listed":1570,"listed_where_code_ran":193,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":162,"every_run_a_failure_of_syntologys_instrument":31,"listed_with_a_run_with_no_instrument_failure":162,"listed_every_run_a_failure_of_syntologys_instrument":31,"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-learning","prev":"/task/graph-learning/papers/6","next":"/task/graph-learning/papers/8","papers":[{"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/consensus-graph-learning-for-multi-view","slug":"consensus-graph-learning-for-multi-view","title":"Consensus Graph Learning for Multi-view Clustering","date":"2021-05-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/stacking-vae-with-graph-neural-networks-for","slug":"stacking-vae-with-graph-neural-networks-for","title":"StackVAE-G: An efficient and interpretable model for time series anomaly detection","date":"2021-05-18","arxiv_id":"2105.08397","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-graph-learning-with-auxiliary","slug":"collaborative-graph-learning-with-auxiliary","title":"Collaborative Graph Learning with Auxiliary Text for Temporal Event Prediction in Healthcare","date":"2021-05-16","arxiv_id":"2105.07542","repositories_listed":1,"syntology":{"n":16,"n_ran":14,"n_constructed":8,"n_ran_checked":14,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":2,"n_no_contract":11,"n_pointer_only":0,"phrase":"14 ran (of which 8 constructed an object rather than computing a result; 14 with no instrument failure: 1 honoured, 2 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/collaborative-graph-learning-with-auxiliary#ran","syntology_url":"https://syntology.ai/paper/2105.07542","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.07542"}},"official":{"repos":["LuChang-CS/CGL"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":8,"n_ran_no_instrument_failure":14,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-learning-based-recommender-systems-a","slug":"graph-learning-based-recommender-systems-a","title":"Graph Learning based Recommender Systems: A Review","date":"2021-05-13","arxiv_id":"2105.06339","repositories_listed":1,"syntology":null},{"url":"/paper/neural-graph-matching-based-collaborative","slug":"neural-graph-matching-based-collaborative","title":"Neural Graph Matching based Collaborative Filtering","date":"2021-05-10","arxiv_id":"2105.04067","repositories_listed":1,"syntology":null},{"url":"/paper/an-influence-based-approach-for-root-cause","slug":"an-influence-based-approach-for-root-cause","title":"An Influence-based Approach for Root Cause Alarm Discovery in Telecom Networks","date":"2021-05-07","arxiv_id":"2105.03092","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-with-adaptive-frequency","slug":"graph-neural-networks-with-adaptive-frequency","title":"AdaGNN: Graph Neural Networks with Adaptive Frequency Response Filter","date":"2021-04-26","arxiv_id":"2104.12840","repositories_listed":1,"syntology":null},{"url":"/paper/graphtheta-a-distributed-graph-neural-network","slug":"graphtheta-a-distributed-graph-neural-network","title":"GraphTheta: A Distributed Graph Neural Network Learning System With Flexible Training Strategy","date":"2021-04-21","arxiv_id":"2104.10569","repositories_listed":1,"syntology":null},{"url":"/paper/generative-causal-explanations-for-graph","slug":"generative-causal-explanations-for-graph","title":"Generative Causal Explanations for Graph Neural Networks","date":"2021-04-14","arxiv_id":"2104.06643","repositories_listed":1,"syntology":null},{"url":"/paper/mutual-graph-learning-for-camouflaged-object","slug":"mutual-graph-learning-for-camouflaged-object","title":"Mutual Graph Learning for Camouflaged Object Detection","date":"2021-04-03","arxiv_id":"2104.02613","repositories_listed":1,"syntology":{"n":13,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":13,"phrase":"7 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; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/mutual-graph-learning-for-camouflaged-object#ran","syntology_url":"https://syntology.ai/paper/2104.02613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.02613"}},"official":{"repos":["fanyang587/MGL"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/deepened-graph-auto-encoders-help-stabilize","slug":"deepened-graph-auto-encoders-help-stabilize","title":"Deepened Graph Auto-Encoders Help Stabilize and Enhance Link Prediction","date":"2021-03-21","arxiv_id":"2103.11414","repositories_listed":1,"syntology":null},{"url":"/paper/chemistry-informed-macromolecule-graph","slug":"chemistry-informed-macromolecule-graph","title":"GLAMOUR: Graph Learning over Macromolecule Representations","date":"2021-03-03","arxiv_id":"2103.02565","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/accurate-learning-of-graph-representations-1","slug":"accurate-learning-of-graph-representations-1","title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","date":"2021-02-23","arxiv_id":"2102.11533","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/accurate-learning-of-graph-representations-1#ran","syntology_url":"https://syntology.ai/paper/2102.11533","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11533"}},"official":{"repos":["JinheonBaek/GMT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/persistence-homology-for-link-prediction-an","slug":"persistence-homology-for-link-prediction-an","title":"Link Prediction with Persistent Homology: An Interactive View","date":"2021-02-20","arxiv_id":"2102.10255","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/persistence-homology-for-link-prediction-an#ran","syntology_url":"https://syntology.ai/paper/2102.10255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.10255"}},"official":{"repos":["pkuyzy/TLC-GNN"],"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/ssfg-stochastically-scaling-features-and","slug":"ssfg-stochastically-scaling-features-and","title":"SSFG: Stochastically Scaling Features and Gradients for Regularizing Graph Convolutional Networks","date":"2021-02-20","arxiv_id":"2102.10338","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-learning-with-1d-convolutions-on-random","slug":"graph-learning-with-1d-convolutions-on-random","title":"Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing","date":"2021-02-17","arxiv_id":"2102.08786","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-graph-learning-for-molecular","slug":"few-shot-graph-learning-for-molecular","title":"Few-Shot Graph Learning for Molecular Property Prediction","date":"2021-02-16","arxiv_id":"2102.07916","repositories_listed":1,"syntology":null},{"url":"/paper/topological-graph-neural-networks","slug":"topological-graph-neural-networks","title":"Topological Graph Neural Networks","date":"2021-02-15","arxiv_id":"2102.07835","repositories_listed":1,"syntology":null},{"url":"/paper/online-graph-dictionary-learning","slug":"online-graph-dictionary-learning","title":"Online Graph Dictionary Learning","date":"2021-02-12","arxiv_id":"2102.06555","repositories_listed":1,"syntology":null},{"url":"/paper/a-unifying-generative-model-for-graph","slug":"a-unifying-generative-model-for-graph","title":"A Unifying Generative Model for Graph Learning Algorithms: Label Propagation, Graph Convolutions, and Combinations","date":"2021-01-19","arxiv_id":"2101.07730","repositories_listed":1,"syntology":null},{"url":"/paper/graphhop-an-enhanced-label-propagation-method","slug":"graphhop-an-enhanced-label-propagation-method","title":"GraphHop: An Enhanced Label Propagation Method for Node Classification","date":"2021-01-07","arxiv_id":"2101.02326","repositories_listed":1,"syntology":null},{"url":"/paper/algorithms-for-learning-graphs-in-financial","slug":"algorithms-for-learning-graphs-in-financial","title":"Algorithms for Learning Graphs in Financial Markets","date":"2020-12-31","arxiv_id":"2012.15410","repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-micro-macro-level-convolution-for","slug":"hybrid-micro-macro-level-convolution-for","title":"Hybrid Micro/Macro Level Convolution for Heterogeneous Graph Learning","date":"2020-12-29","arxiv_id":"2012.14722","repositories_listed":1,"syntology":null},{"url":"/paper/tsgcnet-discriminative-geometric-feature","slug":"tsgcnet-discriminative-geometric-feature","title":"TSGCNet: Discriminative Geometric Feature Learning with Two-Stream GraphConvolutional Network for 3D Dental Model Segmentation","date":"2020-12-26","arxiv_id":"2012.13697","repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-bayesian-optimization-via-3","slug":"high-dimensional-bayesian-optimization-via-3","title":"High-Dimensional Bayesian Optimization via Tree-Structured Additive Models","date":"2020-12-24","arxiv_id":"2012.13088","repositories_listed":1,"syntology":null},{"url":"/paper/lcs-graph-kernel-based-on-wasserstein","slug":"lcs-graph-kernel-based-on-wasserstein","title":"LCS Graph Kernel Based on Wasserstein Distance in Longest Common Subsequence Metric Space","date":"2020-12-07","arxiv_id":"2012.03612","repositories_listed":1,"syntology":null},{"url":"/paper/an-uncertainty-driven-gcn-refinement-strategy-1","slug":"an-uncertainty-driven-gcn-refinement-strategy-1","title":"An Uncertainty-Driven GCN Refinement Strategy for Organ Segmentation","date":"2020-12-06","arxiv_id":"2012.03352","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-node-content-for-multiview-graph","slug":"exploiting-node-content-for-multiview-graph","title":"Exploiting Node Content for Multiview Graph Convolutional Network and Adversarial Regularization","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/world-model-as-a-graph-learning-latent","slug":"world-model-as-a-graph-learning-latent","title":"World Model as a Graph: Learning Latent Landmarks for Planning","date":"2020-11-25","arxiv_id":"2011.12491","repositories_listed":1,"syntology":null},{"url":"/paper/graph-information-bottleneck-for-subgraph-1","slug":"graph-information-bottleneck-for-subgraph-1","title":"Graph Information Bottleneck for Subgraph Recognition","date":"2020-10-12","arxiv_id":"2010.05563","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graph-information-bottleneck-for-subgraph-1#ran","syntology_url":"https://syntology.ai/paper/2010.05563","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05563"}},"official":{"repos":["Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/embedding-words-in-non-vector-space-with","slug":"embedding-words-in-non-vector-space-with","title":"Embedding Words in Non-Vector Space with Unsupervised Graph Learning","date":"2020-10-06","arxiv_id":"2010.02598","repositories_listed":1,"syntology":null},{"url":"/paper/framework-for-designing-filters-of-spectral","slug":"framework-for-designing-filters-of-spectral","title":"Framework for Designing Filters of Spectral Graph Convolutional Neural Networks in the Context of Regularization Theory","date":"2020-09-29","arxiv_id":"2009.13801","repositories_listed":1,"syntology":null},{"url":"/paper/extracting-summary-knowledge-graphs-from-long","slug":"extracting-summary-knowledge-graphs-from-long","title":"Extracting Summary Knowledge Graphs from Long Documents","date":"2020-09-19","arxiv_id":"2009.09162","repositories_listed":1,"syntology":null},{"url":"/paper/qr-and-lq-decomposition-matrix","slug":"qr-and-lq-decomposition-matrix","title":"QR and LQ Decomposition Matrix Backpropagation Algorithms for Square, Wide, and Deep -- Real or Complex -- Matrices and Their Software Implementation","date":"2020-09-19","arxiv_id":"2009.10071","repositories_listed":1,"syntology":null},{"url":"/paper/implicit-graph-neural-networks","slug":"implicit-graph-neural-networks","title":"Implicit Graph Neural Networks","date":"2020-09-14","arxiv_id":"2009.06211","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/implicit-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2009.06211","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.06211"}},"official":{"repos":["SwiftieH/IGNN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/catgcn-graph-convolutional-networks-with","slug":"catgcn-graph-convolutional-networks-with","title":"CatGCN: Graph Convolutional Networks with Categorical Node Features","date":"2020-09-11","arxiv_id":"2009.05303","repositories_listed":1,"syntology":null},{"url":"/paper/learnable-graph-inception-network-for-emotion","slug":"learnable-graph-inception-network-for-emotion","title":"Dynamic Emotion Modeling with Learnable Graphs and Graph Inception Network","date":"2020-08-06","arxiv_id":"2008.02661","repositories_listed":1,"syntology":null},{"url":"/paper/active-object-search","slug":"active-object-search","title":"Cross-Domain Facial Expression Recognition: A Unified Evaluation Benchmark and Adversarial Graph Learning","date":"2020-08-03","arxiv_id":"2008.00923","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-bipartite-graph-learning-for","slug":"adversarial-bipartite-graph-learning-for","title":"Adversarial Bipartite Graph Learning for Video Domain Adaptation","date":"2020-07-31","arxiv_id":"2007.15829","repositories_listed":1,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/adversarial-bipartite-graph-learning-for#ran","syntology_url":"https://syntology.ai/paper/2007.15829","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.15829"}},"official":{"repos":["Luoyadan/MM2020_ABG"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/few-shot-link-prediction-via-graph-neural","slug":"few-shot-link-prediction-via-graph-neural","title":"Few-shot link prediction via graph neural networks for Covid-19 drug-repurposing","date":"2020-07-20","arxiv_id":"2007.10261","repositories_listed":1,"syntology":null},{"url":"/paper/data-augmentation-view-on-graph-convolutional","slug":"data-augmentation-view-on-graph-convolutional","title":"Data Augmentation View on Graph Convolutional Network and the Proposal of Monte Carlo Graph Learning","date":"2020-06-23","arxiv_id":"2006.13090","repositories_listed":1,"syntology":null},{"url":"/paper/progressive-graph-learning-for-open-set","slug":"progressive-graph-learning-for-open-set","title":"Progressive Graph Learning for Open-Set Domain Adaptation","date":"2020-06-22","arxiv_id":"2006.12087","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/progressive-graph-learning-for-open-set#ran","syntology_url":"https://syntology.ai/paper/2006.12087","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12087"}},"official":{"repos":["BUserName/PGL"],"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/wasserstein-embedding-for-graph-learning","slug":"wasserstein-embedding-for-graph-learning","title":"Wasserstein Embedding for Graph Learning","date":"2020-06-16","arxiv_id":"2006.09430","repositories_listed":1,"syntology":null},{"url":"/paper/hypergraph-learning-with-line-expansion","slug":"hypergraph-learning-with-line-expansion","title":"Semi-supervised Hypergraph Node Classification on Hypergraph Line Expansion","date":"2020-05-11","arxiv_id":"2005.04843","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/hypergraph-learning-with-line-expansion#ran","syntology_url":"https://syntology.ai/paper/2005.04843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.04843"}},"official":{"repos":["ycq091044/legcn"],"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/dialgraph-sparse-graph-learning-networks-for","slug":"dialgraph-sparse-graph-learning-networks-for","title":"Reasoning Visual Dialog with Sparse Graph Learning and Knowledge Transfer","date":"2020-04-14","arxiv_id":"2004.06698","repositories_listed":1,"syntology":null},{"url":"/paper/the-general-theory-of-permutation-equivarant","slug":"the-general-theory-of-permutation-equivarant","title":"The general theory of permutation equivarant neural networks and higher order graph variational encoders","date":"2020-04-08","arxiv_id":"2004.03990","repositories_listed":1,"syntology":{"n":17,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":9,"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) · 9 unverified","sample_list":"/paper/the-general-theory-of-permutation-equivarant#ran","syntology_url":"https://syntology.ai/paper/2004.03990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.03990"}},"official":null}},{"url":"/paper/universal-function-approximation-on-graphs","slug":"universal-function-approximation-on-graphs","title":"Universal Function Approximation on Graphs","date":"2020-03-14","arxiv_id":"2003.06706","repositories_listed":1,"syntology":null},{"url":"/paper/graph-universal-adversarial-attacks-a-few-bad","slug":"graph-universal-adversarial-attacks-a-few-bad","title":"Graph Universal Adversarial Attacks: A Few Bad Actors Ruin Graph Learning Models","date":"2020-02-12","arxiv_id":"2002.04784","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/graph-universal-adversarial-attacks-a-few-bad#ran","syntology_url":"https://syntology.ai/paper/2002.04784","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.04784"}},"official":{"repos":["chisam0217/Graph-Universal-Attack"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-distance-metric-learning-with","slug":"graph-neural-distance-metric-learning-with","title":"Graph Neural Distance Metric Learning with Graph-Bert","date":"2020-02-09","arxiv_id":"2002.03427","repositories_listed":1,"syntology":null},{"url":"/paper/learning-graph-representations-of-biochemical","slug":"learning-graph-representations-of-biochemical","title":"Learning graph representations of biochemical networks and its application to enzymatic link prediction","date":"2020-02-09","arxiv_id":"2002.03410","repositories_listed":1,"syntology":null},{"url":"/paper/random-features-strengthen-graph-neural","slug":"random-features-strengthen-graph-neural","title":"Random Features Strengthen Graph Neural Networks","date":"2020-02-08","arxiv_id":"2002.03155","repositories_listed":1,"syntology":null},{"url":"/paper/neural-subgraph-isomorphism-counting-1","slug":"neural-subgraph-isomorphism-counting-1","title":"Neural Subgraph Isomorphism Counting","date":"2019-12-25","arxiv_id":"1912.11589","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-subgraph-isomorphism-counting-1#ran","syntology_url":"https://syntology.ai/paper/1912.11589","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.11589"}},"official":{"repos":["HKUST-KnowComp/NeuralSubgraphCounting"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-iterative-and-adaptive-learning-for","slug":"deep-iterative-and-adaptive-learning-for","title":"Deep Iterative and Adaptive Learning for Graph Neural Networks","date":"2019-12-17","arxiv_id":"1912.07832","repositories_listed":1,"syntology":null},{"url":"/paper/stage-spatio-temporal-attention-on-graph","slug":"stage-spatio-temporal-attention-on-graph","title":"Video action detection by learning graph-based spatio-temporal interactions","date":"2019-12-09","arxiv_id":"1912.04316","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-graph-attention-networks","slug":"sparse-graph-attention-networks","title":"Sparse Graph Attention Networks","date":"2019-12-02","arxiv_id":"1912.00552","repositories_listed":1,"syntology":null},{"url":"/paper/graph-agreement-models-for-semi-supervised","slug":"graph-agreement-models-for-semi-supervised","title":"Graph Agreement Models for Semi-Supervised Learning","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-graph-learning-for-visual","slug":"heterogeneous-graph-learning-for-visual","title":"Heterogeneous Graph Learning for Visual Commonsense Reasoning","date":"2019-10-25","arxiv_id":"1910.11475","repositories_listed":1,"syntology":null},{"url":"/paper/relational-graph-learning-for-crowd","slug":"relational-graph-learning-for-crowd","title":"Relational Graph Learning for Crowd Navigation","date":"2019-09-28","arxiv_id":"1909.13165","repositories_listed":1,"syntology":null},{"url":"/paper/a-quest-for-structure-jointly-learning-the","slug":"a-quest-for-structure-jointly-learning-the","title":"A Quest for Structure: Jointly Learning the Graph Structure and Semi-Supervised Classification","date":"2019-09-26","arxiv_id":"1909.12385","repositories_listed":1,"syntology":null},{"url":"/paper/190910086","slug":"190910086","title":"Learning Universal Graph Neural Network Embeddings With Aid Of Transfer Learning","date":"2019-09-22","arxiv_id":"1909.10086","repositories_listed":1,"syntology":null},{"url":"/paper/multi-graph-fusion-for-multi-view-spectral","slug":"multi-graph-fusion-for-multi-view-spectral","title":"Multi-graph Fusion for Multi-view Spectral Clustering","date":"2019-09-16","arxiv_id":"1909.06940","repositories_listed":1,"syntology":null},{"url":"/paper/joint-learning-of-graph-representation-and","slug":"joint-learning-of-graph-representation-and","title":"Joint Learning of Graph Representation and Node Features in Graph Convolutional Neural Networks","date":"2019-09-11","arxiv_id":"1909.04931","repositories_listed":1,"syntology":null},{"url":"/paper/latent-multi-view-semi-supervised","slug":"latent-multi-view-semi-supervised","title":"Latent Multi-view Semi-Supervised Classification","date":"2019-09-09","arxiv_id":"1909.03712","repositories_listed":1,"syntology":null},{"url":"/paper/the-general-black-box-attack-method-for-graph","slug":"the-general-black-box-attack-method-for-graph","title":"A Restricted Black-box Adversarial Framework Towards Attacking Graph Embedding Models","date":"2019-08-04","arxiv_id":"1908.01297","repositories_listed":1,"syntology":null},{"url":"/paper/an-uncertainty-driven-gcn-refinement-strategy","slug":"an-uncertainty-driven-gcn-refinement-strategy","title":"Uncertainty-based graph convolutional networks for organ segmentation refinement","date":"2019-06-05","arxiv_id":"1906.02191","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-learning-with-graph-learning","slug":"semi-supervised-learning-with-graph-learning","title":"Semi-Supervised Learning With Graph Learning-Convolutional Networks","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-learning-network-a-structure-learning-1","slug":"graph-learning-network-a-structure-learning-1","title":"Graph Learning Network: A Structure Learning Algorithm","date":"2019-05-29","arxiv_id":"1905.12665","repositories_listed":1,"syntology":null},{"url":"/paper/rgb-t-image-saliency-detection-via","slug":"rgb-t-image-saliency-detection-via","title":"RGB-T Image Saliency Detection via Collaborative Graph Learning","date":"2019-05-16","arxiv_id":"1905.06741","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-graph-classification-a","slug":"semi-supervised-graph-classification-a","title":"Semi-Supervised Graph Classification: A Hierarchical Graph Perspective","date":"2019-04-10","arxiv_id":"1904.05003","repositories_listed":1,"syntology":null},{"url":"/paper/towards-a-practical-k-dimensional-weisfeiler","slug":"towards-a-practical-k-dimensional-weisfeiler","title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings","date":"2019-04-02","arxiv_id":"1904.01543","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/towards-a-practical-k-dimensional-weisfeiler#ran","syntology_url":"https://syntology.ai/paper/1904.01543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01543"}},"official":{"repos":["chrsmrrs/sparsewl"],"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/multi-stage-self-supervised-learning-for","slug":"multi-stage-self-supervised-learning-for","title":"Multi-Stage Self-Supervised Learning for Graph Convolutional Networks on Graphs with Few Labels","date":"2019-02-28","arxiv_id":"1902.11038","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/multi-stage-self-supervised-learning-for#ran","syntology_url":"https://syntology.ai/paper/1902.11038","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.11038"}},"official":null}},{"url":"/paper/unifying-knowledge-graph-learning-and","slug":"unifying-knowledge-graph-learning-and","title":"Unifying Knowledge Graph Learning and Recommendation: Towards a Better Understanding of User Preferences","date":"2019-02-17","arxiv_id":"1902.06236","repositories_listed":1,"syntology":null},{"url":"/paper/graph-rise-graph-regularized-image-semantic","slug":"graph-rise-graph-regularized-image-semantic","title":"Graph-RISE: Graph-Regularized Image Semantic Embedding","date":"2019-02-14","arxiv_id":"1902.10814","repositories_listed":1,"syntology":null},{"url":"/paper/inferring-networks-from-random-walk-based","slug":"inferring-networks-from-random-walk-based","title":"Inferring Networks From Random Walk-Based Node Similarities","date":"2018-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-laplacian-mixture-model","slug":"graph-laplacian-mixture-model","title":"Graph Laplacian mixture model","date":"2018-10-23","arxiv_id":"1810.10053","repositories_listed":1,"syntology":null},{"url":"/paper/graph-learning-from-filtered-signals-graph","slug":"graph-learning-from-filtered-signals-graph","title":"Graph Learning from Filtered Signals: Graph System and Diffusion Kernel Identification","date":"2018-03-07","arxiv_id":"1803.02553","repositories_listed":1,"syntology":null},{"url":"/paper/learning-networks-from-random-walk-based-node","slug":"learning-networks-from-random-walk-based-node","title":"Learning Networks from Random Walk-Based Node Similarities","date":"2018-01-23","arxiv_id":"1801.07386","repositories_listed":1,"syntology":null},{"url":"/paper/learning-typed-entailment-graphs-with-global","slug":"learning-typed-entailment-graphs-with-global","title":"Learning Typed Entailment Graphs with Global Soft Constraints","date":"2018-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/residual-gated-graph-convnets","slug":"residual-gated-graph-convnets","title":"Residual Gated Graph ConvNets","date":"2017-11-20","arxiv_id":"1711.07553","repositories_listed":1,"syntology":null},{"url":"/paper/graph-learning-under-sparsity-priors","slug":"graph-learning-under-sparsity-priors","title":"Graph learning under sparsity priors","date":"2017-07-18","arxiv_id":"1707.05587","repositories_listed":1,"syntology":null},{"url":"/paper/mixed-graphical-models-for-causal-analysis-of","slug":"mixed-graphical-models-for-causal-analysis-of","title":"Mixed Graphical Models for Causal Analysis of Multi-modal Variables","date":"2017-04-09","arxiv_id":"1704.02621","repositories_listed":1,"syntology":null},{"url":"/paper/cost-optimal-learning-of-causal-graphs","slug":"cost-optimal-learning-of-causal-graphs","title":"Cost-Optimal Learning of Causal Graphs","date":"2017-03-08","arxiv_id":"1703.02645","repositories_listed":1,"syntology":null},{"url":"/paper/how-to-learn-a-graph-from-smooth-signals","slug":"how-to-learn-a-graph-from-smooth-signals","title":"How to learn a graph from smooth signals","date":"2016-01-11","arxiv_id":"1601.02513","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/how-to-learn-a-graph-from-smooth-signals#ran","syntology_url":"https://syntology.ai/paper/1601.02513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1601.02513"}},"official":null}},{"url":null,"slug":"sgcl-unifying-self-supervised-and-supervised","title":"SGCL: Unifying Self-Supervised and Supervised Learning for Graph Recommendation","date":"2025-07-17","arxiv_id":"2507.13336","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-in-graph-learning-framework-for-drug","title":"A Graph-in-Graph Learning Framework for Drug-Target Interaction Prediction","date":"2025-07-15","arxiv_id":"2507.11757","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-learning-with-graph-based","title":"Federated Learning with Graph-Based Aggregation for Traffic Forecasting","date":"2025-07-13","arxiv_id":"2507.09805","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-learning","title":"Graph Learning","date":"2025-07-08","arxiv_id":"2507.05636","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpretable-hierarchical-concept-reasoning","title":"Interpretable Hierarchical Concept Reasoning through Attention-Guided Graph Learning","date":"2025-06-26","arxiv_id":"2506.21102","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-graph-transformer-out-of","title":"Exploring Graph-Transformer Out-of-Distribution Generalization Abilities","date":"2025-06-25","arxiv_id":"2506.20575","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-generation-of-diverse-courses-of","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","date":"2025-06-24","arxiv_id":"2506.20031","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-decision-making-on-networks-with","title":"Automated Decision-Making on Networks with LLMs through Knowledge-Guided Evolution","date":"2025-06-17","arxiv_id":"2506.14529","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-graph-condensation","title":"Dynamic Graph Condensation","date":"2025-06-16","arxiv_id":"2506.13099","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-interest-aware-graph-learning","title":"Collaborative Interest-aware Graph Learning for Group Identification","date":"2025-06-13","arxiv_id":"2506.14826","repositories_listed":0,"syntology":null},{"url":null,"slug":"semanticst-spatially-informed-semantic-graph","title":"SemanticST: Spatially Informed Semantic Graph Learning for Clustering, Integration, and Scalable Analysis of Spatial Transcriptomics","date":"2025-06-13","arxiv_id":"2506.11491","repositories_listed":0,"syntology":null},{"url":null,"slug":"2506-10628","title":"Leveraging Low-rank Factorizations of Conditional Correlation Matrices in Graph Learning","date":"2025-06-12","arxiv_id":"2506.10628","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-mllm-harnessing-multimodal-large","title":"Graph-MLLM: Harnessing Multimodal Large Language Models for Multimodal Graph Learning","date":"2025-06-12","arxiv_id":"2506.10282","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}],"record_sha256":"c5d9b5dc5d8ef72ff7aea59ffb1114a7af38dccfb2e2365dbb41ea3b31de90ae","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}