{"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-file-names","entry":"get_file_names","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":9,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":7,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":7,"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":5,"ran_fixture":0,"ran":0,"unverified":1},"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.09421","arxiv_id_is_arxiv":true,"paper":"/paper/vlfeedback-a-large-scale-ai-feedback-dataset","title":"VLFeedback: A Large-Scale AI Feedback Dataset for Large Vision-Language Models Alignment","date":"2024-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuweihao/MM-Vet","path":"mm-vet_evaluator.py","file_url":"https://github.com/yuweihao/MM-Vet/blob/HEAD/mm-vet_evaluator.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":"7d2672b31e9aa80e","code_sha256_prefix":"7d2672b31e9aa80e","mcp_get_code":{"code_sha256":"7d2672b31e9aa80e"}},{"arxiv_id":"2410.09421","arxiv_id_is_arxiv":true,"paper":"/paper/vlfeedback-a-large-scale-ai-feedback-dataset","title":"VLFeedback: A Large-Scale AI Feedback Dataset for Large Vision-Language Models Alignment","date":"2024-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuweihao/MM-Vet","path":"v2/mm-vet-v2_evaluator.py","file_url":"https://github.com/yuweihao/MM-Vet/blob/HEAD/v2/mm-vet-v2_evaluator.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":"a907f50fb10a0162","code_sha256_prefix":"a907f50fb10a0162","mcp_get_code":{"code_sha256":"a907f50fb10a0162"}},{"arxiv_id":"2410.08964","arxiv_id_is_arxiv":true,"paper":"/paper/language-imbalance-driven-rewarding-for","title":"Language Imbalance Driven Rewarding for Multilingual Self-improving","date":"2024-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZNLP/Language-Imbalance-Driven-Rewarding","path":"utils/utils.py","file_url":"https://github.com/ZNLP/Language-Imbalance-Driven-Rewarding/blob/HEAD/utils/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, ZNLP/Language-Imbalance-Driven-Rewarding when it was checked","code_sha256":"11e86e115ad397d4","code_sha256_prefix":"11e86e115ad397d4","mcp_get_code":{"code_sha256":"11e86e115ad397d4"}},{"arxiv_id":"2409.06851","arxiv_id_is_arxiv":true,"paper":"/paper/lime-m-less-is-more-for-evaluation-of-mllms","title":"LIME: Less Is More for MLLM Evaluation","date":"2024-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kangreen0210/lime","path":"data_curation_pipeline/gpt_double_check.py","file_url":"https://github.com/kangreen0210/lime/blob/HEAD/data_curation_pipeline/gpt_double_check.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"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, kangreen0210/lime (NOASSERTION)","code_sha256":"d6ed56746b1c0d56","code_sha256_prefix":"d6ed56746b1c0d56","mcp_get_code":{"code_sha256":"d6ed56746b1c0d56"}},{"arxiv_id":"2408.00765","arxiv_id_is_arxiv":true,"paper":"/paper/2408-00765","title":"MM-Vet v2: A Challenging Benchmark to Evaluate Large Multimodal Models for Integrated Capabilities","date":"2024-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"7d2672b31e9aa80e","code_sha256_prefix":"7d2672b31e9aa80e","mcp_get_code":{"code_sha256":"7d2672b31e9aa80e"}},{"arxiv_id":"2408.00765","arxiv_id_is_arxiv":true,"paper":"/paper/2408-00765","title":"MM-Vet v2: A Challenging Benchmark to Evaluate Large Multimodal Models for Integrated Capabilities","date":"2024-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuweihao/mm-vet","path":"v2/mm-vet-v2_evaluator.py","file_url":"https://github.com/yuweihao/mm-vet/blob/HEAD/v2/mm-vet-v2_evaluator.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":"a907f50fb10a0162","code_sha256_prefix":"a907f50fb10a0162","mcp_get_code":{"code_sha256":"a907f50fb10a0162"}},{"arxiv_id":"2405.19716","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-large-vision-language-models-with","title":"Enhancing Large Vision Language Models with Self-Training on Image Comprehension","date":"2024-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yihedeng9/stic","path":"llava/eval/eval_mm_vet.py","file_url":"https://github.com/yihedeng9/stic/blob/HEAD/llava/eval/eval_mm_vet.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":"7d2672b31e9aa80e","code_sha256_prefix":"7d2672b31e9aa80e","mcp_get_code":{"code_sha256":"7d2672b31e9aa80e"}},{"arxiv_id":"2308.12143","arxiv_id_is_arxiv":true,"paper":"/paper/a-probabilistic-fluctuation-based-membership","title":"A Probabilistic Fluctuation based Membership Inference Attack for Diffusion Models","date":"2023-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wjfu99/mia-gen","path":"diffusion_models/training_general.py","file_url":"https://github.com/wjfu99/mia-gen/blob/HEAD/diffusion_models/training_general.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, wjfu99/mia-gen when it was checked","code_sha256":"b165ff8b04a2afe3","code_sha256_prefix":"b165ff8b04a2afe3","mcp_get_code":{"code_sha256":"b165ff8b04a2afe3"}},{"arxiv_id":"2308.02490","arxiv_id_is_arxiv":true,"paper":"/paper/mm-vet-evaluating-large-multimodal-models-for","title":"MM-Vet: Evaluating Large Multimodal Models for Integrated Capabilities","date":"2023-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"7d2672b31e9aa80e","code_sha256_prefix":"7d2672b31e9aa80e","mcp_get_code":{"code_sha256":"7d2672b31e9aa80e"}},{"arxiv_id":"2110.14000","arxiv_id_is_arxiv":true,"paper":"/paper/towards-hyperparameter-free-policy-selection","title":"Towards Hyperparameter-free Policy Selection for Offline Reinforcement Learning","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jasonzhang929/BVFT_empirical_experiments","path":"run_exp.py","file_url":"https://github.com/jasonzhang929/BVFT_empirical_experiments/blob/HEAD/run_exp.py","status":"unverified","verification_level":0,"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, jasonzhang929/BVFT_empirical_experiments when it was checked","code_sha256":"dc49e9f62cb45a02","code_sha256_prefix":"dc49e9f62cb45a02","mcp_get_code":{"code_sha256":"dc49e9f62cb45a02"}},{"arxiv_id":"2008.04990","arxiv_id_is_arxiv":true,"paper":"/paper/batch-value-function-approximation-with-only","title":"Batch Value-function Approximation with Only Realizability","date":"2020-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"dc49e9f62cb45a02","code_sha256_prefix":"dc49e9f62cb45a02","mcp_get_code":{"code_sha256":"dc49e9f62cb45a02"}}],"record_sha256":"ccd78d7e8a28198c9981e401f5a4e5aa3e602fb187bde5171dcb6c54616ee653","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}