{"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/scheduling/papers/ran/2","list_of":"/task/scheduling","task":"Scheduling","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":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,107],"of":107,"counts":{"archive_papers_tagged":3104,"with_a_code_link":574,"where_syntology_ran_a_sample":107,"not_listed_spam_title":0,"listed":3104,"listed_where_code_ran":107,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":94,"every_run_a_failure_of_syntologys_instrument":13,"listed_with_a_run_with_no_instrument_failure":94,"listed_every_run_a_failure_of_syntologys_instrument":13,"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/scheduling/papers/ran/1","prev":"/task/scheduling/papers/ran/1","next":null,"papers":[{"url":"/paper/online-planner-selection-with-graph-neural","slug":"online-planner-selection-with-graph-neural","title":"Online Planner Selection with Graph Neural Networks and Adaptive Scheduling","date":"2018-11-01","arxiv_id":"1811.00210","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/online-planner-selection-with-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1811.00210","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.00210"}},"official":{"repos":["IBM/IPC-graph-data","matenure/GNN_planner"],"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":["official"]}}},{"url":"/paper/learning-scheduling-algorithms-for-data","slug":"learning-scheduling-algorithms-for-data","title":"Learning Scheduling Algorithms for Data Processing Clusters","date":"2018-10-03","arxiv_id":"1810.01963","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/learning-scheduling-algorithms-for-data#ran","syntology_url":"https://syntology.ai/paper/1810.01963","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.01963"}},"official":{"repos":["hongzimao/decima-sim"],"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/tiramisu-a-polyhedral-compiler-for-expressing","slug":"tiramisu-a-polyhedral-compiler-for-expressing","title":"Tiramisu: A Polyhedral Compiler for Expressing Fast and Portable Code","date":"2018-04-27","arxiv_id":"1804.10694","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/tiramisu-a-polyhedral-compiler-for-expressing#ran","syntology_url":"https://syntology.ai/paper/1804.10694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.10694"}},"official":null}},{"url":"/paper/learning-by-playing-solving-sparse-reward","slug":"learning-by-playing-solving-sparse-reward","title":"Learning by Playing - Solving Sparse Reward Tasks from Scratch","date":"2018-02-28","arxiv_id":"1802.10567","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"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) · 2 unverified","sample_list":"/paper/learning-by-playing-solving-sparse-reward#ran","syntology_url":"https://syntology.ai/paper/1802.10567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.10567"}},"official":{"repos":["hu-po/pySACQ"],"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/task-based-end-to-end-model-learning-in","slug":"task-based-end-to-end-model-learning-in","title":"Task-based End-to-end Model Learning in Stochastic Optimization","date":"2017-03-13","arxiv_id":"1703.04529","repositories_listed":1,"syntology":{"n":18,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/task-based-end-to-end-model-learning-in#ran","syntology_url":"https://syntology.ai/paper/1703.04529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04529"}},"official":{"repos":["locuslab/e2e-model-learning"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-gradient-descent-better","slug":"learning-gradient-descent-better","title":"Learning Gradient Descent: Better Generalization and Longer Horizons","date":"2017-03-10","arxiv_id":"1703.03633","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":0,"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/learning-gradient-descent-better#ran","syntology_url":"https://syntology.ai/paper/1703.03633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.03633"}},"official":{"repos":["vfleaking/rnnprop"],"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/endonet-a-deep-architecture-for-recognition","slug":"endonet-a-deep-architecture-for-recognition","title":"EndoNet: A Deep Architecture for Recognition Tasks on Laparoscopic Videos","date":"2016-02-09","arxiv_id":"1602.03012","repositories_listed":9,"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":0,"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/endonet-a-deep-architecture-for-recognition#ran","syntology_url":"https://syntology.ai/paper/1602.03012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.03012"}},"official":null}}],"record_sha256":"928475934130239952d20e922528847872ece58faa614051c31cbe0eebba8caf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}