{"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/filter-func","entry":"filter_func","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":5,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":1,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":1,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":3,"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":"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/filter_func.py","file_url":"https://github.com/kangreen0210/lime/blob/HEAD/data_curation_pipeline/filter_func.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":"de2edd5fa790dcff","code_sha256_prefix":"de2edd5fa790dcff","mcp_get_code":{"code_sha256":"de2edd5fa790dcff"}},{"arxiv_id":"2408.07246","arxiv_id_is_arxiv":true,"paper":"/paper/seeing-and-understanding-bridging-vision-with","title":"ChemVLM: Exploring the Power of Multimodal Large Language Models in Chemistry Area","date":"2024-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AI4Chem/ChemVlm","path":"datagen/convert_raw.py","file_url":"https://github.com/AI4Chem/ChemVlm/blob/HEAD/datagen/convert_raw.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, AI4Chem/ChemVlm when it was checked","code_sha256":"4bcced38c1b75864","code_sha256_prefix":"4bcced38c1b75864","mcp_get_code":{"code_sha256":"4bcced38c1b75864"}},{"arxiv_id":"1903.06048","arxiv_id_is_arxiv":true,"paper":"/paper/msg-gan-multi-scale-gradients-gan-for-more","title":"MSG-GAN: Multi-Scale Gradients for Generative Adversarial Networks","date":"2019-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"denizalperacar/MSG-GAN","path":"src/data_loader.py","file_url":"https://github.com/denizalperacar/MSG-GAN/blob/HEAD/src/data_loader.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":"fae02fd84bdd8461","code_sha256_prefix":"fae02fd84bdd8461","mcp_get_code":{"code_sha256":"fae02fd84bdd8461"}},{"arxiv_id":"1804.09541","arxiv_id_is_arxiv":true,"paper":"/paper/qanet-combining-local-convolution-with-global","title":"QANet: Combining Local Convolution with Global Self-Attention for Reading Comprehension","date":"2018-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BangLiu/QANet-PyTorch","path":"data_loader/SQuAD.py","file_url":"https://github.com/BangLiu/QANet-PyTorch/blob/HEAD/data_loader/SQuAD.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":"c4d748327c33e6cc","code_sha256_prefix":"c4d748327c33e6cc","mcp_get_code":{"code_sha256":"c4d748327c33e6cc"}},{"arxiv_id":"2023.emnlp-industry.13","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.emnlp-industry.13","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"NVIDIA/TensorRT","path":"demo/Diffusion/demo_diffusion/utils_modelopt.py","file_url":"https://github.com/NVIDIA/TensorRT/blob/HEAD/demo/Diffusion/demo_diffusion/utils_modelopt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"18727f46fd9d8216","code_sha256_prefix":"18727f46fd9d8216","mcp_get_code":{"code_sha256":"18727f46fd9d8216"}}],"record_sha256":"6f7955c3f76166173b7477bfdec5ddbd7ce2e04623d63426f9760b8abee9fa1c","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}