{"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/papers/ran/1","list_of":"/task/graph-sampling","task":"Graph Sampling","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":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,11],"of":11,"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"},"first_page":"/task/graph-sampling/papers/ran/1","prev":null,"next":null,"papers":[{"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/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":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"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-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":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/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/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/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/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/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":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 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/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":11,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":3,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 0 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":11,"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"]}}}],"record_sha256":"3729b94691cd518e965e2395cb0fdb1b7e932dd7381c36b8a40d0cdb7b7a2dbe","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}