{"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/escape","entry":"escape","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":10,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":6,"n_places":10,"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":3,"ran_fixture":0,"ran":4,"unverified":1},"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":"2605.14665","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-14665","title":"Falkor-IRAC: Graph-Constrained Generation for Verified Legal Reasoning in Indian Judicial AI","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"joyboseroy/falkor-irac","path":"ingestion/graph_loader.py","file_url":"https://github.com/joyboseroy/falkor-irac/blob/HEAD/ingestion/graph_loader.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1d137fb5f729b044","code_sha256_prefix":"1d137fb5f729b044","mcp_get_code":{"code_sha256":"1d137fb5f729b044"}},{"arxiv_id":"2412.03719","arxiv_id_is_arxiv":true,"paper":"/paper/from-language-models-over-tokens-to-language","title":"From Language Models over Tokens to Language Models over Characters","date":"2024-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"genlm/genlm-bytes","path":"genlm/bytes/util.py","file_url":"https://github.com/genlm/genlm-bytes/blob/HEAD/genlm/bytes/util.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f9b09439a971a5ef","code_sha256_prefix":"f9b09439a971a5ef","mcp_get_code":{"code_sha256":"f9b09439a971a5ef"}},{"arxiv_id":"2307.02477","arxiv_id_is_arxiv":true,"paper":"/paper/reasoning-or-reciting-exploring-the","title":"Reasoning or Reciting? Exploring the Capabilities and Limitations of Language Models Through Counterfactual Tasks","date":"2023-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaofengwu/counterfactual-evaluation","path":"arithmetic/query_ccc.py","file_url":"https://github.com/zhaofengwu/counterfactual-evaluation/blob/HEAD/arithmetic/query_ccc.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":"8e2c1bf8f5114da3","code_sha256_prefix":"8e2c1bf8f5114da3","mcp_get_code":{"code_sha256":"8e2c1bf8f5114da3"}},{"arxiv_id":"2212.07919","arxiv_id_is_arxiv":true,"paper":"/paper/roscoe-a-suite-of-metrics-for-scoring-step-by","title":"ROSCOE: A Suite of Metrics for Scoring Step-by-Step Reasoning","date":"2022-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/ParlAI","path":"parlai/core/dict.py","file_url":"https://github.com/facebookresearch/ParlAI/blob/HEAD/parlai/core/dict.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, facebookresearch/ParlAI, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"758e9948df81569f","code_sha256_prefix":"758e9948df81569f","mcp_get_code":{"code_sha256":"758e9948df81569f"}},{"arxiv_id":"2003.11963","arxiv_id_is_arxiv":true,"paper":"/paper/tldr-token-loss-dynamic-reweighting-for","title":"TLDR: Token Loss Dynamic Reweighting for Reducing Repetitive Utterance Generation","date":"2020-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShaojieJiang/tldr","path":"parlai/core/dict.py","file_url":"https://github.com/ShaojieJiang/tldr/blob/HEAD/parlai/core/dict.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, ShaojieJiang/tldr, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"758e9948df81569f","code_sha256_prefix":"758e9948df81569f","mcp_get_code":{"code_sha256":"758e9948df81569f"}},{"arxiv_id":"2002.06653","arxiv_id_is_arxiv":true,"paper":"/paper/directed-graph-hashing","title":"Directed Graph Hashing","date":null,"month_inferred_from_arxiv_id":"2020-02","title_source":"archive","repo":"calebh/dihash","path":"dihash/hash_impl.py","file_url":"https://github.com/calebh/dihash/blob/HEAD/dihash/hash_impl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7c34d9b8fbf3c63a","code_sha256_prefix":"7c34d9b8fbf3c63a","mcp_get_code":{"code_sha256":"7c34d9b8fbf3c63a"}},{"arxiv_id":"1909.05863","arxiv_id_is_arxiv":true,"paper":"/paper/finding-generalizable-evidence-by-learning-to","title":"Finding Generalizable Evidence by Learning to Convince Q&A Models","date":"2019-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ethanjperez/convince","path":"ParlAI/parlai/core/dict.py","file_url":"https://github.com/ethanjperez/convince/blob/HEAD/ParlAI/parlai/core/dict.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eeaa9721dd6b0c0e","code_sha256_prefix":"eeaa9721dd6b0c0e","mcp_get_code":{"code_sha256":"eeaa9721dd6b0c0e"}},{"arxiv_id":"1906.01603","arxiv_id_is_arxiv":true,"paper":"/paper/do-neural-dialog-systems-use-the-conversation","title":"Do Neural Dialog Systems Use the Conversation History Effectively? An Empirical Study","date":"2019-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chinnadhurai/ParlAI","path":"parlai/core/dict.py","file_url":"https://github.com/chinnadhurai/ParlAI/blob/HEAD/parlai/core/dict.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, chinnadhurai/ParlAI, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"758e9948df81569f","code_sha256_prefix":"758e9948df81569f","mcp_get_code":{"code_sha256":"758e9948df81569f"}},{"arxiv_id":"1606.00739","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-structured-prediction-under-bandit","title":"Stochastic Structured Prediction under Bandit Feedback","date":"2016-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juliakreutzer/bandit-cdec","path":"corpus/xml-tok.py","file_url":"https://github.com/juliakreutzer/bandit-cdec/blob/HEAD/corpus/xml-tok.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1ea28f9c5a22c5be","code_sha256_prefix":"1ea28f9c5a22c5be","mcp_get_code":{"code_sha256":"1ea28f9c5a22c5be"}},{"arxiv_id":"1511.07487","arxiv_id_is_arxiv":true,"paper":"/paper/analysing-how-people-orient-to-and-spread","title":"Analysing How People Orient to and Spread Rumours in Social Media by Looking at Conversational Threads","date":null,"month_inferred_from_arxiv_id":"2015-11","title_source":"archive","repo":"azubiaga/pheme-twitter-conversation-collection","path":"tweepy/oauth.py","file_url":"https://github.com/azubiaga/pheme-twitter-conversation-collection/blob/HEAD/tweepy/oauth.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":"cc18bec1c682036f","code_sha256_prefix":"cc18bec1c682036f","mcp_get_code":{"code_sha256":"cc18bec1c682036f"}}],"record_sha256":"b16dace43900fc6136cbea5140fdc0e9b8e386389019788879734c2d66db9b16","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}