{"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/get-convnet","entry":"get_convnet","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":6,"n_papers_ran":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":6,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":6},"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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"e74ab9485d1cb03c","mcp_get_code":{"code_sha256":"e74ab9485d1cb03c"}},{"arxiv_id":"2502.20032","paper":"/paper/order-robust-class-incremental-learning-graph","title":"Order-Robust Class Incremental Learning: Graph-Driven Dynamic Similarity Grouping","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AIGNLAI/GDDSG","path":"GDDSG.py","file_url":"https://github.com/AIGNLAI/GDDSG/blob/HEAD/GDDSG.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a9c49573d599bef5","mcp_get_code":{"code_sha256":"a9c49573d599bef5"}},{"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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e113d5c01297db61","mcp_get_code":{"code_sha256":"e113d5c01297db61"}},{"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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5b4db26e86013485","mcp_get_code":{"code_sha256":"5b4db26e86013485"}},{"arxiv_id":"2307.02251","paper":"/paper/ranpac-random-projections-and-pre-trained","title":"RanPAC: Random Projections and Pre-trained Models for Continual Learning","date":"2023-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ranpac/ranpac","path":"inc_net.py","file_url":"https://github.com/ranpac/ranpac/blob/HEAD/inc_net.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2edd6df79bc77668","mcp_get_code":{"code_sha256":"2edd6df79bc77668"}},{"arxiv_id":"2204.04662","paper":"/paper/foster-feature-boosting-and-compression-for","title":"FOSTER: Feature Boosting and Compression for Class-Incremental Learning","date":"2022-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"G-U-N/ECCV22-FOSTER","path":"models/foster.py","file_url":"https://github.com/G-U-N/ECCV22-FOSTER/blob/HEAD/models/foster.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4cad458166ad5417","mcp_get_code":{"code_sha256":"4cad458166ad5417"}}]}