{"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/similar","entry":"similar","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":8,"n_places_pointer_only":1,"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":2,"ran_violates":0,"ran_draft_wrong":0,"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":"2410.20274","arxiv_id_is_arxiv":true,"paper":"/paper/library-learning-doesn-t-the-curious-case-of","title":"Library Learning Doesn't: The Curious Case of the Single-Use \"Library\"","date":"2024-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wiio12/LEGO-Prover","path":"lego_prover/agents/skill.py","file_url":"https://github.com/wiio12/LEGO-Prover/blob/HEAD/lego_prover/agents/skill.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2858c9de61ad0a2c","code_sha256_prefix":"2858c9de61ad0a2c","mcp_get_code":{"code_sha256":"2858c9de61ad0a2c"}},{"arxiv_id":"2409.11295","arxiv_id_is_arxiv":true,"paper":"/paper/eia-environmental-injection-attack-on","title":"EIA: Environmental Injection Attack on Generalist Web Agents for Privacy Leakage","date":"2024-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"osu-nlp-group/eia_against_webagent","path":"SeeAct/src/dy_human_dynamic.py","file_url":"https://github.com/osu-nlp-group/eia_against_webagent/blob/HEAD/SeeAct/src/dy_human_dynamic.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":"5e4b02e5bc753357","code_sha256_prefix":"5e4b02e5bc753357","mcp_get_code":{"code_sha256":"5e4b02e5bc753357"}},{"arxiv_id":"2405.05347","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-educational-program-repair","title":"Benchmarking Educational Program Repair","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"koutchemecharles/gaied_nips23","path":"src/utils/data_structures.py","file_url":"https://github.com/koutchemecharles/gaied_nips23/blob/HEAD/src/utils/data_structures.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, koutchemecharles/gaied_nips23 when it was checked","code_sha256":"5e4b02e5bc753357","code_sha256_prefix":"5e4b02e5bc753357","mcp_get_code":{"code_sha256":"5e4b02e5bc753357"}},{"arxiv_id":"2404.04269","arxiv_id_is_arxiv":true,"paper":"/paper/algorithmic-collective-action-in-recommender","title":"Algorithmic Collective Action in Recommender Systems: Promoting Songs by Reordering Playlists","date":"2024-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joebaumann/recsys-collectiveaction","path":"recommender_system/spotify_scraper/scrape_spotify_song_streams.py","file_url":"https://github.com/joebaumann/recsys-collectiveaction/blob/HEAD/recommender_system/spotify_scraper/scrape_spotify_song_streams.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":"5e4b02e5bc753357","code_sha256_prefix":"5e4b02e5bc753357","mcp_get_code":{"code_sha256":"5e4b02e5bc753357"}},{"arxiv_id":"2310.05914","arxiv_id_is_arxiv":true,"paper":"/paper/neftune-noisy-embeddings-improve-instruction","title":"NEFTune: Noisy Embeddings Improve Instruction Finetuning","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akjindal53244/arithmo","path":"data_prep/prepare_model_traininig_data.py","file_url":"https://github.com/akjindal53244/arithmo/blob/HEAD/data_prep/prepare_model_traininig_data.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5e4b02e5bc753357","code_sha256_prefix":"5e4b02e5bc753357","mcp_get_code":{"code_sha256":"5e4b02e5bc753357"}},{"arxiv_id":"2305.00909","arxiv_id_is_arxiv":true,"paper":"/paper/outline-then-details-syntactically-guided","title":"Outline, Then Details: Syntactically Guided Coarse-To-Fine Code Generation","date":"2023-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/chaincoder","path":"create_data_step3_raw_to_codeAug.py","file_url":"https://github.com/vita-group/chaincoder/blob/HEAD/create_data_step3_raw_to_codeAug.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":"5e4b02e5bc753357","code_sha256_prefix":"5e4b02e5bc753357","mcp_get_code":{"code_sha256":"5e4b02e5bc753357"}},{"arxiv_id":"2301.11305","arxiv_id_is_arxiv":true,"paper":"/paper/detectgpt-zero-shot-machine-generated-text","title":"DetectGPT: Zero-Shot Machine-Generated Text Detection using Probability Curvature","date":"2023-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BurhanUlTayyab/DetectGPT","path":"model.py","file_url":"https://github.com/BurhanUlTayyab/DetectGPT/blob/HEAD/model.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":"5e4b02e5bc753357","code_sha256_prefix":"5e4b02e5bc753357","mcp_get_code":{"code_sha256":"5e4b02e5bc753357"}},{"arxiv_id":"2106.03427","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-task-learning-from-language","title":"Hierarchical Task Learning from Language Instructions with Unified Transformers and Self-Monitoring","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"594zyc/HiTUT","path":"gen/constants.py","file_url":"https://github.com/594zyc/HiTUT/blob/HEAD/gen/constants.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2f4ceff574612daf","code_sha256_prefix":"2f4ceff574612daf","mcp_get_code":{"code_sha256":"2f4ceff574612daf"}}],"record_sha256":"6cbe5feb2c0d794ef8549eba737bb5473072659d718a5bd14e453226075a32e2","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}