{"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":"/method/graphsage/papers/2","list_of":"/method/graphsage","method":"GraphSAGE","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"date (newest first), then slug","page":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,132],"of":132,"counts":{"archive_papers_tagged":132,"with_a_code_link":52,"where_syntology_ran_a_sample":15,"not_listed_spam_title":0,"listed":132,"listed_where_code_ran":15,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":12,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":12,"listed_every_run_a_failure_of_syntologys_instrument":3,"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":"/method/graphsage","prev":"/method/graphsage","next":null,"papers":[{"paper":null,"slug":"bi-rec-guided-data-analysis-for","title":"BI-REC: Guided Data Analysis for Conversational Business Intelligence","date":"2021-05-02","arxiv_id":"2105.00467","n_code_links":0,"syntology":null},{"paper":"/paper/user-preference-aware-fake-news-detection","slug":"user-preference-aware-fake-news-detection","title":"User Preference-aware Fake News Detection","date":"2021-04-25","arxiv_id":"2104.12259","n_code_links":2,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"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","official":{"repos":["safe-graph/GNN-FakeNews"],"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"]}}},{"paper":null,"slug":"predicting-mergers-and-acquisitions-using","title":"Predicting Mergers and Acquisitions using Graph-based Deep Learning","date":"2021-04-05","arxiv_id":"2104.01757","n_code_links":0,"syntology":null},{"paper":"/paper/e-graphsage-a-graph-neural-network-based","slug":"e-graphsage-a-graph-neural-network-based","title":"E-GraphSAGE: A Graph Neural Network based Intrusion Detection System for IoT","date":"2021-03-30","arxiv_id":"2103.16329","n_code_links":3,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"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","official":{"repos":["waimorris/E-GraphSAGE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":null,"slug":"benchmarking-graph-neural-networks-on-link","title":"Benchmarking Graph Neural Networks on Link Prediction","date":"2021-02-24","arxiv_id":"2102.12557","n_code_links":0,"syntology":null},{"paper":"/paper/gist-distributed-training-for-large-scale","slug":"gist-distributed-training-for-large-scale","title":"GIST: Distributed Training for Large-Scale Graph Convolutional Networks","date":"2021-02-20","arxiv_id":"2102.10424","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"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","official":null}},{"paper":null,"slug":"comparisons-of-graph-neural-networks-on","title":"Comparisons of Graph Neural Networks on Cancer Classification Leveraging a Joint of Phenotypic and Genetic Features","date":"2021-01-14","arxiv_id":"2101.05866","n_code_links":0,"syntology":null},{"paper":null,"slug":"adiag-graph-neural-network-based-diagnosis-of","title":"ADiag: Graph Neural Network Based Diagnosis of Alzheimer's Disease","date":"2021-01-08","arxiv_id":"2101.02870","n_code_links":0,"syntology":null},{"paper":"/paper/single-node-attack-for-fooling-graph-neural-1","slug":"single-node-attack-for-fooling-graph-neural-1","title":"Single-Node Attacks for Fooling Graph Neural Networks","date":"2020-11-06","arxiv_id":"2011.03574","n_code_links":1,"syntology":null},{"paper":"/paper/graph-based-temporal-aggregation-for-video","slug":"graph-based-temporal-aggregation-for-video","title":"Graph Based Temporal Aggregation for Video Retrieval","date":"2020-11-04","arxiv_id":"2011.02426","n_code_links":1,"syntology":null},{"paper":null,"slug":"hypersage-generalizing-inductive-1","title":"HyperSAGE: Generalizing Inductive Representation Learning on Hypergraphs","date":"2020-10-09","arxiv_id":"2010.04558","n_code_links":0,"syntology":null},{"paper":null,"slug":"nextdoor-gpu-based-graph-sampling-for","title":"Accelerating Graph Sampling for Graph Machine Learning using GPUs","date":"2020-09-14","arxiv_id":"2009.06693","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":2,"syntology":null},{"paper":"/paper/learning-robust-node-representation-on-graphs","slug":"learning-robust-node-representation-on-graphs","title":"Learning Node Representations against Perturbations","date":"2020-08-26","arxiv_id":"2008.11416","n_code_links":1,"syntology":null},{"paper":"/paper/sce-scalable-network-embedding-from-sparsest","slug":"sce-scalable-network-embedding-from-sparsest","title":"SCE: Scalable Network Embedding from Sparsest Cut","date":"2020-06-30","arxiv_id":"2006.16499","n_code_links":1,"syntology":{"ran":6,"of":7,"n_ran_checked":4,"n_instrument":2,"unverified":1,"pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["szzhang17/Sparsest-Cut-Network-Embedding"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/graph-representation-learning-network-via","slug":"graph-representation-learning-network-via","title":"Graph Representation Learning Network via Adaptive Sampling","date":"2020-06-08","arxiv_id":"2006.04637","n_code_links":1,"syntology":null},{"paper":null,"slug":"pooling-in-graph-convolutional-neural","title":"Pooling in Graph Convolutional Neural Networks","date":"2020-04-07","arxiv_id":"2004.03519","n_code_links":0,"syntology":null},{"paper":null,"slug":"swag-item-recommendations-using-convolutions","title":"SWAG: Item Recommendations using Convolutions on Weighted Graphs","date":"2019-11-22","arxiv_id":"1911.10232","n_code_links":0,"syntology":null},{"paper":null,"slug":"graph-neural-networks-for-small-graph-and","title":"Graph Neural Networks for Small Graph and Giant Network Representation Learning: An Overview","date":"2019-08-01","arxiv_id":"1908.00187","n_code_links":0,"syntology":null},{"paper":"/paper/the-truly-deep-graph-convolutional-networks","slug":"the-truly-deep-graph-convolutional-networks","title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","date":"2019-07-25","arxiv_id":"1907.10903","n_code_links":7,"syntology":{"ran":4,"of":5,"n_ran_checked":4,"n_instrument":0,"unverified":1,"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) · 1 unverified","official":{"repos":["DropEdge/DropEdge"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":null,"slug":"identifying-illicit-accounts-in-large-scale-e","title":"Identifying Illicit Accounts in Large Scale E-payment Networks -- A Graph Representation Learning Approach","date":"2019-06-13","arxiv_id":"1906.05546","n_code_links":0,"syntology":null},{"paper":null,"slug":"approximation-ratios-of-graph-neural-networks","title":"Approximation Ratios of Graph Neural Networks for Combinatorial Problems","date":"2019-05-24","arxiv_id":"1905.10261","n_code_links":0,"syntology":null},{"paper":null,"slug":"190503679","title":"Adversarial Defense Framework for Graph Neural Network","date":"2019-05-09","arxiv_id":"1905.03679","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-graph-neural-networks-with-noisy","title":"Learning Graph Neural Networks with Noisy Labels","date":"2019-05-05","arxiv_id":"1905.01591","n_code_links":0,"syntology":null},{"paper":null,"slug":"bigsage-unsupervised-inductive-representation","title":"BIGSAGE: unsupervised inductive representation learning of graph via bi-attended sampling and global-biased aggregating","date":"2019-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/advancing-graphsage-with-a-data-driven-node","slug":"advancing-graphsage-with-a-data-driven-node","title":"Advancing GraphSAGE with A Data-Driven Node Sampling","date":"2019-04-29","arxiv_id":"1904.12935","n_code_links":1,"syntology":null},{"paper":"/paper/clique-pooling-for-graph-classification","slug":"clique-pooling-for-graph-classification","title":"Clique pooling for graph classification","date":"2019-03-31","arxiv_id":"1904.00374","n_code_links":1,"syntology":null},{"paper":null,"slug":"constant-time-graph-neural-networks","title":"Constant Time Graph Neural Networks","date":"2019-01-23","arxiv_id":"1901.07868","n_code_links":0,"syntology":null},{"paper":"/paper/how-powerful-are-graph-neural-networks","slug":"how-powerful-are-graph-neural-networks","title":"How Powerful are Graph Neural Networks?","date":"2018-10-01","arxiv_id":"1810.00826","n_code_links":19,"syntology":{"ran":6,"of":10,"n_ran_checked":6,"n_instrument":0,"unverified":4,"pointer_only":5,"phrase":"6 ran (of which 2 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) · 4 unverified","official":{"repos":["weihua916/powerful-gnns"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/n-gcn-multi-scale-graph-convolution-for-semi","slug":"n-gcn-multi-scale-graph-convolution-for-semi","title":"N-GCN: Multi-scale Graph Convolution for Semi-supervised Node Classification","date":"2018-02-24","arxiv_id":"1802.08888","n_code_links":1,"syntology":null},{"paper":null,"slug":"network-of-graph-convolutional-networks","title":"Network of Graph Convolutional Networks Trained on Random Walks","date":"2018-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/inductive-representation-learning-on-large","slug":"inductive-representation-learning-on-large","title":"Inductive Representation Learning on Large Graphs","date":"2017-06-07","arxiv_id":"1706.02216","n_code_links":20,"syntology":{"ran":3,"of":5,"n_ran_checked":3,"n_instrument":0,"unverified":2,"pointer_only":5,"phrase":"3 ran (of which 2 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) · 2 unverified","official":{"repos":["williamleif/GraphSAGE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"record_sha256":"ef2de619813b5c371644a9d40fe7c5a709cb13580c0fbd1ded38d40365b3c735","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}