{"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/strtobool","entry":"strtobool","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":0,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":4,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"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":"2509.12521","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-12521","title":"Phi: Preference Hijacking in Multi-modal Large Language Models at Inference Time","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"Yifan-Lan/Phi","path":"trl/env_utils.py","file_url":"https://github.com/Yifan-Lan/Phi/blob/HEAD/trl/env_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f0cba5a1fca2a144","code_sha256_prefix":"f0cba5a1fca2a144","mcp_get_code":{"code_sha256":"f0cba5a1fca2a144"}},{"arxiv_id":"2504.17838","arxiv_id_is_arxiv":true,"paper":"/paper/carl-learning-scalable-planning-policies-with","title":"CaRL: Learning Scalable Planning Policies with Simple Rewards","date":"2025-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"autonomousvision/CaRL","path":"CARLA/custom_leaderboard/leaderboard/leaderboard/leaderboard_evaluator.py","file_url":"https://github.com/autonomousvision/CaRL/blob/HEAD/CARLA/custom_leaderboard/leaderboard/leaderboard/leaderboard_evaluator.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, autonomousvision/CaRL (NOASSERTION)","code_sha256":"ca1e969574d78a88","code_sha256_prefix":"ca1e969574d78a88","mcp_get_code":{"code_sha256":"ca1e969574d78a88"}},{"arxiv_id":"2404.02098","arxiv_id_is_arxiv":true,"paper":"/paper/braven-improving-self-supervised-pre-training","title":"BRAVEn: Improving Self-Supervised Pre-training for Visual and Auditory Speech Recognition","date":"2024-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahaliassos/raven","path":"espnet/utils/cli_utils.py","file_url":"https://github.com/ahaliassos/raven/blob/HEAD/espnet/utils/cli_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a322f4a71dff8cd9","code_sha256_prefix":"a322f4a71dff8cd9","mcp_get_code":{"code_sha256":"a322f4a71dff8cd9"}},{"arxiv_id":"2311.08695","arxiv_id_is_arxiv":true,"paper":"/paper/attribute-diversity-determines-the","title":"Attribute Diversity Determines the Systematicity Gap in VQA","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ikb-a/systematicity-gap-in-vqa","path":"vqa-framework/src/vqa_framework/utils/misc.py","file_url":"https://github.com/ikb-a/systematicity-gap-in-vqa/blob/HEAD/vqa-framework/src/vqa_framework/utils/misc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ikb-a/systematicity-gap-in-vqa when it was checked","code_sha256":"039a47d6cbd99391","code_sha256_prefix":"039a47d6cbd99391","mcp_get_code":{"code_sha256":"039a47d6cbd99391"}},{"arxiv_id":"2310.07402","arxiv_id_is_arxiv":true,"paper":"/paper/nutime-numerically-multi-scaled-embedding-for","title":"NuTime: Numerically Multi-Scaled Embedding for Large-Scale Time-Series Pretraining","date":"2023-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenguolin/nutime","path":"src/config.py","file_url":"https://github.com/chenguolin/nutime/blob/HEAD/src/config.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from hangtingye/uadb, and GitHub detected no licence in that repository when it was checked","code_sha256":"4e1c1ced33060261","code_sha256_prefix":"4e1c1ced33060261","mcp_get_code":{"code_sha256":"4e1c1ced33060261"}},{"arxiv_id":"2306.17100","arxiv_id_is_arxiv":true,"paper":"/paper/rl4co-an-extensive-reinforcement-learning-for","title":"RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark","date":"2023-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/rl","path":"torchrl/_utils.py","file_url":"https://github.com/facebookresearch/rl/blob/HEAD/torchrl/_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, facebookresearch/rl, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"f5efb02606aa8292","code_sha256_prefix":"f5efb02606aa8292","mcp_get_code":{"code_sha256":"f5efb02606aa8292"}},{"arxiv_id":"2306.01997","arxiv_id_is_arxiv":true,"paper":"/paper/uadb-unsupervised-anomaly-detection-booster","title":"UADB: Unsupervised Anomaly Detection Booster","date":"2023-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hangtingye/uadb","path":"config.py","file_url":"https://github.com/hangtingye/uadb/blob/HEAD/config.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, hangtingye/uadb when it was checked","code_sha256":"4e1c1ced33060261","code_sha256_prefix":"4e1c1ced33060261","mcp_get_code":{"code_sha256":"4e1c1ced33060261"}}],"record_sha256":"4dad9285f644d3e2df56db9abd8137fc47de738e4a1d0604e70d53606ffab56a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}