{"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/convert-clone-examples-to-features","entry":"convert_clone_examples_to_features","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":2,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"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":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"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":"2312.04234","arxiv_id_is_arxiv":true,"paper":"/paper/graph-convolutions-enrich-the-self-attention","title":"Graph Convolutions Enrich the Self-Attention in Transformers!","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeongwhanchoi/gfsa","path":"Code/_utils.py","file_url":"https://github.com/jeongwhanchoi/gfsa/blob/HEAD/Code/_utils.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":"08ffc47da0ae6767","code_sha256_prefix":"08ffc47da0ae6767","mcp_get_code":{"code_sha256":"08ffc47da0ae6767"}},{"arxiv_id":"2311.00317","arxiv_id_is_arxiv":true,"paper":"/paper/data-augmentation-for-code-translation-with","title":"Data Augmentation for Code Translation with Comparable Corpora and Multiple References","date":"2023-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"veronicium/cmtrans","path":"codet5/_utils.py","file_url":"https://github.com/veronicium/cmtrans/blob/HEAD/codet5/_utils.py","status":"ran","verification_level":1,"contract_check":null,"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, veronicium/cmtrans when it was checked","code_sha256":"cc181d5e6e9504de","code_sha256_prefix":"cc181d5e6e9504de","mcp_get_code":{"code_sha256":"cc181d5e6e9504de"}},{"arxiv_id":"2207.11680","arxiv_id_is_arxiv":true,"paper":"/paper/no-more-fine-tuning-an-experimental","title":"No More Fine-Tuning? An Experimental Evaluation of Prompt Tuning in Code Intelligence","date":"2022-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adf1178/pt4code","path":"CodeT5-main/_utils.py","file_url":"https://github.com/adf1178/pt4code/blob/HEAD/CodeT5-main/_utils.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":"08ffc47da0ae6767","code_sha256_prefix":"08ffc47da0ae6767","mcp_get_code":{"code_sha256":"08ffc47da0ae6767"}},{"arxiv_id":"2206.07796","arxiv_id_is_arxiv":true,"paper":"/paper/fixeval-execution-based-evaluation-of-program","title":"FixEval: Execution-based Evaluation of Program Fixes for Programming Problems","date":"2022-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mahimanzum/fixeval","path":"codet5/_utils.py","file_url":"https://github.com/mahimanzum/fixeval/blob/HEAD/codet5/_utils.py","status":"ran","verification_level":1,"contract_check":null,"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 veronicium/cmtrans, and GitHub detected no licence in that repository when it was checked","code_sha256":"cc181d5e6e9504de","code_sha256_prefix":"cc181d5e6e9504de","mcp_get_code":{"code_sha256":"cc181d5e6e9504de"}},{"arxiv_id":"1909.09436","arxiv_id_is_arxiv":true,"paper":"/paper/codesearchnet-challenge-evaluating-the-state","title":"CodeSearchNet Challenge: Evaluating the State of Semantic Code Search","date":"2019-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nchen909/codeattention","path":"utils.py","file_url":"https://github.com/nchen909/codeattention/blob/HEAD/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":"cfd0293d796a30d2","code_sha256_prefix":"cfd0293d796a30d2","mcp_get_code":{"code_sha256":"cfd0293d796a30d2"}}],"record_sha256":"c49f355da4c0bfcda60ca66fe0d32c6f90f7a5b7bb068d2768f1801280a0e536","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}