{"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/resnet18-rep","entry":"resnet18_rep","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":9,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":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":3,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":8,"n_places_pointer_only_link_open":2,"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":0,"ran":0,"unverified":2},"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":"2511.05064","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-05064","title":"Order-Level Attention Similarity Across Language Models: A Latent Commonality","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"jinglin-liang/OLAS","path":"convs/modified_represnet.py","file_url":"https://github.com/jinglin-liang/OLAS/blob/HEAD/convs/modified_represnet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jinglin-liang/OLAS when it was checked","code_sha256":"ecaa7ca05d715804","code_sha256_prefix":"ecaa7ca05d715804","mcp_get_code":{"code_sha256":"ecaa7ca05d715804"}},{"arxiv_id":"2409.01128","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-driven-data-replay-a-novel-approach","title":"Diffusion-Driven Data Replay: A Novel Approach to Combat Forgetting in Federated Class Continual Learning","date":"2024-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jinglin-liang/DDDR","path":"convs/modified_represnet.py","file_url":"https://github.com/jinglin-liang/DDDR/blob/HEAD/convs/modified_represnet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jinglin-liang/DDDR when it was checked","code_sha256":"ecaa7ca05d715804","code_sha256_prefix":"ecaa7ca05d715804","mcp_get_code":{"code_sha256":"ecaa7ca05d715804"}},{"arxiv_id":"2407.08536","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, alviur/ldc when it was checked","code_sha256":"3280b9194d9b887e","code_sha256_prefix":"3280b9194d9b887e","mcp_get_code":{"code_sha256":"3280b9194d9b887e"}},{"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/modified_represnet.py","file_url":"https://github.com/dipamgoswami/adc/blob/HEAD/convs/modified_represnet.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":"6a8f78bbfd703db3","code_sha256_prefix":"6a8f78bbfd703db3","mcp_get_code":{"code_sha256":"6a8f78bbfd703db3"}},{"arxiv_id":"2404.14829","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-neural-networks-for-continual","title":"Revisiting Neural Networks for Continual Learning: An Architectural Perspective","date":"2024-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"byyx666/archcraft","path":"class_il/convs/modified_represnet.py","file_url":"https://github.com/byyx666/archcraft/blob/HEAD/class_il/convs/modified_represnet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, byyx666/archcraft when it was checked","code_sha256":"ecaa7ca05d715804","code_sha256_prefix":"ecaa7ca05d715804","mcp_get_code":{"code_sha256":"ecaa7ca05d715804"}},{"arxiv_id":"2404.00986","arxiv_id_is_arxiv":true,"paper":"/paper/make-continual-learning-stronger-via-c-flat","title":"Make Continual Learning Stronger via C-Flat","date":"2024-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wannaa/c-flat","path":"convs/modified_represnet.py","file_url":"https://github.com/wannaa/c-flat/blob/HEAD/convs/modified_represnet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wannaa/c-flat when it was checked","code_sha256":"ecaa7ca05d715804","code_sha256_prefix":"ecaa7ca05d715804","mcp_get_code":{"code_sha256":"ecaa7ca05d715804"}},{"arxiv_id":"2403.14101","arxiv_id_is_arxiv":true,"paper":"/paper/text-enhanced-data-free-approach-for","title":"Text-Enhanced Data-free Approach for Federated Class-Incremental Learning","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmtuan1307/lander","path":"convs/modified_represnet.py","file_url":"https://github.com/tmtuan1307/lander/blob/HEAD/convs/modified_represnet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tmtuan1307/lander when it was checked","code_sha256":"ecaa7ca05d715804","code_sha256_prefix":"ecaa7ca05d715804","mcp_get_code":{"code_sha256":"ecaa7ca05d715804"}},{"arxiv_id":"2309.14062","arxiv_id_is_arxiv":true,"paper":"/paper/fecam-exploiting-the-heterogeneity-of-class-1","title":"FeCAM: Exploiting the Heterogeneity of Class Distributions in Exemplar-Free Continual Learning","date":"2023-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dipamgoswami/fecam","path":"convs/modified_represnet.py","file_url":"https://github.com/dipamgoswami/fecam/blob/HEAD/convs/modified_represnet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"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 jinglin-liang/OLAS, and GitHub detected no licence in that repository when it was checked","code_sha256":"ecaa7ca05d715804","code_sha256_prefix":"ecaa7ca05d715804","mcp_get_code":{"code_sha256":"ecaa7ca05d715804"}},{"arxiv_id":"aaai_29079","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29079","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"fanyan0411/DSGD","path":"convs/modified_represnet.py","file_url":"https://github.com/fanyan0411/DSGD/blob/HEAD/convs/modified_represnet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"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 jinglin-liang/OLAS, and GitHub detected no licence in that repository when it was checked","code_sha256":"ecaa7ca05d715804","code_sha256_prefix":"ecaa7ca05d715804","mcp_get_code":{"code_sha256":"ecaa7ca05d715804"}}],"record_sha256":"639f5d41f25112d8c5550ac57c80f952617140671f160ac49426094bfddb2213","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}