{"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/5","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":5,"pages_in_order":10,"rows_per_page":100,"rows":[401,500],"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/4","next":"/task/graph-classification/papers/6","papers":[{"url":"/paper/graphnorm-a-principled-approach-to","slug":"graphnorm-a-principled-approach-to","title":"GraphNorm: A Principled Approach to Accelerating Graph Neural Network Training","date":"2020-09-07","arxiv_id":"2009.03294","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graphnorm-a-principled-approach-to#ran","syntology_url":"https://syntology.ai/paper/2009.03294","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.03294"}},"official":null}},{"url":"/paper/quaternion-graph-neural-networks","slug":"quaternion-graph-neural-networks","title":"Quaternion Graph Neural Networks","date":"2020-08-12","arxiv_id":"2008.05089","repositories_listed":1,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"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) · 4 unverified","sample_list":"/paper/quaternion-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2008.05089","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.05089"}},"official":{"repos":["daiquocnguyen/QGNN"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/pinet-attention-pooling-for-graph","slug":"pinet-attention-pooling-for-graph","title":"PiNet: Attention Pooling for Graph Classification","date":"2020-08-11","arxiv_id":"2008.04575","repositories_listed":1,"syntology":null},{"url":"/paper/second-order-pooling-for-graph-neural","slug":"second-order-pooling-for-graph-neural","title":"Second-Order Pooling for Graph Neural Networks","date":"2020-07-20","arxiv_id":"2007.10467","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-graph-matching-networks-for-deep-1","slug":"hierarchical-graph-matching-networks-for-deep-1","title":"Multilevel Graph Matching Networks for Deep Graph Similarity Learning","date":"2020-07-08","arxiv_id":"2007.04395","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":3,"phrase":"6 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hierarchical-graph-matching-networks-for-deep-1#ran","syntology_url":"https://syntology.ai/paper/2007.04395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04395"}},"official":{"repos":["kleincup/MGMN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-novel-higher-order-weisfeiler-lehman-graph","slug":"a-novel-higher-order-weisfeiler-lehman-graph","title":"A Novel Higher-order Weisfeiler-Lehman Graph Convolution","date":"2020-07-01","arxiv_id":"2007.00346","repositories_listed":1,"syntology":null},{"url":"/paper/path-integral-based-convolution-and-pooling","slug":"path-integral-based-convolution-and-pooling","title":"Path Integral Based Convolution and Pooling for Graph Neural Networks","date":"2020-06-29","arxiv_id":"2006.16811","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/path-integral-based-convolution-and-pooling#ran","syntology_url":"https://syntology.ai/paper/2006.16811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16811"}},"official":{"repos":["YuGuangWang/PAN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-networks-in-tensorflow-and-keras","slug":"graph-neural-networks-in-tensorflow-and-keras","title":"Graph Neural Networks in TensorFlow and Keras with Spektral","date":"2020-06-22","arxiv_id":"2006.12138","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/graph-neural-networks-in-tensorflow-and-keras#ran","syntology_url":"https://syntology.ai/paper/2006.12138","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12138"}},"official":{"repos":["danielegrattarola/spektral"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/treernn-topology-preserving-deep","slug":"treernn-topology-preserving-deep","title":"TreeRNN: Topology-Preserving Deep GraphEmbedding and Learning","date":"2020-06-21","arxiv_id":"2006.11825","repositories_listed":1,"syntology":null},{"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/little-ball-of-fur-a-python-library-for-graph","slug":"little-ball-of-fur-a-python-library-for-graph","title":"Little Ball of Fur: A Python Library for Graph Sampling","date":"2020-06-08","arxiv_id":"2006.04311","repositories_listed":1,"syntology":null},{"url":"/paper/graph-homomorphism-convolution","slug":"graph-homomorphism-convolution","title":"Graph Homomorphism Convolution","date":"2020-05-03","arxiv_id":"2005.01214","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-homomorphism-convolution#ran","syntology_url":"https://syntology.ai/paper/2005.01214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.01214"}},"official":null}},{"url":"/paper/deepmap-learning-deep-representations-for","slug":"deepmap-learning-deep-representations-for","title":"Learning Deep Graph Representations via Convolutional Neural Networks","date":"2020-04-05","arxiv_id":"2004.02131","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-hierarchical-graph-1","slug":"unsupervised-hierarchical-graph-1","title":"Unsupervised Hierarchical Graph Representation Learning by Mutual Information Maximization","date":"2020-03-18","arxiv_id":"2003.08420","repositories_listed":1,"syntology":null},{"url":"/paper/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/learning-distributed-representations-of-3","slug":"learning-distributed-representations-of-3","title":"Learning distributed representations of graphs with Geo2DR","date":"2020-03-12","arxiv_id":"2003.05926","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"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 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/learning-distributed-representations-of-3#ran","syntology_url":"https://syntology.ai/paper/2003.05926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05926"}},"official":{"repos":["paulmorio/geo2dr"],"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"]}}},{"url":"/paper/convolutional-kernel-networks-for-graph","slug":"convolutional-kernel-networks-for-graph","title":"Convolutional Kernel Networks for Graph-Structured Data","date":"2020-03-11","arxiv_id":"2003.05189","repositories_listed":1,"syntology":null},{"url":"/paper/copt-coordinated-optimal-transport-on-graphs","slug":"copt-coordinated-optimal-transport-on-graphs","title":"COPT: Coordinated Optimal Transport for Graph Sketching","date":"2020-03-09","arxiv_id":"2003.03892","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":4,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 4 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/copt-coordinated-optimal-transport-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2003.03892","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03892"}},"official":{"repos":["twistedcubic/copt"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/few-shot-learning-on-graphs-via-super-classes-1","slug":"few-shot-learning-on-graphs-via-super-classes-1","title":"Few-Shot Learning on Graphs via Super-Classes based on Graph Spectral Measures","date":"2020-02-27","arxiv_id":"2002.12815","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 0 unverified","sample_list":"/paper/few-shot-learning-on-graphs-via-super-classes-1#ran","syntology_url":"https://syntology.ai/paper/2002.12815","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.12815"}},"official":{"repos":["chauhanjatin10/GraphsFewShot"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-graph-mapper-seeing-graphs-through-the","slug":"deep-graph-mapper-seeing-graphs-through-the","title":"Deep Graph Mapper: Seeing Graphs through the Neural Lens","date":"2020-02-10","arxiv_id":"2002.03864","repositories_listed":1,"syntology":null},{"url":"/paper/graph-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/segmented-graph-bert-for-graph-instance","slug":"segmented-graph-bert-for-graph-instance","title":"Segmented Graph-Bert for Graph Instance Modeling","date":"2020-02-09","arxiv_id":"2002.03283","repositories_listed":1,"syntology":null},{"url":"/paper/structure-feature-based-graph-self-adaptive","slug":"structure-feature-based-graph-self-adaptive","title":"Structure-Feature based Graph Self-adaptive Pooling","date":"2020-01-30","arxiv_id":"2002.00848","repositories_listed":1,"syntology":null},{"url":"/paper/gl2vec-graph-embedding-enriched-by-line","slug":"gl2vec-graph-embedding-enriched-by-line","title":"GL2vec: Graph Embedding Enriched by Line Graphs with Edge Features","date":"2020-01-23","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-attack-on-community-detection-by","slug":"adversarial-attack-on-community-detection-by","title":"Adversarial Attack on Community Detection by Hiding Individuals","date":"2020-01-22","arxiv_id":"2001.07933","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-graph-isomorphism-network-for","slug":"understanding-graph-isomorphism-network-for","title":"Understanding Graph Isomorphism Network for rs-fMRI Functional Connectivity Analysis","date":"2020-01-10","arxiv_id":"2001.03690","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-learning-of-graph-hierarchical-1","slug":"unsupervised-learning-of-graph-hierarchical-1","title":"Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport","date":"2019-12-24","arxiv_id":"1912.11176","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/rethinking-the-item-order-in-session-based","slug":"rethinking-the-item-order-in-session-based","title":"Rethinking the Item Order in Session-based Recommendation with Graph Neural Networks","date":"2019-11-27","arxiv_id":"1911.11942","repositories_listed":1,"syntology":null},{"url":"/paper/asap-adaptive-structure-aware-pooling-for","slug":"asap-adaptive-structure-aware-pooling-for","title":"ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph Representations","date":"2019-11-18","arxiv_id":"1911.07979","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-isomorphism-bias-in-graph-data","slug":"understanding-isomorphism-bias-in-graph-data","title":"Understanding Isomorphism Bias in Graph Data Sets","date":"2019-10-26","arxiv_id":"1910.12091","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-representation-learning-in-graph","slug":"hierarchical-representation-learning-in-graph","title":"Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling","date":"2019-10-24","arxiv_id":"1910.11436","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":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hierarchical-representation-learning-in-graph#ran","syntology_url":"https://syntology.ai/paper/1910.11436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.11436"}},"official":{"repos":["danielegrattarola/decimation-pooling"],"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/rethinking-kernel-methods-for-node","slug":"rethinking-kernel-methods-for-node","title":"Rethinking Kernel Methods for Node Representation Learning on Graphs","date":"2019-10-06","arxiv_id":"1910.02548","repositories_listed":1,"syntology":null},{"url":"/paper/evolution-of-graph-classifiers","slug":"evolution-of-graph-classifiers","title":"Evolution of Graph Classifiers","date":"2019-10-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/attpool-towards-hierarchical-feature","slug":"attpool-towards-hierarchical-feature","title":"AttPool: Towards Hierarchical Feature Representation in Graph Convolutional Networks via Attention Mechanism","date":"2019-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-universal-self-attention-network","slug":"unsupervised-universal-self-attention-network","title":"Universal Graph Transformer Self-Attention Networks","date":"2019-09-26","arxiv_id":"1909.11855","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unsupervised-universal-self-attention-network#ran","syntology_url":"https://syntology.ai/paper/1909.11855","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11855"}},"official":{"repos":["daiquocnguyen/Graph-Transformer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/haarpooling-graph-pooling-with-compressive","slug":"haarpooling-graph-pooling-with-compressive","title":"Haar Graph Pooling","date":"2019-09-25","arxiv_id":"1909.11580","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/invariant-embedding-for-graph-classification","slug":"invariant-embedding-for-graph-classification","title":"Invariant embedding for graph classification","date":"2019-08-18","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/k-hop-graph-neural-networks","slug":"k-hop-graph-neural-networks","title":"k-hop Graph Neural Networks","date":"2019-07-13","arxiv_id":"1907.06051","repositories_listed":1,"syntology":null},{"url":"/paper/graph-representation-learning-via-hard-and","slug":"graph-representation-learning-via-hard-and","title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","date":"2019-07-05","arxiv_id":"1907.04652","repositories_listed":1,"syntology":null},{"url":"/paper/improving-attention-mechanism-in-graph-neural","slug":"improving-attention-mechanism-in-graph-neural","title":"Improving Attention Mechanism in Graph Neural Networks via Cardinality Preservation","date":"2019-07-04","arxiv_id":"1907.02204","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-attention-mechanism-in-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1907.02204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.02204"}},"official":{"repos":["zetayue/CPA"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-star-net-for-generalized-multi-task-1","slug":"graph-star-net-for-generalized-multi-task-1","title":"Graph Star Net for Generalized Multi-Task Learning","date":"2019-06-21","arxiv_id":"1906.12330","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/graph-star-net-for-generalized-multi-task-1#ran","syntology_url":"https://syntology.ai/paper/1906.12330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12330"}},"official":null}},{"url":"/paper/a-persistent-weisfeilerlehman-procedure-for","slug":"a-persistent-weisfeilerlehman-procedure-for","title":"A Persistent Weisfeiler–Lehman Procedure for Graph Classification","date":"2019-06-09","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/demo-net-degree-specific-graph-neural","slug":"demo-net-degree-specific-graph-neural","title":"DEMO-Net: Degree-specific Graph Neural Networks for Node and Graph Classification","date":"2019-06-05","arxiv_id":"1906.02319","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-tangent-kernel-fusing-graph","slug":"graph-neural-tangent-kernel-fusing-graph","title":"Graph Neural Tangent Kernel: Fusing Graph Neural Networks with Graph Kernels","date":"2019-05-30","arxiv_id":"1905.13192","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/graph-neural-tangent-kernel-fusing-graph#ran","syntology_url":"https://syntology.ai/paper/1905.13192","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13192"}},"official":{"repos":["KangchengHou/gntk"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-filtration-learning","slug":"graph-filtration-learning","title":"Graph Filtration Learning","date":"2019-05-27","arxiv_id":"1905.10996","repositories_listed":1,"syntology":null},{"url":"/paper/ipc-a-benchmark-data-set-for-learning-with","slug":"ipc-a-benchmark-data-set-for-learning-with","title":"IPC: A Benchmark Data Set for Learning with Graph-Structured Data","date":"2019-05-15","arxiv_id":"1905.06393","repositories_listed":1,"syntology":null},{"url":"/paper/dissecting-graph-neural-networks-on-graph","slug":"dissecting-graph-neural-networks-on-graph","title":"Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification","date":"2019-05-11","arxiv_id":"1905.04579","repositories_listed":1,"syntology":null},{"url":"/paper/pinet-a-permutation-invariant-graph-neural","slug":"pinet-a-permutation-invariant-graph-neural","title":"PiNet: A Permutation Invariant Graph Neural Network for Graph Classification","date":"2019-05-08","arxiv_id":"1905.03046","repositories_listed":1,"syntology":null},{"url":"/paper/capsule-graph-neural-network","slug":"capsule-graph-neural-network","title":"Capsule Graph Neural Network","date":"2019-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolutional-networks-with","slug":"graph-convolutional-networks-with","title":"Graph Convolutional Networks with EigenPooling","date":"2019-04-30","arxiv_id":"1904.13107","repositories_listed":1,"syntology":null},{"url":"/paper/ddgk-learning-graph-representations-for-deep","slug":"ddgk-learning-graph-representations-for-deep","title":"DDGK: Learning Graph Representations for Deep Divergence Graph Kernels","date":"2019-04-21","arxiv_id":"1904.09671","repositories_listed":1,"syntology":null},{"url":"/paper/190409378","slug":"190409378","title":"PersLay: A Neural Network Layer for Persistence Diagrams and New Graph Topological Signatures","date":"2019-04-20","arxiv_id":"1904.09378","repositories_listed":1,"syntology":null},{"url":"/paper/edgnn-a-simple-and-powerful-gnn-for-directed","slug":"edgnn-a-simple-and-powerful-gnn-for-directed","title":"edGNN: a Simple and Powerful GNN for Directed Labeled Graphs","date":"2019-04-18","arxiv_id":"1904.08745","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/can-gcns-go-as-deep-as-cnns","slug":"can-gcns-go-as-deep-as-cnns","title":"DeepGCNs: Can GCNs Go as Deep as CNNs?","date":"2019-04-07","arxiv_id":"1904.03751","repositories_listed":1,"syntology":null},{"url":"/paper/dagcn-dual-attention-graph-convolutional","slug":"dagcn-dual-attention-graph-convolutional","title":"DAGCN: Dual Attention Graph Convolutional Networks","date":"2019-04-04","arxiv_id":"1904.02278","repositories_listed":1,"syntology":null},{"url":"/paper/rep-the-set-neural-networks-for-learning-set","slug":"rep-the-set-neural-networks-for-learning-set","title":"Rep the Set: Neural Networks for Learning Set Representations","date":"2019-04-03","arxiv_id":"1904.01962","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/unsupervised-inductive-whole-graph-embedding","slug":"unsupervised-inductive-whole-graph-embedding","title":"Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity","date":"2019-04-01","arxiv_id":"1904.01098","repositories_listed":1,"syntology":null},{"url":"/paper/clique-pooling-for-graph-classification","slug":"clique-pooling-for-graph-classification","title":"Clique pooling for graph classification","date":"2019-03-31","arxiv_id":"1904.00374","repositories_listed":1,"syntology":null},{"url":"/paper/relational-pooling-for-graph-representations","slug":"relational-pooling-for-graph-representations","title":"Relational Pooling for Graph Representations","date":"2019-03-06","arxiv_id":"1903.02541","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/relational-pooling-for-graph-representations#ran","syntology_url":"https://syntology.ai/paper/1903.02541","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.02541"}},"official":{"repos":["PurdueMINDS/RelationalPooling"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-classification-with-recurrent","slug":"graph-classification-with-recurrent","title":"Variational Recurrent Neural Networks for Graph Classification","date":"2019-02-07","arxiv_id":"1902.02721","repositories_listed":1,"syntology":null},{"url":"/paper/propagation-kernels-efficient-graph-kernels","slug":"propagation-kernels-efficient-graph-kernels","title":"Propagation kernels: efficient graph kernels from propagated information","date":"2019-02-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-with-convolutional-arma","slug":"graph-neural-networks-with-convolutional-arma","title":"Graph Neural Networks with convolutional ARMA filters","date":"2019-01-05","arxiv_id":"1901.01343","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-graph-convolutional-neural-networks","slug":"bayesian-graph-convolutional-neural-networks","title":"Bayesian graph convolutional neural networks for semi-supervised classification","date":"2018-11-27","arxiv_id":"1811.11103","repositories_listed":1,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":3,"n_honours":3,"n_violates":3,"n_no_contract":6,"n_pointer_only":16,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 3 honoured, 3 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/bayesian-graph-convolutional-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1811.11103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.11103"}},"official":null}},{"url":"/paper/spectral-multigraph-networks-for-discovering","slug":"spectral-multigraph-networks-for-discovering","title":"Spectral Multigraph Networks for Discovering and Fusing Relationships in Molecules","date":"2018-11-23","arxiv_id":"1811.09595","repositories_listed":1,"syntology":null},{"url":"/paper/towards-sparse-hierarchical-graph-classifiers","slug":"towards-sparse-hierarchical-graph-classifiers","title":"Towards Sparse Hierarchical Graph Classifiers","date":"2018-11-03","arxiv_id":"1811.01287","repositories_listed":1,"syntology":null},{"url":"/paper/data-driven-analysis-of-complex-networks-and","slug":"data-driven-analysis-of-complex-networks-and","title":"Network Classification Based Structural Analysis of Real Networks and their Model-Generated Counterparts","date":"2018-10-19","arxiv_id":"1810.08498","repositories_listed":1,"syntology":null},{"url":"/paper/weisfeiler-and-leman-go-neural-higher-order","slug":"weisfeiler-and-leman-go-neural-higher-order","title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","date":"2018-10-04","arxiv_id":"1810.02244","repositories_listed":1,"syntology":null},{"url":"/paper/convolutional-neural-networks-for-fast","slug":"convolutional-neural-networks-for-fast","title":"Learning-based Efficient Graph Similarity Computation via Multi-Scale Convolutional Set Matching","date":"2018-09-10","arxiv_id":"1809.04440","repositories_listed":1,"syntology":null},{"url":"/paper/attention-models-in-graphs-a-survey","slug":"attention-models-in-graphs-a-survey","title":"Attention Models in Graphs: A Survey","date":"2018-07-20","arxiv_id":"1807.07984","repositories_listed":1,"syntology":null},{"url":"/paper/graph-classification-using-structural","slug":"graph-classification-using-structural","title":"Graph Classification using Structural Attention","date":"2018-07-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/grakel-a-graph-kernel-library-in-python","slug":"grakel-a-graph-kernel-library-in-python","title":"GraKeL: A Graph Kernel Library in Python","date":"2018-06-06","arxiv_id":"1806.02193","repositories_listed":1,"syntology":null},{"url":"/paper/graph-capsule-convolutional-neural-networks","slug":"graph-capsule-convolutional-neural-networks","title":"Graph Capsule Convolutional Neural Networks","date":"2018-05-21","arxiv_id":"1805.08090","repositories_listed":1,"syntology":null},{"url":"/paper/learning-graph-level-representations-with","slug":"learning-graph-level-representations-with","title":"Learning Graph-Level Representations with Recurrent Neural Networks","date":"2018-05-20","arxiv_id":"1805.07683","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/kernel-graph-convolutional-neural-networks","slug":"kernel-graph-convolutional-neural-networks","title":"Kernel Graph Convolutional Neural Networks","date":"2017-10-29","arxiv_id":"1710.10689","repositories_listed":1,"syntology":null},{"url":"/paper/learning-universal-adversarial-perturbations","slug":"learning-universal-adversarial-perturbations","title":"Learning Universal Adversarial Perturbations with Generative Models","date":"2017-08-17","arxiv_id":"1708.05207","repositories_listed":1,"syntology":null},{"url":"/paper/kernel-method-for-persistence-diagrams-via","slug":"kernel-method-for-persistence-diagrams-via","title":"Kernel method for persistence diagrams via kernel embedding and weight factor","date":"2017-06-12","arxiv_id":"1706.03472","repositories_listed":1,"syntology":null},{"url":"/paper/global-weisfeiler-lehman-graph-kernels","slug":"global-weisfeiler-lehman-graph-kernels","title":"Global Weisfeiler-Lehman Graph Kernels","date":"2017-03-07","arxiv_id":"1703.02379","repositories_listed":1,"syntology":null},{"url":"/paper/network-classification-with-applications-to","slug":"network-classification-with-applications-to","title":"Network classification with applications to brain connectomics","date":"2017-01-27","arxiv_id":"1701.08140","repositories_listed":1,"syntology":null},{"url":null,"slug":"weisfeiler-and-leman-follow-the-arrow-of-time","title":"Weisfeiler and Leman Follow the Arrow of Time: Expressive Power of Message Passing in Temporal Event Graphs","date":"2025-05-30","arxiv_id":"2505.24438","repositories_listed":0,"syntology":null},{"url":null,"slug":"schreier-coset-graph-propagation","title":"Schreier-Coset Graph Propagation","date":"2025-05-15","arxiv_id":"2505.10392","repositories_listed":0,"syntology":null},{"url":null,"slug":"rhomboid-tiling-for-geometric-graph-deep","title":"Rhomboid Tiling for Geometric Graph Deep Learning","date":"2025-05-14","arxiv_id":"2505.09586","repositories_listed":0,"syntology":null},{"url":null,"slug":"dpq-hd-post-training-compression-for-ultra","title":"DPQ-HD: Post-Training Compression for Ultra-Low Power Hyperdimensional Computing","date":"2025-05-08","arxiv_id":"2505.05413","repositories_listed":0,"syntology":null},{"url":null,"slug":"graffe-graph-representation-learning-via","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","date":"2025-05-08","arxiv_id":"2505.04956","repositories_listed":0,"syntology":null},{"url":null,"slug":"lgrpool-hierarchical-graph-pooling-via-local","title":"LGRPool: Hierarchical Graph Pooling Via Local-Global Regularisation","date":"2025-04-11","arxiv_id":"2504.08530","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-level-label-only-membership-inference","title":"Graph-Level Label-Only Membership Inference Attack against Graph Neural Networks","date":"2025-03-24","arxiv_id":"2503.19070","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-semantic-and-clean-label-backdoor-attack","title":"A Semantic and Clean-label Backdoor Attack against Graph Convolutional Networks","date":"2025-03-19","arxiv_id":"2503.14922","repositories_listed":0,"syntology":null},{"url":null,"slug":"performance-heterogeneity-in-graph-neural","title":"Performance Heterogeneity in Graph Neural Networks: Lessons for Architecture Design and Preprocessing","date":"2025-03-01","arxiv_id":"2503.00547","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-backbones-sparsifying-graphs-through","title":"Learning Backbones: Sparsifying Graphs through Zero Forcing for Effective Graph-Based Learning","date":"2025-02-24","arxiv_id":"2502.17713","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-euclidean-hierarchical-representational","title":"Non-Euclidean Hierarchical Representational Learning using Hyperbolic Graph Neural Networks for Environmental Claim Detection","date":"2025-02-19","arxiv_id":"2502.13628","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-gnn-based-spectral-filtering-mechanism-for","title":"Graph Neural Network-based Spectral Filtering Mechanism for Imbalance Classification in Network Digital Twin","date":"2025-02-17","arxiv_id":"2502.11505","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-domain-adaptation-and-graph-neural","title":"Bridging Domain Adaptation and Graph Neural Networks: A Tensor-Based Framework for Effective Label Propagation","date":"2025-02-12","arxiv_id":"2502.08505","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-at-a-fraction","title":"Graph Neural Networks at a Fraction","date":"2025-02-10","arxiv_id":"2502.06136","repositories_listed":0,"syntology":null},{"url":null,"slug":"weakly-supervised-learning-on-large-graphs","title":"Weakly Supervised Learning on Large Graphs","date":"2025-01-02","arxiv_id":"2501.02021","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-graph-neural-networks-on-graph","title":"Revisiting Graph Neural Networks on Graph-level Tasks: Comprehensive Experiments, Analysis, and Improvements","date":"2025-01-01","arxiv_id":"2501.00773","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-size-imbalanced-learning-with-energy","title":"Graph Size-imbalanced Learning with Energy-guided Structural Smoothing","date":"2024-12-23","arxiv_id":"2412.17591","repositories_listed":0,"syntology":null}],"record_sha256":"e5e316a4a91348a722543ea78b9ddec8c5608d00891288adada8fe5c89cd5e4d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}