{"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/permute","entry":"permute","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":15,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":3,"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":7,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":16,"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":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":3,"unverified":2},"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":"2608.17809","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-17809","title":"Whether LLMs Can Navigate Beliefs and Facts Depends on How You Phrase It","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"ngqm/belief-fact-phrasing","path":"src/controls/option_permute_control.py","file_url":"https://github.com/ngqm/belief-fact-phrasing/blob/HEAD/src/controls/option_permute_control.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"306ce30c9724e57b","code_sha256_prefix":"306ce30c9724e57b","mcp_get_code":{"code_sha256":"306ce30c9724e57b"}},{"arxiv_id":"2608.17809","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-17809","title":"Whether LLMs Can Navigate Beliefs and Facts Depends on How You Phrase It","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"ngqm/belief-fact-phrasing","path":"src/controls/option_permute_control_or.py","file_url":"https://github.com/ngqm/belief-fact-phrasing/blob/HEAD/src/controls/option_permute_control_or.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"47ba2725ada1113c","code_sha256_prefix":"47ba2725ada1113c","mcp_get_code":{"code_sha256":"47ba2725ada1113c"}},{"arxiv_id":"2605.08110","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-08110","title":"BaLoRA: Bayesian Low-Rank Adaptation of Large Scale Models","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"AGI-Edgerunners/LLM-Adapters","path":"export_state_dict_checkpoint.py","file_url":"https://github.com/AGI-Edgerunners/LLM-Adapters/blob/HEAD/export_state_dict_checkpoint.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":"a2f49e13f6e13d6b","code_sha256_prefix":"a2f49e13f6e13d6b","mcp_get_code":{"code_sha256":"a2f49e13f6e13d6b"}},{"arxiv_id":"2510.03276","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-03276","title":"QuadEnhancer: Leveraging Quadratic Transformations to Enhance Deep Neural Networks","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"chitar/QuadEnhancer","path":"LLM-finetuning/export_state_dict_checkpoint.py","file_url":"https://github.com/chitar/QuadEnhancer/blob/HEAD/LLM-finetuning/export_state_dict_checkpoint.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, chitar/QuadEnhancer when it was checked","code_sha256":"a2f49e13f6e13d6b","code_sha256_prefix":"a2f49e13f6e13d6b","mcp_get_code":{"code_sha256":"a2f49e13f6e13d6b"}},{"arxiv_id":"2409.01035","arxiv_id_is_arxiv":true,"paper":"/paper/unleashing-the-power-of-task-specific","title":"Task-Specific Directions: Definition, Exploration, and Utilization in Parameter Efficient Fine-Tuning","date":"2024-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Chongjie-Si/Subspace-Tuning","path":"CR_MR/export_state_dict_checkpoint.py","file_url":"https://github.com/Chongjie-Si/Subspace-Tuning/blob/HEAD/CR_MR/export_state_dict_checkpoint.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":"a2f49e13f6e13d6b","code_sha256_prefix":"a2f49e13f6e13d6b","mcp_get_code":{"code_sha256":"a2f49e13f6e13d6b"}},{"arxiv_id":"2405.17991","arxiv_id_is_arxiv":true,"paper":"/paper/velora-memory-efficient-training-using-rank-1","title":"VeLoRA: Memory Efficient Training using Rank-1 Sub-Token Projections","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tloen/alpaca-lora","path":"export_state_dict_checkpoint.py","file_url":"https://github.com/tloen/alpaca-lora/blob/HEAD/export_state_dict_checkpoint.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":"a2f49e13f6e13d6b","code_sha256_prefix":"a2f49e13f6e13d6b","mcp_get_code":{"code_sha256":"a2f49e13f6e13d6b"}},{"arxiv_id":"2402.09353","arxiv_id_is_arxiv":true,"paper":"/paper/dora-weight-decomposed-low-rank-adaptation","title":"DoRA: Weight-Decomposed Low-Rank Adaptation","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/DoRA","path":"commonsense_reasoning/export_state_dict_checkpoint.py","file_url":"https://github.com/NVlabs/DoRA/blob/HEAD/commonsense_reasoning/export_state_dict_checkpoint.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, NVlabs/DoRA when it was checked","code_sha256":"a2f49e13f6e13d6b","code_sha256_prefix":"a2f49e13f6e13d6b","mcp_get_code":{"code_sha256":"a2f49e13f6e13d6b"}},{"arxiv_id":"2309.04175","arxiv_id_is_arxiv":true,"paper":"/paper/knowledge-tuning-large-language-models-with","title":"Knowledge-tuning Large Language Models with Structured Medical Knowledge Bases for Reliable Response Generation in Chinese","date":"2023-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scir-hi/huatuo-llama-med-chinese","path":"export_state_dict_checkpoint.py","file_url":"https://github.com/scir-hi/huatuo-llama-med-chinese/blob/HEAD/export_state_dict_checkpoint.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":"a2f49e13f6e13d6b","code_sha256_prefix":"a2f49e13f6e13d6b","mcp_get_code":{"code_sha256":"a2f49e13f6e13d6b"}},{"arxiv_id":"2307.00457","arxiv_id_is_arxiv":true,"paper":"/paper/text-based-large-language-model-for","title":"GenRec: Large Language Model for Generative Recommendation","date":"2023-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rutgerswiselab/genrec","path":"export_state_dict_checkpoint.py","file_url":"https://github.com/rutgerswiselab/genrec/blob/HEAD/export_state_dict_checkpoint.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":"a2f49e13f6e13d6b","code_sha256_prefix":"a2f49e13f6e13d6b","mcp_get_code":{"code_sha256":"a2f49e13f6e13d6b"}},{"arxiv_id":"2306.05268","arxiv_id_is_arxiv":true,"paper":"/paper/factorized-contrastive-learning-going-beyond","title":"Factorized Contrastive Learning: Going Beyond Multi-view Redundancy","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pliang279/FactorCL","path":"IRFL_model.py","file_url":"https://github.com/pliang279/FactorCL/blob/HEAD/IRFL_model.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":"5477d0827fb36dd7","code_sha256_prefix":"5477d0827fb36dd7","mcp_get_code":{"code_sha256":"5477d0827fb36dd7"}},{"arxiv_id":"2306.05064","arxiv_id_is_arxiv":true,"paper":"/paper/learning-a-foundation-language-model-for","title":"K2: A Foundation Language Model for Geoscience Knowledge Understanding and Utilization","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davendw49/k2","path":"export_state_dict_checkpoint.py","file_url":"https://github.com/davendw49/k2/blob/HEAD/export_state_dict_checkpoint.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":"a2f49e13f6e13d6b","code_sha256_prefix":"a2f49e13f6e13d6b","mcp_get_code":{"code_sha256":"a2f49e13f6e13d6b"}},{"arxiv_id":"2305.00447","arxiv_id_is_arxiv":true,"paper":"/paper/tallrec-an-effective-and-efficient-tuning","title":"TALLRec: An Effective and Efficient Tuning Framework to Align Large Language Model with Recommendation","date":"2023-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sai990323/tallrec","path":"export_state_dict_checkpoint.py","file_url":"https://github.com/sai990323/tallrec/blob/HEAD/export_state_dict_checkpoint.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":"a2f49e13f6e13d6b","code_sha256_prefix":"a2f49e13f6e13d6b","mcp_get_code":{"code_sha256":"a2f49e13f6e13d6b"}},{"arxiv_id":"2207.14255","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-training-of-language-models-to-fill","title":"Efficient Training of Language Models to Fill in the Middle","date":"2022-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"loubnabnl/santacoder-finetuning","path":"fim.py","file_url":"https://github.com/loubnabnl/santacoder-finetuning/blob/HEAD/fim.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":"6245ccab460ba92b","code_sha256_prefix":"6245ccab460ba92b","mcp_get_code":{"code_sha256":"6245ccab460ba92b"}},{"arxiv_id":"2003.09040","arxiv_id_is_arxiv":true,"paper":"/paper/tf-coder-program-synthesis-for-tensor","title":"TF-Coder: Program Synthesis for Tensor Manipulations","date":"2020-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grwlf/galaxy-lang","path":"src/galang/gen.py","file_url":"https://github.com/grwlf/galaxy-lang/blob/HEAD/src/galang/gen.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":"40fe88a021d3c23b","code_sha256_prefix":"40fe88a021d3c23b","mcp_get_code":{"code_sha256":"40fe88a021d3c23b"}},{"arxiv_id":"1908.08486","arxiv_id_is_arxiv":true,"paper":"/paper/a-neural-model-for-dialogue-coherence","title":"Dialogue Coherence Assessment Without Explicit Dialogue Act Labels","date":"2019-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UKPLab/acl2020-dialogue-coherence-assessment","path":"create_coherency_dataset.py","file_url":"https://github.com/UKPLab/acl2020-dialogue-coherence-assessment/blob/HEAD/create_coherency_dataset.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":"78064a7b80034401","code_sha256_prefix":"78064a7b80034401","mcp_get_code":{"code_sha256":"78064a7b80034401"}},{"arxiv_id":"2023.findings-emnlp.269","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-emnlp.269","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"PhoebusSi/Alpaca-CoT","path":"export_state_dict_checkpoint.py","file_url":"https://github.com/PhoebusSi/Alpaca-CoT/blob/HEAD/export_state_dict_checkpoint.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":"a2f49e13f6e13d6b","code_sha256_prefix":"a2f49e13f6e13d6b","mcp_get_code":{"code_sha256":"a2f49e13f6e13d6b"}}],"record_sha256":"31d50072e3494be2d446720c5a0678cf8da72234a9dcadc33b1acc76c19fd19b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}