{"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/query","entry":"query","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":11,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":3,"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":11,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":6,"n_samples_fingerprinted":1,"n_places":11,"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":0,"ran_fixture":2,"ran":2,"unverified":6},"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":"2601.11866","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-11866","title":"Advances in LLM Reasoning Enable Flexibility in Clinical Problem-Solving","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"bernardolab/mARC-Reasoning","path":"evaluate_from_api.py","file_url":"https://github.com/bernardolab/mARC-Reasoning/blob/HEAD/evaluate_from_api.py","status":"unverified","verification_level":0,"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":"e8acc225e775317a","code_sha256_prefix":"e8acc225e775317a","mcp_get_code":{"code_sha256":"e8acc225e775317a"}},{"arxiv_id":"2403.18548","arxiv_id_is_arxiv":true,"paper":"/paper/a-semi-supervised-nighttime-dehazing-baseline","title":"A Semi-supervised Nighttime Dehazing Baseline with Spatial-Frequency Aware and Realistic Brightness Constraint","date":"2024-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaofeng-life/sfsnid","path":"task_SFSNiD/train_SFSNiD_semi_supervised.py","file_url":"https://github.com/xiaofeng-life/sfsnid/blob/HEAD/task_SFSNiD/train_SFSNiD_semi_supervised.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xiaofeng-life/sfsnid when it was checked","code_sha256":"71d44f079297c28a","code_sha256_prefix":"71d44f079297c28a","mcp_get_code":{"code_sha256":"71d44f079297c28a"}},{"arxiv_id":"2401.00690","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-large-language-models-on","title":"Benchmarking Large Language Models on Controllable Generation under Diversified Instructions","date":"2024-01-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Xt-cyh/CoDI-Eval","path":"utils/query_huggingface.py","file_url":"https://github.com/Xt-cyh/CoDI-Eval/blob/HEAD/utils/query_huggingface.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, Xt-cyh/CoDI-Eval when it was checked","code_sha256":"aa85076767ed9c7a","code_sha256_prefix":"aa85076767ed9c7a","mcp_get_code":{"code_sha256":"aa85076767ed9c7a"}},{"arxiv_id":"2312.00374","arxiv_id_is_arxiv":true,"paper":"/paper/unleashing-cheapfakes-through-trojan-plugins","title":"The Philosopher's Stone: Trojaning Plugins of Large Language Models","date":null,"month_inferred_from_arxiv_id":"2023-12","title_source":"archive","repo":"chichidd/llm-lora-trojan","path":"polished_query.py","file_url":"https://github.com/chichidd/llm-lora-trojan/blob/HEAD/polished_query.py","status":"unverified","verification_level":0,"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":"6be099782a45aa78","code_sha256_prefix":"6be099782a45aa78","mcp_get_code":{"code_sha256":"6be099782a45aa78"}},{"arxiv_id":"2304.13861","arxiv_id_is_arxiv":true,"paper":"/paper/is-a-prompt-and-a-few-samples-all-you-need","title":"The Parrot Dilemma: Human-Labeled vs. LLM-augmented Data in Classification Tasks","date":"2023-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AGMoller/worker_vs_gpt","path":"src/worker_vs_gpt/hf_inference.py","file_url":"https://github.com/AGMoller/worker_vs_gpt/blob/HEAD/src/worker_vs_gpt/hf_inference.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":"45c45b78efe4b52b","code_sha256_prefix":"45c45b78efe4b52b","mcp_get_code":{"code_sha256":"45c45b78efe4b52b"}},{"arxiv_id":"2212.10534","arxiv_id_is_arxiv":true,"paper":"/paper/disco-distilling-phrasal-counterfactuals-with","title":"DISCO: Distilling Counterfactuals with Large Language Models","date":"2022-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eric11eca/disco","path":"distiller/db.py","file_url":"https://github.com/eric11eca/disco/blob/HEAD/distiller/db.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":"de9b161971667f91","code_sha256_prefix":"de9b161971667f91","mcp_get_code":{"code_sha256":"de9b161971667f91"}},{"arxiv_id":"2110.08207","arxiv_id_is_arxiv":true,"paper":"/paper/multitask-prompted-training-enables-zero-shot-1","title":"Multitask Prompted Training Enables Zero-Shot Task Generalization","date":"2021-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ukplab/arxiv2022-context-injection-stance","path":"src/retrieve/retrieve_t0pp_context.py","file_url":"https://github.com/ukplab/arxiv2022-context-injection-stance/blob/HEAD/src/retrieve/retrieve_t0pp_context.py","status":"unverified","verification_level":0,"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":"279ad86d58c62ffb","code_sha256_prefix":"279ad86d58c62ffb","mcp_get_code":{"code_sha256":"279ad86d58c62ffb"}},{"arxiv_id":"2106.06799","arxiv_id_is_arxiv":true,"paper":"/paper/zero-cost-proxies-meet-differentiable","title":"Zero-Cost Operation Scoring in Differentiable Architecture Search","date":"2021-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zerocostptnas/zerocost_operation_score","path":"nasbench201/networks_proposal.py","file_url":"https://github.com/zerocostptnas/zerocost_operation_score/blob/HEAD/nasbench201/networks_proposal.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":"868f9ec838a3822b","code_sha256_prefix":"868f9ec838a3822b","mcp_get_code":{"code_sha256":"868f9ec838a3822b"}},{"arxiv_id":"1901.08746","arxiv_id_is_arxiv":true,"paper":"/paper/biobert-a-pre-trained-biomedical-language","title":"BioBERT: a pre-trained biomedical language representation model for biomedical text mining","date":"2019-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dmis-lab/bern","path":"utils.py","file_url":"https://github.com/dmis-lab/bern/blob/HEAD/utils.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":"63af112374694328","code_sha256_prefix":"63af112374694328","mcp_get_code":{"code_sha256":"63af112374694328"}},{"arxiv_id":"1812.01844","arxiv_id_is_arxiv":true,"paper":"/paper/improving-similarity-search-with-high","title":"Improving Similarity Search with High-dimensional Locality-sensitive Hashing","date":"2018-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tian-kun/Fly-LSH","path":"unsupervised.py","file_url":"https://github.com/tian-kun/Fly-LSH/blob/HEAD/unsupervised.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c342316823ebedf1","code_sha256_prefix":"c342316823ebedf1","mcp_get_code":{"code_sha256":"c342316823ebedf1"}},{"arxiv_id":"1706.00764","arxiv_id_is_arxiv":true,"paper":"/paper/hyperparameter-optimization-a-spectral","title":"Hyperparameter Optimization: A Spectral Approach","date":"2017-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"callowbird/Harmonica","path":"samplings.py","file_url":"https://github.com/callowbird/Harmonica/blob/HEAD/samplings.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7dc391fa0102351b","code_sha256_prefix":"7dc391fa0102351b","mcp_get_code":{"code_sha256":"7dc391fa0102351b"}}],"record_sha256":"76af32d58f872aef0b1930456acd1d7a27fc50b058c18a81d8762fdb449c5e9d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}