{"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/decision-making","name":"Decision Making","slug":"decision-making","description_markdown":null,"categories":[{"name":"Methodology","url":"/area/methodology"},{"name":"Reasoning","url":"/area/reasoning"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":12311,"papers_with_code":2946,"benchmarks":2,"benchmark_tables_in_archive":2,"benchmark_tables_shown":2,"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":40,"subtasks":1,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/decision-making-on-01-01-1967","slug":"decision-making-on-01-01-1967","dataset":"./01/01/1967","dataset_url":null,"rows_in_archive":1,"metrics":["0..5sec"],"first_row_in_archive_order":{"model":"topais","paper_title":"Strategic Evaluation in Optimizing the Internal Supply Chain Using TOPSIS: Evidence In A Coil Winding Machine Manufacturer","paper_url":"/paper/strategic-evaluation-in-optimizing-the","paper_date":"2020-07-08","arxiv_id":"2007.10121","code_links":[{"title":"hcshipra/researchpublication","url":"https://github.com/hcshipra/researchpublication"}],"syntology":null}},{"leaderboard":"/sota/decision-making-on-nasa-c-mapss","slug":"decision-making-on-nasa-c-mapss","dataset":"NASA C-MAPSS","dataset_url":"/dataset/nasa-c-mapss","rows_in_archive":1,"metrics":["Average Remaining Cycles"],"first_row_in_archive_order":{"model":"SRLA","paper_title":"Hierarchical Framework for Interpretable and Probabilistic Model-Based Safe Reinforcement Learning","paper_url":"/paper/hierarchical-framework-for-interpretable-and","paper_date":"2023-10-28","arxiv_id":"2310.18811","code_links":[{"title":"ammar-n-abbas/Predictive-Maintenance-BC-IOHMM-DRL","url":"https://github.com/ammar-n-abbas/Predictive-Maintenance-BC-IOHMM-DRL"}],"syntology":null}}],"datasets":[{"url":"/dataset/d4rl","name":"D4RL","full_name":"D4RL","num_papers_in_archive":538},{"url":"/dataset/charades-sta","name":"Charades-STA","full_name":"","num_papers_in_archive":236},{"url":"/dataset/fairface","name":"FairFace","full_name":"","num_papers_in_archive":208},{"url":"/dataset/vizdoom","name":"VizDoom","full_name":"VizDoom","num_papers_in_archive":156},{"url":"/dataset/logiqa","name":"LogiQA","full_name":"","num_papers_in_archive":127},{"url":"/dataset/torcs","name":"TORCS","full_name":"The Open Racing Car Simulator","num_papers_in_archive":96},{"url":"/dataset/mura","name":"MURA","full_name":"","num_papers_in_archive":43},{"url":"/dataset/sharc","name":"ShARC","full_name":"Shaping Answers with Rules through Conversation","num_papers_in_archive":43},{"url":"/dataset/peerread","name":"PeerRead","full_name":"","num_papers_in_archive":42},{"url":"/dataset/coaid","name":"CoAID","full_name":"","num_papers_in_archive":41},{"url":"/dataset/gazefollow","name":"GazeFollow","full_name":"GazeFollow","num_papers_in_archive":38},{"url":"/dataset/robonet","name":"RoboNet","full_name":"","num_papers_in_archive":28},{"url":"/dataset/evidence-inference","name":"Evidence Inference","full_name":"","num_papers_in_archive":27},{"url":"/dataset/road","name":"ROAD","full_name":"ROAD: The ROad event Awareness Dataset for Autonomous Driving","num_papers_in_archive":27},{"url":"/dataset/senticap","name":"SentiCap","full_name":"","num_papers_in_archive":26},{"url":"/dataset/ropes","name":"ROPES","full_name":"Reasoning Over Paragraph Effects in Situations","num_papers_in_archive":24},{"url":"/dataset/obstacle-tower","name":"Obstacle Tower","full_name":"","num_papers_in_archive":20},{"url":"/dataset/industrial-benchmark","name":"Industrial Benchmark","full_name":"","num_papers_in_archive":13},{"url":"/dataset/trajnet-1","name":"TrajNet","full_name":"","num_papers_in_archive":12},{"url":"/dataset/chalet","name":"CHALET","full_name":"Cornell House Agent Learning Environment","num_papers_in_archive":10},{"url":"/dataset/atari-head","name":"Atari-HEAD","full_name":null,"num_papers_in_archive":9},{"url":"/dataset/blvd","name":"BLVD","full_name":"","num_papers_in_archive":9},{"url":"/dataset/ukp","name":"UKP","full_name":"UKP Argument Annotated Essays","num_papers_in_archive":8},{"url":"/dataset/nasa-c-mapss","name":"NASA C-MAPSS","full_name":"Turbofan Engine Degradation Simulation Data Set","num_papers_in_archive":7},{"url":"/dataset/omics","name":"OMICS","full_name":"Open Mind Indoor Common Sense","num_papers_in_archive":6},{"url":"/dataset/demcare","name":"DemCare","full_name":"","num_papers_in_archive":5},{"url":"/dataset/flickr-cropping-dataset","name":"Flickr Cropping Dataset","full_name":null,"num_papers_in_archive":5},{"url":"/dataset/golfdb","name":"GolfDB","full_name":"","num_papers_in_archive":5},{"url":"/dataset/cuhk-image-cropping","name":"CUHK Image Cropping","full_name":"CUHK Image Cropping","num_papers_in_archive":3},{"url":"/dataset/packit","name":"PackIt","full_name":"","num_papers_in_archive":3},{"url":"/dataset/covid-hera","name":"Covid-HeRA","full_name":null,"num_papers_in_archive":2},{"url":"/dataset/negotiation-dialogues-dataset","name":"Negotiation Dialogues Dataset","full_name":"","num_papers_in_archive":2},{"url":"/dataset/pubmed-pico-element-detection-dataset","name":"PubMed PICO Element Detection Dataset","full_name":null,"num_papers_in_archive":2},{"url":"/dataset/a-view-from-somewhere-avfs","name":"A View From Somewhere (AVFS)","full_name":"","num_papers_in_archive":1},{"url":"/dataset/benyfits","name":"BeNYfits","full_name":"New York City Public Benefits Eligibility Dialog Agent Benchmark","num_papers_in_archive":1},{"url":"/dataset/car-price-prediction","name":"Car_Price_Prediction","full_name":"Second_Hand-Car_Price_Prediction","num_papers_in_archive":1},{"url":"/dataset/d2city","name":"D2City","full_name":"","num_papers_in_archive":1},{"url":"/dataset/industrial-benchmark-dataset-for-customer","name":"Industrial Benchmark Dataset for Customer Escalation Prediction","full_name":"","num_papers_in_archive":1},{"url":"/dataset/pursuitmw","name":"pursuitMW","full_name":"Multi-agent pursuit in matrix world","num_papers_in_archive":1},{"url":"/dataset/spaceship-dataset","name":"Spaceship Dataset","full_name":null,"num_papers_in_archive":1}],"subtasks":[{"url":"/task/imitation-learning","name":"Imitation Learning"}],"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":124,"rows_per_page":100,"shown":100,"of":12311,"of_with_code":2946,"tagged_in_all":12311,"counts":{"archive_papers_tagged":12311,"with_a_code_link":2946,"where_syntology_ran_a_sample":678,"not_listed_spam_title":0,"listed":12311,"listed_where_code_ran":678,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":536,"every_run_a_failure_of_syntologys_instrument":142,"listed_with_a_run_with_no_instrument_failure":536,"listed_every_run_a_failure_of_syntologys_instrument":142,"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/soft-actor-critic-off-policy-maximum-entropy","slug":"soft-actor-critic-off-policy-maximum-entropy","title":"Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor","date":"2018-01-04","arxiv_id":"1801.01290","repositories_listed":86,"syntology":{"n":148,"n_ran":91,"n_constructed":61,"n_ran_checked":73,"n_instrument":18,"n_unverified":57,"n_honours":3,"n_violates":1,"n_no_contract":69,"n_pointer_only":66,"phrase":"91 ran (of which 61 constructed an object rather than computing a result; 73 with no instrument failure: 3 honoured, 1 violated, 69 with no contract checked; 18 where Syntology's instrument failed) · 57 unverified","sample_list":"/paper/soft-actor-critic-off-policy-maximum-entropy#ran","syntology_url":"https://syntology.ai/paper/1801.01290","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.01290"}},"official":{"repos":["haarnoja/sac"],"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/soft-actor-critic-algorithms-and-applications","slug":"soft-actor-critic-algorithms-and-applications","title":"Soft Actor-Critic Algorithms and Applications","date":"2018-12-13","arxiv_id":"1812.05905","repositories_listed":52,"syntology":{"n":40,"n_ran":38,"n_constructed":0,"n_ran_checked":35,"n_instrument":3,"n_unverified":2,"n_honours":4,"n_violates":1,"n_no_contract":30,"n_pointer_only":5,"phrase":"38 ran (of which 0 constructed an object rather than computing a result; 35 with no instrument failure: 4 honoured, 1 violated, 30 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/soft-actor-critic-algorithms-and-applications#ran","syntology_url":"https://syntology.ai/paper/1812.05905","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.05905"}},"official":{"repos":["rail-berkeley/softlearning"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/relational-inductive-biases-deep-learning-and","slug":"relational-inductive-biases-deep-learning-and","title":"Relational inductive biases, deep learning, and graph networks","date":"2018-06-04","arxiv_id":"1806.01261","repositories_listed":31,"syntology":{"n":51,"n_ran":39,"n_constructed":5,"n_ran_checked":38,"n_instrument":1,"n_unverified":12,"n_honours":4,"n_violates":0,"n_no_contract":34,"n_pointer_only":15,"phrase":"39 ran (of which 5 constructed an object rather than computing a result; 38 with no instrument failure: 4 honoured, 0 violated, 34 with no contract checked; 1 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/relational-inductive-biases-deep-learning-and#ran","syntology_url":"https://syntology.ai/paper/1806.01261","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.01261"}},"official":{"repos":["deepmind/graph_nets"],"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/bayesian-segnet-model-uncertainty-in-deep","slug":"bayesian-segnet-model-uncertainty-in-deep","title":"Bayesian SegNet: Model Uncertainty in Deep Convolutional Encoder-Decoder Architectures for Scene Understanding","date":"2015-11-09","arxiv_id":"1511.02680","repositories_listed":21,"syntology":{"n":18,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":12,"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) · 12 unverified","sample_list":"/paper/bayesian-segnet-model-uncertainty-in-deep#ran","syntology_url":"https://syntology.ai/paper/1511.02680","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.02680"}},"official":null}},{"url":"/paper/tabnet-attentive-interpretable-tabular","slug":"tabnet-attentive-interpretable-tabular","title":"TabNet: Attentive Interpretable Tabular Learning","date":"2019-08-20","arxiv_id":"1908.07442","repositories_listed":19,"syntology":{"n":17,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":1,"phrase":"13 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/tabnet-attentive-interpretable-tabular#ran","syntology_url":"https://syntology.ai/paper/1908.07442","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.07442"}},"official":{"repos":["google-research/google-research"],"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/ai-fairness-360-an-extensible-toolkit-for","slug":"ai-fairness-360-an-extensible-toolkit-for","title":"AI Fairness 360: An Extensible Toolkit for Detecting, Understanding, and Mitigating Unwanted Algorithmic Bias","date":"2018-10-03","arxiv_id":"1810.01943","repositories_listed":13,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ai-fairness-360-an-extensible-toolkit-for#ran","syntology_url":"https://syntology.ai/paper/1810.01943","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.01943"}},"official":{"repos":["IBM/AIF360"],"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":["listed","official"]}}},{"url":"/paper/graphcast-learning-skillful-medium-range","slug":"graphcast-learning-skillful-medium-range","title":"GraphCast: Learning skillful medium-range global weather forecasting","date":"2022-12-24","arxiv_id":"2212.12794","repositories_listed":11,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"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: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graphcast-learning-skillful-medium-range#ran","syntology_url":"https://syntology.ai/paper/2212.12794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.12794"}},"official":{"repos":["deepmind/graphcast"],"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/react-synergizing-reasoning-and-acting-in","slug":"react-synergizing-reasoning-and-acting-in","title":"ReAct: Synergizing Reasoning and Acting in Language Models","date":"2022-10-06","arxiv_id":"2210.03629","repositories_listed":9,"syntology":{"n":34,"n_ran":15,"n_constructed":9,"n_ran_checked":10,"n_instrument":5,"n_unverified":19,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":6,"phrase":"15 ran (of which 9 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 5 where Syntology's instrument failed) · 19 unverified","sample_list":"/paper/react-synergizing-reasoning-and-acting-in#ran","syntology_url":"https://syntology.ai/paper/2210.03629","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.03629"}},"official":{"repos":["ysymyth/ReAct"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/score-camimproved-visual-explanations-via","slug":"score-camimproved-visual-explanations-via","title":"Score-CAM: Score-Weighted Visual Explanations for Convolutional Neural Networks","date":"2019-10-03","arxiv_id":"1910.01279","repositories_listed":9,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"9 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; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/score-camimproved-visual-explanations-via#ran","syntology_url":"https://syntology.ai/paper/1910.01279","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.01279"}},"official":{"repos":["haofanwang/Score-CAM"],"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":["listed","official"]}}},{"url":"/paper/a-probabilistic-u-net-for-segmentation-of","slug":"a-probabilistic-u-net-for-segmentation-of","title":"A Probabilistic U-Net for Segmentation of Ambiguous Images","date":"2018-06-13","arxiv_id":"1806.05034","repositories_listed":9,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":2,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 1 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-probabilistic-u-net-for-segmentation-of#ran","syntology_url":"https://syntology.ai/paper/1806.05034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.05034"}},"official":{"repos":["SimonKohl/probabilistic_unet"],"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/neural-additive-models-interpretable-machine","slug":"neural-additive-models-interpretable-machine","title":"Neural Additive Models: Interpretable Machine Learning with Neural Nets","date":"2020-04-29","arxiv_id":"2004.13912","repositories_listed":8,"syntology":{"n":33,"n_ran":26,"n_constructed":14,"n_ran_checked":26,"n_instrument":0,"n_unverified":7,"n_honours":5,"n_violates":0,"n_no_contract":21,"n_pointer_only":14,"phrase":"26 ran (of which 14 constructed an object rather than computing a result; 26 with no instrument failure: 5 honoured, 0 violated, 21 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/neural-additive-models-interpretable-machine#ran","syntology_url":"https://syntology.ai/paper/2004.13912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13912"}},"official":{"repos":["lemeln/nam"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/mastering-diverse-domains-through-world","slug":"mastering-diverse-domains-through-world","title":"Mastering Diverse Domains through World Models","date":"2023-01-10","arxiv_id":"2301.04104","repositories_listed":7,"syntology":{"n":34,"n_ran":21,"n_constructed":0,"n_ran_checked":16,"n_instrument":5,"n_unverified":13,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 5 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/mastering-diverse-domains-through-world#ran","syntology_url":"https://syntology.ai/paper/2301.04104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.04104"}},"official":{"repos":["danijar/dreamerv3"],"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/the-kits19-challenge-data-300-kidney-tumor","slug":"the-kits19-challenge-data-300-kidney-tumor","title":"The KiTS19 Challenge Data: 300 Kidney Tumor Cases with Clinical Context, CT Semantic Segmentations, and Surgical Outcomes","date":"2019-03-31","arxiv_id":"1904.00445","repositories_listed":7,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/the-kits19-challenge-data-300-kidney-tumor#ran","syntology_url":"https://syntology.ai/paper/1904.00445","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.00445"}},"official":{"repos":["neheller/kits19"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/brain-tumor-segmentation-and-radiomics","slug":"brain-tumor-segmentation-and-radiomics","title":"Brain Tumor Segmentation and Radiomics Survival Prediction: Contribution to the BRATS 2017 Challenge","date":"2018-02-28","arxiv_id":"1802.10508","repositories_listed":7,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/brain-tumor-segmentation-and-radiomics#ran","syntology_url":"https://syntology.ai/paper/1802.10508","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.10508"}},"official":null}},{"url":"/paper/learning-robust-rewards-with-adversarial","slug":"learning-robust-rewards-with-adversarial","title":"Learning Robust Rewards with Adversarial Inverse Reinforcement Learning","date":"2017-10-30","arxiv_id":"1710.11248","repositories_listed":7,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"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) · 3 unverified","sample_list":"/paper/learning-robust-rewards-with-adversarial#ran","syntology_url":"https://syntology.ai/paper/1710.11248","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.11248"}},"official":null}},{"url":"/paper/tree-of-thoughts-deliberate-problem-solving-1","slug":"tree-of-thoughts-deliberate-problem-solving-1","title":"Tree of Thoughts: Deliberate Problem Solving with Large Language Models","date":"2023-05-17","arxiv_id":"2305.10601","repositories_listed":6,"syntology":{"n":24,"n_ran":19,"n_constructed":6,"n_ran_checked":17,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":1,"phrase":"19 ran (of which 6 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/tree-of-thoughts-deliberate-problem-solving-1#ran","syntology_url":"https://syntology.ai/paper/2305.10601","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.10601"}},"official":{"repos":["princeton-nlp/tree-of-thought-llm","ysymyth/tree-of-thought-llm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["community","listed","official"]}}},{"url":"/paper/a-comprehensive-analysis-of-ai-biases-in","slug":"a-comprehensive-analysis-of-ai-biases-in","title":"Analyzing Fairness in Deepfake Detection With Massively Annotated Databases","date":"2022-08-11","arxiv_id":"2208.05845","repositories_listed":6,"syntology":null},{"url":"/paper/qplex-duplex-dueling-multi-agent-q-learning","slug":"qplex-duplex-dueling-multi-agent-q-learning","title":"QPLEX: Duplex Dueling Multi-Agent Q-Learning","date":"2020-08-03","arxiv_id":"2008.01062","repositories_listed":6,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"4 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/qplex-duplex-dueling-multi-agent-q-learning#ran","syntology_url":"https://syntology.ai/paper/2008.01062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.01062"}},"official":{"repos":["wjh720/QPLEX"],"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/motion-planning-among-dynamic-decision-making","slug":"motion-planning-among-dynamic-decision-making","title":"Motion Planning Among Dynamic, Decision-Making Agents with Deep Reinforcement Learning","date":"2018-05-04","arxiv_id":"1805.01956","repositories_listed":6,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/motion-planning-among-dynamic-decision-making#ran","syntology_url":"https://syntology.ai/paper/1805.01956","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.01956"}},"official":{"repos":["mfe7/cadrl_ros"],"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/quicknat-a-fully-convolutional-network-for","slug":"quicknat-a-fully-convolutional-network-for","title":"QuickNAT: A Fully Convolutional Network for Quick and Accurate Segmentation of Neuroanatomy","date":"2018-01-12","arxiv_id":"1801.04161","repositories_listed":6,"syntology":null},{"url":"/paper/deep-reinforcement-learning-for-unsupervised","slug":"deep-reinforcement-learning-for-unsupervised","title":"Deep Reinforcement Learning for Unsupervised Video Summarization with Diversity-Representativeness Reward","date":"2017-12-29","arxiv_id":"1801.00054","repositories_listed":6,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-reinforcement-learning-for-unsupervised#ran","syntology_url":"https://syntology.ai/paper/1801.00054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.00054"}},"official":{"repos":["KaiyangZhou/vsumm-reinforce"],"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/deep-q-learning-from-demonstrations","slug":"deep-q-learning-from-demonstrations","title":"Deep Q-learning from Demonstrations","date":"2017-04-12","arxiv_id":"1704.03732","repositories_listed":6,"syntology":null},{"url":"/paper/reflexion-language-agents-with-verbal","slug":"reflexion-language-agents-with-verbal","title":"Reflexion: Language Agents with Verbal Reinforcement Learning","date":"2023-03-20","arxiv_id":"2303.11366","repositories_listed":5,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"8 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/reflexion-language-agents-with-verbal#ran","syntology_url":"https://syntology.ai/paper/2303.11366","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.11366"}},"official":{"repos":["noahshinn024/reflexion"],"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/neur2sp-neural-two-stage-stochastic","slug":"neur2sp-neural-two-stage-stochastic","title":"Neur2SP: Neural Two-Stage Stochastic Programming","date":"2022-05-20","arxiv_id":"2205.12006","repositories_listed":5,"syntology":{"n":10,"n_ran":5,"n_constructed":2,"n_ran_checked":3,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":10,"phrase":"5 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/neur2sp-neural-two-stage-stochastic#ran","syntology_url":"https://syntology.ai/paper/2205.12006","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12006"}},"official":{"repos":["khalil-research/neur2sp"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/safe-learning-in-robotics-from-learning-based","slug":"safe-learning-in-robotics-from-learning-based","title":"Safe Learning in Robotics: From Learning-Based Control to Safe Reinforcement Learning","date":"2021-08-13","arxiv_id":"2108.06266","repositories_listed":5,"syntology":null},{"url":"/paper/iq-learn-inverse-soft-q-learning-for","slug":"iq-learn-inverse-soft-q-learning-for","title":"IQ-Learn: Inverse soft-Q Learning for Imitation","date":"2021-06-23","arxiv_id":"2106.12142","repositories_listed":5,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/iq-learn-inverse-soft-q-learning-for#ran","syntology_url":"https://syntology.ai/paper/2106.12142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12142"}},"official":{"repos":["Div99/IQ-Learn"],"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/an-introduction-to-deep-reinforcement","slug":"an-introduction-to-deep-reinforcement","title":"An Introduction to Deep Reinforcement Learning","date":"2018-11-30","arxiv_id":"1811.12560","repositories_listed":5,"syntology":null},{"url":"/paper/deep-reinforcement-learning-based","slug":"deep-reinforcement-learning-based","title":"Deep Reinforcement Learning based Recommendation with Explicit User-Item Interactions Modeling","date":"2018-10-29","arxiv_id":"1810.12027","repositories_listed":5,"syntology":null},{"url":"/paper/medsts-a-resource-for-clinical-semantic","slug":"medsts-a-resource-for-clinical-semantic","title":"MedSTS: A Resource for Clinical Semantic Textual Similarity","date":"2018-08-28","arxiv_id":"1808.09397","repositories_listed":5,"syntology":null},{"url":"/paper/txagent-an-ai-agent-for-therapeutic-reasoning","slug":"txagent-an-ai-agent-for-therapeutic-reasoning","title":"TxAgent: An AI Agent for Therapeutic Reasoning Across a Universe of Tools","date":"2025-03-14","arxiv_id":"2503.10970","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/txagent-an-ai-agent-for-therapeutic-reasoning#ran","syntology_url":"https://syntology.ai/paper/2503.10970","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.10970"}},"official":{"repos":["mims-harvard/ToolUniverse","mims-harvard/TxAgent","huggingface.co/mims-harvard/ToolRAG-T1-GTE-Qwen2-1.5B","huggingface.co/mims-harvard/TxAgent-T1-Llama-3.1-8B"],"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/rethinking-early-stopping-refine-then","slug":"rethinking-early-stopping-refine-then","title":"Rethinking Early Stopping: Refine, Then Calibrate","date":"2025-01-31","arxiv_id":"2501.19195","repositories_listed":4,"syntology":null},{"url":"/paper/a-corpus-of-german-citizen-contributions-in","slug":"a-corpus-of-german-citizen-contributions-in","title":"A Corpus of German Citizen Contributions in Mobility Planning: Supporting Evaluation Through Multidimensional Classification","date":"2022-06-01","arxiv_id":null,"repositories_listed":4,"syntology":null},{"url":"/paper/polis-scaling-deliberation-by-mapping-high","slug":"polis-scaling-deliberation-by-mapping-high","title":"Polis: Scaling Deliberation by Mapping High Dimensional Opinion Spaces","date":"2021-07-22","arxiv_id":null,"repositories_listed":4,"syntology":null},{"url":"/paper/beyond-trivial-counterfactual-explanations","slug":"beyond-trivial-counterfactual-explanations","title":"Beyond Trivial Counterfactual Explanations with Diverse Valuable Explanations","date":"2021-03-18","arxiv_id":"2103.10226","repositories_listed":4,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":9,"phrase":"6 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; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/beyond-trivial-counterfactual-explanations#ran","syntology_url":"https://syntology.ai/paper/2103.10226","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.10226"}},"official":{"repos":["ElementAI/beyond-trivial-explanations"],"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/formation-control-for-multiple-connected-and","slug":"formation-control-for-multiple-connected-and","title":"Formation Control for Connected and Automated Vehicles on Multi-lane Roads: Relative Motion Planning and Conflict Resolution","date":"2021-03-18","arxiv_id":"2103.10287","repositories_listed":4,"syntology":null},{"url":"/paper/genetic-programming-approaches-to-learning","slug":"genetic-programming-approaches-to-learning","title":"Genetic programming approaches to learning fair classifiers","date":"2020-04-28","arxiv_id":"2004.13282","repositories_listed":4,"syntology":null},{"url":"/paper/restricting-the-flow-information-bottlenecks-1","slug":"restricting-the-flow-information-bottlenecks-1","title":"Restricting the Flow: Information Bottlenecks for Attribution","date":"2020-01-02","arxiv_id":"2001.00396","repositories_listed":4,"syntology":{"n":16,"n_ran":10,"n_constructed":4,"n_ran_checked":7,"n_instrument":3,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":7,"phrase":"10 ran (of which 4 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/restricting-the-flow-information-bottlenecks-1#ran","syntology_url":"https://syntology.ai/paper/2001.00396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.00396"}},"official":{"repos":["BioroboticsLab/IBA","BioroboticsLab/IBA-paper-code","attribution-bottleneck/attribution-bottleneck-pytorch"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":4,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/integrated-multi-omics-analysis-using","slug":"integrated-multi-omics-analysis-using","title":"Integrated Multi-omics Analysis Using Variational Autoencoders: Application to Pan-cancer Classification","date":"2019-08-17","arxiv_id":"1908.06278","repositories_listed":4,"syntology":null},{"url":"/paper/deep-neuroevolution-of-recurrent-and-discrete","slug":"deep-neuroevolution-of-recurrent-and-discrete","title":"Deep Neuroevolution of Recurrent and Discrete World Models","date":"2019-04-28","arxiv_id":"1906.08857","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-neuroevolution-of-recurrent-and-discrete#ran","syntology_url":"https://syntology.ai/paper/1906.08857","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.08857"}},"official":{"repos":["sebastianrisi/ga-world-models"],"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/attention-based-prototypical-learning-towards","slug":"attention-based-prototypical-learning-towards","title":"ProtoAttend: Attention-Based Prototypical Learning","date":"2019-02-17","arxiv_id":"1902.06292","repositories_listed":4,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/attention-based-prototypical-learning-towards#ran","syntology_url":"https://syntology.ai/paper/1902.06292","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.06292"}},"official":null}},{"url":"/paper/graph-convolutional-reinforcement-learning","slug":"graph-convolutional-reinforcement-learning","title":"Graph Convolutional Reinforcement Learning","date":"2018-10-22","arxiv_id":"1810.09202","repositories_listed":4,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/graph-convolutional-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/1810.09202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.09202"}},"official":{"repos":["PKU-AI-Edge/DGN"],"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/deep-bayesian-bandits-showdown-an-empirical","slug":"deep-bayesian-bandits-showdown-an-empirical","title":"Deep Bayesian Bandits Showdown: An Empirical Comparison of Bayesian Deep Networks for Thompson Sampling","date":"2018-02-26","arxiv_id":"1802.09127","repositories_listed":4,"syntology":null},{"url":"/paper/learning-multi-level-hierarchies-with","slug":"learning-multi-level-hierarchies-with","title":"Learning Multi-Level Hierarchies with Hindsight","date":"2017-12-04","arxiv_id":"1712.00948","repositories_listed":4,"syntology":null},{"url":"/paper/counterfactual-explanations-without-opening","slug":"counterfactual-explanations-without-opening","title":"Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPR","date":"2017-11-01","arxiv_id":"1711.00399","repositories_listed":4,"syntology":null},{"url":"/paper/thinking-fast-and-slow-with-deep-learning-and","slug":"thinking-fast-and-slow-with-deep-learning-and","title":"Thinking Fast and Slow with Deep Learning and Tree Search","date":"2017-05-23","arxiv_id":"1705.08439","repositories_listed":4,"syntology":null},{"url":"/paper/literature-meets-data-a-synergistic-approach","slug":"literature-meets-data-a-synergistic-approach","title":"Literature Meets Data: A Synergistic Approach to Hypothesis Generation","date":"2024-10-22","arxiv_id":"2410.17309","repositories_listed":3,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/literature-meets-data-a-synergistic-approach#ran","syntology_url":"https://syntology.ai/paper/2410.17309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.17309"}},"official":{"repos":["chicagohai/hypothesis-generation"],"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":["listed","official"]}}},{"url":"/paper/embodied-agent-interface-benchmarking-llms","slug":"embodied-agent-interface-benchmarking-llms","title":"Embodied Agent Interface: Benchmarking LLMs for Embodied Decision Making","date":"2024-10-09","arxiv_id":"2410.07166","repositories_listed":3,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"7 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/embodied-agent-interface-benchmarking-llms#ran","syntology_url":"https://syntology.ai/paper/2410.07166","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.07166"}},"official":{"repos":["embodied-agent-eval/embodied-agent-eval","embodied-agent-interface/embodied-agent-interface","embodied-agent-eval/embodied-agent-eval.github.io"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/diffusion-forcing-next-token-prediction-meets","slug":"diffusion-forcing-next-token-prediction-meets","title":"Diffusion Forcing: Next-token Prediction Meets Full-Sequence Diffusion","date":"2024-07-01","arxiv_id":"2407.01392","repositories_listed":3,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":2,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 2 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/diffusion-forcing-next-token-prediction-meets#ran","syntology_url":"https://syntology.ai/paper/2407.01392","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.01392"}},"official":{"repos":["buoyancy99/diffusion-forcing"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/cleandiffuser-an-easy-to-use-modularized","slug":"cleandiffuser-an-easy-to-use-modularized","title":"CleanDiffuser: An Easy-to-use Modularized Library for Diffusion Models in Decision Making","date":"2024-06-13","arxiv_id":"2406.09509","repositories_listed":3,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"8 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/cleandiffuser-an-easy-to-use-modularized#ran","syntology_url":"https://syntology.ai/paper/2406.09509","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09509"}},"official":{"repos":["cleandiffuserteam/cleandiffuser"],"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":["listed","official"]}}},{"url":"/paper/analyzing-the-impact-of-data-selection-and","slug":"analyzing-the-impact-of-data-selection-and","title":"PoliTune: Analyzing the Impact of Data Selection and Fine-Tuning on Economic and Political Biases in Large Language Models","date":"2024-04-10","arxiv_id":"2404.08699","repositories_listed":3,"syntology":null},{"url":"/paper/better-than-classical-the-subtle-art-of","slug":"better-than-classical-the-subtle-art-of","title":"Better than classical? The subtle art of benchmarking quantum machine learning models","date":"2024-03-11","arxiv_id":"2403.07059","repositories_listed":3,"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":0,"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/better-than-classical-the-subtle-art-of#ran","syntology_url":"https://syntology.ai/paper/2403.07059","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.07059"}},"official":{"repos":["xanaduai/qml-benchmarks"],"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":["listed","official"]}}},{"url":"/paper/gencast-diffusion-based-ensemble-forecasting","slug":"gencast-diffusion-based-ensemble-forecasting","title":"GenCast: Diffusion-based ensemble forecasting for medium-range weather","date":"2023-12-25","arxiv_id":"2312.15796","repositories_listed":3,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":3,"n_no_contract":3,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 2 honoured, 3 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gencast-diffusion-based-ensemble-forecasting#ran","syntology_url":"https://syntology.ai/paper/2312.15796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.15796"}},"official":null}},{"url":"/paper/navigating-the-synthetic-realm-harnessing","slug":"navigating-the-synthetic-realm-harnessing","title":"Navigating the Synthetic Realm: Harnessing Diffusion-based Models for Laparoscopic Text-to-Image Generation","date":"2023-12-05","arxiv_id":"2312.03043","repositories_listed":3,"syntology":null},{"url":"/paper/ehrxqa-a-multi-modal-question-answering-1","slug":"ehrxqa-a-multi-modal-question-answering-1","title":"EHRXQA: A Multi-Modal Question Answering Dataset for Electronic Health Records with Chest X-ray Images","date":"2023-10-28","arxiv_id":"2310.18652","repositories_listed":3,"syntology":{"n":20,"n_ran":20,"n_constructed":0,"n_ran_checked":17,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":0,"phrase":"20 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ehrxqa-a-multi-modal-question-answering-1#ran","syntology_url":"https://syntology.ai/paper/2310.18652","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18652"}},"official":{"repos":["baeseongsu/ehrxqa","baeseongsu/mimic-cxr-vqa"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/autogen-enabling-next-gen-llm-applications","slug":"autogen-enabling-next-gen-llm-applications","title":"AutoGen: Enabling Next-Gen LLM Applications via Multi-Agent Conversation","date":"2023-08-16","arxiv_id":"2308.08155","repositories_listed":3,"syntology":{"n":8,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":8,"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) · 7 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/autogen-enabling-next-gen-llm-applications#ran","syntology_url":"https://syntology.ai/paper/2308.08155","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08155"}},"official":null}},{"url":"/paper/explanations-as-features-llm-based-features","slug":"explanations-as-features-llm-based-features","title":"Harnessing Explanations: LLM-to-LM Interpreter for Enhanced Text-Attributed Graph Representation Learning","date":"2023-05-31","arxiv_id":"2305.19523","repositories_listed":3,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/explanations-as-features-llm-based-features#ran","syntology_url":"https://syntology.ai/paper/2305.19523","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19523"}},"official":{"repos":["XiaoxinHe/TAPE","xiaoxinhe/tape_arxiv_2023"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hierarchical-prompting-assists-large-language","slug":"hierarchical-prompting-assists-large-language","title":"Hierarchical Prompting Assists Large Language Model on Web Navigation","date":"2023-05-23","arxiv_id":"2305.14257","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"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; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hierarchical-prompting-assists-large-language#ran","syntology_url":"https://syntology.ai/paper/2305.14257","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14257"}},"official":{"repos":["robert1003/ash-prompting"],"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/training-diffusion-models-with-reinforcement","slug":"training-diffusion-models-with-reinforcement","title":"Training Diffusion Models with Reinforcement Learning","date":"2023-05-22","arxiv_id":"2305.13301","repositories_listed":3,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/training-diffusion-models-with-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2305.13301","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.13301"}},"official":{"repos":["kvablack/ddpo-pytorch"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/agieval-a-human-centric-benchmark-for","slug":"agieval-a-human-centric-benchmark-for","title":"AGIEval: A Human-Centric Benchmark for Evaluating Foundation Models","date":"2023-04-13","arxiv_id":"2304.06364","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/agieval-a-human-centric-benchmark-for#ran","syntology_url":"https://syntology.ai/paper/2304.06364","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.06364"}},"official":{"repos":["ruixiangcui/agieval"],"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"]}}},{"url":"/paper/hospital-length-of-stay-prediction-based-on","slug":"hospital-length-of-stay-prediction-based-on","title":"Interpretable machine learning for time-to-event prediction in medicine and healthcare","date":"2023-03-17","arxiv_id":"2303.09817","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hospital-length-of-stay-prediction-based-on#ran","syntology_url":"https://syntology.ai/paper/2303.09817","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.09817"}},"official":{"repos":["mi2datalab/xlungs-trustworthy-los-prediction","modeloriented/survex","mi2datalab/interpret-time-to-event"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/grounding-large-language-models-in","slug":"grounding-large-language-models-in","title":"Grounding Large Language Models in Interactive Environments with Online Reinforcement Learning","date":"2023-02-06","arxiv_id":"2302.02662","repositories_listed":3,"syntology":{"n":12,"n_ran":9,"n_constructed":2,"n_ran_checked":6,"n_instrument":3,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"9 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/grounding-large-language-models-in#ran","syntology_url":"https://syntology.ai/paper/2302.02662","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.02662"}},"official":{"repos":["clementromac/lamorel","flowersteam/grounding_llms_with_online_rl","flowersteam/lamorel"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":2,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-deep-learning-method-for-comparing-bayesian","slug":"a-deep-learning-method-for-comparing-bayesian","title":"A Deep Learning Method for Comparing Bayesian Hierarchical Models","date":"2023-01-27","arxiv_id":"2301.11873","repositories_listed":3,"syntology":null},{"url":"/paper/pic-score-probabilistic-interpretable","slug":"pic-score-probabilistic-interpretable","title":"PIC-Score: Probabilistic Interpretable Comparison Score for Optimal Matching Confidence in Single- and Multi-Biometric (Face) Recognition","date":"2022-11-22","arxiv_id":"2211.12483","repositories_listed":3,"syntology":null},{"url":"/paper/tapas-a-toolbox-for-adversarial-privacy","slug":"tapas-a-toolbox-for-adversarial-privacy","title":"TAPAS: a Toolbox for Adversarial Privacy Auditing of Synthetic Data","date":"2022-11-12","arxiv_id":"2211.06550","repositories_listed":3,"syntology":{"n":11,"n_ran":6,"n_constructed":1,"n_ran_checked":5,"n_instrument":1,"n_unverified":5,"n_honours":4,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"6 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 4 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/tapas-a-toolbox-for-adversarial-privacy#ran","syntology_url":"https://syntology.ai/paper/2211.06550","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.06550"}},"official":{"repos":["alan-turing-institute/privacy-sdg-toolbox"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":1,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/is-reinforcement-learning-not-for-natural","slug":"is-reinforcement-learning-not-for-natural","title":"Is Reinforcement Learning (Not) for Natural Language Processing: Benchmarks, Baselines, and Building Blocks for Natural Language Policy Optimization","date":"2022-10-03","arxiv_id":"2210.01241","repositories_listed":3,"syntology":null},{"url":"/paper/deep-lake-a-lakehouse-for-deep-learning","slug":"deep-lake-a-lakehouse-for-deep-learning","title":"Deep Lake: a Lakehouse for Deep Learning","date":"2022-09-22","arxiv_id":"2209.10785","repositories_listed":3,"syntology":null},{"url":"/paper/developing-optimal-causal-cyber-defence","slug":"developing-optimal-causal-cyber-defence","title":"Developing Optimal Causal Cyber-Defence Agents via Cyber Security Simulation","date":"2022-07-25","arxiv_id":"2207.12355","repositories_listed":3,"syntology":null},{"url":"/paper/webshop-towards-scalable-real-world-web","slug":"webshop-towards-scalable-real-world-web","title":"WebShop: Towards Scalable Real-World Web Interaction with Grounded Language Agents","date":"2022-07-04","arxiv_id":"2207.01206","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/webshop-towards-scalable-real-world-web#ran","syntology_url":"https://syntology.ai/paper/2207.01206","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.01206"}},"official":{"repos":["princeton-nlp/WebShop"],"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"]}}},{"url":"/paper/planning-with-diffusion-for-flexible-behavior","slug":"planning-with-diffusion-for-flexible-behavior","title":"Planning with Diffusion for Flexible Behavior Synthesis","date":"2022-05-20","arxiv_id":"2205.09991","repositories_listed":3,"syntology":null},{"url":"/paper/do-as-i-can-not-as-i-say-grounding-language","slug":"do-as-i-can-not-as-i-say-grounding-language","title":"Do As I Can, Not As I Say: Grounding Language in Robotic Affordances","date":"2022-04-04","arxiv_id":"2204.01691","repositories_listed":3,"syntology":null},{"url":"/paper/a-closer-look-at-advantage-filtered","slug":"a-closer-look-at-advantage-filtered","title":"A Closer Look at Advantage-Filtered Behavioral Cloning in High-Noise Datasets","date":"2021-10-10","arxiv_id":"2110.04698","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-closer-look-at-advantage-filtered#ran","syntology_url":"https://syntology.ai/paper/2110.04698","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.04698"}},"official":{"repos":["jakegrigsby/cc-afbc","jakegrigsby/deep_control","jakegrigsby/super_sac"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/pyraformer-low-complexity-pyramidal-attention","slug":"pyraformer-low-complexity-pyramidal-attention","title":"Pyraformer: Low-Complexity Pyramidal Attention for Long-Range Time Series Modeling and Forecasting","date":"2021-09-29","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/warpdrive-extremely-fast-end-to-end-deep","slug":"warpdrive-extremely-fast-end-to-end-deep","title":"WarpDrive: Extremely Fast End-to-End Deep Multi-Agent Reinforcement Learning on a GPU","date":"2021-08-31","arxiv_id":"2108.13976","repositories_listed":3,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/warpdrive-extremely-fast-end-to-end-deep#ran","syntology_url":"https://syntology.ai/paper/2108.13976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.13976"}},"official":{"repos":["salesforce/warp-drive"],"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/benchmarks-for-deep-off-policy-evaluation-1","slug":"benchmarks-for-deep-off-policy-evaluation-1","title":"Benchmarks for Deep Off-Policy Evaluation","date":"2021-03-30","arxiv_id":"2103.16596","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/benchmarks-for-deep-off-policy-evaluation-1#ran","syntology_url":"https://syntology.ai/paper/2103.16596","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16596"}},"official":{"repos":["google-research/deep_ope"],"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/road-the-road-event-awareness-dataset-for","slug":"road-the-road-event-awareness-dataset-for","title":"ROAD: The ROad event Awareness Dataset for Autonomous Driving","date":"2021-02-23","arxiv_id":"2102.11585","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/road-the-road-event-awareness-dataset-for#ran","syntology_url":"https://syntology.ai/paper/2102.11585","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11585"}},"official":{"repos":["gurkirt/3D-RetinaNet","gurkirt/road-dataset"],"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/distribution-free-risk-controlling-prediction","slug":"distribution-free-risk-controlling-prediction","title":"Distribution-Free, Risk-Controlling Prediction Sets","date":"2021-01-07","arxiv_id":"2101.02703","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":3,"n_no_contract":0,"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, 3 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/distribution-free-risk-controlling-prediction#ran","syntology_url":"https://syntology.ai/paper/2101.02703","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.02703"}},"official":{"repos":["aangelopoulos/rcps"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/visual-memorability-for-robotic","slug":"visual-memorability-for-robotic","title":"Visual Memorability for Robotic Interestingness via Unsupervised Online Learning","date":"2020-05-18","arxiv_id":"2005.08829","repositories_listed":3,"syntology":null},{"url":"/paper/neural-collaborative-reasoning","slug":"neural-collaborative-reasoning","title":"Neural Collaborative Reasoning","date":"2020-05-16","arxiv_id":"2005.08129","repositories_listed":3,"syntology":null},{"url":"/paper/offline-reinforcement-learning-tutorial","slug":"offline-reinforcement-learning-tutorial","title":"Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problems","date":"2020-05-04","arxiv_id":"2005.01643","repositories_listed":3,"syntology":null},{"url":"/paper/a-divergence-minimization-perspective-on","slug":"a-divergence-minimization-perspective-on","title":"A Divergence Minimization Perspective on Imitation Learning Methods","date":"2019-11-06","arxiv_id":"1911.02256","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/a-divergence-minimization-perspective-on#ran","syntology_url":"https://syntology.ai/paper/1911.02256","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02256"}},"official":{"repos":["KamyarGh/rl_swiss"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/collision-avoidance-in-pedestrian-rich","slug":"collision-avoidance-in-pedestrian-rich","title":"Collision Avoidance in Pedestrian-Rich Environments with Deep Reinforcement Learning","date":"2019-10-24","arxiv_id":"1910.11689","repositories_listed":3,"syntology":null},{"url":"/paper/explainable-authorship-verification-in-social","slug":"explainable-authorship-verification-in-social","title":"Explainable Authorship Verification in Social Media via Attention-based Similarity Learning","date":"2019-10-17","arxiv_id":"1910.08144","repositories_listed":3,"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":0,"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/explainable-authorship-verification-in-social#ran","syntology_url":"https://syntology.ai/paper/1910.08144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.08144"}},"official":{"repos":["rub-ksv/AdHominem"],"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/temporal-coding-in-spiking-neural-networks","slug":"temporal-coding-in-spiking-neural-networks","title":"Temporal Coding in Spiking Neural Networks with Alpha Synaptic Function: Learning with Backpropagation","date":"2019-07-30","arxiv_id":"1907.13223","repositories_listed":3,"syntology":null},{"url":"/paper/towards-realistic-individual-recourse-and","slug":"towards-realistic-individual-recourse-and","title":"Towards Realistic Individual Recourse and Actionable Explanations in Black-Box Decision Making Systems","date":"2019-07-22","arxiv_id":"1907.09615","repositories_listed":3,"syntology":null},{"url":"/paper/a-detailed-study-of-recurrent-neural-networks","slug":"a-detailed-study-of-recurrent-neural-networks","title":"Exploring weight initialization, diversity of solutions, and degradation in recurrent neural networks trained for temporal and decision-making tasks","date":"2019-06-03","arxiv_id":"1906.01094","repositories_listed":3,"syntology":null},{"url":"/paper/summit-scaling-deep-learning-interpretability","slug":"summit-scaling-deep-learning-interpretability","title":"Summit: Scaling Deep Learning Interpretability by Visualizing Activation and Attribution Summarizations","date":"2019-04-04","arxiv_id":"1904.02323","repositories_listed":3,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/summit-scaling-deep-learning-interpretability#ran","syntology_url":"https://syntology.ai/paper/1904.02323","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.02323"}},"official":{"repos":["fredhohman/summit","fredhohman/summit-data","fredhohman/summit-notebooks"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/the-regretful-agent-heuristic-aided","slug":"the-regretful-agent-heuristic-aided","title":"The Regretful Agent: Heuristic-Aided Navigation through Progress Estimation","date":"2019-03-05","arxiv_id":"1903.01602","repositories_listed":3,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/the-regretful-agent-heuristic-aided#ran","syntology_url":"https://syntology.ai/paper/1903.01602","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.01602"}},"official":{"repos":["chihyaoma/regretful-agent"],"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":["listed","official"]}}},{"url":"/paper/rethinking-action-spaces-for-reinforcement","slug":"rethinking-action-spaces-for-reinforcement","title":"Rethinking Action Spaces for Reinforcement Learning in End-to-end Dialog Agents with Latent Variable Models","date":"2019-02-23","arxiv_id":"1902.08858","repositories_listed":3,"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":0,"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/rethinking-action-spaces-for-reinforcement#ran","syntology_url":"https://syntology.ai/paper/1902.08858","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.08858"}},"official":{"repos":["snakeztc/NeuralDialog-LaRL"],"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/deep-reinforcement-learning-for-imbalanced","slug":"deep-reinforcement-learning-for-imbalanced","title":"Deep Reinforcement Learning for Imbalanced Classification","date":"2019-01-05","arxiv_id":"1901.01379","repositories_listed":3,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/deep-reinforcement-learning-for-imbalanced#ran","syntology_url":"https://syntology.ai/paper/1901.01379","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.01379"}},"official":{"repos":["linenus/DRL-For-imbalanced-Classification"],"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/attention-branch-network-learning-of","slug":"attention-branch-network-learning-of","title":"Attention Branch Network: Learning of Attention Mechanism for Visual Explanation","date":"2018-12-25","arxiv_id":"1812.10025","repositories_listed":3,"syntology":{"n":24,"n_ran":16,"n_constructed":0,"n_ran_checked":14,"n_instrument":2,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":2,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 2 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/attention-branch-network-learning-of#ran","syntology_url":"https://syntology.ai/paper/1812.10025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.10025"}},"official":{"repos":["machine-perception-robotics-group/attention_branch_network"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/please-stop-explaining-black-box-models-for","slug":"please-stop-explaining-black-box-models-for","title":"Stop Explaining Black Box Machine Learning Models for High Stakes Decisions and Use Interpretable Models Instead","date":"2018-11-26","arxiv_id":"1811.10154","repositories_listed":3,"syntology":null},{"url":"/paper/quota-the-quantile-option-architecture-for","slug":"quota-the-quantile-option-architecture-for","title":"QUOTA: The Quantile Option Architecture for Reinforcement Learning","date":"2018-11-05","arxiv_id":"1811.02073","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/quota-the-quantile-option-architecture-for#ran","syntology_url":"https://syntology.ai/paper/1811.02073","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.02073"}},"official":{"repos":["ShangtongZhang/DeepRL"],"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/actionable-recourse-in-linear-classification","slug":"actionable-recourse-in-linear-classification","title":"Actionable Recourse in Linear Classification","date":"2018-09-18","arxiv_id":"1809.06514","repositories_listed":3,"syntology":null},{"url":"/paper/bipedal-walking-robot-using-deep","slug":"bipedal-walking-robot-using-deep","title":"Bipedal Walking Robot using Deep Deterministic Policy Gradient","date":"2018-07-16","arxiv_id":"1807.05924","repositories_listed":3,"syntology":null},{"url":"/paper/interpreting-and-explaining-deep-neural","slug":"interpreting-and-explaining-deep-neural","title":"AudioMNIST: Exploring Explainable Artificial Intelligence for Audio Analysis on a Simple Benchmark","date":"2018-07-09","arxiv_id":"1807.03418","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/interpreting-and-explaining-deep-neural#ran","syntology_url":"https://syntology.ai/paper/1807.03418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.03418"}},"official":{"repos":["soerenab/AudioMNIST"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-reinforcement-learning-for-sequence-to","slug":"deep-reinforcement-learning-for-sequence-to","title":"Deep Reinforcement Learning For Sequence to Sequence Models","date":"2018-05-24","arxiv_id":"1805.09461","repositories_listed":3,"syntology":{"n":17,"n_ran":16,"n_constructed":0,"n_ran_checked":15,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":13,"n_pointer_only":2,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 2 honoured, 0 violated, 13 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-reinforcement-learning-for-sequence-to#ran","syntology_url":"https://syntology.ai/paper/1805.09461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09461"}},"official":{"repos":["yaserkl/RLSeq2Seq"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a2-rl-aesthetics-aware-reinforcement-learning","slug":"a2-rl-aesthetics-aware-reinforcement-learning","title":"A2-RL: Aesthetics Aware Reinforcement Learning for Image Cropping","date":"2017-09-14","arxiv_id":"1709.04595","repositories_listed":3,"syntology":null},{"url":"/paper/visual-interaction-networks","slug":"visual-interaction-networks","title":"Visual Interaction Networks","date":"2017-06-05","arxiv_id":"1706.01433","repositories_listed":3,"syntology":null},{"url":"/paper/an-alternative-softmax-operator-for","slug":"an-alternative-softmax-operator-for","title":"An Alternative Softmax Operator for Reinforcement Learning","date":"2016-12-16","arxiv_id":"1612.05628","repositories_listed":3,"syntology":null},{"url":"/paper/cryptocurrency-portfolio-management-with-deep","slug":"cryptocurrency-portfolio-management-with-deep","title":"Cryptocurrency Portfolio Management with Deep Reinforcement Learning","date":"2016-12-05","arxiv_id":"1612.01277","repositories_listed":3,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/cryptocurrency-portfolio-management-with-deep#ran","syntology_url":"https://syntology.ai/paper/1612.01277","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.01277"}},"official":{"repos":["ZhengyaoJiang/PGPortfolio"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}}],"syntology_records":60,"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":678,"papers_where_code_ran_first_page":"/task/decision-making/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":"archive","page":2,"of":124,"url":"/task/decision-making/papers/2","json":"/task/decision-making/papers/2.json","rows":100},{"order":"archive","page":3,"of":124,"url":"/task/decision-making/papers/3","json":"/task/decision-making/papers/3.json","rows":100},{"order":"archive","page":4,"of":124,"url":"/task/decision-making/papers/4","json":"/task/decision-making/papers/4.json","rows":100},{"order":"archive","page":5,"of":124,"url":"/task/decision-making/papers/5","json":"/task/decision-making/papers/5.json","rows":100},{"order":"archive","page":6,"of":124,"url":"/task/decision-making/papers/6","json":"/task/decision-making/papers/6.json","rows":100},{"order":"archive","page":7,"of":124,"url":"/task/decision-making/papers/7","json":"/task/decision-making/papers/7.json","rows":100},{"order":"archive","page":8,"of":124,"url":"/task/decision-making/papers/8","json":"/task/decision-making/papers/8.json","rows":100},{"order":"archive","page":9,"of":124,"url":"/task/decision-making/papers/9","json":"/task/decision-making/papers/9.json","rows":100},{"order":"archive","page":10,"of":124,"url":"/task/decision-making/papers/10","json":"/task/decision-making/papers/10.json","rows":100},{"order":"archive","page":11,"of":124,"url":"/task/decision-making/papers/11","json":"/task/decision-making/papers/11.json","rows":100},{"order":"archive","page":12,"of":124,"url":"/task/decision-making/papers/12","json":"/task/decision-making/papers/12.json","rows":100},{"order":"archive","page":13,"of":124,"url":"/task/decision-making/papers/13","json":"/task/decision-making/papers/13.json","rows":100},{"order":"archive","page":14,"of":124,"url":"/task/decision-making/papers/14","json":"/task/decision-making/papers/14.json","rows":100},{"order":"archive","page":15,"of":124,"url":"/task/decision-making/papers/15","json":"/task/decision-making/papers/15.json","rows":100},{"order":"archive","page":16,"of":124,"url":"/task/decision-making/papers/16","json":"/task/decision-making/papers/16.json","rows":100},{"order":"archive","page":17,"of":124,"url":"/task/decision-making/papers/17","json":"/task/decision-making/papers/17.json","rows":100},{"order":"archive","page":18,"of":124,"url":"/task/decision-making/papers/18","json":"/task/decision-making/papers/18.json","rows":100},{"order":"archive","page":19,"of":124,"url":"/task/decision-making/papers/19","json":"/task/decision-making/papers/19.json","rows":100},{"order":"archive","page":20,"of":124,"url":"/task/decision-making/papers/20","json":"/task/decision-making/papers/20.json","rows":100},{"order":"archive","page":21,"of":124,"url":"/task/decision-making/papers/21","json":"/task/decision-making/papers/21.json","rows":100},{"order":"archive","page":22,"of":124,"url":"/task/decision-making/papers/22","json":"/task/decision-making/papers/22.json","rows":100},{"order":"archive","page":23,"of":124,"url":"/task/decision-making/papers/23","json":"/task/decision-making/papers/23.json","rows":100},{"order":"archive","page":24,"of":124,"url":"/task/decision-making/papers/24","json":"/task/decision-making/papers/24.json","rows":100},{"order":"archive","page":25,"of":124,"url":"/task/decision-making/papers/25","json":"/task/decision-making/papers/25.json","rows":100},{"order":"archive","page":26,"of":124,"url":"/task/decision-making/papers/26","json":"/task/decision-making/papers/26.json","rows":100},{"order":"archive","page":27,"of":124,"url":"/task/decision-making/papers/27","json":"/task/decision-making/papers/27.json","rows":100},{"order":"archive","page":28,"of":124,"url":"/task/decision-making/papers/28","json":"/task/decision-making/papers/28.json","rows":100},{"order":"archive","page":29,"of":124,"url":"/task/decision-making/papers/29","json":"/task/decision-making/papers/29.json","rows":100},{"order":"archive","page":30,"of":124,"url":"/task/decision-making/papers/30","json":"/task/decision-making/papers/30.json","rows":100},{"order":"archive","page":31,"of":124,"url":"/task/decision-making/papers/31","json":"/task/decision-making/papers/31.json","rows":100},{"order":"archive","page":32,"of":124,"url":"/task/decision-making/papers/32","json":"/task/decision-making/papers/32.json","rows":100},{"order":"archive","page":33,"of":124,"url":"/task/decision-making/papers/33","json":"/task/decision-making/papers/33.json","rows":100},{"order":"archive","page":34,"of":124,"url":"/task/decision-making/papers/34","json":"/task/decision-making/papers/34.json","rows":100},{"order":"archive","page":35,"of":124,"url":"/task/decision-making/papers/35","json":"/task/decision-making/papers/35.json","rows":100},{"order":"archive","page":36,"of":124,"url":"/task/decision-making/papers/36","json":"/task/decision-making/papers/36.json","rows":100},{"order":"archive","page":37,"of":124,"url":"/task/decision-making/papers/37","json":"/task/decision-making/papers/37.json","rows":100},{"order":"archive","page":38,"of":124,"url":"/task/decision-making/papers/38","json":"/task/decision-making/papers/38.json","rows":100},{"order":"archive","page":39,"of":124,"url":"/task/decision-making/papers/39","json":"/task/decision-making/papers/39.json","rows":100},{"order":"archive","page":40,"of":124,"url":"/task/decision-making/papers/40","json":"/task/decision-making/papers/40.json","rows":100},{"order":"archive","page":41,"of":124,"url":"/task/decision-making/papers/41","json":"/task/decision-making/papers/41.json","rows":100},{"order":"archive","page":42,"of":124,"url":"/task/decision-making/papers/42","json":"/task/decision-making/papers/42.json","rows":100},{"order":"archive","page":43,"of":124,"url":"/task/decision-making/papers/43","json":"/task/decision-making/papers/43.json","rows":100},{"order":"archive","page":44,"of":124,"url":"/task/decision-making/papers/44","json":"/task/decision-making/papers/44.json","rows":100},{"order":"archive","page":45,"of":124,"url":"/task/decision-making/papers/45","json":"/task/decision-making/papers/45.json","rows":100},{"order":"archive","page":46,"of":124,"url":"/task/decision-making/papers/46","json":"/task/decision-making/papers/46.json","rows":100},{"order":"archive","page":47,"of":124,"url":"/task/decision-making/papers/47","json":"/task/decision-making/papers/47.json","rows":100},{"order":"archive","page":48,"of":124,"url":"/task/decision-making/papers/48","json":"/task/decision-making/papers/48.json","rows":100},{"order":"archive","page":49,"of":124,"url":"/task/decision-making/papers/49","json":"/task/decision-making/papers/49.json","rows":100},{"order":"archive","page":50,"of":124,"url":"/task/decision-making/papers/50","json":"/task/decision-making/papers/50.json","rows":100},{"order":"archive","page":51,"of":124,"url":"/task/decision-making/papers/51","json":"/task/decision-making/papers/51.json","rows":100},{"order":"archive","page":52,"of":124,"url":"/task/decision-making/papers/52","json":"/task/decision-making/papers/52.json","rows":100},{"order":"archive","page":53,"of":124,"url":"/task/decision-making/papers/53","json":"/task/decision-making/papers/53.json","rows":100},{"order":"archive","page":54,"of":124,"url":"/task/decision-making/papers/54","json":"/task/decision-making/papers/54.json","rows":100},{"order":"archive","page":55,"of":124,"url":"/task/decision-making/papers/55","json":"/task/decision-making/papers/55.json","rows":100},{"order":"archive","page":56,"of":124,"url":"/task/decision-making/papers/56","json":"/task/decision-making/papers/56.json","rows":100},{"order":"archive","page":57,"of":124,"url":"/task/decision-making/papers/57","json":"/task/decision-making/papers/57.json","rows":100},{"order":"archive","page":58,"of":124,"url":"/task/decision-making/papers/58","json":"/task/decision-making/papers/58.json","rows":100},{"order":"archive","page":59,"of":124,"url":"/task/decision-making/papers/59","json":"/task/decision-making/papers/59.json","rows":100},{"order":"archive","page":60,"of":124,"url":"/task/decision-making/papers/60","json":"/task/decision-making/papers/60.json","rows":100},{"order":"archive","page":61,"of":124,"url":"/task/decision-making/papers/61","json":"/task/decision-making/papers/61.json","rows":100},{"order":"archive","page":62,"of":124,"url":"/task/decision-making/papers/62","json":"/task/decision-making/papers/62.json","rows":100},{"order":"archive","page":63,"of":124,"url":"/task/decision-making/papers/63","json":"/task/decision-making/papers/63.json","rows":100},{"order":"archive","page":64,"of":124,"url":"/task/decision-making/papers/64","json":"/task/decision-making/papers/64.json","rows":100},{"order":"archive","page":65,"of":124,"url":"/task/decision-making/papers/65","json":"/task/decision-making/papers/65.json","rows":100},{"order":"archive","page":66,"of":124,"url":"/task/decision-making/papers/66","json":"/task/decision-making/papers/66.json","rows":100},{"order":"archive","page":67,"of":124,"url":"/task/decision-making/papers/67","json":"/task/decision-making/papers/67.json","rows":100},{"order":"archive","page":68,"of":124,"url":"/task/decision-making/papers/68","json":"/task/decision-making/papers/68.json","rows":100},{"order":"archive","page":69,"of":124,"url":"/task/decision-making/papers/69","json":"/task/decision-making/papers/69.json","rows":100},{"order":"archive","page":70,"of":124,"url":"/task/decision-making/papers/70","json":"/task/decision-making/papers/70.json","rows":100},{"order":"archive","page":71,"of":124,"url":"/task/decision-making/papers/71","json":"/task/decision-making/papers/71.json","rows":100},{"order":"archive","page":72,"of":124,"url":"/task/decision-making/papers/72","json":"/task/decision-making/papers/72.json","rows":100},{"order":"archive","page":73,"of":124,"url":"/task/decision-making/papers/73","json":"/task/decision-making/papers/73.json","rows":100},{"order":"archive","page":74,"of":124,"url":"/task/decision-making/papers/74","json":"/task/decision-making/papers/74.json","rows":100},{"order":"archive","page":75,"of":124,"url":"/task/decision-making/papers/75","json":"/task/decision-making/papers/75.json","rows":100},{"order":"archive","page":76,"of":124,"url":"/task/decision-making/papers/76","json":"/task/decision-making/papers/76.json","rows":100},{"order":"archive","page":77,"of":124,"url":"/task/decision-making/papers/77","json":"/task/decision-making/papers/77.json","rows":100},{"order":"archive","page":78,"of":124,"url":"/task/decision-making/papers/78","json":"/task/decision-making/papers/78.json","rows":100},{"order":"archive","page":79,"of":124,"url":"/task/decision-making/papers/79","json":"/task/decision-making/papers/79.json","rows":100},{"order":"archive","page":80,"of":124,"url":"/task/decision-making/papers/80","json":"/task/decision-making/papers/80.json","rows":100},{"order":"archive","page":81,"of":124,"url":"/task/decision-making/papers/81","json":"/task/decision-making/papers/81.json","rows":100},{"order":"archive","page":82,"of":124,"url":"/task/decision-making/papers/82","json":"/task/decision-making/papers/82.json","rows":100},{"order":"archive","page":83,"of":124,"url":"/task/decision-making/papers/83","json":"/task/decision-making/papers/83.json","rows":100},{"order":"archive","page":84,"of":124,"url":"/task/decision-making/papers/84","json":"/task/decision-making/papers/84.json","rows":100},{"order":"archive","page":85,"of":124,"url":"/task/decision-making/papers/85","json":"/task/decision-making/papers/85.json","rows":100},{"order":"archive","page":86,"of":124,"url":"/task/decision-making/papers/86","json":"/task/decision-making/papers/86.json","rows":100},{"order":"archive","page":87,"of":124,"url":"/task/decision-making/papers/87","json":"/task/decision-making/papers/87.json","rows":100},{"order":"archive","page":88,"of":124,"url":"/task/decision-making/papers/88","json":"/task/decision-making/papers/88.json","rows":100},{"order":"archive","page":89,"of":124,"url":"/task/decision-making/papers/89","json":"/task/decision-making/papers/89.json","rows":100},{"order":"archive","page":90,"of":124,"url":"/task/decision-making/papers/90","json":"/task/decision-making/papers/90.json","rows":100},{"order":"archive","page":91,"of":124,"url":"/task/decision-making/papers/91","json":"/task/decision-making/papers/91.json","rows":100},{"order":"archive","page":92,"of":124,"url":"/task/decision-making/papers/92","json":"/task/decision-making/papers/92.json","rows":100},{"order":"archive","page":93,"of":124,"url":"/task/decision-making/papers/93","json":"/task/decision-making/papers/93.json","rows":100},{"order":"archive","page":94,"of":124,"url":"/task/decision-making/papers/94","json":"/task/decision-making/papers/94.json","rows":100},{"order":"archive","page":95,"of":124,"url":"/task/decision-making/papers/95","json":"/task/decision-making/papers/95.json","rows":100},{"order":"archive","page":96,"of":124,"url":"/task/decision-making/papers/96","json":"/task/decision-making/papers/96.json","rows":100},{"order":"archive","page":97,"of":124,"url":"/task/decision-making/papers/97","json":"/task/decision-making/papers/97.json","rows":100},{"order":"archive","page":98,"of":124,"url":"/task/decision-making/papers/98","json":"/task/decision-making/papers/98.json","rows":100},{"order":"archive","page":99,"of":124,"url":"/task/decision-making/papers/99","json":"/task/decision-making/papers/99.json","rows":100},{"order":"archive","page":100,"of":124,"url":"/task/decision-making/papers/100","json":"/task/decision-making/papers/100.json","rows":100},{"order":"archive","page":101,"of":124,"url":"/task/decision-making/papers/101","json":"/task/decision-making/papers/101.json","rows":100},{"order":"archive","page":102,"of":124,"url":"/task/decision-making/papers/102","json":"/task/decision-making/papers/102.json","rows":100},{"order":"archive","page":103,"of":124,"url":"/task/decision-making/papers/103","json":"/task/decision-making/papers/103.json","rows":100},{"order":"archive","page":104,"of":124,"url":"/task/decision-making/papers/104","json":"/task/decision-making/papers/104.json","rows":100},{"order":"archive","page":105,"of":124,"url":"/task/decision-making/papers/105","json":"/task/decision-making/papers/105.json","rows":100},{"order":"archive","page":106,"of":124,"url":"/task/decision-making/papers/106","json":"/task/decision-making/papers/106.json","rows":100},{"order":"archive","page":107,"of":124,"url":"/task/decision-making/papers/107","json":"/task/decision-making/papers/107.json","rows":100},{"order":"archive","page":108,"of":124,"url":"/task/decision-making/papers/108","json":"/task/decision-making/papers/108.json","rows":100},{"order":"archive","page":109,"of":124,"url":"/task/decision-making/papers/109","json":"/task/decision-making/papers/109.json","rows":100},{"order":"archive","page":110,"of":124,"url":"/task/decision-making/papers/110","json":"/task/decision-making/papers/110.json","rows":100},{"order":"archive","page":111,"of":124,"url":"/task/decision-making/papers/111","json":"/task/decision-making/papers/111.json","rows":100},{"order":"archive","page":112,"of":124,"url":"/task/decision-making/papers/112","json":"/task/decision-making/papers/112.json","rows":100},{"order":"archive","page":113,"of":124,"url":"/task/decision-making/papers/113","json":"/task/decision-making/papers/113.json","rows":100},{"order":"archive","page":114,"of":124,"url":"/task/decision-making/papers/114","json":"/task/decision-making/papers/114.json","rows":100},{"order":"archive","page":115,"of":124,"url":"/task/decision-making/papers/115","json":"/task/decision-making/papers/115.json","rows":100},{"order":"archive","page":116,"of":124,"url":"/task/decision-making/papers/116","json":"/task/decision-making/papers/116.json","rows":100},{"order":"archive","page":117,"of":124,"url":"/task/decision-making/papers/117","json":"/task/decision-making/papers/117.json","rows":100},{"order":"archive","page":118,"of":124,"url":"/task/decision-making/papers/118","json":"/task/decision-making/papers/118.json","rows":100},{"order":"archive","page":119,"of":124,"url":"/task/decision-making/papers/119","json":"/task/decision-making/papers/119.json","rows":100},{"order":"archive","page":120,"of":124,"url":"/task/decision-making/papers/120","json":"/task/decision-making/papers/120.json","rows":100},{"order":"archive","page":121,"of":124,"url":"/task/decision-making/papers/121","json":"/task/decision-making/papers/121.json","rows":100},{"order":"archive","page":122,"of":124,"url":"/task/decision-making/papers/122","json":"/task/decision-making/papers/122.json","rows":100},{"order":"archive","page":123,"of":124,"url":"/task/decision-making/papers/123","json":"/task/decision-making/papers/123.json","rows":100},{"order":"archive","page":124,"of":124,"url":"/task/decision-making/papers/124","json":"/task/decision-making/papers/124.json","rows":11},{"order":"ran","page":1,"of":7,"url":"/task/decision-making/papers/ran/1","json":"/task/decision-making/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":7,"url":"/task/decision-making/papers/ran/2","json":"/task/decision-making/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":7,"url":"/task/decision-making/papers/ran/3","json":"/task/decision-making/papers/ran/3.json","rows":100},{"order":"ran","page":4,"of":7,"url":"/task/decision-making/papers/ran/4","json":"/task/decision-making/papers/ran/4.json","rows":100},{"order":"ran","page":5,"of":7,"url":"/task/decision-making/papers/ran/5","json":"/task/decision-making/papers/ran/5.json","rows":100},{"order":"ran","page":6,"of":7,"url":"/task/decision-making/papers/ran/6","json":"/task/decision-making/papers/ran/6.json","rows":100},{"order":"ran","page":7,"of":7,"url":"/task/decision-making/papers/ran/7","json":"/task/decision-making/papers/ran/7.json","rows":78}],"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":"ed4fb9ba9e922f3f45b1deec1b3335e05250d75fb531adaf991ef4f26ba3023d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}