{"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/rubik-s-cube","name":"Rubik's Cube","slug":"rubik-s-cube","description_markdown":"Solving the Rubik's Cube is a pathfinding task on a massive implicit graph.","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":37,"papers_with_code":17,"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":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"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":1,"rows_per_page":100,"shown":37,"of":37,"of_with_code":17,"tagged_in_all":37,"counts":{"archive_papers_tagged":37,"with_a_code_link":17,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":37,"listed_where_code_ran":3,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":3,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":3,"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"},"items":[{"url":"/paper/model-rubik-s-cube-twisting-resolution-depth","slug":"model-rubik-s-cube-twisting-resolution-depth","title":"Model Rubik's Cube: Twisting Resolution, Depth and Width for TinyNets","date":"2020-10-28","arxiv_id":"2010.14819","repositories_listed":9,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/model-rubik-s-cube-twisting-resolution-depth#ran","syntology_url":"https://syntology.ai/paper/2010.14819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.14819"}},"official":{"repos":["huawei-noah/CV-backbones","huawei-noah/ghostnet"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/solving-the-rubiks-cube-without-human","slug":"solving-the-rubiks-cube-without-human","title":"Solving the Rubik's Cube Without Human Knowledge","date":"2018-05-18","arxiv_id":"1805.07470","repositories_listed":9,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/solving-the-rubiks-cube-without-human#ran","syntology_url":"https://syntology.ai/paper/1805.07470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.07470"}},"official":null}},{"url":"/paper/a-practical-method-for-constructing","slug":"a-practical-method-for-constructing","title":"A Practical Method for Constructing Equivariant Multilayer Perceptrons for Arbitrary Matrix Groups","date":"2021-04-19","arxiv_id":"2104.09459","repositories_listed":4,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"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) · 1 unverified","sample_list":"/paper/a-practical-method-for-constructing#ran","syntology_url":"https://syntology.ai/paper/2104.09459","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.09459"}},"official":{"repos":["mfinzi/equivariant-MLP"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/levin-tree-search-with-context-models","slug":"levin-tree-search-with-context-models","title":"Levin Tree Search with Context Models","date":"2023-05-26","arxiv_id":"2305.16945","repositories_listed":2,"syntology":null},{"url":"/paper/solving-rubiks-cube-with-a-robot-hand","slug":"solving-rubiks-cube-with-a-robot-hand","title":"Solving Rubik's Cube with a Robot Hand","date":"2019-10-16","arxiv_id":"1910.07113","repositories_listed":2,"syntology":null},{"url":"/paper/a-machine-learning-approach-that-beats-large","slug":"a-machine-learning-approach-that-beats-large","title":"A Machine Learning Approach That Beats Large Rubik's Cubes","date":"2025-02-18","arxiv_id":"2502.13266","repositories_listed":1,"syntology":null},{"url":"/paper/wormhole-memory-a-rubik-s-cube-for-cross","slug":"wormhole-memory-a-rubik-s-cube-for-cross","title":"Wormhole Memory: A Rubik's Cube for Cross-Dialogue Retrieval","date":"2025-01-24","arxiv_id":"2501.14846","repositories_listed":1,"syntology":null},{"url":"/paper/learning-discrete-world-models-for-heuristic","slug":"learning-discrete-world-models-for-heuristic","title":"Learning Discrete World Models for Heuristic Search","date":"2024-09-14","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/flow-of-reasoning-efficient-training-of-llm","slug":"flow-of-reasoning-efficient-training-of-llm","title":"Flow of Reasoning:Training LLMs for Divergent Problem Solving with Minimal Examples","date":"2024-06-09","arxiv_id":"2406.05673","repositories_listed":1,"syntology":{"n":15,"n_ran":11,"n_constructed":0,"n_ran_checked":4,"n_instrument":7,"n_unverified":4,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 7 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/flow-of-reasoning-efficient-training-of-llm#ran","syntology_url":"https://syntology.ai/paper/2406.05673","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.05673"}},"official":{"repos":["yu-fangxu/for"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/a-rubik-s-cube-inspired-approach-to-clifford","slug":"a-rubik-s-cube-inspired-approach-to-clifford","title":"A Rubik's Cube inspired approach to Clifford synthesis","date":"2023-07-17","arxiv_id":"2307.08684","repositories_listed":1,"syntology":null},{"url":"/paper/learning-symmetric-rules-with-satnet","slug":"learning-symmetric-rules-with-satnet","title":"Learning Symmetric Rules with SATNet","date":"2022-06-28","arxiv_id":"2206.13998","repositories_listed":1,"syntology":null},{"url":"/paper/fast-and-precise-adjusting-planning-horizon","slug":"fast-and-precise-adjusting-planning-horizon","title":"Fast and Precise: Adjusting Planning Horizon with Adaptive Subgoal Search","date":"2022-06-01","arxiv_id":"2206.00702","repositories_listed":1,"syntology":null},{"url":"/paper/alphazero-inspired-general-board-game","slug":"alphazero-inspired-general-board-game","title":"AlphaZero-Inspired Game Learning: Faster Training by Using MCTS Only at Test Time","date":"2022-04-28","arxiv_id":"2204.13307","repositories_listed":1,"syntology":null},{"url":"/paper/subgoal-search-for-complex-reasoning-tasks","slug":"subgoal-search-for-complex-reasoning-tasks","title":"Subgoal Search For Complex Reasoning Tasks","date":"2021-08-25","arxiv_id":"2108.11204","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-rubik-s-cube-solver","slug":"self-supervised-rubik-s-cube-solver","title":"Self-Supervision is All You Need for Solving Rubik's Cube","date":"2021-06-06","arxiv_id":"2106.03157","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-visual-patterns-in-projected-human","slug":"exploring-visual-patterns-in-projected-human","title":"ProjectionPathExplorer: Exploring Visual Patterns in Projected Decision-Making Paths","date":"2020-01-20","arxiv_id":"2001.08372","repositories_listed":1,"syntology":null},{"url":"/paper/color-recognition-for-rubiks-cube-robot","slug":"color-recognition-for-rubiks-cube-robot","title":"Color Recognition for Rubik's Cube Robot","date":"2019-01-11","arxiv_id":"1901.03470","repositories_listed":1,"syntology":null},{"url":null,"slug":"cuberobot-grounding-language-in-rubik-s-cube","title":"CubeRobot: Grounding Language in Rubik's Cube Manipulation via Vision-Language Model","date":"2025-03-25","arxiv_id":"2503.19281","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffusion-models-for-cayley-graphs","title":"Diffusion Models for Cayley Graphs","date":"2025-03-07","arxiv_id":"2503.05558","repositories_listed":0,"syntology":null},{"url":null,"slug":"precise-gps-denied-uav-self-positioning-via","title":"Precise GPS-Denied UAV Self-Positioning via Context-Enhanced Cross-View Geo-Localization","date":"2025-02-17","arxiv_id":"2502.11408","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-classification-and-search-on-the-rubik-s","title":"Node Classification and Search on the Rubik's Cube Graph with GNNs","date":"2025-01-30","arxiv_id":"2501.18580","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-rubik-s-cube-without-tricky-sampling","title":"Solving Rubik's Cube Without Tricky Sampling","date":"2024-11-29","arxiv_id":"2411.19583","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-a-rubik-s-cube-using-its-local-graph","title":"Solving a Rubik's Cube Using its Local Graph Structure","date":"2024-08-15","arxiv_id":"2408.07945","repositories_listed":0,"syntology":null},{"url":null,"slug":"trust-and-ethical-considerations-in-a-multi","title":"Trust and ethical considerations in a multi-modal, explainable AI-driven chatbot tutoring system: The case of collaboratively solving Rubik's Cube","date":"2024-01-30","arxiv_id":"2402.01760","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-solving-the-rubik-s-cube-with-domain","title":"On Solving the Rubik's Cube with Domain-Independent Planners Using Standard Representations","date":"2023-07-25","arxiv_id":"2307.13552","repositories_listed":0,"syntology":null},{"url":null,"slug":"rubik-s-optical-neural-networks-multi-task","title":"Rubik's Optical Neural Networks: Multi-task Learning with Physics-aware Rotation Architecture","date":"2023-04-25","arxiv_id":"2304.12985","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-learning-rubik-s-cube-with-n-tuple","title":"Towards Learning Rubik's Cube with N-tuple-based Reinforcement Learning","date":"2023-01-28","arxiv_id":"2301.12167","repositories_listed":0,"syntology":null},{"url":null,"slug":"rubik-s-cube-operator-a-plug-and-play","title":"Rubik's Cube Operator: A Plug And Play Permutation Module for Better Arranging High Dimensional Industrial Data in Deep Convolutional Processes","date":"2022-03-24","arxiv_id":"2203.12921","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-for-image","title":"Graph Neural Networks for Image Classification and Reinforcement Learning using Graph representations","date":"2022-03-07","arxiv_id":"2203.03457","repositories_listed":0,"syntology":null},{"url":null,"slug":"benchmarking-robot-manipulation-with-the","title":"Benchmarking Robot Manipulation with the Rubik's Cube","date":"2022-02-14","arxiv_id":"2202.07074","repositories_listed":0,"syntology":null},{"url":null,"slug":"cubetr-learning-to-solve-the-rubik-s-cube","title":"CubeTR: Learning to Solve the Rubik's Cube using Transformers","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"puzzle-solving-without-search-or-human","title":"Puzzle Solving without Search or Human Knowledge: An Unnatural Language Approach","date":"2021-09-07","arxiv_id":"2109.02797","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-search-without-expansions-learning","title":"A* Search Without Expansions: Learning Heuristic Functions with Deep Q-Networks","date":"2021-02-08","arxiv_id":"2102.04518","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-rubik-s-cube-self-supervised","title":"Revisiting Rubik's Cube: Self-supervised Learning with Volume-wise Transformation for 3D Medical Image Segmentation","date":"2020-07-17","arxiv_id":"2007.08826","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-feature-learning-for-3d","title":"Self-supervised Feature Learning for 3D Medical Images by Playing a Rubik's Cube","date":"2019-10-05","arxiv_id":"1910.02241","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-the-rubiks-cube-with-approximate","title":"Solving the Rubik's Cube with Approximate Policy Iteration","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sub-optimal-multi-phase-path-planning-a","title":"Sub-Optimal Multi-Phase Path Planning: A Method for Solving Rubik's Revenge","date":"2016-01-20","arxiv_id":"1601.05744","repositories_listed":0,"syntology":null}],"syntology_records":4,"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":3,"papers_where_code_ran_first_page":"/task/rubik-s-cube/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":"ran","page":1,"of":1,"url":"/task/rubik-s-cube/papers/ran/1","json":"/task/rubik-s-cube/papers/ran/1.json","rows":3}],"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":"94d4c550cbe03bb069b72963c7fe39bbb57eda81777750c789457c2a0749febe","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}