{"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-parameter-number","entry":"get_parameter_number","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":19,"n_papers_ran":19,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":11,"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":11,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":19,"n_places_pointer_only":13,"n_places_pointer_only_link_open":1,"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":2,"ran_violates":0,"ran_draft_wrong":5,"ran_fixture":0,"ran":4,"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":"2411.14717","arxiv_id_is_arxiv":true,"paper":"/paper/fedmllm-federated-fine-tuning-mllm-on","title":"FedMLLM: Federated Fine-tuning MLLM on Multimodal Heterogeneity Data","date":"2024-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1xbq1/fedmllm","path":"finetune/finetune.py","file_url":"https://github.com/1xbq1/fedmllm/blob/HEAD/finetune/finetune.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, 1xbq1/fedmllm when it was checked","code_sha256":"1a3baf406bc7de64","code_sha256_prefix":"1a3baf406bc7de64","mcp_get_code":{"code_sha256":"1a3baf406bc7de64"}},{"arxiv_id":"2411.06448","arxiv_id_is_arxiv":true,"paper":"/paper/over-parameterized-student-model-via-tensor","title":"Over-parameterized Student Model via Tensor Decomposition Boosted Knowledge Distillation","date":"2024-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intell-sci-comput/opdf","path":"compress_tools/trainer_bert_4.py","file_url":"https://github.com/intell-sci-comput/opdf/blob/HEAD/compress_tools/trainer_bert_4.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":"383d339873e8f63f","code_sha256_prefix":"383d339873e8f63f","mcp_get_code":{"code_sha256":"383d339873e8f63f"}},{"arxiv_id":"2411.01656","arxiv_id_is_arxiv":true,"paper":"/paper/degradation-aware-residual-conditioned","title":"Degradation-Aware Residual-Conditioned Optimal Transport for Unified Image Restoration","date":"2024-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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":"a23501ebdd938df8","code_sha256_prefix":"a23501ebdd938df8","mcp_get_code":{"code_sha256":"a23501ebdd938df8"}},{"arxiv_id":"2408.12454","arxiv_id_is_arxiv":true,"paper":"/paper/relaxed-rotational-equivariance-via-g-biases","title":"Relaxed Rotational Equivariance via $G$-Biases in Vision","date":"2024-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wuer5/rrenet","path":"classification/utils.py","file_url":"https://github.com/wuer5/rrenet/blob/HEAD/classification/utils.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, wuer5/rrenet when it was checked","code_sha256":"81c05f353caebaab","code_sha256_prefix":"81c05f353caebaab","mcp_get_code":{"code_sha256":"81c05f353caebaab"}},{"arxiv_id":"2408.01800","arxiv_id_is_arxiv":true,"paper":"/paper/2408-01800","title":"MiniCPM-V: A GPT-4V Level MLLM on Your Phone","date":"2024-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openbmb/minicpm-v","path":"finetune/finetune.py","file_url":"https://github.com/openbmb/minicpm-v/blob/HEAD/finetune/finetune.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":"1a3baf406bc7de64","code_sha256_prefix":"1a3baf406bc7de64","mcp_get_code":{"code_sha256":"1a3baf406bc7de64"}},{"arxiv_id":"2405.17220","arxiv_id_is_arxiv":true,"paper":"/paper/rlaif-v-aligning-mllms-through-open-source-ai","title":"RLAIF-V: Open-Source AI Feedback Leads to Super GPT-4V Trustworthiness","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openbmb/omnilmm","path":"finetune/finetune.py","file_url":"https://github.com/openbmb/omnilmm/blob/HEAD/finetune/finetune.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":"1a3baf406bc7de64","code_sha256_prefix":"1a3baf406bc7de64","mcp_get_code":{"code_sha256":"1a3baf406bc7de64"}},{"arxiv_id":"2405.12591","arxiv_id_is_arxiv":true,"paper":"/paper/unlocking-data-free-low-bit-quantization-with","title":"Unlocking Data-free Low-bit Quantization with Matrix Decomposition for KV Cache Compression","date":"2024-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lpyhdzx/DecoQuant_code","path":"icl/evaluate_icl_ori.py","file_url":"https://github.com/lpyhdzx/DecoQuant_code/blob/HEAD/icl/evaluate_icl_ori.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, lpyhdzx/DecoQuant_code when it was checked","code_sha256":"383d339873e8f63f","code_sha256_prefix":"383d339873e8f63f","mcp_get_code":{"code_sha256":"383d339873e8f63f"}},{"arxiv_id":"2405.02843","arxiv_id_is_arxiv":true,"paper":"/paper/residual-conditioned-optimal-transport","title":"Residual-Conditioned Optimal Transport: Towards Structure-Preserving Unpaired and Paired Image Restoration","date":"2024-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xl-tang3/RCOT","path":"trainer.py","file_url":"https://github.com/xl-tang3/RCOT/blob/HEAD/trainer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xl-tang3/RCOT when it was checked","code_sha256":"a23501ebdd938df8","code_sha256_prefix":"a23501ebdd938df8","mcp_get_code":{"code_sha256":"a23501ebdd938df8"}},{"arxiv_id":"2404.03637","arxiv_id_is_arxiv":true,"paper":"/paper/sequential-recommendation-for-optimizing-both","title":"Sequential Recommendation for Optimizing Both Immediate Feedback and Long-term Retention","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"applied-machine-learning-lab/dt4ier","path":"GPT_trainer_returnscore.py","file_url":"https://github.com/applied-machine-learning-lab/dt4ier/blob/HEAD/GPT_trainer_returnscore.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, applied-machine-learning-lab/dt4ier when it was checked","code_sha256":"b2fb8159f199e5b8","code_sha256_prefix":"b2fb8159f199e5b8","mcp_get_code":{"code_sha256":"b2fb8159f199e5b8"}},{"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/run_glue_v5.py","file_url":"https://github.com/yifanycc/loretta/blob/HEAD/bert_model/run_glue_v5.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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":"918fc46b5088d174","code_sha256_prefix":"918fc46b5088d174","mcp_get_code":{"code_sha256":"918fc46b5088d174"}},{"arxiv_id":"2310.18274","arxiv_id_is_arxiv":true,"paper":"/paper/lipsim-a-provably-robust-perceptual","title":"LipSim: A Provably Robust Perceptual Similarity Metric","date":"2023-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"saraghazanfari/lipsim","path":"lipsim/core/utils.py","file_url":"https://github.com/saraghazanfari/lipsim/blob/HEAD/lipsim/core/utils.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, saraghazanfari/lipsim when it was checked","code_sha256":"f5db246ea9eec533","code_sha256_prefix":"f5db246ea9eec533","mcp_get_code":{"code_sha256":"f5db246ea9eec533"}},{"arxiv_id":"2309.05613","arxiv_id_is_arxiv":true,"paper":"/paper/learning-the-geodesic-embedding-with-graph","title":"Learning the Geodesic Embedding with Graph Neural Networks","date":"2023-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intelligentgeometry/gegnn","path":"GnnDist.py","file_url":"https://github.com/intelligentgeometry/gegnn/blob/HEAD/GnnDist.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, intelligentgeometry/gegnn when it was checked","code_sha256":"ef891d3fc0e86020","code_sha256_prefix":"ef891d3fc0e86020","mcp_get_code":{"code_sha256":"ef891d3fc0e86020"}},{"arxiv_id":"2308.13894","arxiv_id_is_arxiv":true,"paper":"/paper/federated-fine-tuning-of-billion-sized","title":"FwdLLM: Efficient FedLLM using Forward Gradient","date":"2023-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ubiquitouslearning/fwdllm","path":"process-design-pitfall-memory-inference.py","file_url":"https://github.com/ubiquitouslearning/fwdllm/blob/HEAD/process-design-pitfall-memory-inference.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, ubiquitouslearning/fwdllm when it was checked","code_sha256":"b2fb8159f199e5b8","code_sha256_prefix":"b2fb8159f199e5b8","mcp_get_code":{"code_sha256":"b2fb8159f199e5b8"}},{"arxiv_id":"2308.13259","arxiv_id_is_arxiv":true,"paper":"/paper/knowledge-driven-cot-exploring-faithful","title":"Knowledge-Driven CoT: Exploring Faithful Reasoning in LLMs for Knowledge-intensive Question Answering","date":"2023-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adelwang/kd-cot","path":"verifier_and_cot_finetuning/data_utils/data_utils.py","file_url":"https://github.com/adelwang/kd-cot/blob/HEAD/verifier_and_cot_finetuning/data_utils/data_utils.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, adelwang/kd-cot when it was checked","code_sha256":"4bf8c7490aa8c35b","code_sha256_prefix":"4bf8c7490aa8c35b","mcp_get_code":{"code_sha256":"4bf8c7490aa8c35b"}},{"arxiv_id":"2304.07574","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-incompatible-knowledge-transfer-in","title":"Exploring Incompatible Knowledge Transfer in Few-shot Image Generation","date":"2023-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunqing-me/RICK","path":"gan_training/utils_model_load.py","file_url":"https://github.com/yunqing-me/RICK/blob/HEAD/gan_training/utils_model_load.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":"a6c491bc2737153b","code_sha256_prefix":"a6c491bc2737153b","mcp_get_code":{"code_sha256":"a6c491bc2737153b"}},{"arxiv_id":"2302.11215","arxiv_id_is_arxiv":true,"paper":"/paper/energy-based-test-sample-adaptation-for","title":"Energy-Based Test Sample Adaptation for Domain Generalization","date":"2023-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzzx1224/ebtsa-iclr2023","path":"ebmdg_main.py","file_url":"https://github.com/zzzx1224/ebtsa-iclr2023/blob/HEAD/ebmdg_main.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, zzzx1224/ebtsa-iclr2023 when it was checked","code_sha256":"b2fb8159f199e5b8","code_sha256_prefix":"b2fb8159f199e5b8","mcp_get_code":{"code_sha256":"b2fb8159f199e5b8"}},{"arxiv_id":"2210.16559","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-image-generation-via-adaptation","title":"Few-shot Image Generation via Adaptation-Aware Kernel Modulation","date":"2022-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunqing-me/AdAM","path":"gan_training/utils_model_load.py","file_url":"https://github.com/yunqing-me/AdAM/blob/HEAD/gan_training/utils_model_load.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":"a6c491bc2737153b","code_sha256_prefix":"a6c491bc2737153b","mcp_get_code":{"code_sha256":"a6c491bc2737153b"}},{"arxiv_id":"2203.03619","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-cross-layer-attention-for-image-1","title":"Adaptive Cross-Layer Attention for Image Restoration","date":"2022-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sdl-asu/acla","path":"SR/model/common.py","file_url":"https://github.com/sdl-asu/acla/blob/HEAD/SR/model/common.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from zzzx1224/ebtsa-iclr2023, and GitHub detected no licence in that repository when it was checked","code_sha256":"b2fb8159f199e5b8","code_sha256_prefix":"b2fb8159f199e5b8","mcp_get_code":{"code_sha256":"b2fb8159f199e5b8"}},{"arxiv_id":"2109.04096","arxiv_id_is_arxiv":true,"paper":"/paper/a-three-stage-learning-framework-for-low","title":"A Three-Stage Learning Framework for Low-Resource Knowledge-Grounded Dialogue Generation","date":"2021-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neukg/kat-tslf","path":"run_kat.py","file_url":"https://github.com/neukg/kat-tslf/blob/HEAD/run_kat.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":"e7a0f438d6d3b92f","code_sha256_prefix":"e7a0f438d6d3b92f","mcp_get_code":{"code_sha256":"e7a0f438d6d3b92f"}}],"record_sha256":"e8c240eee70e93f87a86e9785c67d059a8603eb723a6ddc53d2c89e841d0e918","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}