{"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/select-confident-samples","entry":"select_confident_samples","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":10,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":1,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":12,"n_places_pointer_only":5,"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":3,"ran_fixture":0,"ran":1,"unverified":1},"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":"2503.12866","arxiv_id_is_arxiv":true,"paper":"/paper/scap-transductive-test-time-adaptation-via-1","title":"SCAP: Transductive Test-Time Adaptation via Supportive Clique-based Attribute Prompting","date":"2025-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhoujiahuan1991/CVPR2025-SCAP","path":"batch_utils.py","file_url":"https://github.com/zhoujiahuan1991/CVPR2025-SCAP/blob/HEAD/batch_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ce4d11e58de02ad","code_sha256_prefix":"3ce4d11e58de02ad","mcp_get_code":{"code_sha256":"3ce4d11e58de02ad"}},{"arxiv_id":"2412.09706","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-enhanced-test-time-adaptation-with","title":"Diffusion-Enhanced Test-time Adaptation with Text and Image Augmentation","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"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":"3ce4d11e58de02ad","code_sha256_prefix":"3ce4d11e58de02ad","mcp_get_code":{"code_sha256":"3ce4d11e58de02ad"}},{"arxiv_id":"2410.15430","arxiv_id_is_arxiv":true,"paper":"/paper/boostadapter-improving-test-time-adaptation","title":"BoostAdapter: Improving Vision-Language Test-Time Adaptation via Regional Bootstrapping","date":"2024-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taolinzhang/boostadapter","path":"runner.py","file_url":"https://github.com/taolinzhang/boostadapter/blob/HEAD/runner.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6460989d9e69e02f","code_sha256_prefix":"6460989d9e69e02f","mcp_get_code":{"code_sha256":"6460989d9e69e02f"}},{"arxiv_id":"2407.15913","arxiv_id_is_arxiv":true,"paper":"/paper/test-time-low-rank-adaptation-via-confidence","title":"Test-Time Low Rank Adaptation via Confidence Maximization for Zero-Shot Generalization of Vision-Language Models","date":"2024-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"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":"3ce4d11e58de02ad","code_sha256_prefix":"3ce4d11e58de02ad","mcp_get_code":{"code_sha256":"3ce4d11e58de02ad"}},{"arxiv_id":"2403.14119","arxiv_id_is_arxiv":true,"paper":"/paper/c-tpt-calibrated-test-time-prompt-tuning-for","title":"C-TPT: Calibrated Test-Time Prompt Tuning for Vision-Language Models via Text Feature Dispersion","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hee-suk-yoon/C-TPT","path":"tpt_classification.py","file_url":"https://github.com/hee-suk-yoon/C-TPT/blob/HEAD/tpt_classification.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ce4d11e58de02ad","code_sha256_prefix":"3ce4d11e58de02ad","mcp_get_code":{"code_sha256":"3ce4d11e58de02ad"}},{"arxiv_id":"2403.07369","arxiv_id_is_arxiv":true,"paper":"/paper/textual-knowledge-matters-cross-modality-co","title":"Textual Knowledge Matters: Cross-Modality Co-Teaching for Generalized Visual Class Discovery","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haiyangzheng/textgcd","path":"utils/train_utils.py","file_url":"https://github.com/haiyangzheng/textgcd/blob/HEAD/utils/train_utils.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, haiyangzheng/textgcd when it was checked","code_sha256":"00bcaa100d09df79","code_sha256_prefix":"00bcaa100d09df79","mcp_get_code":{"code_sha256":"00bcaa100d09df79"}},{"arxiv_id":"2401.15657","arxiv_id_is_arxiv":true,"paper":"/paper/data-free-generalized-zero-shot-learning","title":"Data-Free Generalized Zero-Shot Learning","date":"2024-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ylong4/dfzsl","path":"pt/feature_train_prompt.py","file_url":"https://github.com/ylong4/dfzsl/blob/HEAD/pt/feature_train_prompt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ylong4/dfzsl when it was checked","code_sha256":"3ce4d11e58de02ad","code_sha256_prefix":"3ce4d11e58de02ad","mcp_get_code":{"code_sha256":"3ce4d11e58de02ad"}},{"arxiv_id":"2305.18010","arxiv_id_is_arxiv":true,"paper":"/paper/test-time-adaptation-with-clip-reward-for","title":"Test-Time Adaptation with CLIP Reward for Zero-Shot Generalization in Vision-Language Models","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mzhaoshuai/RLCF","path":"TPT/tpt_cls.py","file_url":"https://github.com/mzhaoshuai/RLCF/blob/HEAD/TPT/tpt_cls.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ce4d11e58de02ad","code_sha256_prefix":"3ce4d11e58de02ad","mcp_get_code":{"code_sha256":"3ce4d11e58de02ad"}},{"arxiv_id":"2305.18010","arxiv_id_is_arxiv":true,"paper":"/paper/test-time-adaptation-with-clip-reward-for","title":"Test-Time Adaptation with CLIP Reward for Zero-Shot Generalization in Vision-Language Models","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mzhaoshuai/RLCF","path":"TPT/tpt_cls_rl.py","file_url":"https://github.com/mzhaoshuai/RLCF/blob/HEAD/TPT/tpt_cls_rl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"03602a2e9952cb27","code_sha256_prefix":"03602a2e9952cb27","mcp_get_code":{"code_sha256":"03602a2e9952cb27"}},{"arxiv_id":"2209.07511","arxiv_id_is_arxiv":true,"paper":"/paper/test-time-prompt-tuning-for-zero-shot","title":"Test-Time Prompt Tuning for Zero-Shot Generalization in Vision-Language Models","date":"2022-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"azshue/TPT","path":"tpt_classification.py","file_url":"https://github.com/azshue/TPT/blob/HEAD/tpt_classification.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ce4d11e58de02ad","code_sha256_prefix":"3ce4d11e58de02ad","mcp_get_code":{"code_sha256":"3ce4d11e58de02ad"}},{"arxiv_id":"2209.07511","arxiv_id_is_arxiv":true,"paper":"/paper/test-time-prompt-tuning-for-zero-shot","title":"Test-Time Prompt Tuning for Zero-Shot Generalization in Vision-Language Models","date":"2022-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"azshue/TPT","path":"tpt_classification.py","file_url":"https://github.com/azshue/TPT/blob/HEAD/tpt_classification.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"93433d4c63e62457","code_sha256_prefix":"93433d4c63e62457","mcp_get_code":{"code_sha256":"93433d4c63e62457"}},{"arxiv_id":"2103.00020","arxiv_id_is_arxiv":true,"paper":"/paper/learning-transferable-visual-models-from","title":"Learning Transferable Visual Models From Natural Language Supervision","date":"2021-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"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":"3ce4d11e58de02ad","code_sha256_prefix":"3ce4d11e58de02ad","mcp_get_code":{"code_sha256":"3ce4d11e58de02ad"}}],"record_sha256":"21edaf9fe5a9631c8e4060cf49301c647a0380e947b36e4e320e2f2665f9f5bc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}