{"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/init-tokenizer","entry":"init_tokenizer","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":5,"n_papers_ran":2,"n_papers_ran_no_instrument_failure":2,"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":5,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":5,"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":0,"ran_fixture":0,"ran":2,"unverified":3},"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.12639","arxiv_id_is_arxiv":true,"paper":"/paper/ask-before-plan-proactive-language-agents-for","title":"Ask-before-Plan: Proactive Language Agents for Real-World Planning","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"magicgh/ask-before-plan","path":"src/base.py","file_url":"https://github.com/magicgh/ask-before-plan/blob/HEAD/src/base.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8e150ed7cc6fd041","code_sha256_prefix":"8e150ed7cc6fd041","mcp_get_code":{"code_sha256":"8e150ed7cc6fd041"}},{"arxiv_id":"2406.07358","arxiv_id_is_arxiv":true,"paper":"/paper/ai-sandbagging-language-models-can","title":"AI Sandbagging: Language Models can Strategically Underperform on Evaluations","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"teunvdweij/sandbagging","path":"old/model.py","file_url":"https://github.com/teunvdweij/sandbagging/blob/HEAD/old/model.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, teunvdweij/sandbagging when it was checked","code_sha256":"d24e1905ab5edbc9","code_sha256_prefix":"d24e1905ab5edbc9","mcp_get_code":{"code_sha256":"d24e1905ab5edbc9"}},{"arxiv_id":"2303.10323","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-graph-enhanced-contrastive-learning","title":"Dynamic Graph Enhanced Contrastive Learning for Chest X-ray Report Generation","date":"2023-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlii0117/dcl","path":"models/blip.py","file_url":"https://github.com/mlii0117/dcl/blob/HEAD/models/blip.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"771da9d8d8724c6a","code_sha256_prefix":"771da9d8d8724c6a","mcp_get_code":{"code_sha256":"771da9d8d8724c6a"}},{"arxiv_id":"2211.09790","arxiv_id_is_arxiv":true,"paper":"/paper/construct-vl-data-free-continual-structured","title":"ConStruct-VL: Data-Free Continual Structured VL Concepts Learning","date":"2022-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jamessealesmith/construct-vl","path":"models/blip.py","file_url":"https://github.com/jamessealesmith/construct-vl/blob/HEAD/models/blip.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, jamessealesmith/construct-vl, 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":"1ca8251947e588b8","code_sha256_prefix":"1ca8251947e588b8","mcp_get_code":{"code_sha256":"1ca8251947e588b8"}},{"arxiv_id":"2107.12542","arxiv_id_is_arxiv":true,"paper":"/paper/energy-based-unknown-intent-detection-with","title":"Energy-based Unknown Intent Detection with Data Manipulation","date":"2021-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yawenouyang/GOT","path":"util/utils.py","file_url":"https://github.com/yawenouyang/GOT/blob/HEAD/util/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"67b6f30629903c07","code_sha256_prefix":"67b6f30629903c07","mcp_get_code":{"code_sha256":"67b6f30629903c07"}}],"record_sha256":"649df425103912202b403de8d591328fa8579f64dc5caf432cc6e3befe460c75","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}