{"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/reduce-proxies","entry":"reduce_proxies","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":2,"n_places":8,"n_places_pointer_only":8,"n_places_pointer_only_link_open":4,"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":1,"ran_fixture":1,"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":"2507.07100","arxiv_id_is_arxiv":true,"paper":"/paper/addressing-imbalanced-domain-incremental","title":"Addressing Imbalanced Domain-Incremental Learning through Dual-Balance Collaborative Experts","date":"2025-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lain810/DCE","path":"models/linears.py","file_url":"https://github.com/Lain810/DCE/blob/HEAD/models/linears.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, Lain810/DCE when it was checked","code_sha256":"4072283c98270784","code_sha256_prefix":"4072283c98270784","mcp_get_code":{"code_sha256":"4072283c98270784"}},{"arxiv_id":"2412.09441","arxiv_id_is_arxiv":true,"paper":"/paper/mos-model-surgery-for-pre-trained-model-based","title":"MOS: Model Surgery for Pre-Trained Model-Based Class-Incremental Learning","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sun-hailong/aaai25-mos","path":"backbone/linears.py","file_url":"https://github.com/sun-hailong/aaai25-mos/blob/HEAD/backbone/linears.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, sun-hailong/aaai25-mos when it was checked","code_sha256":"4072283c98270784","code_sha256_prefix":"4072283c98270784","mcp_get_code":{"code_sha256":"4072283c98270784"}},{"arxiv_id":"2409.07446","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-adapter-routing-for-long-tailed","title":"Adaptive Adapter Routing for Long-Tailed Class-Incremental Learning","date":"2024-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-qzh/apart","path":"backbone/linears.py","file_url":"https://github.com/vita-qzh/apart/blob/HEAD/backbone/linears.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"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 sun-hailong/cvpr24-ease, and GitHub detected no licence in that repository when it was checked","code_sha256":"4072283c98270784","code_sha256_prefix":"4072283c98270784","mcp_get_code":{"code_sha256":"4072283c98270784"}},{"arxiv_id":"2405.19074","arxiv_id_is_arxiv":true,"paper":"/paper/resurrecting-old-classes-with-new-data-for","title":"Resurrecting Old Classes with New Data for Exemplar-Free Continual Learning","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dipamgoswami/adc","path":"convs/linears.py","file_url":"https://github.com/dipamgoswami/adc/blob/HEAD/convs/linears.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"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 sun-hailong/cvpr24-ease, and GitHub detected no licence in that repository when it was checked","code_sha256":"4072283c98270784","code_sha256_prefix":"4072283c98270784","mcp_get_code":{"code_sha256":"4072283c98270784"}},{"arxiv_id":"2404.06622","arxiv_id_is_arxiv":true,"paper":"/paper/calibrating-higher-order-statistics-for-few","title":"Calibrating Higher-Order Statistics for Few-Shot Class-Incremental Learning with Pre-trained Vision Transformers","date":"2024-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dipamgoswami/fscil-calibration","path":"backbone/linears.py","file_url":"https://github.com/dipamgoswami/fscil-calibration/blob/HEAD/backbone/linears.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"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 sun-hailong/cvpr24-ease, and GitHub detected no licence in that repository when it was checked","code_sha256":"4072283c98270784","code_sha256_prefix":"4072283c98270784","mcp_get_code":{"code_sha256":"4072283c98270784"}},{"arxiv_id":"2403.12030","arxiv_id_is_arxiv":true,"paper":"/paper/expandable-subspace-ensemble-for-pre-trained","title":"Expandable Subspace Ensemble for Pre-Trained Model-Based Class-Incremental Learning","date":"2024-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sun-hailong/cvpr24-ease","path":"models/ease.py","file_url":"https://github.com/sun-hailong/cvpr24-ease/blob/HEAD/models/ease.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, sun-hailong/cvpr24-ease when it was checked","code_sha256":"4072283c98270784","code_sha256_prefix":"4072283c98270784","mcp_get_code":{"code_sha256":"4072283c98270784"}},{"arxiv_id":"2308.11073","arxiv_id_is_arxiv":true,"paper":"/paper/audio-visual-class-incremental-learning","title":"Audio-Visual Class-Incremental Learning","date":"2023-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weiguopian/av-cil_iccv2023","path":"ours/train_incremental_ours.py","file_url":"https://github.com/weiguopian/av-cil_iccv2023/blob/HEAD/ours/train_incremental_ours.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, weiguopian/av-cil_iccv2023 when it was checked","code_sha256":"b8de6a8bb6a96884","code_sha256_prefix":"b8de6a8bb6a96884","mcp_get_code":{"code_sha256":"b8de6a8bb6a96884"}},{"arxiv_id":"2307.12045","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-distillation-for-continual","title":"Revisiting Distillation for Continual Learning on Visual Question Localized-Answering in Robotic Surgery","date":"2023-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"longbai1006/cs-vqla","path":"utils/linears.py","file_url":"https://github.com/longbai1006/cs-vqla/blob/HEAD/utils/linears.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"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 sun-hailong/cvpr24-ease, and GitHub detected no licence in that repository when it was checked","code_sha256":"4072283c98270784","code_sha256_prefix":"4072283c98270784","mcp_get_code":{"code_sha256":"4072283c98270784"}}],"record_sha256":"098f2760e249b815bac4ac4834c3fe90322da1e1128eddc1fd0f7222457c725b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}