{"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/is-torch-tpu-available","entry":"is_torch_tpu_available","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":8,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":8,"n_places_pointer_only_link_open":3,"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":0,"ran_fixture":2,"ran":0,"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":"2412.06071","arxiv_id_is_arxiv":true,"paper":"/paper/kasa-knowledge-aware-singular-value","title":"KaSA: Knowledge-Aware Singular-Value Adaptation of Large Language Models","date":"2024-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juyongjiang/KaSA","path":"peft/src/peft/import_utils.py","file_url":"https://github.com/juyongjiang/KaSA/blob/HEAD/peft/src/peft/import_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","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, juyongjiang/KaSA when it was checked","code_sha256":"a3daaf3e5bdfc709","code_sha256_prefix":"a3daaf3e5bdfc709","mcp_get_code":{"code_sha256":"a3daaf3e5bdfc709"}},{"arxiv_id":"2409.10673","arxiv_id_is_arxiv":true,"paper":"/paper/a-bayesian-interpretation-of-adaptive-low","title":"A Bayesian Interpretation of Adaptive Low-Rank Adaptation","date":"2024-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idiap/vilora","path":"peft/src/peft/import_utils.py","file_url":"https://github.com/idiap/vilora/blob/HEAD/peft/src/peft/import_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","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, idiap/vilora when it was checked","code_sha256":"a3daaf3e5bdfc709","code_sha256_prefix":"a3daaf3e5bdfc709","mcp_get_code":{"code_sha256":"a3daaf3e5bdfc709"}},{"arxiv_id":"2408.15300","arxiv_id_is_arxiv":true,"paper":"/paper/gift-sw-gaussian-noise-injected-fine-tuning","title":"GIFT-SW: Gaussian noise Injected Fine-Tuning of Salient Weights for LLMs","date":"2024-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"On-Point-RND/GIFT_SW","path":"src/peft/import_utils.py","file_url":"https://github.com/On-Point-RND/GIFT_SW/blob/HEAD/src/peft/import_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from juyongjiang/KaSA, and GitHub detected no licence in that repository when it was checked","code_sha256":"a3daaf3e5bdfc709","code_sha256_prefix":"a3daaf3e5bdfc709","mcp_get_code":{"code_sha256":"a3daaf3e5bdfc709"}},{"arxiv_id":"2408.12325","arxiv_id_is_arxiv":true,"paper":"/paper/improving-factuality-in-large-language-models","title":"Improving Factuality in Large Language Models via Decoding-Time Hallucinatory and Truthful Comparators","date":"2024-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ydk122024/cdt","path":"src/peft/import_utils.py","file_url":"https://github.com/ydk122024/cdt/blob/HEAD/src/peft/import_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","metamorphic_tier":null,"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 juyongjiang/KaSA, and GitHub detected no licence in that repository when it was checked","code_sha256":"a3daaf3e5bdfc709","code_sha256_prefix":"a3daaf3e5bdfc709","mcp_get_code":{"code_sha256":"a3daaf3e5bdfc709"}},{"arxiv_id":"2406.12629","arxiv_id_is_arxiv":true,"paper":"/paper/setar-out-of-distribution-detection-with","title":"SeTAR: Out-of-Distribution Detection with Selective Low-Rank Approximation","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"X1AOX1A/SeTAR","path":"src/peft/peft/import_utils.py","file_url":"https://github.com/X1AOX1A/SeTAR/blob/HEAD/src/peft/peft/import_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","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, X1AOX1A/SeTAR when it was checked","code_sha256":"a3daaf3e5bdfc709","code_sha256_prefix":"a3daaf3e5bdfc709","mcp_get_code":{"code_sha256":"a3daaf3e5bdfc709"}},{"arxiv_id":"2406.05130","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-study-on-parameter-efficient","title":"An Empirical Study on Parameter-Efficient Fine-Tuning for MultiModal Large Language Models","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alenai97/peft-mllm","path":"peft/src/peft/import_utils.py","file_url":"https://github.com/alenai97/peft-mllm/blob/HEAD/peft/src/peft/import_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","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, alenai97/peft-mllm when it was checked","code_sha256":"f4c98aa4d8282317","code_sha256_prefix":"f4c98aa4d8282317","mcp_get_code":{"code_sha256":"f4c98aa4d8282317"}},{"arxiv_id":"2405.12130","arxiv_id_is_arxiv":true,"paper":"/paper/mora-high-rank-updating-for-parameter","title":"MoRA: High-Rank Updating for Parameter-Efficient Fine-Tuning","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kongds/mora","path":"peft-mora/src/peft/import_utils.py","file_url":"https://github.com/kongds/mora/blob/HEAD/peft-mora/src/peft/import_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from juyongjiang/KaSA, and GitHub detected no licence in that repository when it was checked","code_sha256":"a3daaf3e5bdfc709","code_sha256_prefix":"a3daaf3e5bdfc709","mcp_get_code":{"code_sha256":"a3daaf3e5bdfc709"}},{"arxiv_id":"2404.04316","arxiv_id_is_arxiv":true,"paper":"/paper/parameter-efficient-quasi-orthogonal-fine","title":"Parameter Efficient Quasi-Orthogonal Fine-Tuning via Givens Rotation","date":"2024-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ArthurLeoM/peft-givens","path":"import_utils.py","file_url":"https://github.com/ArthurLeoM/peft-givens/blob/HEAD/import_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","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, ArthurLeoM/peft-givens when it was checked","code_sha256":"a3daaf3e5bdfc709","code_sha256_prefix":"a3daaf3e5bdfc709","mcp_get_code":{"code_sha256":"a3daaf3e5bdfc709"}}],"record_sha256":"608c7adc562654759ad77452ab3aa236b937b28e7ef99d67bd7f42a5a4bc849c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}