{"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/to-str","entry":"to_str","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":5,"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":10,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":10,"n_places_pointer_only":2,"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":4,"ran_fixture":1,"ran":5,"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":"2410.04332","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-routing-masking-gradients-to","title":"Gradient Routing: Masking Gradients to Localize Computation in Neural Networks","date":"2024-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kxcloud/gradient-routing","path":"projects/mnist/analyze_runs_for_paper_main.py","file_url":"https://github.com/kxcloud/gradient-routing/blob/HEAD/projects/mnist/analyze_runs_for_paper_main.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kxcloud/gradient-routing when it was checked","code_sha256":"962dbb03f7b826e6","code_sha256_prefix":"962dbb03f7b826e6","mcp_get_code":{"code_sha256":"962dbb03f7b826e6"}},{"arxiv_id":"2310.17914","arxiv_id_is_arxiv":true,"paper":"/paper/3d-aware-visual-question-answering-about-1","title":"3D-Aware Visual Question Answering about Parts, Poses and Occlusions","date":"2023-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XingruiWang/superclevr-3D-question","path":"image_generation/restore_img2json.py","file_url":"https://github.com/XingruiWang/superclevr-3D-question/blob/HEAD/image_generation/restore_img2json.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":"a2ed7edd94a0f20c","code_sha256_prefix":"a2ed7edd94a0f20c","mcp_get_code":{"code_sha256":"a2ed7edd94a0f20c"}},{"arxiv_id":"2309.04459","arxiv_id_is_arxiv":true,"paper":"/paper/subwords-as-skills-tokenization-for-sparse","title":"Subwords as Skills: Tokenization for Sparse-Reward Reinforcement Learning","date":"2023-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dyunis/subwords_as_skills","path":"subwords.py","file_url":"https://github.com/dyunis/subwords_as_skills/blob/HEAD/subwords.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e0e45cd4b9d51aa0","code_sha256_prefix":"e0e45cd4b9d51aa0","mcp_get_code":{"code_sha256":"e0e45cd4b9d51aa0"}},{"arxiv_id":"2303.11257","arxiv_id_is_arxiv":true,"paper":"/paper/unit-scaling-out-of-the-box-low-precision","title":"Unit Scaling: Out-of-the-Box Low-Precision Training","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graphcore-research/unit-scaling-demo","path":"scmm/datasets.py","file_url":"https://github.com/graphcore-research/unit-scaling-demo/blob/HEAD/scmm/datasets.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":"e30037d5501d3b17","code_sha256_prefix":"e30037d5501d3b17","mcp_get_code":{"code_sha256":"e30037d5501d3b17"}},{"arxiv_id":"2206.11397","arxiv_id_is_arxiv":true,"paper":"/paper/online-bipartite-matching-with-advice-tight","title":"Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model","date":null,"month_inferred_from_arxiv_id":"2022-06","title_source":"archive","repo":"mapleox/matching_predictions","path":"utils.py","file_url":"https://github.com/mapleox/matching_predictions/blob/HEAD/utils.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":"d55b2cb2003d2840","code_sha256_prefix":"d55b2cb2003d2840","mcp_get_code":{"code_sha256":"d55b2cb2003d2840"}},{"arxiv_id":"2106.09292","arxiv_id_is_arxiv":true,"paper":"/paper/crop-certifying-robust-policies-for","title":"CROP: Certifying Robust Policies for Reinforcement Learning through Functional Smoothing","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai-secure/crop","path":"lo_re.py","file_url":"https://github.com/ai-secure/crop/blob/HEAD/lo_re.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ai-secure/crop when it was checked","code_sha256":"ab585ce720204361","code_sha256_prefix":"ab585ce720204361","mcp_get_code":{"code_sha256":"ab585ce720204361"}},{"arxiv_id":"2004.00584","arxiv_id_is_arxiv":true,"paper":"/paper/deep-entity-matching-with-pre-trained","title":"Deep Entity Matching with Pre-Trained Language Models","date":"2020-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"megagonlabs/ditto","path":"matcher.py","file_url":"https://github.com/megagonlabs/ditto/blob/HEAD/matcher.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6fc3e78682fa1e57","code_sha256_prefix":"6fc3e78682fa1e57","mcp_get_code":{"code_sha256":"6fc3e78682fa1e57"}},{"arxiv_id":"1809.02079","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-over-sensitivity-and-over","title":"Adversarial Over-Sensitivity and Over-Stability Strategies for Dialogue Models","date":"2018-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WolfNiu/AdversarialDialogue","path":"src/basic/ubuntu_data_generator.py","file_url":"https://github.com/WolfNiu/AdversarialDialogue/blob/HEAD/src/basic/ubuntu_data_generator.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":"ca020336382cc115","code_sha256_prefix":"ca020336382cc115","mcp_get_code":{"code_sha256":"ca020336382cc115"}},{"arxiv_id":"2022.acl-long.470","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.acl-long.470","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"pettarin/ipapy","path":"ipapy/compatibility.py","file_url":"https://github.com/pettarin/ipapy/blob/HEAD/ipapy/compatibility.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":"f709f9137f1ab43e","code_sha256_prefix":"f709f9137f1ab43e","mcp_get_code":{"code_sha256":"f709f9137f1ab43e"}},{"arxiv_id":"2020.findings-emnlp.444","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2020.findings-emnlp.444","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"baidu/lac","path":"python/LAC/utils.py","file_url":"https://github.com/baidu/lac/blob/HEAD/python/LAC/utils.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":"6987467a8e751b45","code_sha256_prefix":"6987467a8e751b45","mcp_get_code":{"code_sha256":"6987467a8e751b45"}}],"record_sha256":"7352937d7fe748f9d6864777487e4fd7cafc670b63dd627fbf63e30aed24c903","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}