{"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/calculate-metric","entry":"calculate_metric","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":17,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":9,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":20,"n_places_pointer_only":13,"n_places_pointer_only_link_open":2,"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":0,"ran":5,"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":"2602.17155","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-17155","title":"Powering Up Zeroth-Order Training via Subspace Gradient Orthogonalization","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"OPTML-Group/ZO-Muon","path":"llm/metrics.py","file_url":"https://github.com/OPTML-Group/ZO-Muon/blob/HEAD/llm/metrics.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":"84c658f2c9252878","code_sha256_prefix":"84c658f2c9252878","mcp_get_code":{"code_sha256":"84c658f2c9252878"}},{"arxiv_id":"2508.06033","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2508-06033","title":"InstantEdit: Text-Guided Few-Step Image Editing with Piecewise Rectified Flow","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"Supercomputing-System-AI-Lab/InstantEdit","path":"pie_evaluator/evaluate.py","file_url":"https://github.com/Supercomputing-System-AI-Lab/InstantEdit/blob/HEAD/pie_evaluator/evaluate.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, Supercomputing-System-AI-Lab/InstantEdit when it was checked","code_sha256":"608cb84fa52efd4c","code_sha256_prefix":"608cb84fa52efd4c","mcp_get_code":{"code_sha256":"608cb84fa52efd4c"}},{"arxiv_id":"2505.13430","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuning-quantized-neural-networks-with","title":"Fine-tuning Quantized Neural Networks with Zeroth-order Optimization","date":"2025-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maifoundations/qzo","path":"large_language_models/metrics.py","file_url":"https://github.com/maifoundations/qzo/blob/HEAD/large_language_models/metrics.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":"84c658f2c9252878","code_sha256_prefix":"84c658f2c9252878","mcp_get_code":{"code_sha256":"84c658f2c9252878"}},{"arxiv_id":"2410.14752","arxiv_id_is_arxiv":true,"paper":"/paper/timeseriesexam-a-time-series-understanding","title":"TimeSeriesExam: A time series understanding exam","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moment-timeseries-foundation-model/timeseriesexam","path":"evaluate/evaluate.py","file_url":"https://github.com/moment-timeseries-foundation-model/timeseriesexam/blob/HEAD/evaluate/evaluate.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9c78b96d660e383f","code_sha256_prefix":"9c78b96d660e383f","mcp_get_code":{"code_sha256":"9c78b96d660e383f"}},{"arxiv_id":"2410.08989","arxiv_id_is_arxiv":true,"paper":"/paper/subzero-random-subspace-zeroth-order","title":"Zeroth-Order Fine-Tuning of LLMs in Random Subspaces","date":"2024-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zimingyy/subzero","path":"large_models/metrics.py","file_url":"https://github.com/zimingyy/subzero/blob/HEAD/large_models/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, zimingyy/subzero, is not in the permissive set Syntology serves inline","code_sha256":"84c658f2c9252878","code_sha256_prefix":"84c658f2c9252878","mcp_get_code":{"code_sha256":"84c658f2c9252878"}},{"arxiv_id":"2406.16536","arxiv_id_is_arxiv":true,"paper":"/paper/c-llm-learn-to-check-chinese-spelling-errors","title":"C-LLM: Learn to Check Chinese Spelling Errors Character by Character","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ktlKTL/C-LLM","path":"calcuate_metric.py","file_url":"https://github.com/ktlKTL/C-LLM/blob/HEAD/calcuate_metric.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, ktlKTL/C-LLM when it was checked","code_sha256":"2ad6711456139fd1","code_sha256_prefix":"2ad6711456139fd1","mcp_get_code":{"code_sha256":"2ad6711456139fd1"}},{"arxiv_id":"2406.00132","arxiv_id_is_arxiv":true,"paper":"/paper/quanta-efficient-high-rank-fine-tuning-of","title":"QuanTA: Efficient High-Rank Fine-Tuning of LLMs with Quantum-Informed Tensor Adaptation","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"quanta-fine-tuning/quanta","path":"run/utils/metrics.py","file_url":"https://github.com/quanta-fine-tuning/quanta/blob/HEAD/run/utils/metrics.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":"add335e0714d42b3","code_sha256_prefix":"add335e0714d42b3","mcp_get_code":{"code_sha256":"add335e0714d42b3"}},{"arxiv_id":"2404.06287","arxiv_id_is_arxiv":true,"paper":"/paper/counterfactual-reasoning-for-multi-label","title":"Counterfactual Reasoning for Multi-Label Image Classification via Patching-Based Training","date":"2024-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiemk/mlc-pat","path":"run_PAT-I.py","file_url":"https://github.com/xiemk/mlc-pat/blob/HEAD/run_PAT-I.py","status":"ran","verification_level":1,"contract_check":null,"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, xiemk/mlc-pat when it was checked","code_sha256":"c1a4354520c04ab6","code_sha256_prefix":"c1a4354520c04ab6","mcp_get_code":{"code_sha256":"c1a4354520c04ab6"}},{"arxiv_id":"2404.05729","arxiv_id_is_arxiv":true,"paper":"/paper/finding-visual-task-vectors","title":"Finding Visual Task Vectors","date":"2024-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alhojel/visual_task_vectors","path":"evaluate/evaluate_colorization.py","file_url":"https://github.com/alhojel/visual_task_vectors/blob/HEAD/evaluate/evaluate_colorization.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, alhojel/visual_task_vectors when it was checked","code_sha256":"764136a5eff74434","code_sha256_prefix":"764136a5eff74434","mcp_get_code":{"code_sha256":"764136a5eff74434"}},{"arxiv_id":"2404.05729","arxiv_id_is_arxiv":true,"paper":"/paper/finding-visual-task-vectors","title":"Finding Visual Task Vectors","date":"2024-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alhojel/visual_task_vectors","path":"evaluate/evaluate_reasoning.py","file_url":"https://github.com/alhojel/visual_task_vectors/blob/HEAD/evaluate/evaluate_reasoning.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, alhojel/visual_task_vectors when it was checked","code_sha256":"69532fa60013e9f4","code_sha256_prefix":"69532fa60013e9f4","mcp_get_code":{"code_sha256":"69532fa60013e9f4"}},{"arxiv_id":"2402.11592","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-zeroth-order-optimization-for","title":"Revisiting Zeroth-Order Optimization for Memory-Efficient LLM Fine-Tuning: A Benchmark","date":"2024-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zo-bench/zo-llm","path":"zo-bench/metrics.py","file_url":"https://github.com/zo-bench/zo-llm/blob/HEAD/zo-bench/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, zo-bench/zo-llm, is not in the permissive set Syntology serves inline","code_sha256":"84c658f2c9252878","code_sha256_prefix":"84c658f2c9252878","mcp_get_code":{"code_sha256":"84c658f2c9252878"}},{"arxiv_id":"2402.11417","arxiv_id_is_arxiv":true,"paper":"/paper/loretta-low-rank-economic-tensor-train","title":"LoRETTA: Low-Rank Economic Tensor-Train Adaptation for Ultra-Low-Parameter Fine-Tuning of Large Language Models","date":"2024-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifanycc/loretta","path":"bert_model/metrics.py","file_url":"https://github.com/yifanycc/loretta/blob/HEAD/bert_model/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, yifanycc/loretta, is not in the permissive set Syntology serves inline","code_sha256":"84c658f2c9252878","code_sha256_prefix":"84c658f2c9252878","mcp_get_code":{"code_sha256":"84c658f2c9252878"}},{"arxiv_id":"2312.15184","arxiv_id_is_arxiv":true,"paper":"/paper/zo-adamu-optimizer-adapting-perturbation-by","title":"ZO-AdaMU Optimizer: Adapting Perturbation by the Momentum and Uncertainty in Zeroth-order Optimization","date":"2023-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mathisall/zo-adamu","path":"metrics.py","file_url":"https://github.com/mathisall/zo-adamu/blob/HEAD/metrics.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, mathisall/zo-adamu when it was checked","code_sha256":"84c658f2c9252878","code_sha256_prefix":"84c658f2c9252878","mcp_get_code":{"code_sha256":"84c658f2c9252878"}},{"arxiv_id":"2311.03648","arxiv_id_is_arxiv":true,"paper":"/paper/instruct-me-more-random-prompting-for-visual","title":"Instruct Me More! Random Prompting for Visual In-Context Learning","date":"2023-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jackieam/inmemo","path":"evaluate/evaluate_colorization.py","file_url":"https://github.com/jackieam/inmemo/blob/HEAD/evaluate/evaluate_colorization.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, jackieam/inmemo when it was checked","code_sha256":"764136a5eff74434","code_sha256_prefix":"764136a5eff74434","mcp_get_code":{"code_sha256":"764136a5eff74434"}},{"arxiv_id":"2311.03648","arxiv_id_is_arxiv":true,"paper":"/paper/instruct-me-more-random-prompting-for-visual","title":"Instruct Me More! Random Prompting for Visual In-Context Learning","date":"2023-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jackieam/inmemo","path":"evaluate/evaluate_reasoning.py","file_url":"https://github.com/jackieam/inmemo/blob/HEAD/evaluate/evaluate_reasoning.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, jackieam/inmemo when it was checked","code_sha256":"69532fa60013e9f4","code_sha256_prefix":"69532fa60013e9f4","mcp_get_code":{"code_sha256":"69532fa60013e9f4"}},{"arxiv_id":"2310.09639","arxiv_id_is_arxiv":true,"paper":"/paper/dpzero-dimension-independent-and","title":"DPZero: Private Fine-Tuning of Language Models without Backpropagation","date":"2023-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Liang137/DPZero","path":"opt/src/metrics.py","file_url":"https://github.com/Liang137/DPZero/blob/HEAD/opt/src/metrics.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":"84c658f2c9252878","code_sha256_prefix":"84c658f2c9252878","mcp_get_code":{"code_sha256":"84c658f2c9252878"}},{"arxiv_id":"2305.17333","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuning-language-models-with-just-forward-1","title":"Fine-Tuning Language Models with Just Forward Passes","date":"2023-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-nlp/mezo","path":"large_models/metrics.py","file_url":"https://github.com/princeton-nlp/mezo/blob/HEAD/large_models/metrics.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":"84c658f2c9252878","code_sha256_prefix":"84c658f2c9252878","mcp_get_code":{"code_sha256":"84c658f2c9252878"}},{"arxiv_id":"2301.13670","arxiv_id_is_arxiv":true,"paper":"/paper/what-makes-good-examples-for-visual-in-1","title":"What Makes Good Examples for Visual In-Context Learning?","date":"2023-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangyuanhan-ai/visual_prompt_retrieval","path":"evaluate/evaluate_colorization.py","file_url":"https://github.com/zhangyuanhan-ai/visual_prompt_retrieval/blob/HEAD/evaluate/evaluate_colorization.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (CC0-1.0), but get_code serves the stored copy, first harvested from alhojel/visual_task_vectors, and GitHub detected no licence in that repository when it was checked","code_sha256":"764136a5eff74434","code_sha256_prefix":"764136a5eff74434","mcp_get_code":{"code_sha256":"764136a5eff74434"}},{"arxiv_id":"2301.13670","arxiv_id_is_arxiv":true,"paper":"/paper/what-makes-good-examples-for-visual-in-1","title":"What Makes Good Examples for Visual In-Context Learning?","date":"2023-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangyuanhan-ai/visual_prompt_retrieval","path":"evaluate/evaluate_reasoning.py","file_url":"https://github.com/zhangyuanhan-ai/visual_prompt_retrieval/blob/HEAD/evaluate/evaluate_reasoning.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (CC0-1.0), but get_code serves the stored copy, first harvested from alhojel/visual_task_vectors, and GitHub detected no licence in that repository when it was checked","code_sha256":"69532fa60013e9f4","code_sha256_prefix":"69532fa60013e9f4","mcp_get_code":{"code_sha256":"69532fa60013e9f4"}},{"arxiv_id":"2205.15485","arxiv_id_is_arxiv":true,"paper":"/paper/finbert-mrc-financial-named-entity","title":"FinBERT-MRC: financial named entity recognition using BERT under the machine reading comprehension paradigm","date":"2022-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zyz0000/finbert-mrc","path":"utils/evaluator.py","file_url":"https://github.com/zyz0000/finbert-mrc/blob/HEAD/utils/evaluator.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":"6f736eb737268aa4","code_sha256_prefix":"6f736eb737268aa4","mcp_get_code":{"code_sha256":"6f736eb737268aa4"}}],"record_sha256":"6a75f4838874b23fd4a8475bd17e9046e165cd0d04e483d46002bd8acbb4e1bf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}