{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/clone-module","entry":"clone_module","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":3,"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":3,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":1},"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":"2407.13483","paper":"/paper/scape-a-simple-and-strong-category-agnostic","title":"SCAPE: A Simple and Strong Category-Agnostic Pose Estimator","date":"2024-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tiny-smart/SCAPE","path":"scape/models/keypoint_heads/one_stage_keypoints.py","file_url":"https://github.com/tiny-smart/SCAPE/blob/HEAD/scape/models/keypoint_heads/one_stage_keypoints.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ecb77c63d940855e","mcp_get_code":{"code_sha256":"ecb77c63d940855e"}},{"arxiv_id":"2405.20838","paper":"/paper/einspace-searching-for-neural-architectures","title":"einspace: Searching for Neural Architectures from Fundamental Operations","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linusericsson/einspace","path":"einspace/utils.py","file_url":"https://github.com/linusericsson/einspace/blob/HEAD/einspace/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8e8b2baaa9e2d837","mcp_get_code":{"code_sha256":"8e8b2baaa9e2d837"}},{"arxiv_id":"2405.17984","paper":"/paper/cross-context-backdoor-attacks-against-graph","title":"Cross-Context Backdoor Attacks against Graph Prompt Learning","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xtLyu/CrossBA","path":"ProG/meta.py","file_url":"https://github.com/xtLyu/CrossBA/blob/HEAD/ProG/meta.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3425b06cc24cb577","mcp_get_code":{"code_sha256":"3425b06cc24cb577"}},{"arxiv_id":"2311.00322","paper":"/paper/robust-graph-clustering-via-meta-weighting","title":"Robust Graph Clustering via Meta Weighting for Noisy Graphs","date":"2023-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyeonsoojo/metagc","path":"utils/clone_utils.py","file_url":"https://github.com/hyeonsoojo/metagc/blob/HEAD/utils/clone_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3425b06cc24cb577","mcp_get_code":{"code_sha256":"3425b06cc24cb577"}},{"arxiv_id":"1703.03400","paper":"/paper/model-agnostic-meta-learning-for-fast","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","date":"2017-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"learnables/learn2learn","path":"learn2learn/algorithms/maml.py","file_url":"https://github.com/learnables/learn2learn/blob/HEAD/learn2learn/algorithms/maml.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bbe0a23f6db14d65","mcp_get_code":{"code_sha256":"bbe0a23f6db14d65"}}]}