{"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/node-classification/papers/2","list_of":"/task/node-classification","task":"Node 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":2,"pages_in_order":19,"rows_per_page":100,"rows":[101,200],"of":1860,"counts":{"archive_papers_tagged":1860,"with_a_code_link":991,"where_syntology_ran_a_sample":305,"not_listed_spam_title":0,"listed":1860,"listed_where_code_ran":305,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":256,"every_run_a_failure_of_syntologys_instrument":49,"listed_with_a_run_with_no_instrument_failure":256,"listed_every_run_a_failure_of_syntologys_instrument":49,"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/node-classification","prev":"/task/node-classification","next":"/task/node-classification/papers/3","papers":[{"url":"/paper/unifying-label-inputted-graph-neural-networks","slug":"unifying-label-inputted-graph-neural-networks","title":"Unifying Label-inputted Graph Neural Networks with Deep Equilibrium Models","date":"2022-11-19","arxiv_id":"2211.10629","repositories_listed":2,"syntology":null},{"url":"/paper/a-comprehensive-study-on-large-scale-graph","slug":"a-comprehensive-study-on-large-scale-graph","title":"A Comprehensive Study on Large-Scale Graph Training: Benchmarking and Rethinking","date":"2022-10-14","arxiv_id":"2210.07494","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 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) · 2 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/a-comprehensive-study-on-large-scale-graph#ran","syntology_url":"https://syntology.ai/paper/2210.07494","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07494"}},"official":{"repos":["vita-group/large_scale_gcn_benchmarking"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/mlpinit-embarrassingly-simple-gnn-training","slug":"mlpinit-embarrassingly-simple-gnn-training","title":"MLPInit: Embarrassingly Simple GNN Training Acceleration with MLP Initialization","date":"2022-09-30","arxiv_id":"2210.00102","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mlpinit-embarrassingly-simple-gnn-training#ran","syntology_url":"https://syntology.ai/paper/2210.00102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00102"}},"official":{"repos":["snap-research/MLPInit-for-GNNs"],"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/learning-long-term-spatial-temporal-graphs","slug":"learning-long-term-spatial-temporal-graphs","title":"Learning Long-Term Spatial-Temporal Graphs for Active Speaker Detection","date":"2022-07-15","arxiv_id":"2207.07783","repositories_listed":2,"syntology":null},{"url":"/paper/graph-neural-networks-as-gradient-flows","slug":"graph-neural-networks-as-gradient-flows","title":"Understanding convolution on graphs via energies","date":"2022-06-22","arxiv_id":"2206.10991","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"6 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graph-neural-networks-as-gradient-flows#ran","syntology_url":"https://syntology.ai/paper/2206.10991","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.10991"}},"official":{"repos":["jrowbottomgit/graff"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/long-range-graph-benchmark","slug":"long-range-graph-benchmark","title":"Long Range Graph Benchmark","date":"2022-06-16","arxiv_id":"2206.08164","repositories_listed":2,"syntology":null},{"url":"/paper/diffwire-inductive-graph-rewiring-via-the","slug":"diffwire-inductive-graph-rewiring-via-the","title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","date":"2022-06-15","arxiv_id":"2206.07369","repositories_listed":2,"syntology":null},{"url":"/paper/maskgae-masked-graph-modeling-meets-graph","slug":"maskgae-masked-graph-modeling-meets-graph","title":"What's Behind the Mask: Understanding Masked Graph Modeling for Graph Autoencoders","date":"2022-05-20","arxiv_id":"2205.10053","repositories_listed":2,"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/maskgae-masked-graph-modeling-meets-graph#ran","syntology_url":"https://syntology.ai/paper/2205.10053","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10053"}},"official":{"repos":["edisonleeeee/maskgae","pyg-team/pytorch_geometric"],"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/celltypegraph-a-new-geometric-computer-vision","slug":"celltypegraph-a-new-geometric-computer-vision","title":"CellTypeGraph: A New Geometric Computer Vision Benchmark","date":"2022-05-17","arxiv_id":"2205.08166","repositories_listed":2,"syntology":null},{"url":"/paper/a-survey-on-fairness-for-machine-learning-on","slug":"a-survey-on-fairness-for-machine-learning-on","title":"A Survey on Fairness for Machine Learning on Graphs","date":"2022-05-11","arxiv_id":"2205.05396","repositories_listed":2,"syntology":null},{"url":"/paper/grafn-semi-supervised-node-classification-on","slug":"grafn-semi-supervised-node-classification-on","title":"GraFN: Semi-Supervised Node Classification on Graph with Few Labels via Non-Parametric Distribution Assignment","date":"2022-04-04","arxiv_id":"2204.01303","repositories_listed":2,"syntology":null},{"url":"/paper/tgl-a-general-framework-for-temporal-gnn","slug":"tgl-a-general-framework-for-temporal-gnn","title":"TGL: A General Framework for Temporal GNN Training on Billion-Scale Graphs","date":"2022-03-28","arxiv_id":"2203.14883","repositories_listed":2,"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":5,"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/tgl-a-general-framework-for-temporal-gnn#ran","syntology_url":"https://syntology.ai/paper/2203.14883","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.14883"}},"official":{"repos":["amazon-research/tgl"],"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":["listed","official"]}}},{"url":"/paper/node-representation-learning-in-graph-via","slug":"node-representation-learning-in-graph-via","title":"Node Representation Learning in Graph via Node-to-Neighbourhood Mutual Information Maximization","date":"2022-03-23","arxiv_id":"2203.12265","repositories_listed":2,"syntology":null},{"url":"/paper/bns-gcn-efficient-full-graph-training-of","slug":"bns-gcn-efficient-full-graph-training-of","title":"BNS-GCN: Efficient Full-Graph Training of Graph Convolutional Networks with Partition-Parallelism and Random Boundary Node Sampling","date":"2022-03-21","arxiv_id":"2203.10983","repositories_listed":2,"syntology":null},{"url":"/paper/on-recoverability-of-graph-neural-network","slug":"on-recoverability-of-graph-neural-network","title":"Graph Representation Learning via Aggregation Enhancement","date":"2022-01-30","arxiv_id":"2201.12843","repositories_listed":2,"syntology":null},{"url":"/paper/fedgcn-convergence-and-communication","slug":"fedgcn-convergence-and-communication","title":"FedGCN: Convergence-Communication Tradeoffs in Federated Training of Graph Convolutional Networks","date":"2022-01-28","arxiv_id":"2201.12433","repositories_listed":2,"syntology":{"n":19,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 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; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/fedgcn-convergence-and-communication#ran","syntology_url":"https://syntology.ai/paper/2201.12433","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12433"}},"official":{"repos":["yh-yao/FedGCN"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/imbalanced-graph-classification-via-graph-of","slug":"imbalanced-graph-classification-via-graph-of","title":"Imbalanced Graph Classification via Graph-of-Graph Neural Networks","date":"2021-12-01","arxiv_id":"2112.00238","repositories_listed":2,"syntology":null},{"url":"/paper/p-laplacian-based-graph-neural-networks-1","slug":"p-laplacian-based-graph-neural-networks-1","title":"$p$-Laplacian Based Graph Neural Networks","date":"2021-11-14","arxiv_id":"2111.07337","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/p-laplacian-based-graph-neural-networks-1#ran","syntology_url":"https://syntology.ai/paper/2111.07337","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.07337"}},"official":{"repos":["guoji-fu/pgnns"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/cold-brew-distilling-graph-node-1","slug":"cold-brew-distilling-graph-node-1","title":"Cold Brew: Distilling Graph Node Representations with Incomplete or Missing Neighborhoods","date":"2021-11-08","arxiv_id":"2111.04840","repositories_listed":2,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/cold-brew-distilling-graph-node-1#ran","syntology_url":"https://syntology.ai/paper/2111.04840","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.04840"}},"official":{"repos":["amazon-research/gnn-tail-generalization"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-posterior-network-bayesian-predictive","slug":"graph-posterior-network-bayesian-predictive","title":"Graph Posterior Network: Bayesian Predictive Uncertainty for Node Classification","date":"2021-10-26","arxiv_id":"2110.14012","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-posterior-network-bayesian-predictive#ran","syntology_url":"https://syntology.ai/paper/2110.14012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14012"}},"official":{"repos":["stadlmax/Graph-Posterior-Network"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/grape-fast-and-scalable-graph-processing-and","slug":"grape-fast-and-scalable-graph-processing-and","title":"GRAPE for Fast and Scalable Graph Processing and random walk-based Embedding","date":"2021-10-12","arxiv_id":"2110.06196","repositories_listed":2,"syntology":null},{"url":"/paper/local2global-scaling-global-representation","slug":"local2global-scaling-global-representation","title":"Local2Global: Scaling global representation learning on graphs via local training","date":"2021-07-26","arxiv_id":"2107.12224","repositories_listed":2,"syntology":null},{"url":"/paper/asymptotics-of-network-embeddings-learned-via","slug":"asymptotics-of-network-embeddings-learned-via","title":"Asymptotics of Network Embeddings Learned via Subsampling","date":"2021-07-06","arxiv_id":"2107.02363","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/asymptotics-of-network-embeddings-learned-via#ran","syntology_url":"https://syntology.ai/paper/2107.02363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.02363"}},"official":{"repos":["aday651/embed-asym-exeriments","aday651/embed-asym-experiments"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/on-positional-and-structural-node-features","slug":"on-positional-and-structural-node-features","title":"On Positional and Structural Node Features for Graph Neural Networks on Non-attributed Graphs","date":"2021-07-03","arxiv_id":"2107.01495","repositories_listed":2,"syntology":null},{"url":"/paper/graph-attention-networks-with-lstm-based-path","slug":"graph-attention-networks-with-lstm-based-path","title":"Customizing Graph Neural Networks using Path Reweighting","date":"2021-06-21","arxiv_id":"2106.10866","repositories_listed":2,"syntology":null},{"url":"/paper/distilling-self-knowledge-from-contrastive","slug":"distilling-self-knowledge-from-contrastive","title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","date":"2021-06-16","arxiv_id":"2106.08541","repositories_listed":2,"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/distilling-self-knowledge-from-contrastive#ran","syntology_url":"https://syntology.ai/paper/2106.08541","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.08541"}},"official":{"repos":["cf020031308/LinkDist"],"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/symmetric-spaces-for-graph-embeddings-a","slug":"symmetric-spaces-for-graph-embeddings-a","title":"Symmetric Spaces for Graph Embeddings: A Finsler-Riemannian Approach","date":"2021-06-09","arxiv_id":"2106.04941","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":3,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":8,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/symmetric-spaces-for-graph-embeddings-a#ran","syntology_url":"https://syntology.ai/paper/2106.04941","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04941"}},"official":{"repos":["fedelopez77/sympa"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/gipa-general-information-propagation","slug":"gipa-general-information-propagation","title":"GIPA: General Information Propagation Algorithm for Graph Learning","date":"2021-05-13","arxiv_id":"2105.06035","repositories_listed":2,"syntology":null},{"url":"/paper/wgcn-graph-convolutional-networks-with","slug":"wgcn-graph-convolutional-networks-with","title":"WGCN: Graph Convolutional Networks with Weighted Structural Features","date":"2021-04-29","arxiv_id":"2104.14060","repositories_listed":2,"syntology":null},{"url":"/paper/bag-of-tricks-of-semi-supervised","slug":"bag-of-tricks-of-semi-supervised","title":"Bag of Tricks for Node Classification with Graph Neural Networks","date":"2021-03-24","arxiv_id":"2103.13355","repositories_listed":2,"syntology":null},{"url":"/paper/graphsmote-imbalanced-node-classification-on","slug":"graphsmote-imbalanced-node-classification-on","title":"GraphSMOTE: Imbalanced Node Classification on Graphs with Graph Neural Networks","date":"2021-03-16","arxiv_id":"2103.08826","repositories_listed":2,"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":2,"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/graphsmote-imbalanced-node-classification-on#ran","syntology_url":"https://syntology.ai/paper/2103.08826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.08826"}},"official":{"repos":["TianxiangZhao/GraphSmote"],"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/learning-whole-slide-segmentation-from","slug":"learning-whole-slide-segmentation-from","title":"Learning Whole-Slide Segmentation from Inexact and Incomplete Labels using Tissue Graphs","date":"2021-03-04","arxiv_id":"2103.03129","repositories_listed":2,"syntology":null},{"url":"/paper/evaluating-node-embeddings-of-complex","slug":"evaluating-node-embeddings-of-complex","title":"Evaluating Node Embeddings of Complex Networks","date":"2021-02-16","arxiv_id":"2102.08275","repositories_listed":2,"syntology":null},{"url":"/paper/a-unified-lottery-ticket-hypothesis-for-graph","slug":"a-unified-lottery-ticket-hypothesis-for-graph","title":"A Unified Lottery Ticket Hypothesis for Graph Neural Networks","date":"2021-02-12","arxiv_id":"2102.06790","repositories_listed":2,"syntology":null},{"url":"/paper/cleora-a-simple-strong-and-scalable-graph","slug":"cleora-a-simple-strong-and-scalable-graph","title":"Cleora: A Simple, Strong and Scalable Graph Embedding Scheme","date":"2021-02-03","arxiv_id":"2102.02302","repositories_listed":2,"syntology":null},{"url":"/paper/generating-a-doppelganger-graph-resembling","slug":"generating-a-doppelganger-graph-resembling","title":"Generating a Doppelganger Graph: Resembling but Distinct","date":"2021-01-23","arxiv_id":"2101.09593","repositories_listed":2,"syntology":null},{"url":"/paper/twitch-gamers-a-dataset-for-evaluating","slug":"twitch-gamers-a-dataset-for-evaluating","title":"Twitch Gamers: a Dataset for Evaluating Proximity Preserving and Structural Role-based Node Embeddings","date":"2021-01-08","arxiv_id":"2101.03091","repositories_listed":2,"syntology":null},{"url":"/paper/simple-spectral-graph-convolution","slug":"simple-spectral-graph-convolution","title":"Simple Spectral Graph Convolution","date":"2021-01-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/revisiting-graph-neural-networks-for-link-1","slug":"revisiting-graph-neural-networks-for-link-1","title":"Labeling Trick: A Theory of Using Graph Neural Networks for Multi-Node Representation Learning","date":"2020-10-30","arxiv_id":"2010.16103","repositories_listed":2,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/revisiting-graph-neural-networks-for-link-1#ran","syntology_url":"https://syntology.ai/paper/2010.16103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.16103"}},"official":{"repos":["facebookresearch/SEAL_OGB"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/line-graph-neural-networks-for-link","slug":"line-graph-neural-networks-for-link","title":"Line Graph Neural Networks for Link Prediction","date":"2020-10-20","arxiv_id":"2010.10046","repositories_listed":2,"syntology":null},{"url":"/paper/inductive-entity-representations-from-text","slug":"inductive-entity-representations-from-text","title":"Inductive Entity Representations from Text via Link Prediction","date":"2020-10-07","arxiv_id":"2010.03496","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/inductive-entity-representations-from-text#ran","syntology_url":"https://syntology.ai/paper/2010.03496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03496"}},"official":{"repos":["dfdazac/blp"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/directional-graph-networks-1","slug":"directional-graph-networks-1","title":"Directional Graph Networks","date":"2020-10-06","arxiv_id":"2010.02863","repositories_listed":2,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":1,"n_honours":3,"n_violates":1,"n_no_contract":7,"n_pointer_only":5,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 3 honoured, 1 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/directional-graph-networks-1#ran","syntology_url":"https://syntology.ai/paper/2010.02863","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02863"}},"official":{"repos":["Saro00/DGN"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/graph-infoclust-leveraging-cluster-level-node","slug":"graph-infoclust-leveraging-cluster-level-node","title":"Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learning","date":"2020-09-15","arxiv_id":"2009.06946","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/graph-infoclust-leveraging-cluster-level-node#ran","syntology_url":"https://syntology.ai/paper/2009.06946","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.06946"}},"official":null}},{"url":"/paper/gtea-representation-learning-for-temporal","slug":"gtea-representation-learning-for-temporal","title":"GTEA: Inductive Representation Learning on Temporal Interaction Graphs via Temporal Edge Aggregation","date":"2020-09-11","arxiv_id":"2009.05266","repositories_listed":2,"syntology":null},{"url":"/paper/fairgnn-eliminating-the-discrimination-in","slug":"fairgnn-eliminating-the-discrimination-in","title":"Say No to the Discrimination: Learning Fair Graph Neural Networks with Limited Sensitive Attribute Information","date":"2020-09-03","arxiv_id":"2009.01454","repositories_listed":2,"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":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/fairgnn-eliminating-the-discrimination-in#ran","syntology_url":"https://syntology.ai/paper/2009.01454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.01454"}},"official":{"repos":["EnyanDai/FairGNN"],"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/adversarial-immunization-for-improving","slug":"adversarial-immunization-for-improving","title":"Adversarial Immunization for Certifiable Robustness on Graphs","date":"2020-07-19","arxiv_id":"2007.09647","repositories_listed":2,"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/adversarial-immunization-for-improving#ran","syntology_url":"https://syntology.ai/paper/2007.09647","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.09647"}},"official":{"repos":["TaoShuchang/AdvImmune"],"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/graph-convolutional-networks-for-graphs","slug":"graph-convolutional-networks-for-graphs","title":"Graph Convolutional Networks for Graphs Containing Missing Features","date":"2020-07-09","arxiv_id":"2007.04583","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"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) · 3 unverified","sample_list":"/paper/graph-convolutional-networks-for-graphs#ran","syntology_url":"https://syntology.ai/paper/2007.04583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04583"}},"official":{"repos":["marblet/GCNmf"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/scaling-graph-neural-networks-with","slug":"scaling-graph-neural-networks-with","title":"Scaling Graph Neural Networks with Approximate PageRank","date":"2020-07-03","arxiv_id":"2007.01570","repositories_listed":2,"syntology":null},{"url":"/paper/graph-prototypical-networks-for-few-shot","slug":"graph-prototypical-networks-for-few-shot","title":"Graph Prototypical Networks for Few-shot Learning on Attributed Networks","date":"2020-06-23","arxiv_id":"2006.12739","repositories_listed":2,"syntology":null},{"url":"/paper/graph-backdoor","slug":"graph-backdoor","title":"Graph Backdoor","date":"2020-06-21","arxiv_id":"2006.11890","repositories_listed":2,"syntology":null},{"url":"/paper/backdoor-attacks-to-graph-neural-networks","slug":"backdoor-attacks-to-graph-neural-networks","title":"Backdoor Attacks to Graph Neural Networks","date":"2020-06-19","arxiv_id":"2006.11165","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/backdoor-attacks-to-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2006.11165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11165"}},"official":{"repos":["zaixizhang/graphbackdoor"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/data-augmentation-for-graph-neural-networks","slug":"data-augmentation-for-graph-neural-networks","title":"Data Augmentation for Graph Neural Networks","date":"2020-06-11","arxiv_id":"2006.06830","repositories_listed":2,"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/data-augmentation-for-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2006.06830","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06830"}},"official":{"repos":["zhao-tong/GAug"],"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/the-effects-of-randomness-on-the-stability-of","slug":"the-effects-of-randomness-on-the-stability-of","title":"The Effects of Randomness on the Stability of Node Embeddings","date":"2020-05-20","arxiv_id":"2005.10039","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/the-effects-of-randomness-on-the-stability-of#ran","syntology_url":"https://syntology.ai/paper/2005.10039","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.10039"}},"official":{"repos":["SGDE2020/embedding_stability"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bridging-the-gap-between-spectral-and-spatial","slug":"bridging-the-gap-between-spectral-and-spatial","title":"Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks","date":"2020-03-26","arxiv_id":"2003.11702","repositories_listed":2,"syntology":null},{"url":"/paper/a-survey-of-adversarial-learning-on-graphs","slug":"a-survey-of-adversarial-learning-on-graphs","title":"A Survey of Adversarial Learning on Graphs","date":"2020-03-10","arxiv_id":"2003.05730","repositories_listed":2,"syntology":null},{"url":"/paper/an-api-oriented-open-source-python-framework-1","slug":"an-api-oriented-open-source-python-framework-1","title":"Karate Club: An API Oriented Open-source Python Framework for Unsupervised Learning on Graphs","date":"2020-03-10","arxiv_id":"2003.04819","repositories_listed":2,"syntology":null},{"url":"/paper/adversarial-deep-network-embedding-for-cross","slug":"adversarial-deep-network-embedding-for-cross","title":"Adversarial Deep Network Embedding for Cross-network Node Classification","date":"2020-02-18","arxiv_id":"2002.07366","repositories_listed":2,"syntology":{"n":11,"n_ran":8,"n_constructed":7,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":11,"phrase":"8 ran (of which 7 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) · 3 unverified","sample_list":"/paper/adversarial-deep-network-embedding-for-cross#ran","syntology_url":"https://syntology.ai/paper/2002.07366","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07366"}},"official":{"repos":["shenxiaocam/ACDNE"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]}}},{"url":"/paper/unifying-graph-convolutional-neural-networks-1","slug":"unifying-graph-convolutional-neural-networks-1","title":"Unifying Graph Convolutional Neural Networks and Label Propagation","date":"2020-02-17","arxiv_id":"2002.06755","repositories_listed":2,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":1,"n_no_contract":7,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/unifying-graph-convolutional-neural-networks-1#ran","syntology_url":"https://syntology.ai/paper/2002.06755","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06755"}},"official":null}},{"url":"/paper/magnn-metapath-aggregated-graph-neural","slug":"magnn-metapath-aggregated-graph-neural","title":"MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding","date":"2020-02-05","arxiv_id":"2002.01680","repositories_listed":2,"syntology":null},{"url":"/paper/get-rid-of-suspended-animation-problem-deep","slug":"get-rid-of-suspended-animation-problem-deep","title":"Get Rid of Suspended Animation Problem: Deep Diffusive Neural Network on Graph Semi-Supervised Classification","date":"2020-01-22","arxiv_id":"2001.07922","repositories_listed":2,"syntology":null},{"url":"/paper/graph-bert-only-attention-is-needed-for","slug":"graph-bert-only-attention-is-needed-for","title":"Graph-Bert: Only Attention is Needed for Learning Graph Representations","date":"2020-01-15","arxiv_id":"2001.05140","repositories_listed":2,"syntology":null},{"url":"/paper/on-the-choice-of-graph-neural-network","slug":"on-the-choice-of-graph-neural-network","title":"On the choice of graph neural network architectures","date":"2019-11-13","arxiv_id":"1911.05384","repositories_listed":2,"syntology":null},{"url":"/paper/deep-hyperedges-a-framework-for-transductive","slug":"deep-hyperedges-a-framework-for-transductive","title":"Deep Hyperedges: a Framework for Transductive and Inductive Learning on Hypergraphs","date":"2019-10-07","arxiv_id":"1910.02633","repositories_listed":2,"syntology":null},{"url":"/paper/gresnet-graph-residuals-for-reviving-deep","slug":"gresnet-graph-residuals-for-reviving-deep","title":"GResNet: Graph Residual Network for Reviving Deep GNNs from Suspended Animation","date":"2019-09-12","arxiv_id":"1909.05729","repositories_listed":2,"syntology":null},{"url":"/paper/dimensional-reweighting-graph-convolutional","slug":"dimensional-reweighting-graph-convolutional","title":"Dimensional Reweighting Graph Convolutional Networks","date":"2019-07-04","arxiv_id":"1907.02237","repositories_listed":2,"syntology":null},{"url":"/paper/learning-discrete-structures-for-graph-neural","slug":"learning-discrete-structures-for-graph-neural","title":"Learning Discrete Structures for Graph Neural Networks","date":"2019-03-28","arxiv_id":"1903.11960","repositories_listed":2,"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":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/learning-discrete-structures-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1903.11960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.11960"}},"official":{"repos":["lucfra/LDS","lucfra/LDS-GNN"],"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/dynamic-graph-representation-learning-via","slug":"dynamic-graph-representation-learning-via","title":"Dynamic Graph Representation Learning via Self-Attention Networks","date":"2018-12-22","arxiv_id":"1812.09430","repositories_listed":2,"syntology":null},{"url":"/paper/graph-node-feature-convolution-for","slug":"graph-node-feature-convolution-for","title":"Graph Node-Feature Convolution for Representation Learning","date":"2018-11-30","arxiv_id":"1812.00086","repositories_listed":2,"syntology":null},{"url":"/paper/enhanced-network-embedding-with-text","slug":"enhanced-network-embedding-with-text","title":"Enhanced Network Embedding with Text Information","date":"2018-11-29","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/pitfalls-of-graph-neural-network-evaluation","slug":"pitfalls-of-graph-neural-network-evaluation","title":"Pitfalls of Graph Neural Network Evaluation","date":"2018-11-14","arxiv_id":"1811.05868","repositories_listed":2,"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/pitfalls-of-graph-neural-network-evaluation#ran","syntology_url":"https://syntology.ai/paper/1811.05868","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.05868"}},"official":null}},{"url":"/paper/accurate-efficient-and-scalable-graph","slug":"accurate-efficient-and-scalable-graph","title":"Accurate, Efficient and Scalable Graph Embedding","date":"2018-10-28","arxiv_id":"1810.11899","repositories_listed":2,"syntology":null},{"url":"/paper/streaming-graph-neural-networks","slug":"streaming-graph-neural-networks","title":"Streaming Graph Neural Networks","date":"2018-10-24","arxiv_id":"1810.10627","repositories_listed":2,"syntology":null},{"url":"/paper/binarized-attributed-network-embedding","slug":"binarized-attributed-network-embedding","title":"Binarized Attributed Network Embedding","date":"2018-10-22","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/deep-autoencoder-like-nonnegative-matrix","slug":"deep-autoencoder-like-nonnegative-matrix","title":"Deep Autoencoder-like Nonnegative Matrix Factorization for Community Detection","date":"2018-10-22","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-sampling-towards-fast-graph","slug":"adaptive-sampling-towards-fast-graph","title":"Adaptive Sampling Towards Fast Graph Representation Learning","date":"2018-09-14","arxiv_id":"1809.05343","repositories_listed":2,"syntology":null},{"url":"/paper/billion-scale-network-embedding-with","slug":"billion-scale-network-embedding-with","title":"Billion-scale Network Embedding with Iterative Random Projection","date":"2018-05-07","arxiv_id":"1805.02396","repositories_listed":2,"syntology":null},{"url":"/paper/fast-sequence-based-embedding-with-diffusion","slug":"fast-sequence-based-embedding-with-diffusion","title":"Fast Sequence Based Embedding with Diffusion Graphs","date":"2018-03-20","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/learning-to-make-predictions-on-graphs-with","slug":"learning-to-make-predictions-on-graphs-with","title":"Learning to Make Predictions on Graphs with Autoencoders","date":"2018-02-23","arxiv_id":"1802.08352","repositories_listed":2,"syntology":null},{"url":"/paper/enhancing-network-embedding-with-auxiliary","slug":"enhancing-network-embedding-with-auxiliary","title":"Enhancing Network Embedding with Auxiliary Information: An Explicit Matrix Factorization Perspective","date":"2017-11-11","arxiv_id":"1711.04094","repositories_listed":2,"syntology":null},{"url":"/paper/watch-your-step-learning-node-embeddings-via","slug":"watch-your-step-learning-node-embeddings-via","title":"Watch Your Step: Learning Node Embeddings via Graph Attention","date":"2017-10-26","arxiv_id":"1710.09599","repositories_listed":2,"syntology":null},{"url":"/paper/cayleynets-graph-convolutional-neural","slug":"cayleynets-graph-convolutional-neural","title":"CayleyNets: Graph Convolutional Neural Networks with Complex Rational Spectral Filters","date":"2017-05-22","arxiv_id":"1705.07664","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cayleynets-graph-convolutional-neural#ran","syntology_url":"https://syntology.ai/paper/1705.07664","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.07664"}},"official":{"repos":["amoliu/CayleyNet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/from-node-embedding-to-community-embedding","slug":"from-node-embedding-to-community-embedding","title":"From Node Embedding To Community Embedding","date":"2016-10-31","arxiv_id":"1610.09950","repositories_listed":2,"syntology":null},{"url":"/paper/grarep-learning-graph-representations-with","slug":"grarep-learning-graph-representations-with","title":"GraRep: Learning Graph Representations with Global Structural Information","date":"2015-10-17","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/demystifying-distributed-training-of-graph","slug":"demystifying-distributed-training-of-graph","title":"Demystifying Distributed Training of Graph Neural Networks for Link Prediction","date":"2025-06-25","arxiv_id":"2506.20818","repositories_listed":1,"syntology":null},{"url":"/paper/equivariance-everywhere-all-at-once-a-recipe","slug":"equivariance-everywhere-all-at-once-a-recipe","title":"Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models","date":"2025-06-17","arxiv_id":"2506.14291","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/equivariance-everywhere-all-at-once-a-recipe#ran","syntology_url":"https://syntology.ai/paper/2506.14291","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.14291"}},"official":{"repos":["benfinkelshtein/equivarianceeverywhere"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/delving-into-instance-dependent-label-noise","slug":"delving-into-instance-dependent-label-noise","title":"Delving into Instance-Dependent Label Noise in Graph Data: A Comprehensive Study and Benchmark","date":"2025-06-14","arxiv_id":"2506.12468","repositories_listed":1,"syntology":null},{"url":"/paper/improving-the-effective-receptive-field-of","slug":"improving-the-effective-receptive-field-of","title":"Improving the Effective Receptive Field of Message-Passing Neural Networks","date":"2025-05-29","arxiv_id":"2505.23185","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/improving-the-effective-receptive-field-of#ran","syntology_url":"https://syntology.ai/paper/2505.23185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.23185"}},"official":{"repos":["bgu-cs-vil/im-mpnn"],"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/scalable-graph-generative-modeling-via","slug":"scalable-graph-generative-modeling-via","title":"Scalable Graph Generative Modeling via Substructure Sequences","date":"2025-05-22","arxiv_id":"2505.16130","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/scalable-graph-generative-modeling-via#ran","syntology_url":"https://syntology.ai/paper/2505.16130","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16130"}},"official":{"repos":["zehong-wang/g2pm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/partition-wise-graph-filtering-a-unified","slug":"partition-wise-graph-filtering-a-unified","title":"Partition-wise Graph Filtering: A Unified Perspective Through the Lens of Graph Coarsening","date":"2025-05-20","arxiv_id":"2505.14033","repositories_listed":1,"syntology":null},{"url":"/paper/it-takes-a-graph-to-know-a-graph-rewiring-for","slug":"it-takes-a-graph-to-know-a-graph-rewiring-for","title":"It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph","date":"2025-05-18","arxiv_id":"2505.12411","repositories_listed":1,"syntology":null},{"url":"/paper/2505-11396","slug":"2505-11396","title":"Finding Counterfactual Evidences for Node Classification","date":"2025-05-16","arxiv_id":"2505.11396","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-mixed-precision-quantization-in","slug":"efficient-mixed-precision-quantization-in","title":"Efficient Mixed Precision Quantization in Graph Neural Networks","date":"2025-05-14","arxiv_id":"2505.09361","repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-with-mutual-influence","slug":"representation-learning-with-mutual-influence","title":"Representation Learning with Mutual Influence of Modalities for Node Classification in Multi-Modal Heterogeneous Networks","date":"2025-05-12","arxiv_id":"2505.07895","repositories_listed":1,"syntology":null},{"url":"/paper/wide-deep-learning-for-node-classification","slug":"wide-deep-learning-for-node-classification","title":"Wide & Deep Learning for Node Classification","date":"2025-05-04","arxiv_id":"2505.02020","repositories_listed":1,"syntology":null},{"url":"/paper/abg-nas-adaptive-bayesian-genetic-neural","slug":"abg-nas-adaptive-bayesian-genetic-neural","title":"ABG-NAS: Adaptive Bayesian Genetic Neural Architecture Search for Graph Representation Learning","date":"2025-04-30","arxiv_id":"2504.21254","repositories_listed":1,"syntology":null},{"url":"/paper/graph-fourier-transformer-with-structure","slug":"graph-fourier-transformer-with-structure","title":"Graph Fourier Transformer with Structure-Frequency Information","date":"2025-04-28","arxiv_id":"2504.19740","repositories_listed":1,"syntology":null},{"url":"/paper/msgcn-multiplex-spatial-graph-convolution","slug":"msgcn-multiplex-spatial-graph-convolution","title":"MSGCN: Multiplex Spatial Graph Convolution Network for Interlayer Link Weight Prediction","date":"2025-04-24","arxiv_id":"2504.17749","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-degree-bias-in-graph","slug":"mitigating-degree-bias-in-graph","title":"Mitigating Degree Bias in Graph Representation Learning with Learnable Structural Augmentation and Structural Self-Attention","date":"2025-04-21","arxiv_id":"2504.15075","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-vector-quantized-graph","slug":"hierarchical-vector-quantized-graph","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","date":"2025-04-17","arxiv_id":"2504.12715","repositories_listed":1,"syntology":null},{"url":"/paper/balancing-graph-embedding-smoothness-in-self","slug":"balancing-graph-embedding-smoothness-in-self","title":"Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition","date":"2025-04-16","arxiv_id":"2504.12011","repositories_listed":1,"syntology":null}],"record_sha256":"fc026bedd7f71b059d4bc158c4069abfab26b6443ce3760c297a3e872354fb97","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}