{"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/reservoir","entry":"reservoir","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":7,"n_papers_ran_no_instrument_failure":7,"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":4,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":9,"n_places_pointer_only":4,"n_places_pointer_only_link_open":0,"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":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":1},"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":"2406.04584","arxiv_id_is_arxiv":true,"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_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"191a38b80955c416","code_sha256_prefix":"191a38b80955c416","mcp_get_code":{"code_sha256":"191a38b80955c416"}},{"arxiv_id":"2403.12559","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Kaile-Du/CSC when it was checked","code_sha256":"7e522e4817696b98","code_sha256_prefix":"7e522e4817696b98","mcp_get_code":{"code_sha256":"7e522e4817696b98"}},{"arxiv_id":"2402.18865","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, which47/llmcl when it was checked","code_sha256":"7e522e4817696b98","code_sha256_prefix":"7e522e4817696b98","mcp_get_code":{"code_sha256":"7e522e4817696b98"}},{"arxiv_id":"2402.18865","arxiv_id_is_arxiv":true,"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_honours","verification_level":1,"contract_check":"HONOURS","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, which47/llmcl when it was checked","code_sha256":"04102179b159097d","code_sha256_prefix":"04102179b159097d","mcp_get_code":{"code_sha256":"04102179b159097d"}},{"arxiv_id":"2208.11266","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"99764303673acdd0","code_sha256_prefix":"99764303673acdd0","mcp_get_code":{"code_sha256":"99764303673acdd0"}},{"arxiv_id":"2201.12604","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7e522e4817696b98","code_sha256_prefix":"7e522e4817696b98","mcp_get_code":{"code_sha256":"7e522e4817696b98"}},{"arxiv_id":"2010.05595","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7e522e4817696b98","code_sha256_prefix":"7e522e4817696b98","mcp_get_code":{"code_sha256":"7e522e4817696b98"}},{"arxiv_id":"ijcai2025_0372","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id 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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7e522e4817696b98","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","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id 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,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, kangzhiq/NNCSL, 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":"7e522e4817696b98","code_sha256_prefix":"7e522e4817696b98","mcp_get_code":{"code_sha256":"7e522e4817696b98"}}],"record_sha256":"3f91a7b59211d1efb73991bbac96f414e098e811193af7258cebd140338099a5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}