{"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","name":"Playing the Game of 2048","slug":"2048","description_markdown":null,"categories":[{"name":"Playing Games","url":"/area/playing-games"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":57,"papers_with_code":26,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"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":1,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/2048-on-2048","slug":"2048-on-2048","dataset":"The Game of 2048","dataset_url":"/dataset/2048","rows_in_archive":5,"metrics":["Average Score"],"first_row_in_archive_order":{"model":"Stochastic Muzero","paper_title":"Planning in Stochastic Environments with a Learned Model","paper_url":"/paper/planning-in-stochastic-environments-with-a","paper_date":"2021-09-29","arxiv_id":null,"code_links":[{"title":"opendilab/LightZero","url":"https://github.com/opendilab/LightZero"},{"title":"DHDev0/Stochastic-muzero","url":"https://github.com/DHDev0/Stochastic-muzero"}],"syntology":null}}],"datasets":[{"url":"/dataset/2048","name":"The Game of 2048","full_name":"","num_papers_in_archive":2}],"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":57,"of":57,"of_with_code":26,"tagged_in_all":57,"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"},"items":[{"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":13,"n_instrument":3,"n_unverified":0,"n_honours":4,"n_violates":0,"n_no_contract":9,"n_pointer_only":5,"phrase":"16 ran (of which 6 constructed an object rather than computing a result; 13 with no instrument failure: 4 honoured, 0 violated, 9 with no contract checked; 3 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":3,"n_unverified":0,"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/mastering-2048-with-delayed-temporal","slug":"mastering-2048-with-delayed-temporal","title":"Mastering 2048 with Delayed Temporal Coherence Learning, Multi-Stage Weight Promotion, Redundant Encoding and Carousel Shaping","date":"2016-04-18","arxiv_id":"1604.05085","repositories_listed":4,"syntology":null},{"url":"/paper/planning-in-stochastic-environments-with-a","slug":"planning-in-stochastic-environments-with-a","title":"Planning in Stochastic Environments with a Learned Model","date":"2021-09-29","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/spatial-separated-curve-rendering-network-for","slug":"spatial-separated-curve-rendering-network-for","title":"Spatial-Separated Curve Rendering Network for Efficient and High-Resolution Image Harmonization","date":"2021-09-13","arxiv_id":"2109.05750","repositories_listed":2,"syntology":null},{"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/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}},{"url":"/paper/perceptual-similarity-for-measuring-decision","slug":"perceptual-similarity-for-measuring-decision","title":"Perceptual Similarity for Measuring Decision-Making Style and Policy Diversity in Games","date":"2024-08-12","arxiv_id":"2408.06051","repositories_listed":1,"syntology":null},{"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/on-reinforcement-learning-for-the-game-of","slug":"on-reinforcement-learning-for-the-game-of","title":"On Reinforcement Learning for the Game of 2048","date":"2022-12-21","arxiv_id":"2212.11087","repositories_listed":1,"syntology":null},{"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/pavementscapes-a-large-scale-hierarchical","slug":"pavementscapes-a-large-scale-hierarchical","title":"Pavementscapes: a large-scale hierarchical image dataset for asphalt pavement damage segmentation","date":"2022-07-24","arxiv_id":"2208.00775","repositories_listed":1,"syntology":null},{"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/characterizing-the-efficiency-vs-accuracy","slug":"characterizing-the-efficiency-vs-accuracy","title":"Characterizing the Efficiency vs. Accuracy Trade-off for Long-Context NLP Models","date":"2022-04-15","arxiv_id":"2204.07288","repositories_listed":1,"syntology":null},{"url":"/paper/reconstruction-of-perceived-images-from-fmri","slug":"reconstruction-of-perceived-images-from-fmri","title":"Reconstruction of Perceived Images from fMRI Patterns and Semantic Brain Exploration using Instance-Conditioned GANs","date":"2022-02-25","arxiv_id":"2202.12692","repositories_listed":1,"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":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/reconstruction-of-perceived-images-from-fmri#ran","syntology_url":"https://syntology.ai/paper/2202.12692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.12692"}},"official":{"repos":["ozcelikfu/ic-gan_fmri_reconstruction"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/optimistic-temporal-difference-learning-for","slug":"optimistic-temporal-difference-learning-for","title":"Optimistic Temporal Difference Learning for 2048","date":"2021-11-22","arxiv_id":"2111.11090","repositories_listed":1,"syntology":null},{"url":"/paper/playing-2048-with-reinforcement-learning","slug":"playing-2048-with-reinforcement-learning","title":"Playing 2048 With Reinforcement Learning","date":"2021-10-20","arxiv_id":"2110.10374","repositories_listed":1,"syntology":null},{"url":"/paper/faster-person-re-identification","slug":"faster-person-re-identification","title":"Faster Person Re-Identification","date":"2020-08-16","arxiv_id":"2008.06826","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-512-tokens-siamese-multi-depth","slug":"beyond-512-tokens-siamese-multi-depth","title":"Beyond 512 Tokens: Siamese Multi-depth Transformer-based Hierarchical Encoder for Long-Form Document Matching","date":"2020-04-26","arxiv_id":"2004.12297","repositories_listed":1,"syntology":null},{"url":"/paper/mg-wfbp-merging-gradients-wisely-for","slug":"mg-wfbp-merging-gradients-wisely-for","title":"MG-WFBP: Merging Gradients Wisely for Efficient Communication in Distributed Deep Learning","date":"2019-12-18","arxiv_id":"1912.09268","repositories_listed":1,"syntology":null},{"url":"/paper/scaling-distributed-training-of-flood-filling","slug":"scaling-distributed-training-of-flood-filling","title":"Scaling Distributed Training of Flood-Filling Networks on HPC Infrastructure for Brain Mapping","date":"2019-05-13","arxiv_id":"1905.06236","repositories_listed":1,"syntology":null},{"url":"/paper/decoder-tailored-polar-code-design-using-the","slug":"decoder-tailored-polar-code-design-using-the","title":"Decoder-tailored Polar Code Design Using the Genetic Algorithm","date":"2019-01-28","arxiv_id":"1901.10464","repositories_listed":1,"syntology":null},{"url":"/paper/genetic-algorithm-based-polar-code","slug":"genetic-algorithm-based-polar-code","title":"Genetic Algorithm-based Polar Code Construction for the AWGN Channel","date":"2019-01-19","arxiv_id":"1901.06444","repositories_listed":1,"syntology":null},{"url":"/paper/improving-electron-micrograph-signal-to-noise","slug":"improving-electron-micrograph-signal-to-noise","title":"Improving Electron Micrograph Signal-to-Noise with an Atrous Convolutional Encoder-Decoder","date":"2018-07-30","arxiv_id":"1807.11234","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-deep-reinforcement-learning-learn","slug":"distributed-deep-reinforcement-learning-learn","title":"Distributed Deep Reinforcement Learning: Learn how to play Atari games in 21 minutes","date":"2018-01-09","arxiv_id":"1801.02852","repositories_listed":1,"syntology":null},{"url":"/paper/imagenet-training-in-minutes","slug":"imagenet-training-in-minutes","title":"ImageNet Training in Minutes","date":"2017-09-14","arxiv_id":"1709.05011","repositories_listed":1,"syntology":null},{"url":null,"slug":"rapid-person-re-identification-via-sub-space","title":"Rapid Person Re-Identification via Sub-space Consistency Regularization","date":"2022-07-13","arxiv_id":"2207.05933","repositories_listed":0,"syntology":null},{"url":null,"slug":"you-can-t-count-on-luck-why-decision","title":"You Can't Count on Luck: Why Decision Transformers and RvS Fail in Stochastic Environments","date":"2022-05-31","arxiv_id":"2205.15967","repositories_listed":0,"syntology":null},{"url":null,"slug":"pathways-asynchronous-distributed-dataflow","title":"Pathways: Asynchronous Distributed Dataflow for ML","date":"2022-03-23","arxiv_id":"2203.12533","repositories_listed":0,"syntology":null},{"url":null,"slug":"open-access-to-orbit-and-runaway-space-debris","title":"The Economics of Orbit Use: Open Access, External Costs, and Runaway Debris Growth","date":"2022-02-12","arxiv_id":"2202.07442","repositories_listed":0,"syntology":null},{"url":null,"slug":"dvhn-a-deep-hashing-framework-for-large-scale","title":"DVHN: A Deep Hashing Framework for Large-scale Vehicle Re-identification","date":"2021-12-09","arxiv_id":"2112.04937","repositories_listed":0,"syntology":null},{"url":null,"slug":"why-out-of-distribution-detection-in-cnns","title":"Why Out-of-distribution Detection in CNNs Does Not Like Mahalanobis -- and What to Use Instead","date":"2021-10-13","arxiv_id":"2110.07043","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-reverse-image-search-engine-for","title":"Scalable Reverse Image Search Engine for NASAWorldview","date":"2021-08-10","arxiv_id":"2108.04479","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-markov-random-field-inference","title":"Accelerating Markov Random Field Inference with Uncertainty Quantification","date":"2021-08-02","arxiv_id":"2108.00570","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-sparse-expert-models-and-beyond","title":"M6-T: Exploring Sparse Expert Models and Beyond","date":"2021-05-31","arxiv_id":"2105.15082","repositories_listed":0,"syntology":null},{"url":null,"slug":"objective-based-hierarchical-clustering-of","title":"Objective-Based Hierarchical Clustering of Deep Embedding Vectors","date":"2020-12-15","arxiv_id":"2012.08466","repositories_listed":0,"syntology":null},{"url":null,"slug":"83-imagenet-accuracy-in-one-hour","title":"Training EfficientNets at Supercomputer Scale: 83% ImageNet Top-1 Accuracy in One Hour","date":"2020-10-30","arxiv_id":"2011.00071","repositories_listed":0,"syntology":null},{"url":null,"slug":"dense-dual-path-network-for-real-time","title":"Dense Dual-Path Network for Real-time Semantic Segmentation","date":"2020-10-21","arxiv_id":"2010.10778","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-investigation-of-feature-selection-and","title":"An Investigation of Feature Selection and Transfer Learning for Writer-Independent Offline Handwritten Signature Verification","date":"2020-10-19","arxiv_id":"2010.10025","repositories_listed":0,"syntology":null},{"url":null,"slug":"lanns-a-web-scale-approximate-nearest","title":"LANNS: A Web-Scale Approximate Nearest Neighbor Lookup System","date":"2020-10-19","arxiv_id":"2010.09426","repositories_listed":0,"syntology":null},{"url":null,"slug":"interference-cancellation-based-channel","title":"Interference Cancellation Based Channel Estimation for Massive MIMO Systems with Time Shifted Pilots","date":"2020-06-25","arxiv_id":"2006.14508","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-bpso-based-feature-selection","title":"Improving BPSO-based feature selection applied to offline WI handwritten signature verification through overfitting control","date":"2020-04-07","arxiv_id":"2004.03373","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-video-semantic-segmentation-with","title":"Efficient Video Semantic Segmentation with Labels Propagation and Refinement","date":"2019-12-26","arxiv_id":"1912.11844","repositories_listed":0,"syntology":null},{"url":null,"slug":"real-time-semantic-segmentation-via-multiply","title":"Real-Time Semantic Segmentation via Multiply Spatial Fusion Network","date":"2019-11-17","arxiv_id":"1911.07217","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hardware-efficient-admm-based-svm-training","title":"A Hardware-Efficient ADMM-Based SVM Training Algorithm for Edge Computing","date":"2019-07-23","arxiv_id":"1907.09916","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-sampling-from-nondirected","title":"Towards Sampling from Nondirected Probabilistic Graphical models using a D-Wave Quantum Annealer","date":"2019-05-01","arxiv_id":"1905.00159","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-interpretable-machine-vision-approach-to","title":"An Interpretable Machine Vision Approach to Human Activity Recognition using Photoplethysmograph Sensor Data","date":"2018-12-03","arxiv_id":"1812.00668","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hitchhikers-guide-on-distributed-training","title":"A Hitchhiker's Guide On Distributed Training of Deep Neural Networks","date":"2018-10-28","arxiv_id":"1810.11787","repositories_listed":0,"syntology":null},{"url":null,"slug":"highly-scalable-deep-learning-training-system","title":"Highly Scalable Deep Learning Training System with Mixed-Precision: Training ImageNet in Four Minutes","date":"2018-07-30","arxiv_id":"1807.11205","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-affective-robot-companion-for-assisting","title":"An Affective Robot Companion for Assisting the Elderly in a Cognitive Game Scenario","date":"2018-07-12","arxiv_id":"1807.09825","repositories_listed":0,"syntology":null},{"url":null,"slug":"seeded-ising-model-and-statistical-natures-of","title":"Seeded Ising Model and Statistical Natures of Human Iris Templates","date":"2018-01-03","arxiv_id":"1802.02223","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-word-embeddings-from-the-portuguese","title":"Learning Word Embeddings from the Portuguese Twitter Stream: A Study of some Practical Aspects","date":"2017-09-04","arxiv_id":"1709.00947","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-node-selection-for-deep-neural","title":"Automatic Node Selection for Deep Neural Networks using Group Lasso Regularization","date":"2016-11-17","arxiv_id":"1611.05527","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-stage-temporal-difference-learning-for","title":"Multi-Stage Temporal Difference Learning for 2048-like Games","date":"2016-06-23","arxiv_id":"1606.07374","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-memorize-a-random-60-bit-string","title":"How to Memorize a Random 60-Bit String","date":"2015-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-parallel-algorithm-for-exact-bayesian","title":"A Parallel Algorithm for Exact Bayesian Structure Discovery in Bayesian Networks","date":"2014-08-07","arxiv_id":"1408.1664","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-efficient-and-exact-map-inference-for","title":"Towards Efficient and Exact MAP-Inference for Large Scale Discrete Computer Vision Problems via Combinatorial Optimization","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":8,"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":7,"papers_where_code_ran_first_page":"/task/2048/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/2048/papers/ran/1","json":"/task/2048/papers/ran/1.json","rows":7}],"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":"5271119c7480bd8635e73a2d31fa2518b39dbc209feefbca7e567ff4cbb81bed","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}