{"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/mask-init","entry":"mask_init","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":1,"n_places":7,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":4,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"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":"2410.10341","arxiv_id_is_arxiv":true,"paper":"/paper/replay-and-forget-free-graph-class","title":"Replay-and-Forget-Free Graph Class-Incremental Learning: A Task Profiling and Prompting Approach","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mala-lab/TPP","path":"Backbones/gnnconv.py","file_url":"https://github.com/mala-lab/TPP/blob/HEAD/Backbones/gnnconv.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"db9df3652df16af3","code_sha256_prefix":"db9df3652df16af3","mcp_get_code":{"code_sha256":"db9df3652df16af3"}},{"arxiv_id":"2406.07413","arxiv_id_is_arxiv":true,"paper":"/paper/holistic-memory-diversification-for","title":"Holistic Memory Diversification for Incremental Learning in Growing Graphs","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joe817/DMSG","path":"Backbones/gnnconv.py","file_url":"https://github.com/joe817/DMSG/blob/HEAD/Backbones/gnnconv.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, joe817/DMSG when it was checked","code_sha256":"db9df3652df16af3","code_sha256_prefix":"db9df3652df16af3","mcp_get_code":{"code_sha256":"db9df3652df16af3"}},{"arxiv_id":"2401.13200","arxiv_id_is_arxiv":true,"paper":"/paper/topology-aware-embedding-memory-for-learning","title":"Topology-aware Embedding Memory for Continual Learning on Expanding Networks","date":"2024-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imzhangxikun/pdgnns","path":"source/Backbones/gnnconv.py","file_url":"https://github.com/imzhangxikun/pdgnns/blob/HEAD/source/Backbones/gnnconv.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, imzhangxikun/pdgnns when it was checked","code_sha256":"db9df3652df16af3","code_sha256_prefix":"db9df3652df16af3","mcp_get_code":{"code_sha256":"db9df3652df16af3"}},{"arxiv_id":"2301.06241","arxiv_id_is_arxiv":true,"paper":"/paper/beagle-forensics-of-deep-learning-backdoor","title":"BEAGLE: Forensics of Deep Learning Backdoor Attack for Better Defense","date":"2023-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"megum1/beagle","path":"trojai_round3/synthesis_scanner.py","file_url":"https://github.com/megum1/beagle/blob/HEAD/trojai_round3/synthesis_scanner.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":"ae8fef45a894c95f","code_sha256_prefix":"ae8fef45a894c95f","mcp_get_code":{"code_sha256":"ae8fef45a894c95f"}},{"arxiv_id":"2210.10209","arxiv_id_is_arxiv":true,"paper":"/paper/exclusive-supermask-subnetwork-training-for","title":"Exclusive Supermask Subnetwork Training for Continual Learning","date":"2022-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prateeky2806/exessnet","path":"models/module_util.py","file_url":"https://github.com/prateeky2806/exessnet/blob/HEAD/models/module_util.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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 RAIVNLab/supsup, and GitHub detected no licence in that repository when it was checked","code_sha256":"ffe66fb2efd3fe30","code_sha256_prefix":"ffe66fb2efd3fe30","mcp_get_code":{"code_sha256":"ffe66fb2efd3fe30"}},{"arxiv_id":"2006.14769","arxiv_id_is_arxiv":true,"paper":"/paper/supermasks-in-superposition","title":"Supermasks in Superposition","date":"2020-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RAIVNLab/supsup","path":"models/modules.py","file_url":"https://github.com/RAIVNLab/supsup/blob/HEAD/models/modules.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, RAIVNLab/supsup when it was checked","code_sha256":"ffe66fb2efd3fe30","code_sha256_prefix":"ffe66fb2efd3fe30","mcp_get_code":{"code_sha256":"ffe66fb2efd3fe30"}},{"arxiv_id":"2006.14769","arxiv_id_is_arxiv":true,"paper":"/paper/supermasks-in-superposition","title":"Supermasks in Superposition","date":"2020-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dmiu-shell/deeprl-shell","path":"deep_rl/shell_modules/mmn/ssmask_utils.py","file_url":"https://github.com/dmiu-shell/deeprl-shell/blob/HEAD/deep_rl/shell_modules/mmn/ssmask_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4041eef325f5a3b2","code_sha256_prefix":"4041eef325f5a3b2","mcp_get_code":{"code_sha256":"4041eef325f5a3b2"}}],"record_sha256":"e0168d46d7a2b761cfff454fc5b578b1a58c9b85c3d1c3b192165f1820dbd06a","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}