{"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/graphsaint","slug":"graphsaint","name":"GraphSAINT","full_name":"Graph sampling based inductive learning method","full_name_withheld":false,"description_markdown":"Scalable method to train large scale GNN models via sampling small subgraphs.","description_state":"present","introduced_year":null,"introduced_by":{"title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","paper":"/paper/graphsaint-graph-sampling-based-inductive","first_author":"Hanqing Zeng","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/graphsaint-graph-sampling-based-inductive"},"source":{"url":"https://arxiv.org/abs/1907.04931v4","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Representation Learning","url":"/methods/category/graph-representation-learning","pwc_aliases":[]}],"n_papers_tagged":7,"archive_num_papers":7,"papers_newest_first":[{"paper":"/paper/lifelong-graph-summarization-with-neural","slug":"lifelong-graph-summarization-with-neural","title":"Lifelong Graph Learning for Graph Summarization","date":"2024-07-25","arxiv_id":"2407.18042","n_code_links":1,"syntology":null},{"paper":null,"slug":"policyclustergcn-identifying-efficient","title":"PolicyClusterGCN: Identifying Efficient Clusters for Training Graph Convolutional Networks","date":"2023-06-25","arxiv_id":"2306.14357","n_code_links":0,"syntology":null},{"paper":null,"slug":"bitgnn-unleashing-the-performance-potential","title":"BitGNN: Unleashing the Performance Potential of Binary Graph Neural Networks on GPUs","date":"2023-05-04","arxiv_id":"2305.02522","n_code_links":0,"syntology":null},{"paper":"/paper/a-new-graph-node-classification-benchmark","slug":"a-new-graph-node-classification-benchmark","title":"A New Graph Node Classification Benchmark: Learning Structure from Histology Cell Graphs","date":"2022-11-11","arxiv_id":"2211.06292","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":2,"n_instrument":0,"unverified":1,"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","official":{"repos":["nellaker-group/placenta"],"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"]}}},{"paper":"/paper/decoupling-the-depth-and-scope-of-graph-1","slug":"decoupling-the-depth-and-scope-of-graph-1","title":"Decoupling the Depth and Scope of Graph Neural Networks","date":"2022-01-19","arxiv_id":"2201.07858","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"pointer_only":2,"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","official":{"repos":["facebookresearch/shaDow_GNN"],"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"]}}},{"paper":null,"slug":"on-batch-size-selection-for-stochastic","title":"On Batch-size Selection for Stochastic Training for Graph Neural Networks","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/graphsaint-graph-sampling-based-inductive","slug":"graphsaint-graph-sampling-based-inductive","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","date":"2019-07-10","arxiv_id":"1907.04931","n_code_links":8,"syntology":null}],"papers_shown":7,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":7,"with_a_code_link":4,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":7,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":0,"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"},"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/method/graphsaint/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/graphsaint/papers/ran/1","json":"/method/graphsaint/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/node-classification","name":"Node Classification","papers":4},{"task":"/task/graph-learning","name":"Graph Learning","papers":2},{"task":"/task/node-property-prediction","name":"Node Property Prediction","papers":2},{"task":"/task/attribute","name":"Attribute","papers":1},{"task":"/task/deep-learning","name":"Deep Learning","papers":1},{"task":"/task/graph-attention","name":"Graph Attention","papers":1},{"task":"/task/graph-embedding","name":"Graph Embedding","papers":1},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":1},{"task":"/task/graph-representation-learning","name":"Graph Representation Learning","papers":1},{"task":"/task/graph-sampling","name":"Graph Sampling","papers":1},{"task":"/task/inductive-learning","name":"Inductive Learning","papers":1},{"task":"/task/link-prediction","name":"Link Prediction","papers":1},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":1},{"task":"/task/graph-partitioning","name":"graph partitioning","papers":1},{"task":"/task/whole-slide-images","name":"whole slide images","papers":1}],"tasks_shown":15,"n_tasks":15,"usage_by_year":[{"year":"2019","papers":1},{"year":"2021","papers":1},{"year":"2022","papers":2},{"year":"2023","papers":2},{"year":"2024","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/graphsaint"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=GraphSAINT","read_at":"2026-10-05T00:57:16+00:00","query":"GraphSAINT","kind":"paper","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"1907.04931","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"unresolved_bearers","may_be_wrong_sense":true,"bearers_found":2,"served":null,"leading_other_bearer":{"arxiv_id":"1907.04931","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","citations":1231,"named_by":["title_prefix"],"bearer_name":"GraphSAINT: Graph Sampling Based Inductive Learning Method","ask_with":"have('1907.04931')"},"n_other_bearers_listed":2,"note":"Nothing resolved to 'GraphSAINT' by name, but 2 thing(s) here DECLARE that name -- most cited: the paper 'GraphSAINT: Graph Sampling Based Inductive Learning Method' (arXiv:1907.04931, 1,231 citations). That is a RESOLUTION miss, not a coverage gap: the corpus holds the name under a spelling the lookup did not reach. Ask again with an entry of `also_named`."},"name_competition_text":"Nothing resolved to this name, but 2 entries in Syntology's graph carry it; the most cited is the paper “GraphSAINT: Graph Sampling Based Inductive Learning Method” (arXiv:1907.04931, 1,231 citations). The lookup reads this as a miss of its own name matching, not a gap in coverage: the graph holds the name under a spelling the lookup did not reach.","near_matches":[],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"22ebca86235293c24d0ed34eb94f549398d53c5c2f209e2f62806dc8589743f1","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}