{"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/4","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":4,"pages_in_order":10,"rows_per_page":100,"rows":[301,400],"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/3","next":"/task/graph-classification/papers/5","papers":[{"url":"/paper/faith-few-shot-graph-classification-with","slug":"faith-few-shot-graph-classification-with","title":"FAITH: Few-Shot Graph Classification with Hierarchical Task Graphs","date":"2022-05-05","arxiv_id":"2205.02435","repositories_listed":1,"syntology":null},{"url":"/paper/spiking-graph-convolutional-networks-1","slug":"spiking-graph-convolutional-networks-1","title":"Spiking Graph Convolutional Networks","date":"2022-05-05","arxiv_id":"2205.02767","repositories_listed":1,"syntology":null},{"url":"/paper/hl-net-heterophily-learning-network-for-scene","slug":"hl-net-heterophily-learning-network-for-scene","title":"HL-Net: Heterophily Learning Network for Scene Graph Generation","date":"2022-05-03","arxiv_id":"2205.01316","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":1,"n_ran_checked":2,"n_instrument":3,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/hl-net-heterophily-learning-network-for-scene#ran","syntology_url":"https://syntology.ai/paper/2205.01316","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.01316"}},"official":{"repos":["siml3/hl-net"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/reinforced-causal-explainer-for-graph-neural","slug":"reinforced-causal-explainer-for-graph-neural","title":"Reinforced Causal Explainer for Graph Neural Networks","date":"2022-04-23","arxiv_id":"2204.11028","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-and-attention-based-cnn","slug":"graph-neural-networks-and-attention-based-cnn","title":"Graph neural networks and attention-based CNN-LSTM for protein classification","date":"2022-04-20","arxiv_id":"2204.09486","repositories_listed":1,"syntology":null},{"url":"/paper/bsal-a-framework-of-bi-component-structure","slug":"bsal-a-framework-of-bi-component-structure","title":"BSAL: A Framework of Bi-component Structure and Attribute Learning for Link Prediction","date":"2022-04-18","arxiv_id":"2204.09508","repositories_listed":1,"syntology":null},{"url":"/paper/graph-pooling-for-graph-neural-networks","slug":"graph-pooling-for-graph-neural-networks","title":"Graph Pooling for Graph Neural Networks: Progress, Challenges, and Opportunities","date":"2022-04-15","arxiv_id":"2204.07321","repositories_listed":1,"syntology":null},{"url":"/paper/semisupervised-cross-scale-graph-prototypical","slug":"semisupervised-cross-scale-graph-prototypical","title":"Semisupervised Cross-scale Graph Prototypical Network for Hyperspectral Image Classification","date":"2022-03-23","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fine-tuning-graph-neural-networks-via-graph","slug":"fine-tuning-graph-neural-networks-via-graph","title":"Fine-Tuning Graph Neural Networks via Graph Topology induced Optimal Transport","date":"2022-03-20","arxiv_id":"2203.10453","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/fine-tuning-graph-neural-networks-via-graph#ran","syntology_url":"https://syntology.ai/paper/2203.10453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10453"}},"official":{"repos":["youjibiying/gtot-tuning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/an-explainability-framework-for-cortical","slug":"an-explainability-framework-for-cortical","title":"An explainability framework for cortical surface-based deep learning","date":"2022-03-15","arxiv_id":"2203.08312","repositories_listed":1,"syntology":null},{"url":"/paper/incorporating-heterophily-into-graph-neural","slug":"incorporating-heterophily-into-graph-neural","title":"Incorporating Heterophily into Graph Neural Networks for Graph Classification","date":"2022-03-15","arxiv_id":"2203.07678","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/incorporating-heterophily-into-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2203.07678","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.07678"}},"official":{"repos":["yeweiysh/ihgnn"],"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/pdns-net-a-large-heterogeneous-graph","slug":"pdns-net-a-large-heterogeneous-graph","title":"PDNS-Net: A Large Heterogeneous Graph Benchmark Dataset of Network Resolutions for Graph Learning","date":"2022-03-15","arxiv_id":"2203.07969","repositories_listed":1,"syntology":null},{"url":"/paper/model-agnostic-augmentation-for-accurate","slug":"model-agnostic-augmentation-for-accurate","title":"Model-Agnostic Augmentation for Accurate Graph Classification","date":"2022-02-21","arxiv_id":"2202.10107","repositories_listed":1,"syntology":null},{"url":"/paper/graph-masked-autoencoder","slug":"graph-masked-autoencoder","title":"Graph Masked Autoencoders with Transformers","date":"2022-02-17","arxiv_id":"2202.08391","repositories_listed":1,"syntology":null},{"url":"/paper/g-mixup-graph-data-augmentation-for-graph","slug":"g-mixup-graph-data-augmentation-for-graph","title":"G-Mixup: Graph Data Augmentation for Graph Classification","date":"2022-02-15","arxiv_id":"2202.07179","repositories_listed":1,"syntology":null},{"url":"/paper/differentially-private-graph-classification","slug":"differentially-private-graph-classification","title":"Differentially Private Graph Classification with GNNs","date":"2022-02-05","arxiv_id":"2202.02575","repositories_listed":1,"syntology":null},{"url":"/paper/discovering-invariant-rationales-for-graph-1","slug":"discovering-invariant-rationales-for-graph-1","title":"Discovering Invariant Rationales for Graph Neural Networks","date":"2022-01-30","arxiv_id":"2201.12872","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/discovering-invariant-rationales-for-graph-1#ran","syntology_url":"https://syntology.ai/paper/2201.12872","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12872"}},"official":{"repos":["wuyxin/dir-gnn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-self-attention-for-learning-graph","slug":"graph-self-attention-for-learning-graph","title":"GRPE: Relative Positional Encoding for Graph Transformer","date":"2022-01-30","arxiv_id":"2201.12787","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graph-self-attention-for-learning-graph#ran","syntology_url":"https://syntology.ai/paper/2201.12787","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12787"}},"official":{"repos":["lenscloth/grpe"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/revisiting-pooling-through-the-lens-of","slug":"revisiting-pooling-through-the-lens-of","title":"Revisiting Global Pooling through the Lens of Optimal Transport","date":"2022-01-23","arxiv_id":"2201.09191","repositories_listed":1,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":13,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/revisiting-pooling-through-the-lens-of#ran","syntology_url":"https://syntology.ai/paper/2201.09191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.09191"}},"official":null}},{"url":"/paper/representing-long-range-context-for-graph-1","slug":"representing-long-range-context-for-graph-1","title":"Representing Long-Range Context for Graph Neural Networks with Global Attention","date":"2022-01-21","arxiv_id":"2201.08821","repositories_listed":1,"syntology":{"n":14,"n_ran":7,"n_constructed":5,"n_ran_checked":6,"n_instrument":1,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 5 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) · 7 unverified","sample_list":"/paper/representing-long-range-context-for-graph-1#ran","syntology_url":"https://syntology.ai/paper/2201.08821","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.08821"}},"official":{"repos":["ucbrise/graphtrans"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/cross-domain-few-shot-graph-classification","slug":"cross-domain-few-shot-graph-classification","title":"Cross-Domain Few-Shot Graph Classification","date":"2022-01-20","arxiv_id":"2201.08265","repositories_listed":1,"syntology":null},{"url":"/paper/kergnns-interpretable-graph-neural-networks","slug":"kergnns-interpretable-graph-neural-networks","title":"KerGNNs: Interpretable Graph Neural Networks with Graph Kernels","date":"2022-01-03","arxiv_id":"2201.00491","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/kergnns-interpretable-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2201.00491","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.00491"}},"official":{"repos":["asfeng/kergnns"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/deconfounded-training-for-graph-neural","slug":"deconfounded-training-for-graph-neural","title":"Causal Attention for Interpretable and Generalizable Graph Classification","date":"2021-12-30","arxiv_id":"2112.15089","repositories_listed":1,"syntology":null},{"url":"/paper/motif-graph-neural-network","slug":"motif-graph-neural-network","title":"Motif Graph Neural Network","date":"2021-12-30","arxiv_id":"2112.14900","repositories_listed":1,"syntology":null},{"url":"/paper/improving-subgraph-recognition-with","slug":"improving-subgraph-recognition-with","title":"Improving Subgraph Recognition with Variational Graph Information Bottleneck","date":"2021-12-18","arxiv_id":"2112.09899","repositories_listed":1,"syntology":null},{"url":"/paper/improving-spectral-graph-convolution-for","slug":"improving-spectral-graph-convolution-for","title":"A New Perspective on the Effects of Spectrum in Graph Neural Networks","date":"2021-12-14","arxiv_id":"2112.07160","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/improving-spectral-graph-convolution-for#ran","syntology_url":"https://syntology.ai/paper/2112.07160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.07160"}},"official":{"repos":["qslim/gnn-spectrum"],"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/autogel-an-automated-graph-neural-network-1","slug":"autogel-an-automated-graph-neural-network-1","title":"AutoGEL: An Automated Graph Neural Network with Explicit Link Information","date":"2021-12-02","arxiv_id":"2112.01064","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-attacks-on-graph-classifiers-via","slug":"adversarial-attacks-on-graph-classifiers-via","title":"Adversarial Attacks on Graph Classifiers via Bayesian Optimisation","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/autohensgnn-winning-solution-to-autograph","slug":"autohensgnn-winning-solution-to-autograph","title":"AutoHEnsGNN: Winning Solution to AutoGraph Challenge for KDD Cup 2020","date":"2021-11-25","arxiv_id":"2111.12952","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-with-parallel","slug":"graph-neural-networks-with-parallel","title":"Graph Neural Networks with Parallel Neighborhood Aggregations for Graph Classification","date":"2021-11-22","arxiv_id":"2111.11482","repositories_listed":1,"syntology":null},{"url":"/paper/dropgnn-random-dropouts-increase-the","slug":"dropgnn-random-dropouts-increase-the","title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","date":"2021-11-11","arxiv_id":"2111.06283","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/dropgnn-random-dropouts-increase-the#ran","syntology_url":"https://syntology.ai/paper/2111.06283","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.06283"}},"official":{"repos":["karolismart/dropgnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-attacks-on-graph-classification","slug":"adversarial-attacks-on-graph-classification","title":"Adversarial Attacks on Graph Classification via Bayesian Optimisation","date":"2021-11-04","arxiv_id":"2111.02842","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/adversarial-attacks-on-graph-classification#ran","syntology_url":"https://syntology.ai/paper/2111.02842","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.02842"}},"official":{"repos":["xingchenwan/grabnel"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/topological-relational-learning-on-graphs","slug":"topological-relational-learning-on-graphs","title":"Topological Relational Learning on Graphs","date":"2021-10-29","arxiv_id":"2110.15529","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":1,"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/topological-relational-learning-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2110.15529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.15529"}},"official":{"repos":["tri-gnn/tri-gnn"],"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/adapting-membership-inference-attacks-to-gnn","slug":"adapting-membership-inference-attacks-to-gnn","title":"Adapting Membership Inference Attacks to GNN for Graph Classification: Approaches and Implications","date":"2021-10-17","arxiv_id":"2110.08760","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/adapting-membership-inference-attacks-to-gnn#ran","syntology_url":"https://syntology.ai/paper/2110.08760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.08760"}},"official":{"repos":["trustworthygnn/mia-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/sogcn-second-order-graph-convolutional-1","slug":"sogcn-second-order-graph-convolutional-1","title":"SoGCN: Second-Order Graph Convolutional Networks","date":"2021-10-14","arxiv_id":"2110.07141","repositories_listed":1,"syntology":null},{"url":"/paper/well-classified-examples-are-underestimated","slug":"well-classified-examples-are-underestimated","title":"Well-classified Examples are Underestimated in Classification with Deep Neural Networks","date":"2021-10-13","arxiv_id":"2110.06537","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-graph-prototypical-networks","slug":"semi-supervised-graph-prototypical-networks","title":"Semi-Supervised Graph Prototypical Networks for Hyperspectral Image Classification","date":"2021-10-12","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fast-attributed-graph-embedding-via-density","slug":"fast-attributed-graph-embedding-via-density","title":"Fast Attributed Graph Embedding via Density of States","date":"2021-10-11","arxiv_id":"2110.05228","repositories_listed":1,"syntology":null},{"url":"/paper/graphon-based-clustering-and-testing-of","slug":"graphon-based-clustering-and-testing-of","title":"Graphon based Clustering and Testing of Networks: Algorithms and Theory","date":"2021-10-06","arxiv_id":"2110.02722","repositories_listed":1,"syntology":null},{"url":"/paper/inference-attacks-against-graph-neural","slug":"inference-attacks-against-graph-neural","title":"Inference Attacks Against Graph Neural Networks","date":"2021-10-06","arxiv_id":"2110.02631","repositories_listed":1,"syntology":null},{"url":"/paper/permute-me-softly-learning-soft-permutations","slug":"permute-me-softly-learning-soft-permutations","title":"Permute Me Softly: Learning Soft Permutations for Graph Representations","date":"2021-10-05","arxiv_id":"2110.01872","repositories_listed":1,"syntology":null},{"url":"/paper/orthogonal-graph-neural-networks","slug":"orthogonal-graph-neural-networks","title":"Orthogonal Graph Neural Networks","date":"2021-09-23","arxiv_id":"2109.11338","repositories_listed":1,"syntology":null},{"url":"/paper/a-meta-learning-approach-for-training","slug":"a-meta-learning-approach-for-training","title":"A Meta-Learning Approach for Training Explainable Graph Neural Networks","date":"2021-09-20","arxiv_id":"2109.09426","repositories_listed":1,"syntology":null},{"url":"/paper/structural-optimization-makes-graph","slug":"structural-optimization-makes-graph","title":"Structural Optimization Makes Graph Classification Simpler and Better","date":"2021-09-05","arxiv_id":"2109.02027","repositories_listed":1,"syntology":null},{"url":"/paper/hyperparameter-free-and-explainable-whole","slug":"hyperparameter-free-and-explainable-whole","title":"Hyperparameter-free and Explainable Whole Graph Embedding","date":"2021-08-04","arxiv_id":"2108.02113","repositories_listed":1,"syntology":null},{"url":"/paper/egc2-enhanced-graph-classification-with-easy","slug":"egc2-enhanced-graph-classification-with-easy","title":"EGC2: Enhanced Graph Classification with Easy Graph Compression","date":"2021-07-16","arxiv_id":"2107.07737","repositories_listed":1,"syntology":null},{"url":"/paper/dppin-a-biological-dataset-of-dynamic-protein","slug":"dppin-a-biological-dataset-of-dynamic-protein","title":"DPPIN: A Biological Repository of Dynamic Protein-Protein Interaction Network Data","date":"2021-07-05","arxiv_id":"2107.02168","repositories_listed":1,"syntology":null},{"url":"/paper/maximum-entropy-weighted-independent-set","slug":"maximum-entropy-weighted-independent-set","title":"Maximum Entropy Weighted Independent Set Pooling for Graph Neural Networks","date":"2021-07-03","arxiv_id":"2107.01410","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 1 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/maximum-entropy-weighted-independent-set#ran","syntology_url":"https://syntology.ai/paper/2107.01410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.01410"}},"official":{"repos":["mewispool/mewispool"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/federated-graph-classification-over-non-iid","slug":"federated-graph-classification-over-non-iid","title":"Federated Graph Classification over Non-IID Graphs","date":"2021-06-25","arxiv_id":"2106.13423","repositories_listed":1,"syntology":null},{"url":"/paper/fea2fea-exploring-structural-feature","slug":"fea2fea-exploring-structural-feature","title":"Fea2Fea: Exploring Structural Feature Correlations via Graph Neural Networks","date":"2021-06-24","arxiv_id":"2106.13061","repositories_listed":1,"syntology":null},{"url":"/paper/an-unifying-point-of-view-on-expressive-power","slug":"an-unifying-point-of-view-on-expressive-power","title":"On the approximation capability of GNNs in node classification/regression tasks","date":"2021-06-16","arxiv_id":"2106.08992","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-modules-in-graph-contrastive","slug":"evaluating-modules-in-graph-contrastive","title":"Evaluating Modules in Graph Contrastive Learning","date":"2021-06-15","arxiv_id":"2106.08171","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/evaluating-modules-in-graph-contrastive#ran","syntology_url":"https://syntology.ai/paper/2106.08171","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.08171"}},"official":{"repos":["thunlp/opengcl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learnable-hypergraph-laplacian-for-hypergraph-1","slug":"learnable-hypergraph-laplacian-for-hypergraph-1","title":"Learnable Hypergraph Laplacian for Hypergraph Learning","date":"2021-06-12","arxiv_id":"2106.06666","repositories_listed":1,"syntology":null},{"url":"/paper/learnable-hypergraph-laplacian-for-hypergraph","slug":"learnable-hypergraph-laplacian-for-hypergraph","title":"Learnable Hypergraph Laplacian for Hypergraph Learning","date":"2021-06-10","arxiv_id":"2106.05701","repositories_listed":1,"syntology":null},{"url":"/paper/relation-order-histograms-as-a-network","slug":"relation-order-histograms-as-a-network","title":"Relation order histograms as a network embedding tool","date":"2021-06-09","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-subtree-pattern-importance-for","slug":"learning-subtree-pattern-importance-for","title":"Learning subtree pattern importance for Weisfeiler-Lehmanbased graph kernels","date":"2021-06-08","arxiv_id":"2106.04739","repositories_listed":1,"syntology":null},{"url":"/paper/convergent-graph-solvers","slug":"convergent-graph-solvers","title":"Convergent Graph Solvers","date":"2021-06-03","arxiv_id":"2106.01680","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/convergent-graph-solvers#ran","syntology_url":"https://syntology.ai/paper/2106.01680","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01680"}},"official":{"repos":["Junyoungpark/CGS"],"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/mixup-for-node-and-graph-classification","slug":"mixup-for-node-and-graph-classification","title":"Mixup for Node and Graph Classification","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-graph-representation-learning-2","slug":"self-supervised-graph-representation-learning-2","title":"Self-Supervised Graph Representation Learning via Topology Transformations","date":"2021-05-25","arxiv_id":"2105.11689","repositories_listed":1,"syntology":null},{"url":"/paper/structure-aware-hierarchical-graph-pooling","slug":"structure-aware-hierarchical-graph-pooling","title":"Structure-Aware Hierarchical Graph Pooling using Information Bottleneck","date":"2021-04-27","arxiv_id":"2104.13012","repositories_listed":1,"syntology":null},{"url":"/paper/permutation-invariant-variational-autoencoder","slug":"permutation-invariant-variational-autoencoder","title":"Permutation-Invariant Variational Autoencoder for Graph-Level Representation Learning","date":"2021-04-20","arxiv_id":"2104.09856","repositories_listed":1,"syntology":null},{"url":"/paper/identity-inference-on-blockchain-using-graph","slug":"identity-inference-on-blockchain-using-graph","title":"Identity Inference on Blockchain using Graph Neural Network","date":"2021-04-14","arxiv_id":"2104.06559","repositories_listed":1,"syntology":null},{"url":"/paper/quadratic-gcn-for-graph-classification","slug":"quadratic-gcn-for-graph-classification","title":"Quadratic GCN for Graph Classification","date":"2021-04-14","arxiv_id":"2104.06750","repositories_listed":1,"syntology":null},{"url":"/paper/smart-vectorizations-for-single-and","slug":"smart-vectorizations-for-single-and","title":"Smart Vectorizations for Single and Multiparameter Persistence","date":"2021-04-10","arxiv_id":"2104.04787","repositories_listed":1,"syntology":null},{"url":"/paper/parameterized-hypercomplex-graph-neural","slug":"parameterized-hypercomplex-graph-neural","title":"Parameterized Hypercomplex Graph Neural Networks for Graph Classification","date":"2021-03-30","arxiv_id":"2103.16584","repositories_listed":1,"syntology":null},{"url":"/paper/catastrophic-forgetting-in-deep-graph","slug":"catastrophic-forgetting-in-deep-graph","title":"Catastrophic Forgetting in Deep Graph Networks: an Introductory Benchmark for Graph Classification","date":"2021-03-22","arxiv_id":"2103.11750","repositories_listed":1,"syntology":null},{"url":"/paper/graphdive-graph-classification-by-mixture-of","slug":"graphdive-graph-classification-by-mixture-of","title":"GraphDIVE: Graph Classification by Mixture of Diverse Experts","date":"2021-03-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-represent-the-evolution-of","slug":"learning-to-represent-the-evolution-of","title":"Learning to Represent the Evolution of Dynamic Graphs with Recurrent Models","date":"2021-03-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/size-invariant-graph-representations-for","slug":"size-invariant-graph-representations-for","title":"Size-Invariant Graph Representations for Graph Classification Extrapolations","date":"2021-03-08","arxiv_id":"2103.05045","repositories_listed":1,"syntology":null},{"url":"/paper/structure-enhanced-meta-learning-for-few-shot","slug":"structure-enhanced-meta-learning-for-few-shot","title":"Structure-Enhanced Meta-Learning For Few-Shot Graph Classification","date":"2021-03-05","arxiv_id":"2103.03547","repositories_listed":1,"syntology":null},{"url":"/paper/graph-autoencoder-for-graph-compression-and","slug":"graph-autoencoder-for-graph-compression-and","title":"Graph Autoencoder for Graph Compression and Representation Learning","date":"2021-03-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/cogdl-an-extensive-toolkit-for-deep-learning","slug":"cogdl-an-extensive-toolkit-for-deep-learning","title":"CogDL: A Comprehensive Library for Graph Deep Learning","date":"2021-03-01","arxiv_id":"2103.00959","repositories_listed":1,"syntology":null},{"url":"/paper/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/dynamic-labeling-for-unlabeled-graph-neural","slug":"dynamic-labeling-for-unlabeled-graph-neural","title":"Generalized Equivariance and Preferential Labeling for GNN Node Classification","date":"2021-02-23","arxiv_id":"2102.11485","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/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/enhance-information-propagation-for-graph","slug":"enhance-information-propagation-for-graph","title":"Enhance Information Propagation for Graph Neural Network by Heterogeneous Aggregations","date":"2021-02-08","arxiv_id":"2102.04064","repositories_listed":1,"syntology":null},{"url":"/paper/re-parameterized-explainer-for-graph-neural","slug":"re-parameterized-explainer-for-graph-neural","title":"[Re] Parameterized Explainer for Graph Neural Network","date":"2021-01-31","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/efficient-graph-deep-learning-in-tensorflow","slug":"efficient-graph-deep-learning-in-tensorflow","title":"Efficient Graph Deep Learning in TensorFlow with tf_geometric","date":"2021-01-27","arxiv_id":"2101.11552","repositories_listed":1,"syntology":null},{"url":"/paper/identity-aware-graph-neural-networks","slug":"identity-aware-graph-neural-networks","title":"Identity-aware Graph Neural Networks","date":"2021-01-25","arxiv_id":"2101.10320","repositories_listed":1,"syntology":null},{"url":"/paper/learning-parametrised-graph-shift-operators-1","slug":"learning-parametrised-graph-shift-operators-1","title":"Learning Parametrised Graph Shift Operators","date":"2021-01-25","arxiv_id":"2101.10050","repositories_listed":1,"syntology":null},{"url":"/paper/sugar-subgraph-neural-network-with","slug":"sugar-subgraph-neural-network-with","title":"SUGAR: Subgraph Neural Network with Reinforcement Pooling and Self-Supervised Mutual Information Mechanism","date":"2021-01-20","arxiv_id":"2101.08170","repositories_listed":1,"syntology":null},{"url":"/paper/graphattacker-a-general-multi-task","slug":"graphattacker-a-general-multi-task","title":"GraphAttacker: A General Multi-Task GraphAttack Framework","date":"2021-01-18","arxiv_id":"2101.06855","repositories_listed":1,"syntology":null},{"url":"/paper/membership-inference-attack-on-graph-neural","slug":"membership-inference-attack-on-graph-neural","title":"Membership Inference Attack on Graph Neural Networks","date":"2021-01-17","arxiv_id":"2101.06570","repositories_listed":1,"syntology":null},{"url":"/paper/label-contrastive-coding-based-graph-neural","slug":"label-contrastive-coding-based-graph-neural","title":"Label Contrastive Coding based Graph Neural Network for Graph Classification","date":"2021-01-14","arxiv_id":"2101.05486","repositories_listed":1,"syntology":null},{"url":"/paper/on-using-classification-datasets-to-evaluate","slug":"on-using-classification-datasets-to-evaluate","title":"On Using Classification Datasets to Evaluate Graph-Level Outlier Detection: Peculiar Observations and New Insights","date":"2020-12-23","arxiv_id":"2012.12931","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-using-classification-datasets-to-evaluate#ran","syntology_url":"https://syntology.ai/paper/2012.12931","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.12931"}},"official":{"repos":["LingxiaoShawn/GLOD-Issues"],"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/an-experimental-study-of-the-transferability","slug":"an-experimental-study-of-the-transferability","title":"An Experimental Study of the Transferability of Spectral Graph Networks","date":"2020-12-18","arxiv_id":"2012.10258","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/an-experimental-study-of-the-transferability#ran","syntology_url":"https://syntology.ai/paper/2012.10258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.10258"}},"official":{"repos":["Axeln78/Transferability-of-spectral-gnns"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/hierarchical-graph-capsule-network","slug":"hierarchical-graph-capsule-network","title":"Hierarchical Graph Capsule Network","date":"2020-12-16","arxiv_id":"2012.08734","repositories_listed":1,"syntology":null},{"url":"/paper/decimated-framelet-system-on-graphs-and-fast","slug":"decimated-framelet-system-on-graphs-and-fast","title":"Decimated Framelet System on Graphs and Fast G-Framelet Transforms","date":"2020-12-12","arxiv_id":"2012.06922","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/decimated-framelet-system-on-graphs-and-fast#ran","syntology_url":"https://syntology.ai/paper/2012.06922","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.06922"}},"official":{"repos":["YuGuangWang/FGT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/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/certified-robustness-of-graph-convolution","slug":"certified-robustness-of-graph-convolution","title":"Certified Robustness of Graph Convolution Networks for Graph Classification under Topological Attacks","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/two-stage-training-of-graph-neural-networks","slug":"two-stage-training-of-graph-neural-networks","title":"Two-stage Training of Graph Neural Networks for Graph Classification","date":"2020-11-10","arxiv_id":"2011.05097","repositories_listed":1,"syntology":null},{"url":"/paper/fewer-is-more-a-deep-graph-metric-learning","slug":"fewer-is-more-a-deep-graph-metric-learning","title":"Fewer is More: A Deep Graph Metric Learning Perspective Using Fewer Proxies","date":"2020-10-26","arxiv_id":"2010.13636","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/fewer-is-more-a-deep-graph-metric-learning#ran","syntology_url":"https://syntology.ai/paper/2010.13636","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13636"}},"official":{"repos":["YuehuaZhu/ProxyGML"],"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/fast-graph-kernel-with-optical-random","slug":"fast-graph-kernel-with-optical-random","title":"Fast Graph Kernel with Optical Random Features","date":"2020-10-16","arxiv_id":"2010.08270","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/fast-graph-kernel-with-optical-random#ran","syntology_url":"https://syntology.ai/paper/2010.08270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.08270"}},"official":{"repos":["hashemghanem/OPU_Graph_Classifier"],"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/factorizable-graph-convolutional-networks","slug":"factorizable-graph-convolutional-networks","title":"Factorizable Graph Convolutional Networks","date":"2020-10-12","arxiv_id":"2010.05421","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/factorizable-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2010.05421","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05421"}},"official":{"repos":["ihollywhy/FactorGCN.PyTorch"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/locality-preserving-dense-graph-convolutional","slug":"locality-preserving-dense-graph-convolutional","title":"Locality Preserving Dense Graph Convolutional Networks with Graph Context-Aware Node Representations","date":"2020-10-12","arxiv_id":"2010.05404","repositories_listed":1,"syntology":null},{"url":"/paper/towards-expressive-graph-representation","slug":"towards-expressive-graph-representation","title":"Towards Expressive Graph Representation","date":"2020-10-12","arxiv_id":"2010.05427","repositories_listed":1,"syntology":null},{"url":"/paper/data-driven-learning-of-geometric-scattering-1","slug":"data-driven-learning-of-geometric-scattering-1","title":"Data-Driven Learning of Geometric Scattering Networks","date":"2020-10-06","arxiv_id":"2010.02415","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/data-driven-learning-of-geometric-scattering-1#ran","syntology_url":"https://syntology.ai/paper/2010.02415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02415"}},"official":null}},{"url":"/paper/learning-graph-normalization-for-graph-neural","slug":"learning-graph-normalization-for-graph-neural","title":"Learning Graph Normalization for Graph Neural Networks","date":"2020-09-24","arxiv_id":"2009.11746","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/learning-graph-normalization-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2009.11746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.11746"}},"official":{"repos":["cyh1112/GraphNormalization"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}}],"record_sha256":"9e93aa2e33c6ecd918e28c99f8ed55d462c70ed50ad2338067ff9364e8dba123","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}