{"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/load-clip-to-cpu","entry":"load_clip_to_cpu","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":9,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"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":8,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":8,"n_samples_fingerprinted":0,"n_places":9,"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":0,"ran_fixture":0,"ran":0,"unverified":8},"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":"2409.19720","arxiv_id_is_arxiv":true,"paper":"/paper/fast-a-dual-tier-few-shot-learning-paradigm","title":"FAST: A Dual-tier Few-Shot Learning Paradigm for Whole Slide Image Classification","date":"2024-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fukexue/FAST","path":"FAST_CAMELYON_CONCH_Train.py","file_url":"https://github.com/fukexue/FAST/blob/HEAD/FAST_CAMELYON_CONCH_Train.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, fukexue/FAST when it was checked","code_sha256":"b272fde70a038dd8","code_sha256_prefix":"b272fde70a038dd8","mcp_get_code":{"code_sha256":"b272fde70a038dd8"}},{"arxiv_id":"2408.07500","arxiv_id_is_arxiv":true,"paper":"/paper/cross-platform-video-person-reid-a-new","title":"Cross-Platform Video Person ReID: A New Benchmark Dataset and Adaptation Approach","date":"2024-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FHR-L/VSLA-CLIP","path":"model/make_model_clipvideoreid_reidadapter_pbp.py","file_url":"https://github.com/FHR-L/VSLA-CLIP/blob/HEAD/model/make_model_clipvideoreid_reidadapter_pbp.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, FHR-L/VSLA-CLIP when it was checked","code_sha256":"1a74fdcd6c2a7e50","code_sha256_prefix":"1a74fdcd6c2a7e50","mcp_get_code":{"code_sha256":"1a74fdcd6c2a7e50"}},{"arxiv_id":"2402.07220","arxiv_id_is_arxiv":true,"paper":"/paper/kvq-kaleidoscope-video-quality-assessment-for","title":"KVQ: Kwai Video Quality Assessment for Short-form Videos","date":"2024-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lixinustc/kvq-challenge-cvpr-ntire2024","path":"models/backbones/KSVQE_model.py","file_url":"https://github.com/lixinustc/kvq-challenge-cvpr-ntire2024/blob/HEAD/models/backbones/KSVQE_model.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, lixinustc/kvq-challenge-cvpr-ntire2024 when it was checked","code_sha256":"04ec11cc7e389655","code_sha256_prefix":"04ec11cc7e389655","mcp_get_code":{"code_sha256":"04ec11cc7e389655"}},{"arxiv_id":"2307.11661","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-clip-with-gpt-4-harnessing-visual","title":"Enhancing CLIP with GPT-4: Harnessing Visual Descriptions as Prompts","date":"2023-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mayug/vdt-adapter","path":"trainers/clip_adapter_gpt.py","file_url":"https://github.com/mayug/vdt-adapter/blob/HEAD/trainers/clip_adapter_gpt.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":"8b59f779d6e14bcd","code_sha256_prefix":"8b59f779d6e14bcd","mcp_get_code":{"code_sha256":"8b59f779d6e14bcd"}},{"arxiv_id":"2305.17891","arxiv_id_is_arxiv":true,"paper":"/paper/the-rise-of-ai-language-pathologists","title":"The Rise of AI Language Pathologists: Exploring Two-level Prompt Learning for Few-shot Weakly-supervised Whole Slide Image Classification","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"miccaiif/top","path":"models/learnable_prompt.py","file_url":"https://github.com/miccaiif/top/blob/HEAD/models/learnable_prompt.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, miccaiif/top when it was checked","code_sha256":"189c2a181a2bba06","code_sha256_prefix":"189c2a181a2bba06","mcp_get_code":{"code_sha256":"189c2a181a2bba06"}},{"arxiv_id":"2303.09833","arxiv_id_is_arxiv":true,"paper":"/paper/freedom-training-free-energy-guided","title":"FreeDoM: Training-Free Energy-Guided Conditional Diffusion Model","date":"2023-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vvictoryuki/freedom","path":"Face-GD/functions/denoising.py","file_url":"https://github.com/vvictoryuki/freedom/blob/HEAD/Face-GD/functions/denoising.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, vvictoryuki/freedom when it was checked","code_sha256":"9975858156fe9960","code_sha256_prefix":"9975858156fe9960","mcp_get_code":{"code_sha256":"9975858156fe9960"}},{"arxiv_id":"2109.01134","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-prompt-for-vision-language-models","title":"Learning to Prompt for Vision-Language Models","date":"2021-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hhenryd/tap","path":"trainers/TAP.py","file_url":"https://github.com/hhenryd/tap/blob/HEAD/trainers/TAP.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":"0f982cfc0f69d842","code_sha256_prefix":"0f982cfc0f69d842","mcp_get_code":{"code_sha256":"0f982cfc0f69d842"}},{"arxiv_id":"aaai_28500","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28500","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"AsuradaYuci/TF-CLIP","path":"model/make_model_clipreid.py","file_url":"https://github.com/AsuradaYuci/TF-CLIP/blob/HEAD/model/make_model_clipreid.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":"6e2d8241bee4c199","code_sha256_prefix":"6e2d8241bee4c199","mcp_get_code":{"code_sha256":"6e2d8241bee4c199"}},{"arxiv_id":"aaai_25225","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25225","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Syliz517/CLIP-ReID","path":"model/make_model.py","file_url":"https://github.com/Syliz517/CLIP-ReID/blob/HEAD/model/make_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":"6e2d8241bee4c199","code_sha256_prefix":"6e2d8241bee4c199","mcp_get_code":{"code_sha256":"6e2d8241bee4c199"}}],"record_sha256":"1c76dda061e2fd93a31bf40a69a12293ba443f4cdbdcd5bd47a3652cf00e6e3a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}