{"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/get-class-order","entry":"get_class_order","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"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":"2407.14143","arxiv_id_is_arxiv":true,"paper":"/paper/class-incremental-learning-with-clip-adaptive","title":"Class-Incremental Learning with CLIP: Adaptive Representation Adjustment and Parameter Fusion","date":"2024-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linlany/rapf","path":"continual_clip/utils.py","file_url":"https://github.com/linlany/rapf/blob/HEAD/continual_clip/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, linlany/rapf when it was checked","code_sha256":"1e44d7843ade1f71","code_sha256_prefix":"1e44d7843ade1f71","mcp_get_code":{"code_sha256":"1e44d7843ade1f71"}},{"arxiv_id":"2403.18383","arxiv_id_is_arxiv":true,"paper":"/paper/generative-multi-modal-models-are-good-class","title":"Generative Multi-modal Models are Good Class-Incremental Learners","date":"2024-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DoubleClass/GMM","path":"clip_base/utils.py","file_url":"https://github.com/DoubleClass/GMM/blob/HEAD/clip_base/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, DoubleClass/GMM when it was checked","code_sha256":"1e44d7843ade1f71","code_sha256_prefix":"1e44d7843ade1f71","mcp_get_code":{"code_sha256":"1e44d7843ade1f71"}},{"arxiv_id":"2308.03374","arxiv_id_is_arxiv":true,"paper":"/paper/heterogeneous-forgetting-compensation-for","title":"Heterogeneous Forgetting Compensation for Class-Incremental Learning","date":"2023-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JiahuaDong/HFC","path":"dataset.py","file_url":"https://github.com/JiahuaDong/HFC/blob/HEAD/dataset.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, JiahuaDong/HFC when it was checked","code_sha256":"b7350611f8e37d00","code_sha256_prefix":"b7350611f8e37d00","mcp_get_code":{"code_sha256":"b7350611f8e37d00"}},{"arxiv_id":"2210.03114","arxiv_id_is_arxiv":true,"paper":"/paper/clip-model-is-an-efficient-continual-learner","title":"CLIP model is an Efficient Continual Learner","date":"2022-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vgthengane/continual-clip","path":"continual_clip/utils.py","file_url":"https://github.com/vgthengane/continual-clip/blob/HEAD/continual_clip/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, vgthengane/continual-clip, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"1e44d7843ade1f71","code_sha256_prefix":"1e44d7843ade1f71","mcp_get_code":{"code_sha256":"1e44d7843ade1f71"}},{"arxiv_id":"Kang_Dynamic_Multi-Layer_Null_Space_Projection_for_Vision-Language_Continual_Learning_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Kang_Dynamic_Multi-Layer_Null_Space_Projection_for_Vision-Language_Continual_Learning_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RL-VIG/DMNSP","path":"continual_clip/utils.py","file_url":"https://github.com/RL-VIG/DMNSP/blob/HEAD/continual_clip/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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 linlany/rapf, and GitHub detected no licence in that repository when it was checked","code_sha256":"1e44d7843ade1f71","code_sha256_prefix":"1e44d7843ade1f71","mcp_get_code":{"code_sha256":"1e44d7843ade1f71"}}],"record_sha256":"10cf8160839a3e7773433d2b57702ceb96ed348436839693f15d47d03f15a2e7","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}