{"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/tensor-prompt","entry":"tensor_prompt","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":8,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":9,"n_places_pointer_only":6,"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":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"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":"2606.12633","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-12633","title":"ECA: Efficient Continual Alignment for Open-Ended Image-to-Text Generation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Snowball0823/ECA","path":"models/ECA_LlaVA/utils.py","file_url":"https://github.com/Snowball0823/ECA/blob/HEAD/models/ECA_LlaVA/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Snowball0823/ECA when it was checked","code_sha256":"3f33843b601c8d4d","code_sha256_prefix":"3f33843b601c8d4d","mcp_get_code":{"code_sha256":"3f33843b601c8d4d"}},{"arxiv_id":"2509.19674","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-19674","title":"C²Prompt: Class-aware Client Knowledge Interaction for Federated Continual Learning","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"zhoujiahuan1991/NeurIPS2025-C2Prompt","path":"models_Cprompt/vit_coda_p_hard.py","file_url":"https://github.com/zhoujiahuan1991/NeurIPS2025-C2Prompt/blob/HEAD/models_Cprompt/vit_coda_p_hard.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhoujiahuan1991/NeurIPS2025-C2Prompt when it was checked","code_sha256":"238a8354f5b75bd3","code_sha256_prefix":"238a8354f5b75bd3","mcp_get_code":{"code_sha256":"238a8354f5b75bd3"}},{"arxiv_id":"2509.19674","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-19674","title":"C²Prompt: Class-aware Client Knowledge Interaction for Federated Continual Learning","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"zhoujiahuan1991/NeurIPS2025-C2Prompt","path":"models_Cprompt/vit_coda_p.py","file_url":"https://github.com/zhoujiahuan1991/NeurIPS2025-C2Prompt/blob/HEAD/models_Cprompt/vit_coda_p.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, zhoujiahuan1991/NeurIPS2025-C2Prompt when it was checked","code_sha256":"c6db6c2bceedd520","code_sha256_prefix":"c6db6c2bceedd520","mcp_get_code":{"code_sha256":"c6db6c2bceedd520"}},{"arxiv_id":"2506.00406","arxiv_id_is_arxiv":true,"paper":"/paper/idpa-instance-decoupled-prompt-attention-for","title":"iDPA: Instance Decoupled Prompt Attention for Incremental Medical Object Detection","date":"2025-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HarveyYi/iDPA","path":"maskrcnn_benchmark/modeling/clm/ipg_dpas.py","file_url":"https://github.com/HarveyYi/iDPA/blob/HEAD/maskrcnn_benchmark/modeling/clm/ipg_dpas.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, HarveyYi/iDPA when it was checked","code_sha256":"4e9666c72969966b","code_sha256_prefix":"4e9666c72969966b","mcp_get_code":{"code_sha256":"4e9666c72969966b"}},{"arxiv_id":"2410.20444","arxiv_id_is_arxiv":true,"paper":"/paper/vector-quantization-prompting-for-continual","title":"Vector Quantization Prompting for Continual Learning","date":"2024-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaolifengmi/VQ-Prompt","path":"models/zoo.py","file_url":"https://github.com/jiaolifengmi/VQ-Prompt/blob/HEAD/models/zoo.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3f33843b601c8d4d","code_sha256_prefix":"3f33843b601c8d4d","mcp_get_code":{"code_sha256":"3f33843b601c8d4d"}},{"arxiv_id":"2403.08568","arxiv_id_is_arxiv":true,"paper":"/paper/consistent-prompting-for-rehearsal-free","title":"Consistent Prompting for Rehearsal-Free Continual Learning","date":"2024-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhanxin-Gao/CPrompt","path":"models/cprompt.py","file_url":"https://github.com/Zhanxin-Gao/CPrompt/blob/HEAD/models/cprompt.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Zhanxin-Gao/CPrompt when it was checked","code_sha256":"238a8354f5b75bd3","code_sha256_prefix":"238a8354f5b75bd3","mcp_get_code":{"code_sha256":"238a8354f5b75bd3"}},{"arxiv_id":"2402.04129","arxiv_id_is_arxiv":true,"paper":"/paper/ovor-oneprompt-with-virtual-outlier","title":"OVOR: OnePrompt with Virtual Outlier Regularization for Rehearsal-Free Class-Incremental Learning","date":"2024-02-06","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":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":"3f33843b601c8d4d","code_sha256_prefix":"3f33843b601c8d4d","mcp_get_code":{"code_sha256":"3f33843b601c8d4d"}},{"arxiv_id":"2401.17186","arxiv_id_is_arxiv":true,"paper":"/paper/embracing-language-inclusivity-and-diversity","title":"Embracing Language Inclusivity and Diversity in CLIP through Continual Language Learning","date":"2024-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangbang18/CLFM","path":"clfm/adapters/prompt.py","file_url":"https://github.com/yangbang18/CLFM/blob/HEAD/clfm/adapters/prompt.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":"580bf03d921b436f","code_sha256_prefix":"580bf03d921b436f","mcp_get_code":{"code_sha256":"580bf03d921b436f"}},{"arxiv_id":"2211.13218","arxiv_id_is_arxiv":true,"paper":"/paper/coda-prompt-continual-decomposed-attention","title":"CODA-Prompt: COntinual Decomposed Attention-based Prompting for Rehearsal-Free Continual Learning","date":"2022-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gt-ripl/coda-prompt","path":"models/zoo.py","file_url":"https://github.com/gt-ripl/coda-prompt/blob/HEAD/models/zoo.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3f33843b601c8d4d","code_sha256_prefix":"3f33843b601c8d4d","mcp_get_code":{"code_sha256":"3f33843b601c8d4d"}}],"record_sha256":"54424d4e3c9a8396669d1d1c26e58fdcb0628f224e507de34f1340cbe3aed0a1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}