{"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":"/code/get-url","entry":"get_url","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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)"},"n_papers":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":1,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":9,"n_places_pointer_only":1,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":7,"unverified":0},"key_notes":{"n_samples_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_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2406.01623","arxiv_id_is_arxiv":true,"paper":"/paper/websuite-systematically-evaluating-why-web","title":"WebSuite: Systematically Evaluating Why Web Agents Fail","date":"2024-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"erichli1/websuite","path":"evaluation/utils.py","file_url":"https://github.com/erichli1/websuite/blob/HEAD/evaluation/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f79218d0f55a18cc","code_sha256_prefix":"f79218d0f55a18cc","mcp_get_code":{"code_sha256":"f79218d0f55a18cc"}},{"arxiv_id":"2309.07430","arxiv_id_is_arxiv":true,"paper":"/paper/clinical-text-summarization-adapting-large","title":"Adapted Large Language Models Can Outperform Medical Experts in Clinical Text Summarization","date":"2023-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanfordmimi/clin-summ","path":"src/constants.py","file_url":"https://github.com/stanfordmimi/clin-summ/blob/HEAD/src/constants.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, stanfordmimi/clin-summ (NOASSERTION)","code_sha256":"1553a48cda4fae1b","code_sha256_prefix":"1553a48cda4fae1b","mcp_get_code":{"code_sha256":"1553a48cda4fae1b"}},{"arxiv_id":"2110.14565","arxiv_id_is_arxiv":true,"paper":"/paper/dreamerpro-reconstruction-free-model-based-1","title":"DreamerPro: Reconstruction-Free Model-Based Reinforcement Learning with Prototypical Representations","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fdeng18/dreamer-pro","path":"download_videos.py","file_url":"https://github.com/fdeng18/dreamer-pro/blob/HEAD/download_videos.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7cfa9dd88da0b290","code_sha256_prefix":"7cfa9dd88da0b290","mcp_get_code":{"code_sha256":"7cfa9dd88da0b290"}},{"arxiv_id":"2106.07156","arxiv_id_is_arxiv":true,"paper":"/paper/temporal-predictive-coding-for-model-based","title":"Temporal Predictive Coding For Model-Based Planning In Latent Space","date":"2021-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tung-nd/TPC-tensorflow","path":"download_videos.py","file_url":"https://github.com/tung-nd/TPC-tensorflow/blob/HEAD/download_videos.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7cfa9dd88da0b290","code_sha256_prefix":"7cfa9dd88da0b290","mcp_get_code":{"code_sha256":"7cfa9dd88da0b290"}},{"arxiv_id":"2007.04118","arxiv_id_is_arxiv":true,"paper":"/paper/delving-into-the-adversarial-robustness-on","title":"RobFR: Benchmarking Adversarial Robustness on Face Recognition","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-ml/realsafe","path":"ares/model/cifar_model_zoo.py","file_url":"https://github.com/thu-ml/realsafe/blob/HEAD/ares/model/cifar_model_zoo.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"152d421c48b6bfa2","code_sha256_prefix":"152d421c48b6bfa2","mcp_get_code":{"code_sha256":"152d421c48b6bfa2"}},{"arxiv_id":"2007.04118","arxiv_id_is_arxiv":true,"paper":"/paper/delving-into-the-adversarial-robustness-on","title":"RobFR: Benchmarking Adversarial Robustness on Face Recognition","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-ml/realsafe","path":"ares/model/imagenet_model_zoo.py","file_url":"https://github.com/thu-ml/realsafe/blob/HEAD/ares/model/imagenet_model_zoo.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bb60872260d982f8","code_sha256_prefix":"bb60872260d982f8","mcp_get_code":{"code_sha256":"bb60872260d982f8"}},{"arxiv_id":"1906.02762","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-and-improving-transformer-from","title":"Understanding and Improving Transformer From a Multi-Particle Dynamic System Point of View","date":"2019-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuohan123/macaron-net","path":"bert/macaron-scripts/bert/WikiExtractor.py","file_url":"https://github.com/zhuohan123/macaron-net/blob/HEAD/bert/macaron-scripts/bert/WikiExtractor.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8294a226aac1a8d4","code_sha256_prefix":"8294a226aac1a8d4","mcp_get_code":{"code_sha256":"8294a226aac1a8d4"}},{"arxiv_id":"1906.02738","arxiv_id_is_arxiv":true,"paper":"/paper/conversing-by-reading-contentful-neural","title":"Conversing by Reading: Contentful Neural Conversation with On-demand Machine Reading","date":"2019-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qkaren/converse_reading_cmr","path":"data/src/create_official_data.py","file_url":"https://github.com/qkaren/converse_reading_cmr/blob/HEAD/data/src/create_official_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2d6234d38ab3c00e","code_sha256_prefix":"2d6234d38ab3c00e","mcp_get_code":{"code_sha256":"2d6234d38ab3c00e"}},{"arxiv_id":"1611.09268","arxiv_id_is_arxiv":true,"paper":"/paper/ms-marco-a-human-generated-machine-reading","title":"MS MARCO: A Human Generated MAchine Reading COmprehension Dataset","date":"2016-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AmenRa/rank_eval","path":"ranx/io.py","file_url":"https://github.com/AmenRa/rank_eval/blob/HEAD/ranx/io.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"76ec290b848f6d2d","code_sha256_prefix":"76ec290b848f6d2d","mcp_get_code":{"code_sha256":"76ec290b848f6d2d"}}],"record_sha256":"8bca10735c598a19cd195149bd1ad80f91eb2996bec57e0533403f1d59c168c2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}