{"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/init-experiment","entry":"init_experiment","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":2,"n_papers_ran_no_instrument_failure":2,"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":8,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":0,"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":2,"unverified":6},"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":"2504.03755","arxiv_id_is_arxiv":true,"paper":"/paper/protogcd-unified-and-unbiased-prototype","title":"ProtoGCD: Unified and Unbiased Prototype Learning for Generalized Category Discovery","date":"2025-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mashijie1028/protogcd","path":"my_utils/general_utils.py","file_url":"https://github.com/mashijie1028/protogcd/blob/HEAD/my_utils/general_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":"3c5ee964462a01ff","code_sha256_prefix":"3c5ee964462a01ff","mcp_get_code":{"code_sha256":"3c5ee964462a01ff"}},{"arxiv_id":"2405.20445","arxiv_id_is_arxiv":true,"paper":"/paper/graphany-a-foundation-model-for-node","title":"Fully-inductive Node Classification on Arbitrary Graphs","date":"2024-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepgraphlearning/graphany","path":"graphany/utils/experiment.py","file_url":"https://github.com/deepgraphlearning/graphany/blob/HEAD/graphany/utils/experiment.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":"48759ff44d6d216b","code_sha256_prefix":"48759ff44d6d216b","mcp_get_code":{"code_sha256":"48759ff44d6d216b"}},{"arxiv_id":"2405.15589","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-adversarial-training-in-llms-with","title":"Efficient Adversarial Training in LLMs with Continuous Attacks","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sophie-xhonneux/continuous-advtrain","path":"src/database_handling.py","file_url":"https://github.com/sophie-xhonneux/continuous-advtrain/blob/HEAD/src/database_handling.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":"61ad493f36ea49b1","code_sha256_prefix":"61ad493f36ea49b1","mcp_get_code":{"code_sha256":"61ad493f36ea49b1"}},{"arxiv_id":"2403.09974","arxiv_id_is_arxiv":true,"paper":"/paper/get-unlocking-the-multi-modal-potential-of","title":"Unlocking the Multi-modal Potential of CLIP for Generalized Category Discovery","date":"2024-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"enguangw/get","path":"util/general_utils.py","file_url":"https://github.com/enguangw/get/blob/HEAD/util/general_utils.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":"39511f9d47e3ddc7","code_sha256_prefix":"39511f9d47e3ddc7","mcp_get_code":{"code_sha256":"39511f9d47e3ddc7"}},{"arxiv_id":"2110.06207","arxiv_id_is_arxiv":true,"paper":"/paper/open-set-recognition-a-good-closed-set-1","title":"Open-Set Recognition: a Good Closed-Set Classifier is All You Need?","date":"2021-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sgvaze/osr_closed_set_all_you_need","path":"utils/utils.py","file_url":"https://github.com/sgvaze/osr_closed_set_all_you_need/blob/HEAD/utils/utils.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":"7767f8e34fb9f60c","code_sha256_prefix":"7767f8e34fb9f60c","mcp_get_code":{"code_sha256":"7767f8e34fb9f60c"}},{"arxiv_id":"2006.06958","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-the-role-of-training-regimes-in","title":"Understanding the Role of Training Regimes in Continual Learning","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imirzadeh/stable-continual-learning","path":"stable_sgd/utils.py","file_url":"https://github.com/imirzadeh/stable-continual-learning/blob/HEAD/stable_sgd/utils.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":"adff890682647c1e","code_sha256_prefix":"adff890682647c1e","mcp_get_code":{"code_sha256":"adff890682647c1e"}},{"arxiv_id":"2004.11727","arxiv_id_is_arxiv":true,"paper":"/paper/coach-a-coarse-to-fine-approach-for-cross","title":"Coach: A Coarse-to-Fine Approach for Cross-domain Slot Filling","date":"2020-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zliucr/coach","path":"src/utils.py","file_url":"https://github.com/zliucr/coach/blob/HEAD/src/utils.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":"d8508a4d683312a6","code_sha256_prefix":"d8508a4d683312a6","mcp_get_code":{"code_sha256":"d8508a4d683312a6"}},{"arxiv_id":"1507.06594","arxiv_id_is_arxiv":true,"paper":"/paper/neural-nilm-deep-neural-networks-applied-to","title":"Neural NILM: Deep Neural Networks Applied to Energy Disaggregation","date":"2015-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JackKelly/neuralnilm_prototype","path":"neuralnilm/experiment.py","file_url":"https://github.com/JackKelly/neuralnilm_prototype/blob/HEAD/neuralnilm/experiment.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":"baae6d0b0087030c","code_sha256_prefix":"baae6d0b0087030c","mcp_get_code":{"code_sha256":"baae6d0b0087030c"}},{"arxiv_id":"Wang_GET_Unlocking_the_Multi-modal_Potential_of_CLIP_for_Generalized_Category_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wang_GET_Unlocking_the_Multi-modal_Potential_of_CLIP_for_Generalized_Category_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"enguangW/GET","path":"util/general_utils.py","file_url":"https://github.com/enguangW/GET/blob/HEAD/util/general_utils.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":"39511f9d47e3ddc7","code_sha256_prefix":"39511f9d47e3ddc7","mcp_get_code":{"code_sha256":"39511f9d47e3ddc7"}}],"record_sha256":"1c2efcfc93d8baa578590cc8218cd8bfd70c41cab252d77ae9a5b767d62360b9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}