{"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/tensor2numpy","entry":"tensor2numpy","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":18,"n_papers_ran":18,"n_papers_ran_no_instrument_failure":14,"n_papers_ran_instrument_only":4,"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":10,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":18,"n_places_pointer_only":7,"n_places_pointer_only_link_open":4,"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":1,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":6,"unverified":0},"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":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ba7e5268c5f9c56b","code_sha256_prefix":"ba7e5268c5f9c56b","mcp_get_code":{"code_sha256":"ba7e5268c5f9c56b"}},{"arxiv_id":"2412.09441","arxiv_id_is_arxiv":true,"paper":"/paper/mos-model-surgery-for-pre-trained-model-based","title":"MOS: Model Surgery for Pre-Trained Model-Based Class-Incremental Learning","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sun-hailong/aaai25-mos","path":"utils/toolkit.py","file_url":"https://github.com/sun-hailong/aaai25-mos/blob/HEAD/utils/toolkit.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","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/aaai25-mos when it was checked","code_sha256":"929c76a2fa2e8c42","code_sha256_prefix":"929c76a2fa2e8c42","mcp_get_code":{"code_sha256":"929c76a2fa2e8c42"}},{"arxiv_id":"2407.17850","arxiv_id_is_arxiv":true,"paper":"/paper/flexiedit-frequency-aware-latent-refinement","title":"FlexiEdit: Frequency-Aware Latent Refinement for Enhanced Non-Rigid Editing","date":"2024-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kookie12/FlexiEdit","path":"flexiedit/utils.py","file_url":"https://github.com/kookie12/FlexiEdit/blob/HEAD/flexiedit/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"94c181218397b5c3","code_sha256_prefix":"94c181218397b5c3","mcp_get_code":{"code_sha256":"94c181218397b5c3"}},{"arxiv_id":"2404.06622","arxiv_id_is_arxiv":true,"paper":"/paper/calibrating-higher-order-statistics-for-few","title":"Calibrating Higher-Order Statistics for Few-Shot Class-Incremental Learning with Pre-trained Vision Transformers","date":"2024-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dipamgoswami/fscil-calibration","path":"utils/toolkit.py","file_url":"https://github.com/dipamgoswami/fscil-calibration/blob/HEAD/utils/toolkit.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","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 wangkiw/iclr23-memo, and GitHub detected no licence in that repository when it was checked","code_sha256":"929c76a2fa2e8c42","code_sha256_prefix":"929c76a2fa2e8c42","mcp_get_code":{"code_sha256":"929c76a2fa2e8c42"}},{"arxiv_id":"2403.19944","arxiv_id_is_arxiv":true,"paper":"/paper/binarized-low-light-raw-video-enhancement","title":"Binarized Low-light Raw Video Enhancement","date":"2024-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ying-fu/BRVE","path":"mmedit/core/misc.py","file_url":"https://github.com/ying-fu/BRVE/blob/HEAD/mmedit/core/misc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0fed22444a608af0","code_sha256_prefix":"0fed22444a608af0","mcp_get_code":{"code_sha256":"0fed22444a608af0"}},{"arxiv_id":"2312.13913","arxiv_id_is_arxiv":true,"paper":"/paper/paint3d-paint-anything-3d-with-lighting-less","title":"Paint3D: Paint Anything 3D with Lighting-Less Texture Diffusion Models","date":"2023-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opentexture/paint3d","path":"paint3d/utils.py","file_url":"https://github.com/opentexture/paint3d/blob/HEAD/paint3d/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3267964715dd20f9","code_sha256_prefix":"3267964715dd20f9","mcp_get_code":{"code_sha256":"3267964715dd20f9"}},{"arxiv_id":"2311.16833","arxiv_id_is_arxiv":true,"paper":"/paper/1-lipschitz-layers-compared-memory-speed-and","title":"1-Lipschitz Layers Compared: Memory, Speed, and Certifiable Robustness","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"berndprach/1lipschitzlayerscompared","path":"trainer/train_module.py","file_url":"https://github.com/berndprach/1lipschitzlayerscompared/blob/HEAD/trainer/train_module.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":"1cb7369440b6a2f9","code_sha256_prefix":"1cb7369440b6a2f9","mcp_get_code":{"code_sha256":"1cb7369440b6a2f9"}},{"arxiv_id":"2307.12045","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-distillation-for-continual","title":"Revisiting Distillation for Continual Learning on Visual Question Localized-Answering in Robotic Surgery","date":"2023-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"longbai1006/cs-vqla","path":"utils/toolkit.py","file_url":"https://github.com/longbai1006/cs-vqla/blob/HEAD/utils/toolkit.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","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 wangkiw/iclr23-memo, and GitHub detected no licence in that repository when it was checked","code_sha256":"929c76a2fa2e8c42","code_sha256_prefix":"929c76a2fa2e8c42","mcp_get_code":{"code_sha256":"929c76a2fa2e8c42"}},{"arxiv_id":"2307.02251","arxiv_id_is_arxiv":true,"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":"utils/toolkit.py","file_url":"https://github.com/ranpac/ranpac/blob/HEAD/utils/toolkit.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","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 wangkiw/iclr23-memo, and GitHub detected no licence in that repository when it was checked","code_sha256":"929c76a2fa2e8c42","code_sha256_prefix":"929c76a2fa2e8c42","mcp_get_code":{"code_sha256":"929c76a2fa2e8c42"}},{"arxiv_id":"2304.07670","arxiv_id_is_arxiv":true,"paper":"/paper/explanations-of-black-box-models-based-on-1","title":"Explanations of Black-Box Models based on Directional Feature Interactions","date":"2023-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davinhill/BivariateShapley","path":"BivariateShapley/utils_shapley.py","file_url":"https://github.com/davinhill/BivariateShapley/blob/HEAD/BivariateShapley/utils_shapley.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":"3df0ea6c0269c048","code_sha256_prefix":"3df0ea6c0269c048","mcp_get_code":{"code_sha256":"3df0ea6c0269c048"}},{"arxiv_id":"2302.01721","arxiv_id_is_arxiv":true,"paper":"/paper/texture-text-guided-texturing-of-3d-shapes","title":"TEXTure: Text-Guided Texturing of 3D Shapes","date":"2023-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TEXTurePaper/TEXTurePaper","path":"src/utils.py","file_url":"https://github.com/TEXTurePaper/TEXTurePaper/blob/HEAD/src/utils.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":"9e26ed8941bbd1c1","code_sha256_prefix":"9e26ed8941bbd1c1","mcp_get_code":{"code_sha256":"9e26ed8941bbd1c1"}},{"arxiv_id":"2301.05792","arxiv_id_is_arxiv":true,"paper":"/paper/rmm-reinforced-memory-management-for-class-1","title":"RMM: Reinforced Memory Management for Class-Incremental Learning","date":"2023-01-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"929c76a2fa2e8c42","code_sha256_prefix":"929c76a2fa2e8c42","mcp_get_code":{"code_sha256":"929c76a2fa2e8c42"}},{"arxiv_id":"2205.13218","arxiv_id_is_arxiv":true,"paper":"/paper/a-model-or-603-exemplars-towards-memory","title":"A Model or 603 Exemplars: Towards Memory-Efficient Class-Incremental Learning","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangkiw/iclr23-memo","path":"models/memo.py","file_url":"https://github.com/wangkiw/iclr23-memo/blob/HEAD/models/memo.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wangkiw/iclr23-memo when it was checked","code_sha256":"929c76a2fa2e8c42","code_sha256_prefix":"929c76a2fa2e8c42","mcp_get_code":{"code_sha256":"929c76a2fa2e8c42"}},{"arxiv_id":"2201.01501","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-depth-estimation-for-multi-view","title":"Rethinking Depth Estimation for Multi-View Stereo: A Unified Representation","date":"2022-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prstrive/unimvsnet","path":"tools.py","file_url":"https://github.com/prstrive/unimvsnet/blob/HEAD/tools.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":"e96100b6e68bc179","code_sha256_prefix":"e96100b6e68bc179","mcp_get_code":{"code_sha256":"e96100b6e68bc179"}},{"arxiv_id":"1904.02639","arxiv_id_is_arxiv":true,"paper":"/paper/memorizing-normality-to-detect-anomaly-memory","title":"Memorizing Normality to Detect Anomaly: Memory-augmented Deep Autoencoder for Unsupervised Anomaly Detection","date":"2019-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"donggong1/memae-anomaly-detection","path":"utils/utils.py","file_url":"https://github.com/donggong1/memae-anomaly-detection/blob/HEAD/utils/utils.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":"20c6252c6b02cdfd","code_sha256_prefix":"20c6252c6b02cdfd","mcp_get_code":{"code_sha256":"20c6252c6b02cdfd"}},{"arxiv_id":"aaai_26216","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_26216","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"iamwangyabin/ESN","path":"utils/toolkit.py","file_url":"https://github.com/iamwangyabin/ESN/blob/HEAD/utils/toolkit.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","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 wangkiw/iclr23-memo, and GitHub detected no licence in that repository when it was checked","code_sha256":"929c76a2fa2e8c42","code_sha256_prefix":"929c76a2fa2e8c42","mcp_get_code":{"code_sha256":"929c76a2fa2e8c42"}},{"arxiv_id":"Zeng_Paint3D_Paint_Anything_3D_with_Lighting-Less_Texture_Diffusion_Models_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Zeng_Paint3D_Paint_Anything_3D_with_Lighting-Less_Texture_Diffusion_Models_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"OpenTexture/Paint3D","path":"paint3d/utils.py","file_url":"https://github.com/OpenTexture/Paint3D/blob/HEAD/paint3d/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3267964715dd20f9","code_sha256_prefix":"3267964715dd20f9","mcp_get_code":{"code_sha256":"3267964715dd20f9"}},{"arxiv_id":"Prach_1-Lipschitz_Layers_Compared_Memory_Speed_and_Certifiable_Robustness_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Prach_1-Lipschitz_Layers_Compared_Memory_Speed_and_Certifiable_Robustness_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"berndprach/1LipschitzLayersCompared","path":"trainer/train_module.py","file_url":"https://github.com/berndprach/1LipschitzLayersCompared/blob/HEAD/trainer/train_module.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":"1cb7369440b6a2f9","code_sha256_prefix":"1cb7369440b6a2f9","mcp_get_code":{"code_sha256":"1cb7369440b6a2f9"}}],"record_sha256":"50244b1aac526e779114e854505b3746e62b9a4d276f8a38acbad0cd2d8c70fb","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}