{"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/2048/papers/ran/1","list_of":"/task/2048","task":"Playing the Game of 2048","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,7],"of":7,"counts":{"archive_papers_tagged":57,"with_a_code_link":26,"where_syntology_ran_a_sample":7,"not_listed_spam_title":0,"listed":57,"listed_where_code_ran":7,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":7,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":7,"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"},"first_page":"/task/2048/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/pfgm-unlocking-the-potential-of-physics","slug":"pfgm-unlocking-the-potential-of-physics","title":"PFGM++: Unlocking the Potential of Physics-Inspired Generative Models","date":"2023-02-08","arxiv_id":"2302.04265","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pfgm-unlocking-the-potential-of-physics#ran","syntology_url":"https://syntology.ai/paper/2302.04265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.04265"}},"official":{"repos":["newbeeer/pfgmpp"],"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","unlocated"]}}},{"url":"/paper/parallel-context-windows-improve-in-context","slug":"parallel-context-windows-improve-in-context","title":"Parallel Context Windows for Large Language Models","date":"2022-12-21","arxiv_id":"2212.10947","repositories_listed":1,"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/parallel-context-windows-improve-in-context#ran","syntology_url":"https://syntology.ai/paper/2212.10947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.10947"}},"official":{"repos":["AI21Labs/Parallel-Context-Windows"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-human-pose-estimation-via-3d-event","slug":"efficient-human-pose-estimation-via-3d-event","title":"Efficient Human Pose Estimation via 3D Event Point Cloud","date":"2022-06-09","arxiv_id":"2206.04511","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"7 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/efficient-human-pose-estimation-via-3d-event#ran","syntology_url":"https://syntology.ai/paper/2206.04511","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04511"}},"official":{"repos":["masterhow/eventpointpose"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/train-short-test-long-attention-with-linear","slug":"train-short-test-long-attention-with-linear","title":"Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolation","date":"2021-08-27","arxiv_id":"2108.12409","repositories_listed":10,"syntology":{"n":16,"n_ran":16,"n_constructed":6,"n_ran_checked":14,"n_instrument":2,"n_unverified":0,"n_honours":4,"n_violates":0,"n_no_contract":10,"n_pointer_only":5,"phrase":"16 ran (of which 6 constructed an object rather than computing a result; 14 with no instrument failure: 4 honoured, 0 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/train-short-test-long-attention-with-linear#ran","syntology_url":"https://syntology.ai/paper/2108.12409","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.12409"}},"official":{"repos":["ofirpress/attention_with_linear_biases"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/long-short-term-transformer-for-online-action","slug":"long-short-term-transformer-for-online-action","title":"Long Short-Term Transformer for Online Action Detection","date":"2021-07-07","arxiv_id":"2107.03377","repositories_listed":2,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 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","sample_list":"/paper/long-short-term-transformer-for-online-action#ran","syntology_url":"https://syntology.ai/paper/2107.03377","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.03377"}},"official":{"repos":["amazon-research/long-short-term-transformer"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/gspmd-general-and-scalable-parallelization","slug":"gspmd-general-and-scalable-parallelization","title":"GSPMD: General and Scalable Parallelization for ML Computation Graphs","date":"2021-05-10","arxiv_id":"2105.04663","repositories_listed":4,"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/gspmd-general-and-scalable-parallelization#ran","syntology_url":"https://syntology.ai/paper/2105.04663","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.04663"}},"official":null}},{"url":"/paper/gshard-scaling-giant-models-with-conditional","slug":"gshard-scaling-giant-models-with-conditional","title":"GShard: Scaling Giant Models with Conditional Computation and Automatic Sharding","date":"2020-06-30","arxiv_id":"2006.16668","repositories_listed":2,"syntology":{"n":10,"n_ran":9,"n_constructed":2,"n_ran_checked":4,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":1,"phrase":"9 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gshard-scaling-giant-models-with-conditional#ran","syntology_url":"https://syntology.ai/paper/2006.16668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16668"}},"official":null}}],"record_sha256":"d57909be1deb2b6e5149e21723029afb67f75723abd696e83d96c83bedfc8029","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}