{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/simplelinear","entry":"SimpleLinear","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":5,"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":4,"n_samples_ran":4,"n_samples_fingerprinted":4,"n_places":5,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":0},"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":"2603.08426","paper":"/paper/arxiv-2603-08426","title":"Grow, Assess, Compress: Adaptive Backbone Scaling for Memory-Efficient Class Incremental Learning","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"ai-digilab/GRACE","path":"models/grace.py","file_url":"https://github.com/ai-digilab/GRACE/blob/HEAD/models/grace.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"eb038f4ed230f75b","mcp_get_code":{"code_sha256":"eb038f4ed230f75b"}},{"arxiv_id":"2407.08536","paper":"/paper/exemplar-free-continual-representation","title":"Exemplar-free Continual Representation Learning via Learnable Drift Compensation","date":"2024-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alviur/ldc","path":"LDC_supervised/utils/inc_net.py","file_url":"https://github.com/alviur/ldc/blob/HEAD/LDC_supervised/utils/inc_net.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7655f8c8144a2115","mcp_get_code":{"code_sha256":"7655f8c8144a2115"}},{"arxiv_id":"2403.08568","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":null,"path":"","file_url":null,"status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"718d523922efedea","mcp_get_code":{"code_sha256":"718d523922efedea"}},{"arxiv_id":"2308.13305","paper":"/paper/dynamic-residual-classifier-for-class","title":"Dynamic Residual Classifier for Class Incremental Learning","date":"2023-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chen-xw/drc-cil","path":"models/mafdrc.py","file_url":"https://github.com/chen-xw/drc-cil/blob/HEAD/models/mafdrc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"912a99c7a4b1f235","mcp_get_code":{"code_sha256":"912a99c7a4b1f235"}},{"arxiv_id":"2205.13218","paper":"/paper/a-model-or-603-exemplars-towards-memory","title":"A Model or 603 Exemplars: Towards Memory-Efficient Class-Incremental Learning","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangkiw/iclr23-memo","path":"models/memo.py","file_url":"https://github.com/wangkiw/iclr23-memo/blob/HEAD/models/memo.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"718d523922efedea","mcp_get_code":{"code_sha256":"718d523922efedea"}}]}