{"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/get-width-and-height-from-size","entry":"get_width_and_height_from_size","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":10,"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":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":10,"n_places_pointer_only":1,"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":1,"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":"2505.24254","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-continual-learning-with","title":"Rethinking Continual Learning with Progressive Neural Collapse","date":"2025-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Continue-Edge-AI-Lab/ProNC","path":"backbone/EfficientNet.py","file_url":"https://github.com/Continue-Edge-AI-Lab/ProNC/blob/HEAD/backbone/EfficientNet.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":"1e2dad967f965366","code_sha256_prefix":"1e2dad967f965366","mcp_get_code":{"code_sha256":"1e2dad967f965366"}},{"arxiv_id":"2410.06645","arxiv_id_is_arxiv":true,"paper":"/paper/continual-learning-in-the-frequency-domain","title":"Continual Learning in the Frequency Domain","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EMLS-ICTCAS/CLFD","path":"backbone/EfficientNet.py","file_url":"https://github.com/EMLS-ICTCAS/CLFD/blob/HEAD/backbone/EfficientNet.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":"1e2dad967f965366","code_sha256_prefix":"1e2dad967f965366","mcp_get_code":{"code_sha256":"1e2dad967f965366"}},{"arxiv_id":"2407.15793","arxiv_id_is_arxiv":true,"paper":"/paper/clip-with-generative-latent-replay-a-strong","title":"CLIP with Generative Latent Replay: a Strong Baseline for Incremental Learning","date":"2024-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aimagelab/mammoth","path":"backbone/EfficientNet.py","file_url":"https://github.com/aimagelab/mammoth/blob/HEAD/backbone/EfficientNet.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":"1e2dad967f965366","code_sha256_prefix":"1e2dad967f965366","mcp_get_code":{"code_sha256":"1e2dad967f965366"}},{"arxiv_id":"2404.04002","arxiv_id_is_arxiv":true,"paper":"/paper/continual-learning-with-weight-interpolation","title":"Continual Learning with Weight Interpolation","date":"2024-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jedrzejkozal/weight-interpolation-cl","path":"backbone/EfficientNet.py","file_url":"https://github.com/jedrzejkozal/weight-interpolation-cl/blob/HEAD/backbone/EfficientNet.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":"1e2dad967f965366","code_sha256_prefix":"1e2dad967f965366","mcp_get_code":{"code_sha256":"1e2dad967f965366"}},{"arxiv_id":"2403.13249","arxiv_id_is_arxiv":true,"paper":"/paper/a-unified-and-general-framework-for-continual","title":"A Unified and General Framework for Continual Learning","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joey-wang123/CL-refresh-learning","path":"backbone/EfficientNet.py","file_url":"https://github.com/joey-wang123/CL-refresh-learning/blob/HEAD/backbone/EfficientNet.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":"ba6166d04ef2afdd","code_sha256_prefix":"ba6166d04ef2afdd","mcp_get_code":{"code_sha256":"ba6166d04ef2afdd"}},{"arxiv_id":"2403.01786","arxiv_id_is_arxiv":true,"paper":"/paper/exposing-the-deception-uncovering-more","title":"Exposing the Deception: Uncovering More Forgery Clues for Deepfake Detection","date":"2024-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qingyuliu/exposing-the-deception","path":"models/MI_Net.py","file_url":"https://github.com/qingyuliu/exposing-the-deception/blob/HEAD/models/MI_Net.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ed9d02b76fb84ae4","code_sha256_prefix":"ed9d02b76fb84ae4","mcp_get_code":{"code_sha256":"ed9d02b76fb84ae4"}},{"arxiv_id":"2310.02206","arxiv_id_is_arxiv":true,"paper":"/paper/chunking-forgetting-matters-in-continual","title":"Chunking: Continual Learning is not just about Distribution Shift","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tlee43/chunking-setting","path":"backbone/EfficientNet.py","file_url":"https://github.com/tlee43/chunking-setting/blob/HEAD/backbone/EfficientNet.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, tlee43/chunking-setting when it was checked","code_sha256":"1e2dad967f965366","code_sha256_prefix":"1e2dad967f965366","mcp_get_code":{"code_sha256":"1e2dad967f965366"}},{"arxiv_id":"2304.10177","arxiv_id_is_arxiv":true,"paper":"/paper/regularizing-second-order-influences-for","title":"Regularizing Second-Order Influences for Continual Learning","date":"2023-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"feifeiobama/InfluenceCL","path":"backbone/EfficientNet.py","file_url":"https://github.com/feifeiobama/InfluenceCL/blob/HEAD/backbone/EfficientNet.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":"1e2dad967f965366","code_sha256_prefix":"1e2dad967f965366","mcp_get_code":{"code_sha256":"1e2dad967f965366"}},{"arxiv_id":"2203.02751","arxiv_id_is_arxiv":true,"paper":"/paper/metaformer-a-unified-meta-framework-for-fine","title":"MetaFormer: A Unified Meta Framework for Fine-Grained Recognition","date":"2022-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dqshuai/metaformer","path":"models/MBConv.py","file_url":"https://github.com/dqshuai/metaformer/blob/HEAD/models/MBConv.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0210f333cd18e2c2","code_sha256_prefix":"0210f333cd18e2c2","mcp_get_code":{"code_sha256":"0210f333cd18e2c2"}},{"arxiv_id":"aaai_32254","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_32254","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"HongsinLee/FLAIR","path":"backbone/EfficientNet.py","file_url":"https://github.com/HongsinLee/FLAIR/blob/HEAD/backbone/EfficientNet.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":"1e2dad967f965366","code_sha256_prefix":"1e2dad967f965366","mcp_get_code":{"code_sha256":"1e2dad967f965366"}}],"record_sha256":"a2b246018dd1fdd11910d0f477d148378149448232dcb7210c9ca1bbd47af88f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}