{"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/reservoir","entry":"reservoir","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":8,"n_papers_ran":7,"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":3,"n_samples_fingerprinted":3,"n_places":9,"n_places_pointer_only":4,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":1},"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":"2406.04584","paper":"/paper/clog-benchmarking-continual-learning-of-image","title":"CLoG: Benchmarking Continual Learning of Image Generation Models","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linhaowei1/clog","path":"networks/memory.py","file_url":"https://github.com/linhaowei1/clog/blob/HEAD/networks/memory.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"191a38b80955c416","mcp_get_code":{"code_sha256":"191a38b80955c416"}},{"arxiv_id":"2403.12559","paper":"/paper/confidence-self-calibration-for-multi-label","title":"Confidence Self-Calibration for Multi-Label Class-Incremental Learning","date":"2024-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Kaile-Du/CSC","path":"CSC/buffer.py","file_url":"https://github.com/Kaile-Du/CSC/blob/HEAD/CSC/buffer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7e522e4817696b98","mcp_get_code":{"code_sha256":"7e522e4817696b98"}},{"arxiv_id":"2402.18865","paper":"/paper/analyzing-and-reducing-catastrophic","title":"Analyzing and Reducing Catastrophic Forgetting in Parameter Efficient Tuning","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"which47/llmcl","path":"method/ILORA.py","file_url":"https://github.com/which47/llmcl/blob/HEAD/method/ILORA.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7e522e4817696b98","mcp_get_code":{"code_sha256":"7e522e4817696b98"}},{"arxiv_id":"2402.18865","paper":"/paper/analyzing-and-reducing-catastrophic","title":"Analyzing and Reducing Catastrophic Forgetting in Parameter Efficient Tuning","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"which47/llmcl","path":"method/ER.py","file_url":"https://github.com/which47/llmcl/blob/HEAD/method/ER.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"04102179b159097d","mcp_get_code":{"code_sha256":"04102179b159097d"}},{"arxiv_id":"2208.11266","paper":"/paper/scale-online-self-supervised-lifelong","title":"SCALE: Online Self-Supervised Lifelong Learning without Prior Knowledge","date":"2022-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"orienfish/scale","path":"OnlineContrast/memory.py","file_url":"https://github.com/orienfish/scale/blob/HEAD/OnlineContrast/memory.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"99764303673acdd0","mcp_get_code":{"code_sha256":"99764303673acdd0"}},{"arxiv_id":"2201.12604","paper":"/paper/learning-fast-learning-slow-a-general-1","title":"Learning Fast, Learning Slow: A General Continual Learning Method based on Complementary Learning System","date":"2022-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NeurAI-Lab/CLS-ER","path":"models/clser.py","file_url":"https://github.com/NeurAI-Lab/CLS-ER/blob/HEAD/models/clser.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7e522e4817696b98","mcp_get_code":{"code_sha256":"7e522e4817696b98"}},{"arxiv_id":"2010.05595","paper":"/paper/rethinking-experience-replay-a-bag-of-tricks","title":"Rethinking Experience Replay: a Bag of Tricks for Continual Learning","date":"2020-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mostafaelaraby/Real-DEEL-Dark-Experience","path":"real_deel_dark_experience/utils/buffer_tricks.py","file_url":"https://github.com/mostafaelaraby/Real-DEEL-Dark-Experience/blob/HEAD/real_deel_dark_experience/utils/buffer_tricks.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7e522e4817696b98","mcp_get_code":{"code_sha256":"7e522e4817696b98"}},{"arxiv_id":"ijcai2025_0372","paper":null,"title":"arXiv:ijcai2025_0372","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"cwang-nus/DOL","path":"utils/buffer.py","file_url":"https://github.com/cwang-nus/DOL/blob/HEAD/utils/buffer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7e522e4817696b98","mcp_get_code":{"code_sha256":"7e522e4817696b98"}},{"arxiv_id":"Kang_A_Soft_Nearest-Neighbor_Framework_for_Continual_Semi-Supervised_Learning_ICCV_2023_paper","paper":null,"title":"arXiv:Kang_A_Soft_Nearest-Neighbor_Framework_for_Continual_Semi-Supervised_Learning_ICCV_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"kangzhiq/NNCSL","path":"src/buffer.py","file_url":"https://github.com/kangzhiq/NNCSL/blob/HEAD/src/buffer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"7e522e4817696b98","mcp_get_code":{"code_sha256":"7e522e4817696b98"}}]}