{"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/load-vectors","entry":"load_vectors","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":6,"n_papers_ran":2,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":2,"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":0,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"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":2,"ran_fixture":0,"ran":0,"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":"2608.12654","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-12654","title":"SteerBench-Work: A Benchmark for Agent Steering at Action Boundaries","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"AgentDock/steerbench-work","path":"integrations/tinker/steerbench_env.py","file_url":"https://github.com/AgentDock/steerbench-work/blob/HEAD/integrations/tinker/steerbench_env.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":"45994eab16a8fca7","code_sha256_prefix":"45994eab16a8fca7","mcp_get_code":{"code_sha256":"45994eab16a8fca7"}},{"arxiv_id":"2606.00160","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-00160","title":"DataShield: Safety-degrading Data Filtering for LLM Benign Instruction Fine-Tuning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"ZJunBo/DataShield","path":"datashield/compute_projections.py","file_url":"https://github.com/ZJunBo/DataShield/blob/HEAD/datashield/compute_projections.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, ZJunBo/DataShield when it was checked","code_sha256":"46ba8cd07ff9e0f3","code_sha256_prefix":"46ba8cd07ff9e0f3","mcp_get_code":{"code_sha256":"46ba8cd07ff9e0f3"}},{"arxiv_id":"2304.04613","arxiv_id_is_arxiv":true,"paper":"/paper/on-evaluation-of-bangla-word-analogies","title":"On Evaluation of Bangla Word Analogies","date":"2023-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/fastText","path":"alignment/utils.py","file_url":"https://github.com/facebookresearch/fastText/blob/HEAD/alignment/utils.py","status":"unverified","verification_level":0,"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/fastText, 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":"5b38e4065c54800a","code_sha256_prefix":"5b38e4065c54800a","mcp_get_code":{"code_sha256":"5b38e4065c54800a"}},{"arxiv_id":"2105.04556","arxiv_id_is_arxiv":true,"paper":"/paper/tango-commonsense-generalization-in","title":"TANGO: Commonsense Generalization in Predicting Tool Interactions for Mobile Manipulators","date":"2021-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reail-iitd/tango","path":"src/extract_vectors.py","file_url":"https://github.com/reail-iitd/tango/blob/HEAD/src/extract_vectors.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b52b00285d990bde","code_sha256_prefix":"b52b00285d990bde","mcp_get_code":{"code_sha256":"b52b00285d990bde"}},{"arxiv_id":"1911.03070","arxiv_id_is_arxiv":true,"paper":"/paper/interactive-refinement-of-cross-lingual-word","title":"Interactive Refinement of Cross-Lingual Word Embeddings","date":"2019-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"forest-snow/clime-ui","path":"utils.py","file_url":"https://github.com/forest-snow/clime-ui/blob/HEAD/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":"36b86179c80fc3ef","code_sha256_prefix":"36b86179c80fc3ef","mcp_get_code":{"code_sha256":"36b86179c80fc3ef"}},{"arxiv_id":"1612.03651","arxiv_id_is_arxiv":true,"paper":"/paper/fasttextzip-compressing-text-classification","title":"FastText.zip: Compressing text classification models","date":"2016-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FengJiaChunFromSYSU/fastText","path":"alignment/utils.py","file_url":"https://github.com/FengJiaChunFromSYSU/fastText/blob/HEAD/alignment/utils.py","status":"unverified","verification_level":0,"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, FengJiaChunFromSYSU/fastText, 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":"5b38e4065c54800a","code_sha256_prefix":"5b38e4065c54800a","mcp_get_code":{"code_sha256":"5b38e4065c54800a"}}],"record_sha256":"67419c36cd96ca45356dd76cf15ab2cb6e6372962e5c14999a3b2fffdb7b1753","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}