{"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-sampling","name":"Graph Sampling","slug":"graph-sampling","description_markdown":"Training GNNs or generating graph embeddings requires graph samples.","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":101,"papers_with_code":44,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":3,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[{"url":"/dataset/friendster","name":"Friendster","full_name":"","num_papers_in_archive":65},{"url":"/dataset/lastfm-asia","name":"LastFM Asia","full_name":"","num_papers_in_archive":21},{"url":"/dataset/chembl-v-27","name":"ChEMBL","full_name":"","num_papers_in_archive":2}],"subtasks":[],"parent_tasks":[{"url":"/task/graph-learning","name":"Graph Learning"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":2,"rows_per_page":100,"shown":100,"of":101,"of_with_code":44,"tagged_in_all":101,"counts":{"archive_papers_tagged":101,"with_a_code_link":44,"where_syntology_ran_a_sample":11,"not_listed_spam_title":0,"listed":101,"listed_where_code_ran":11,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":10,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":10,"listed_every_run_a_failure_of_syntologys_instrument":1,"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"},"items":[{"url":"/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","repositories_listed":8,"syntology":null},{"url":"/paper/sign-scalable-inception-graph-neural-networks","slug":"sign-scalable-inception-graph-neural-networks","title":"SIGN: Scalable Inception Graph Neural Networks","date":"2020-04-23","arxiv_id":"2004.11198","repositories_listed":5,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/sign-scalable-inception-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2004.11198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11198"}},"official":{"repos":["twitter-research/sign"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/training-graph-neural-networks-with-1000","slug":"training-graph-neural-networks-with-1000","title":"Training Graph Neural Networks with 1000 Layers","date":"2021-06-14","arxiv_id":"2106.07476","repositories_listed":4,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/training-graph-neural-networks-with-1000#ran","syntology_url":"https://syntology.ai/paper/2106.07476","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07476"}},"official":{"repos":["lightaime/deep_gcns_torch"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/heterogeneous-graph-transformer","slug":"heterogeneous-graph-transformer","title":"Heterogeneous Graph Transformer","date":"2020-03-03","arxiv_id":"2003.01332","repositories_listed":4,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/heterogeneous-graph-transformer#ran","syntology_url":"https://syntology.ai/paper/2003.01332","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.01332"}},"official":{"repos":["acbull/pyHGT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/accurate-efficient-and-scalable-training-of","slug":"accurate-efficient-and-scalable-training-of","title":"Accurate, Efficient and Scalable Training of Graph Neural Networks","date":"2020-10-05","arxiv_id":"2010.03166","repositories_listed":2,"syntology":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/graph-learning-at-scale-characterizing-and","slug":"graph-learning-at-scale-characterizing-and","title":"Graph Learning at Scale: Characterizing and Optimizing Pre-Propagation GNNs","date":"2025-04-17","arxiv_id":"2504.13266","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-graph-sampling-based-minibatch","slug":"hierarchical-graph-sampling-based-minibatch","title":"Hierarchical graph sampling based minibatch learning with chain preservation and variance reduction","date":"2025-03-02","arxiv_id":"2503.00860","repositories_listed":1,"syntology":null},{"url":"/paper/retrofitting-temporal-graph-neural-networks","slug":"retrofitting-temporal-graph-neural-networks","title":"Retrofitting Temporal Graph Neural Networks with Transformer","date":"2024-09-09","arxiv_id":"2409.05477","repositories_listed":1,"syntology":null},{"url":"/paper/ags-gnn-attribute-guided-sampling-for-graph","slug":"ags-gnn-attribute-guided-sampling-for-graph","title":"AGS-GNN: Attribute-guided Sampling for Graph Neural Networks","date":"2024-05-24","arxiv_id":"2405.15218","repositories_listed":1,"syntology":null},{"url":"/paper/a-sampling-based-framework-for-hypothesis","slug":"a-sampling-based-framework-for-hypothesis","title":"A Sampling-based Framework for Hypothesis Testing on Large Attributed Graphs","date":"2024-03-20","arxiv_id":"2403.13286","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-scientific-discovery-with","slug":"accelerating-scientific-discovery-with","title":"Accelerating Scientific Discovery with Generative Knowledge Extraction, Graph-Based Representation, and Multimodal Intelligent Graph Reasoning","date":"2024-03-18","arxiv_id":"2403.11996","repositories_listed":1,"syntology":null},{"url":"/paper/cooperative-minibatching-in-graph-neural","slug":"cooperative-minibatching-in-graph-neural","title":"Cooperative Minibatching in Graph Neural Networks","date":"2023-10-19","arxiv_id":"2310.12403","repositories_listed":1,"syntology":{"n":9,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":8,"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) · 8 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/cooperative-minibatching-in-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2310.12403","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.12403"}},"official":{"repos":["gt-tdalab/dgl-coop"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/causal-structure-learning-with-momentum","slug":"causal-structure-learning-with-momentum","title":"Causal structure learning with momentum: Sampling distributions over Markov Equivalence Classes of DAGs","date":"2023-10-09","arxiv_id":"2310.05655","repositories_listed":1,"syntology":null},{"url":"/paper/grapes-learning-to-sample-graphs-for-scalable","slug":"grapes-learning-to-sample-graphs-for-scalable","title":"GRAPES: Learning to Sample Graphs for Scalable Graph Neural Networks","date":"2023-10-05","arxiv_id":"2310.03399","repositories_listed":1,"syntology":null},{"url":"/paper/a-topology-aware-analysis-of-graph","slug":"a-topology-aware-analysis-of-graph","title":"A Topology-aware Analysis of Graph Collaborative Filtering","date":"2023-08-21","arxiv_id":"2308.10778","repositories_listed":1,"syntology":null},{"url":"/paper/class-level-structural-relation-modelling-and","slug":"class-level-structural-relation-modelling-and","title":"Class-level Structural Relation Modelling and Smoothing for Visual Representation Learning","date":"2023-08-08","arxiv_id":"2308.04142","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":10,"phrase":"6 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/class-level-structural-relation-modelling-and#ran","syntology_url":"https://syntology.ai/paper/2308.04142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.04142"}},"official":{"repos":["czt117/csrms"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-sampling-based-meta-learning-for","slug":"graph-sampling-based-meta-learning-for","title":"Graph Sampling-based Meta-Learning for Molecular Property Prediction","date":"2023-06-29","arxiv_id":"2306.16780","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"4 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-sampling-based-meta-learning-for#ran","syntology_url":"https://syntology.ai/paper/2306.16780","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.16780"}},"official":{"repos":["hicai-zju/gs-meta"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/accelerating-sampling-and-aggregation","slug":"accelerating-sampling-and-aggregation","title":"Accelerating Sampling and Aggregation Operations in GNN Frameworks with GPU Initiated Direct Storage Accesses","date":"2023-06-28","arxiv_id":"2306.16384","repositories_listed":1,"syntology":null},{"url":"/paper/graph-ladling-shockingly-simple-parallel-gnn","slug":"graph-ladling-shockingly-simple-parallel-gnn","title":"Graph Ladling: Shockingly Simple Parallel GNN Training without Intermediate Communication","date":"2023-06-18","arxiv_id":"2306.10466","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-ladling-shockingly-simple-parallel-gnn#ran","syntology_url":"https://syntology.ai/paper/2306.10466","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.10466"}},"official":{"repos":["vita-group/graph_ladling"],"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/quiver-supporting-gpus-for-low-latency-high","slug":"quiver-supporting-gpus-for-low-latency-high","title":"Quiver: Supporting GPUs for Low-Latency, High-Throughput GNN Serving with Workload Awareness","date":"2023-05-18","arxiv_id":"2305.10863","repositories_listed":1,"syntology":null},{"url":"/paper/explaining-graph-neural-networks-via-non","slug":"explaining-graph-neural-networks-via-non","title":"Rethinking Explaining Graph Neural Networks via Non-parametric Subgraph Matching","date":"2023-01-07","arxiv_id":"2301.02780","repositories_listed":1,"syntology":null},{"url":"/paper/conditional-diffusion-based-on-discrete-graph","slug":"conditional-diffusion-based-on-discrete-graph","title":"Conditional Diffusion Based on Discrete Graph Structures for Molecular Graph Generation","date":"2023-01-01","arxiv_id":"2301.00427","repositories_listed":1,"syntology":null},{"url":"/paper/characterizing-the-efficiency-of-graph-neural","slug":"characterizing-the-efficiency-of-graph-neural","title":"Characterizing the Efficiency of Graph Neural Network Frameworks with a Magnifying Glass","date":"2022-11-06","arxiv_id":"2211.03021","repositories_listed":1,"syntology":null},{"url":"/paper/joint-network-topology-inference-via-a-shared","slug":"joint-network-topology-inference-via-a-shared","title":"Joint Network Topology Inference via a Shared Graphon Model","date":"2022-09-17","arxiv_id":"2209.08223","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-and-scalable-recommendation-via","slug":"efficient-and-scalable-recommendation-via","title":"Fine-tuning Partition-aware Item Similarities for Efficient and Scalable Recommendation","date":"2022-07-13","arxiv_id":"2207.05959","repositories_listed":1,"syntology":null},{"url":"/paper/tf-gnn-graph-neural-networks-in-tensorflow","slug":"tf-gnn-graph-neural-networks-in-tensorflow","title":"TF-GNN: Graph Neural Networks in TensorFlow","date":"2022-07-07","arxiv_id":"2207.03522","repositories_listed":1,"syntology":null},{"url":"/paper/hyfactor-hydrogen-count-labelled-graph-based","slug":"hyfactor-hydrogen-count-labelled-graph-based","title":"HyFactor: Hydrogen-count labelled graph-based defactorization Autoencoder","date":"2021-12-06","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-dynamic-preference-structure","slug":"learning-dynamic-preference-structure","title":"Learning Dynamic Preference Structure Embedding From Temporal Networks","date":"2021-11-23","arxiv_id":"2111.11886","repositories_listed":1,"syntology":null},{"url":"/paper/are-negative-samples-necessary-in-entity","slug":"are-negative-samples-necessary-in-entity","title":"Are Negative Samples Necessary in Entity Alignment? An Approach with High Performance, Scalability and Robustness","date":"2021-08-11","arxiv_id":"2108.05278","repositories_listed":1,"syntology":null},{"url":"/paper/graph-sampling-based-deep-metric-learning-for","slug":"graph-sampling-based-deep-metric-learning-for","title":"Graph Sampling Based Deep Metric Learning for Generalizable Person Re-Identification","date":"2021-04-04","arxiv_id":"2104.01546","repositories_listed":1,"syntology":null},{"url":"/paper/pre-training-on-dynamic-graph-neural-networks","slug":"pre-training-on-dynamic-graph-neural-networks","title":"Pre-Training on Dynamic Graph Neural Networks","date":"2021-02-24","arxiv_id":"2102.12380","repositories_listed":1,"syntology":null},{"url":"/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","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":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/gist-distributed-training-for-large-scale#ran","syntology_url":"https://syntology.ai/paper/2102.10424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.10424"}},"official":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/generalize-a-small-pre-trained-model-to","slug":"generalize-a-small-pre-trained-model-to","title":"Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instances","date":"2020-12-19","arxiv_id":"2012.10658","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-neural-architecture-search-for-end","slug":"efficient-neural-architecture-search-for-end","title":"Efficient Neural Architecture Search for End-to-end Speech Recognition via Straight-Through Gradients","date":"2020-11-11","arxiv_id":"2011.05649","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-graph-neural-networks-via","slug":"scalable-graph-neural-networks-via","title":"Scalable Graph Neural Networks via Bidirectional Propagation","date":"2020-10-29","arxiv_id":"2010.15421","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":1,"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/scalable-graph-neural-networks-via#ran","syntology_url":"https://syntology.ai/paper/2010.15421","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.15421"}},"official":{"repos":["chennnM/GBP"],"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/little-ball-of-fur-a-python-library-for-graph","slug":"little-ball-of-fur-a-python-library-for-graph","title":"Little Ball of Fur: A Python Library for Graph Sampling","date":"2020-06-08","arxiv_id":"2006.04311","repositories_listed":1,"syntology":null},{"url":"/paper/on-random-walk-based-graph-sampling","slug":"on-random-walk-based-graph-sampling","title":"On Random Walk Based Graph Sampling","date":"2020-05-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/reducing-large-internet-topologies-for-faster","slug":"reducing-large-internet-topologies-for-faster","title":"Reducing Large Internet Topologies for Faster Simulations","date":"2020-05-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/neighborhood-matching-network-for-entity","slug":"neighborhood-matching-network-for-entity","title":"Neighborhood Matching Network for Entity Alignment","date":"2020-05-12","arxiv_id":"2005.05607","repositories_listed":1,"syntology":null},{"url":"/paper/learning-policies-for-social-network","slug":"learning-policies-for-social-network","title":"Influence maximization in unknown social networks: Learning Policies for Effective Graph Sampling","date":"2019-07-08","arxiv_id":"1907.11625","repositories_listed":1,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":3,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-policies-for-social-network#ran","syntology_url":"https://syntology.ai/paper/1907.11625","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.11625"}},"official":{"repos":["kage08/graph_sample_rl"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/empirical-risk-minimization-and-stochastic","slug":"empirical-risk-minimization-and-stochastic","title":"Empirical Risk Minimization and Stochastic Gradient Descent for Relational Data","date":"2018-06-27","arxiv_id":"1806.10701","repositories_listed":1,"syntology":{"n":23,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":14,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/empirical-risk-minimization-and-stochastic#ran","syntology_url":"https://syntology.ai/paper/1806.10701","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.10701"}},"official":{"repos":["wooden-spoon/relational-ERM"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":14,"ran_from_kinds":["official"]}}},{"url":"/paper/sampling-from-large-graphs","slug":"sampling-from-large-graphs","title":"Sampling From Large Graphs","date":"2006-08-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"keyed-chaotic-tensor-transformations-for","title":"Keyed Chaotic Dynamics for Privacy-Preserving Neural Inference","date":"2025-05-29","arxiv_id":"2505.23655","repositories_listed":0,"syntology":null},{"url":null,"slug":"simple-yet-effective-graph-distillation-via","title":"Simple yet Effective Graph Distillation via Clustering","date":"2025-05-27","arxiv_id":"2505.20807","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-self-repellent-kernels-history-driven","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","date":"2025-05-23","arxiv_id":"2505.18300","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-limits-of-graph-samplers-for-training","title":"The Limits of Graph Samplers for Training Inductive Recommender Systems: Extended results","date":"2025-05-20","arxiv_id":"2505.14241","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-graph-neural-network-inference","title":"Distributed Graph Neural Network Inference With Just-In-Time Compilation For Industry-Scale Graphs","date":"2025-03-08","arxiv_id":"2503.06208","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphbc-improving-llms-for-better-graph-data","title":"GraphSOS: Graph Sampling and Order Selection to Help LLMs Understand Graphs Better","date":"2025-01-24","arxiv_id":"2501.14427","repositories_listed":0,"syntology":null},{"url":null,"slug":"bmg-q-localized-bipartite-match-graph","title":"BMG-Q: Localized Bipartite Match Graph Attention Q-Learning for Ride-Pooling Order Dispatch","date":"2025-01-23","arxiv_id":"2501.13448","repositories_listed":0,"syntology":null},{"url":null,"slug":"physics-guided-fair-graph-sampling-for-water","title":"Physics-Guided Fair Graph Sampling for Water Temperature Prediction in River Networks","date":"2024-12-21","arxiv_id":"2412.16523","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-joint-graph-and-sampling-set","title":"Towards joint graph learning and sampling set selection from data","date":"2024-12-12","arxiv_id":"2412.09753","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-sampling-for-scalable-and-expressive","title":"Graph Sampling for Scalable and Expressive Graph Neural Networks on Homophilic Graphs","date":"2024-10-22","arxiv_id":"2410.16593","repositories_listed":0,"syntology":null},{"url":null,"slug":"gcm-net-graph-enhanced-cross-modal-infusion","title":"GCM-Net: Graph-enhanced Cross-Modal Infusion with a Metaheuristic-Driven Network for Video Sentiment and Emotion Analysis","date":"2024-10-02","arxiv_id":"2410.12828","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-graph-learning-with-adaptive","title":"Federated Graph Learning with Adaptive Importance-based Sampling","date":"2024-09-23","arxiv_id":"2409.14655","repositories_listed":0,"syntology":null},{"url":null,"slug":"bearing-fault-diagnosis-using-graph-sampling","title":"Bearing Fault Diagnosis using Graph Sampling and Aggregation Network","date":"2024-08-12","arxiv_id":"2408.07099","repositories_listed":0,"syntology":null},{"url":null,"slug":"unveiling-privacy-vulnerabilities","title":"Unveiling Privacy Vulnerabilities: Investigating the Role of Structure in Graph Data","date":"2024-07-26","arxiv_id":"2407.18564","repositories_listed":0,"syntology":null},{"url":null,"slug":"edge-sampling-of-graphs-graph-signal","title":"Edge Sampling of Graphs: Graph Signal Processing Approach With Edge Smoothness","date":"2024-07-14","arxiv_id":"2407.10149","repositories_listed":0,"syntology":null},{"url":null,"slug":"light-weight-end-to-end-graph-interest","title":"Light-weight End-to-End Graph Interest Network for CTR Prediction in E-commerce Search","date":"2024-06-25","arxiv_id":"2406.17745","repositories_listed":0,"syntology":null},{"url":null,"slug":"diskgnn-bridging-i-o-efficiency-and-model","title":"DiskGNN: Bridging I/O Efficiency and Model Accuracy for Out-of-Core GNN Training","date":"2024-05-08","arxiv_id":"2405.05231","repositories_listed":0,"syntology":null},{"url":null,"slug":"glisp-a-scalable-gnn-learning-system-by","title":"GLISP: A Scalable GNN Learning System by Exploiting Inherent Structural Properties of Graphs","date":"2024-01-06","arxiv_id":"2401.03114","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-poincare-inequality-and-consistency-results","title":"A Poincaré Inequality and Consistency Results for Signal Sampling on Large Graphs","date":"2023-11-17","arxiv_id":"2311.10610","repositories_listed":0,"syntology":null},{"url":null,"slug":"classification-of-developmental-and-brain","title":"Classification of developmental and brain disorders via graph convolutional aggregation","date":"2023-11-13","arxiv_id":"2311.07370","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpretable-fine-tuning-for-graph-neural","title":"Interpretable A-posteriori Error Indication for Graph Neural Network Surrogate Models","date":"2023-11-13","arxiv_id":"2311.07548","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-network-for-stress-predictions","title":"Graph Neural Network for Stress Predictions in Stiffened Panels Under Uniform Loading","date":"2023-09-22","arxiv_id":"2309.13022","repositories_listed":0,"syntology":null},{"url":null,"slug":"gdm-dual-mixup-for-graph-classification-with","title":"GDM: Dual Mixup for Graph Classification with Limited Supervision","date":"2023-09-18","arxiv_id":"2309.10134","repositories_listed":0,"syntology":null},{"url":null,"slug":"impression-informed-multi-behavior","title":"Impression-Informed Multi-Behavior Recommender System: A Hierarchical Graph Attention Approach","date":"2023-09-06","arxiv_id":"2309.03169","repositories_listed":0,"syntology":null},{"url":null,"slug":"stgin-spatial-temporal-graph-interaction","title":"STGIN: Spatial-Temporal Graph Interaction Network for Large-scale POI Recommendation","date":"2023-09-05","arxiv_id":"2309.02251","repositories_listed":0,"syntology":null},{"url":null,"slug":"syngraphy-succinct-summarisation-of-large","title":"SynGraphy: Succinct Summarisation of Large Networks via Small Synthetic Representative Graphs","date":"2023-02-15","arxiv_id":"2302.07755","repositories_listed":0,"syntology":null},{"url":null,"slug":"md-gcn-a-multi-scale-temporal-dual-graph","title":"MD-GCN: A Multi-Scale Temporal Dual Graph Convolution Network for Traffic Flow Prediction","date":"2023-01-11","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-sensor-placement-based-on-graph","title":"Dynamic Sensor Placement Based on Sampling Theory for Graph Signals","date":"2022-11-08","arxiv_id":"2211.04019","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-directed-graph-sampling-via","title":"Efficient Directed Graph Sampling via Gershgorin Disc Alignment","date":"2022-10-25","arxiv_id":"2210.14263","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-sampling-for-node-embedding","title":"Graph sampling for node embedding","date":"2022-10-19","arxiv_id":"2210.10520","repositories_listed":0,"syntology":null},{"url":null,"slug":"sampling-for-network-function-learning","title":"Sampling for network function learning","date":"2022-09-11","arxiv_id":"2209.07342","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-signed-graph-sampling-via-balancing","title":"Efficient Signed Graph Sampling via Balancing & Gershgorin Disc Perfect Alignment","date":"2022-08-18","arxiv_id":"2208.08726","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-copying-a-random-graph-model-for","title":"Node Copying: A Random Graph Model for Effective Graph Sampling","date":"2022-08-04","arxiv_id":"2208.02435","repositories_listed":0,"syntology":null},{"url":null,"slug":"neuro-symbolic-causal-language-planning-with","title":"Neuro-Symbolic Procedural Planning with Commonsense Prompting","date":"2022-06-06","arxiv_id":"2206.02928","repositories_listed":0,"syntology":null},{"url":null,"slug":"neighborhood-random-walk-graph-sampling-for","title":"Neighborhood Random Walk Graph Sampling for Regularized Bayesian Graph Convolutional Neural Networks","date":"2021-12-14","arxiv_id":"2112.07743","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-large-scale-network-embedding-from","title":"Learning Large-scale Network Embedding from Representative Subgraph","date":"2021-12-02","arxiv_id":"2112.01442","repositories_listed":0,"syntology":null},{"url":null,"slug":"fedgraph-federated-graph-learning-with","title":"FedGraph: Federated Graph Learning with Intelligent Sampling","date":"2021-11-02","arxiv_id":"2111.01370","repositories_listed":0,"syntology":null},{"url":null,"slug":"gophormer-ego-graph-transformer-for-node","title":"Gophormer: Ego-Graph Transformer for Node Classification","date":"2021-10-25","arxiv_id":"2110.13094","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-graph-sampling-for-short-video","title":"Fast Graph Sampling for Short Video Summarization using Gershgorin Disc Alignment","date":"2021-10-21","arxiv_id":"2110.11420","repositories_listed":0,"syntology":null},{"url":null,"slug":"scaffold-induced-molecular-graph-simg","title":"Scaffold-Induced Molecular Graph (SIMG): Effective Graph Sampling Methods for High-Throughput Computational Drug Discovery","date":"2021-09-10","arxiv_id":"2109.05012","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-structure-learning-and-sampling-of","title":"Bayesian structure learning and sampling of Bayesian networks with the R package BiDAG","date":"2021-05-02","arxiv_id":"2105.00488","repositories_listed":0,"syntology":null},{"url":null,"slug":"point-cloud-sampling-via-graph-balancing-and","title":"Point Cloud Sampling via Graph Balancing and Gershgorin Disc Alignment","date":"2021-03-10","arxiv_id":"2103.06153","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-parameters-for-balanced-index","title":"Learning Parameters for Balanced Index Influence Maximization","date":"2020-12-15","arxiv_id":"2012.08067","repositories_listed":0,"syntology":null},{"url":null,"slug":"text-graph-transformer-for-document","title":"Text Graph Transformer for Document Classification","date":"2020-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":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","repositories_listed":0,"syntology":null},{"url":null,"slug":"folded-graph-signals-sensing-with-unlimited","title":"Folded Graph Signals: Sensing with Unlimited Dynamic Range","date":"2020-01-20","arxiv_id":"1903.03741","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphbgs-background-subtraction-via-recovery","title":"GraphBGS: Background Subtraction via Recovery of Graph Signals","date":"2020-01-17","arxiv_id":"2001.06404","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-sampling-for-matrix-completion-using","title":"Graph Sampling for Matrix Completion Using Recurrent Gershgorin Disc Shift","date":"2019-10-16","arxiv_id":"1906.01087","repositories_listed":0,"syntology":null},{"url":null,"slug":"reconstruction-cognizant-graph-sampling-using","title":"Reconstruction-Cognizant Graph Sampling using Gershgorin Disc Alignment","date":"2019-02-16","arxiv_id":"1811.03206","repositories_listed":0,"syntology":null},{"url":null,"slug":"counting-motifs-with-graph-sampling","title":"Counting Motifs with Graph Sampling","date":"2018-02-21","arxiv_id":"1802.07773","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-graph-signal-processing-algorithms","title":"Adaptive Graph Signal Processing: Algorithms and Optimal Sampling Strategies","date":"2017-09-12","arxiv_id":"1709.03726","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-learning-of-morphology-with","title":"Unsupervised Learning of Morphology with Graph Sampling","date":"2017-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-sampling-theory-perspective-of-graph-based","title":"A Sampling Theory Perspective of Graph-based Semi-supervised Learning","date":"2017-05-26","arxiv_id":"1705.09518","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-graph-signal-processing-for","title":"Evaluating Graph Signal Processing for Neuroimaging Through Classification and Dimensionality Reduction","date":"2017-03-06","arxiv_id":"1703.01842","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-sampling-with-determinantal-processes","title":"Graph sampling with determinantal processes","date":"2017-03-05","arxiv_id":"1703.01594","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-least-mean-squares-estimation-of","title":"Adaptive Least Mean Squares Estimation of Graph Signals","date":"2016-02-18","arxiv_id":"1602.05703","repositories_listed":0,"syntology":null}],"syntology_records":11,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":11,"papers_where_code_ran_first_page":"/task/graph-sampling/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":2,"url":"/task/graph-sampling/papers/2","json":"/task/graph-sampling/papers/2.json","rows":1},{"order":"ran","page":1,"of":1,"url":"/task/graph-sampling/papers/ran/1","json":"/task/graph-sampling/papers/ran/1.json","rows":11}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"57972b2dcb5f32721b63b84919a4a05b19761848870d4b545c1248e0fcf2b042","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}