{"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/extract-args-from-json","entry":"extract_args_from_json","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":2,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"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":4,"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":"2408.12594","arxiv_id_is_arxiv":true,"paper":"/paper/non-homophilic-graph-pre-training-and-prompt","title":"Non-Homophilic Graph Pre-Training and Prompt Learning","date":"2024-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaygagaga/pronog","path":"DSSL/ENZYMES_pretrain.py","file_url":"https://github.com/jaygagaga/pronog/blob/HEAD/DSSL/ENZYMES_pretrain.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jaygagaga/pronog when it was checked","code_sha256":"fd09b516ae8e2395","code_sha256_prefix":"fd09b516ae8e2395","mcp_get_code":{"code_sha256":"fd09b516ae8e2395"}},{"arxiv_id":"2106.10575","arxiv_id_is_arxiv":true,"paper":"/paper/evograd-efficient-gradient-based-meta","title":"EvoGrad: Efficient Gradient-Based Meta-Learning and Hyperparameter Optimization","date":"2021-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ondrejbohdal/evograd","path":"LabelNoiseMetaWeightNet/meta-weight-net-label-noise.py","file_url":"https://github.com/ondrejbohdal/evograd/blob/HEAD/LabelNoiseMetaWeightNet/meta-weight-net-label-noise.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"25b7c604b7346978","code_sha256_prefix":"25b7c604b7346978","mcp_get_code":{"code_sha256":"25b7c604b7346978"}},{"arxiv_id":"2011.00209","arxiv_id_is_arxiv":true,"paper":"/paper/meta-learning-with-adaptive-hyperparameters","title":"Meta-Learning with Adaptive Hyperparameters","date":"2020-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baiksung/ALFA","path":"utils/parser_utils.py","file_url":"https://github.com/baiksung/ALFA/blob/HEAD/utils/parser_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, baiksung/ALFA when it was checked","code_sha256":"21080e592d66eff4","code_sha256_prefix":"21080e592d66eff4","mcp_get_code":{"code_sha256":"21080e592d66eff4"}},{"arxiv_id":"2008.04042","arxiv_id_is_arxiv":true,"paper":"/paper/arcade-a-rapid-continual-anomaly-detector","title":"ARCADe: A Rapid Continual Anomaly Detector","date":"2020-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AhmedFrikha/ARCADe-A-Rapid-Continual-Anomaly-Detector","path":"arcade_main.py","file_url":"https://github.com/AhmedFrikha/ARCADe-A-Rapid-Continual-Anomaly-Detector/blob/HEAD/arcade_main.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AhmedFrikha/ARCADe-A-Rapid-Continual-Anomaly-Detector when it was checked","code_sha256":"c09ce24d7c70b40d","code_sha256_prefix":"c09ce24d7c70b40d","mcp_get_code":{"code_sha256":"c09ce24d7c70b40d"}},{"arxiv_id":"1906.05895","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-forget-for-meta-learning","title":"Learning to Forget for Meta-Learning","date":"2019-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baiksung/L2F","path":"utils/parser_utils.py","file_url":"https://github.com/baiksung/L2F/blob/HEAD/utils/parser_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":"632e39376f13aefe","code_sha256_prefix":"632e39376f13aefe","mcp_get_code":{"code_sha256":"632e39376f13aefe"}},{"arxiv_id":"1905.10295","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-learn-by-self-critique","title":"Learning to learn via Self-Critique","date":"2019-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AntreasAntoniou/Learning_to_Learn_via_Self-Critique","path":"utils/parser_utils.py","file_url":"https://github.com/AntreasAntoniou/Learning_to_Learn_via_Self-Critique/blob/HEAD/utils/parser_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":"632e39376f13aefe","code_sha256_prefix":"632e39376f13aefe","mcp_get_code":{"code_sha256":"632e39376f13aefe"}}],"record_sha256":"6e6ee3ada95c59612faed444f9a1c43d53466ea0761c8a07a3c9b986a5079796","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}