{"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/process-line","entry":"process_line","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":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":9,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":5,"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":3,"ran_fixture":0,"ran":3,"unverified":3},"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":"2503.23513","arxiv_id_is_arxiv":true,"paper":"/paper/rare-retrieval-augmented-reasoning-modeling","title":"RARE: Retrieval-Augmented Reasoning Modeling","date":"2025-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"open-dataflow/rare","path":"process/process_mmrait.py","file_url":"https://github.com/open-dataflow/rare/blob/HEAD/process/process_mmrait.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"271b7030a5cdfb52","code_sha256_prefix":"271b7030a5cdfb52","mcp_get_code":{"code_sha256":"271b7030a5cdfb52"}},{"arxiv_id":"2410.08821","arxiv_id_is_arxiv":true,"paper":"/paper/retriever-and-memory-towards-adaptive-note","title":"Retriever-and-Memory: Towards Adaptive Note-Enhanced Retrieval-Augmented Generation","date":"2024-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/adaptive-note","path":"src/build_index/es/index_2wiki.py","file_url":"https://github.com/thunlp/adaptive-note/blob/HEAD/src/build_index/es/index_2wiki.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, thunlp/adaptive-note when it was checked","code_sha256":"91887e2af6283559","code_sha256_prefix":"91887e2af6283559","mcp_get_code":{"code_sha256":"91887e2af6283559"}},{"arxiv_id":"2410.08821","arxiv_id_is_arxiv":true,"paper":"/paper/retriever-and-memory-towards-adaptive-note","title":"Retriever-and-Memory: Towards Adaptive Note-Enhanced Retrieval-Augmented Generation","date":"2024-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/adaptive-note","path":"src/build_index/es/index_hotpotqa.py","file_url":"https://github.com/thunlp/adaptive-note/blob/HEAD/src/build_index/es/index_hotpotqa.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, thunlp/adaptive-note when it was checked","code_sha256":"2208090c4ab6bf61","code_sha256_prefix":"2208090c4ab6bf61","mcp_get_code":{"code_sha256":"2208090c4ab6bf61"}},{"arxiv_id":"2408.08067","arxiv_id_is_arxiv":true,"paper":"/paper/ragchecker-a-fine-grained-framework-for","title":"RAGChecker: A Fine-grained Framework for Diagnosing Retrieval-Augmented Generation","date":"2024-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-science/ragchecker","path":"rag_baselines/chunking.py","file_url":"https://github.com/amazon-science/ragchecker/blob/HEAD/rag_baselines/chunking.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ad05949a96877c52","code_sha256_prefix":"ad05949a96877c52","mcp_get_code":{"code_sha256":"ad05949a96877c52"}},{"arxiv_id":"2308.12086","arxiv_id_is_arxiv":true,"paper":"/paper/out-of-the-cage-how-stochastic-parrots-win-in","title":"Out of the Cage: How Stochastic Parrots Win in Cyber Security Environments","date":"2023-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stratosphereips/netsecgame","path":"netsecgame/utils/aidojo_log_colorizer.py","file_url":"https://github.com/stratosphereips/netsecgame/blob/HEAD/netsecgame/utils/aidojo_log_colorizer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-2.0, as GitHub detects it on this paper's repository, stratosphereips/netsecgame, is not in the permissive set Syntology serves inline","code_sha256":"db0eca0915234c88","code_sha256_prefix":"db0eca0915234c88","mcp_get_code":{"code_sha256":"db0eca0915234c88"}},{"arxiv_id":"2302.06144","arxiv_id_is_arxiv":true,"paper":"/paper/skcoder-a-sketch-based-approach-for-automatic","title":"SkCoder: A Sketch-based Approach for Automatic Code Generation","date":null,"month_inferred_from_arxiv_id":"2023-02","title_source":"archive","repo":"lj2lijia/skcoder","path":"sketcher/preprocess.py","file_url":"https://github.com/lj2lijia/skcoder/blob/HEAD/sketcher/preprocess.py","status":"unverified","verification_level":0,"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, lj2lijia/skcoder when it was checked","code_sha256":"a8126a3c1e97ffd2","code_sha256_prefix":"a8126a3c1e97ffd2","mcp_get_code":{"code_sha256":"a8126a3c1e97ffd2"}},{"arxiv_id":"1911.12019","arxiv_id_is_arxiv":true,"paper":"/paper/word2word-a-collection-of-bilingual-lexicons","title":"word2word: A Collection of Bilingual Lexicons for 3,564 Language Pairs","date":"2019-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Kyubyong/word2word","path":"word2word/tokenization.py","file_url":"https://github.com/Kyubyong/word2word/blob/HEAD/word2word/tokenization.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"00f3aa78f7c4246f","code_sha256_prefix":"00f3aa78f7c4246f","mcp_get_code":{"code_sha256":"00f3aa78f7c4246f"}},{"arxiv_id":"1707.00044","arxiv_id_is_arxiv":true,"paper":"/paper/penalizing-unfairness-in-binary","title":"Penalizing Unfairness in Binary Classification","date":"2017-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jjgold012/lab-project-fairness","path":"fairness_project/start.py","file_url":"https://github.com/jjgold012/lab-project-fairness/blob/HEAD/fairness_project/start.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, jjgold012/lab-project-fairness when it was checked","code_sha256":"127a7b514869d39c","code_sha256_prefix":"127a7b514869d39c","mcp_get_code":{"code_sha256":"127a7b514869d39c"}},{"arxiv_id":"1508.01211","arxiv_id_is_arxiv":true,"paper":"/paper/listen-attend-and-spell","title":"Listen, Attend and Spell","date":"2015-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sciforce/phones-las","path":"text_preprocess.py","file_url":"https://github.com/sciforce/phones-las/blob/HEAD/text_preprocess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"78f8ed248b3655ea","code_sha256_prefix":"78f8ed248b3655ea","mcp_get_code":{"code_sha256":"78f8ed248b3655ea"}}],"record_sha256":"73691f49d7f522ebc4ecb0fd8df3008894e500ce61976fd8d1c5990ea272f986","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}