{"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/basenet","entry":"BaseNet","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":14,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"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":14,"n_samples_ran":4,"n_samples_constructed":1,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":10,"n_samples_fingerprinted":2,"n_places":14,"n_places_pointer_only":8,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":10},"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":"2603.10237","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-10237","title":"One Adapter for All: Towards Unified Representation in Step-Imbalanced Class-Incremental Learning","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"xiaoyanzhang1/One-A","path":"models/onea.py","file_url":"https://github.com/xiaoyanzhang1/One-A/blob/HEAD/models/onea.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":"0170f8faf03e95d2","code_sha256_prefix":"0170f8faf03e95d2","mcp_get_code":{"code_sha256":"0170f8faf03e95d2"}},{"arxiv_id":"2602.13670","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-13670","title":"Advancing Analytic Class-Incremental Learning through Vision-Language Calibration","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"byzhaoAI/VILA","path":"utils/VILA.py","file_url":"https://github.com/byzhaoAI/VILA/blob/HEAD/utils/VILA.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":"e0b2d99994363c00","code_sha256_prefix":"e0b2d99994363c00","mcp_get_code":{"code_sha256":"e0b2d99994363c00"}},{"arxiv_id":"2502.20032","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AIGNLAI/GDDSG when it was checked","code_sha256":"2cabd1fb18e7bafc","code_sha256_prefix":"2cabd1fb18e7bafc","mcp_get_code":{"code_sha256":"2cabd1fb18e7bafc"}},{"arxiv_id":"2410.00645","arxiv_id_is_arxiv":true,"paper":"/paper/icl-tsvd-bridging-theory-and-practice-in","title":"LoRanPAC: Low-rank Random Features and Pre-trained Models for Bridging Theory and Practice in Continual Learning","date":"2024-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liangzu/loranpac","path":"models/ranpac.py","file_url":"https://github.com/liangzu/loranpac/blob/HEAD/models/ranpac.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, liangzu/loranpac when it was checked","code_sha256":"cbea6600f1c33154","code_sha256_prefix":"cbea6600f1c33154","mcp_get_code":{"code_sha256":"cbea6600f1c33154"}},{"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":"90ae5395a0910645","code_sha256_prefix":"90ae5395a0910645","mcp_get_code":{"code_sha256":"90ae5395a0910645"}},{"arxiv_id":"2403.12030","arxiv_id_is_arxiv":true,"paper":"/paper/expandable-subspace-ensemble-for-pre-trained","title":"Expandable Subspace Ensemble for Pre-Trained Model-Based Class-Incremental Learning","date":"2024-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sun-hailong/cvpr24-ease","path":"models/ease.py","file_url":"https://github.com/sun-hailong/cvpr24-ease/blob/HEAD/models/ease.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, sun-hailong/cvpr24-ease when it was checked","code_sha256":"5e36479eda911749","code_sha256_prefix":"5e36479eda911749","mcp_get_code":{"code_sha256":"5e36479eda911749"}},{"arxiv_id":"2308.13305","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, chen-xw/drc-cil when it was checked","code_sha256":"c6a1daf0e4d0a2d7","code_sha256_prefix":"c6a1daf0e4d0a2d7","mcp_get_code":{"code_sha256":"c6a1daf0e4d0a2d7"}},{"arxiv_id":"2305.00441","arxiv_id_is_arxiv":true,"paper":"/paper/multi-task-structural-learning-using-local","title":"Multi-Task Structural Learning using Local Task Similarity induced Neuron Creation and Removal","date":"2023-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neurai-lab/mtsl","path":"encoding_custom/models/mtsl.py","file_url":"https://github.com/neurai-lab/mtsl/blob/HEAD/encoding_custom/models/mtsl.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, neurai-lab/mtsl when it was checked","code_sha256":"5e36d66e8e4c4fb9","code_sha256_prefix":"5e36d66e8e4c4fb9","mcp_get_code":{"code_sha256":"5e36d66e8e4c4fb9"}},{"arxiv_id":"2303.05955","arxiv_id_is_arxiv":true,"paper":"/paper/neuron-structure-modeling-for-generalizable","title":"Neuron Structure Modeling for Generalizable Remote Physiological Measurement","date":"2023-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LuPaoPao/NEST","path":"NEST-rPPG/model.py","file_url":"https://github.com/LuPaoPao/NEST/blob/HEAD/NEST-rPPG/model.py","status":"ran","verification_level":1,"contract_check":null,"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, LuPaoPao/NEST when it was checked","code_sha256":"b19af3434ffe3117","code_sha256_prefix":"b19af3434ffe3117","mcp_get_code":{"code_sha256":"b19af3434ffe3117"}},{"arxiv_id":"2301.13422","arxiv_id_is_arxiv":true,"paper":"/paper/anomaly-segmentation-for-high-resolution","title":"Anomaly Segmentation for High-Resolution Remote Sensing Images Based on Pixel Descriptors","date":"2023-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jingtao-Li-CVer/ASD","path":"models/asd_encoder.py","file_url":"https://github.com/Jingtao-Li-CVer/ASD/blob/HEAD/models/asd_encoder.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3a3412caa3bad8a3","code_sha256_prefix":"3a3412caa3bad8a3","mcp_get_code":{"code_sha256":"3a3412caa3bad8a3"}},{"arxiv_id":"2210.08410","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-learning-to-index-and-search-in","title":"ELIAS: End-to-End Learning to Index and Search in Large Output Spaces","date":"2022-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nilesh2797/elias","path":"nets.py","file_url":"https://github.com/nilesh2797/elias/blob/HEAD/nets.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, nilesh2797/elias when it was checked","code_sha256":"6f7a4f3db78f6570","code_sha256_prefix":"6f7a4f3db78f6570","mcp_get_code":{"code_sha256":"6f7a4f3db78f6570"}},{"arxiv_id":"2111.06265","arxiv_id_is_arxiv":true,"paper":"/paper/dense-unsupervised-learning-for-video","title":"Dense Unsupervised Learning for Video Segmentation","date":"2021-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visinf/dense-ulearn-vos","path":"models/net.py","file_url":"https://github.com/visinf/dense-ulearn-vos/blob/HEAD/models/net.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"095e671ad6717b22","code_sha256_prefix":"095e671ad6717b22","mcp_get_code":{"code_sha256":"095e671ad6717b22"}},{"arxiv_id":"2106.13924","arxiv_id_is_arxiv":true,"paper":"/paper/self-attentive-ensemble-transformer","title":"Self-Attentive Ensemble Transformer: Representing Ensemble Interactions in Neural Networks for Earth System Models","date":"2021-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tobifinn/ensemble_transformer","path":"ens_transformer/models/transformer_net.py","file_url":"https://github.com/tobifinn/ensemble_transformer/blob/HEAD/ens_transformer/models/transformer_net.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":"24e7e6a6819ae729","code_sha256_prefix":"24e7e6a6819ae729","mcp_get_code":{"code_sha256":"24e7e6a6819ae729"}},{"arxiv_id":"2105.00097","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-augmentation-consistency-for","title":"Self-supervised Augmentation Consistency for Adapting Semantic Segmentation","date":"2021-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visinf/da-sac","path":"models/sac.py","file_url":"https://github.com/visinf/da-sac/blob/HEAD/models/sac.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d166a1bd9819ef4c","code_sha256_prefix":"d166a1bd9819ef4c","mcp_get_code":{"code_sha256":"d166a1bd9819ef4c"}}],"record_sha256":"a8faed38ec449c0839061f9cfacbe1bc41be94d34b942589a55348f7f8e7fb77","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}