{"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/unzip","entry":"unzip","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":4,"n_papers_ran_no_instrument_failure":2,"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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":5,"n_places_pointer_only_link_open":2,"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":2,"ran_fixture":0,"ran":2,"unverified":2},"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":"2404.05055","arxiv_id_is_arxiv":true,"paper":"/paper/percentile-criterion-optimization-in-offline-1","title":"Percentile Criterion Optimization in Offline Reinforcement Learning","date":"2024-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elitalobo/varframework","path":"src/plot_ternary.py","file_url":"https://github.com/elitalobo/varframework/blob/HEAD/src/plot_ternary.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, elitalobo/varframework when it was checked","code_sha256":"566b67b5fd055137","code_sha256_prefix":"566b67b5fd055137","mcp_get_code":{"code_sha256":"566b67b5fd055137"}},{"arxiv_id":"2107.11323","arxiv_id_is_arxiv":true,"paper":"/paper/rilacs-risk-limiting-audits-via-confidence","title":"RiLACS: Risk-Limiting Audits via Confidence Sequences","date":null,"month_inferred_from_arxiv_id":"2021-07","title_source":"archive","repo":"WannabeSmith/RiLACS","path":"canada_audit/map.py","file_url":"https://github.com/WannabeSmith/RiLACS/blob/HEAD/canada_audit/map.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"70b3f235fc943a61","code_sha256_prefix":"70b3f235fc943a61","mcp_get_code":{"code_sha256":"70b3f235fc943a61"}},{"arxiv_id":"2004.08955","arxiv_id_is_arxiv":true,"paper":"/paper/resnest-split-attention-networks","title":"ResNeSt: Split-Attention Networks","date":"2020-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhanghang1989/ResNeSt","path":"resnest/utils.py","file_url":"https://github.com/zhanghang1989/ResNeSt/blob/HEAD/resnest/utils.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":"79a96a9c7fd65ce5","code_sha256_prefix":"79a96a9c7fd65ce5","mcp_get_code":{"code_sha256":"79a96a9c7fd65ce5"}},{"arxiv_id":"1802.05814","arxiv_id_is_arxiv":true,"paper":"/paper/variational-autoencoders-for-collaborative","title":"Variational Autoencoders for Collaborative Filtering","date":"2018-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amoussawi/recoder","path":"recoder/utils.py","file_url":"https://github.com/amoussawi/recoder/blob/HEAD/recoder/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":"0b263d9c0bf98eef","code_sha256_prefix":"0b263d9c0bf98eef","mcp_get_code":{"code_sha256":"0b263d9c0bf98eef"}},{"arxiv_id":"1701.02962","arxiv_id_is_arxiv":true,"paper":"/paper/distinguishing-antonyms-and-synonyms-in-a","title":"Distinguishing Antonyms and Synonyms in a Pattern-based Neural Network","date":"2017-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nguyenkh/AntSynNET","path":"train_ant_syn_net.py","file_url":"https://github.com/nguyenkh/AntSynNET/blob/HEAD/train_ant_syn_net.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, nguyenkh/AntSynNET when it was checked","code_sha256":"35448309e43583b0","code_sha256_prefix":"35448309e43583b0","mcp_get_code":{"code_sha256":"35448309e43583b0"}},{"arxiv_id":"1610.03017","arxiv_id_is_arxiv":true,"paper":"/paper/fully-character-level-neural-machine","title":"Fully Character-Level Neural Machine Translation without Explicit Segmentation","date":"2016-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nyu-dl/dl4mt-c2c","path":"bpe2char/mixer.py","file_url":"https://github.com/nyu-dl/dl4mt-c2c/blob/HEAD/bpe2char/mixer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from Zhangyuewei98/arctic-captions-py3, and GitHub detected no licence in that repository when it was checked","code_sha256":"73d1b90c1f18304d","code_sha256_prefix":"73d1b90c1f18304d","mcp_get_code":{"code_sha256":"73d1b90c1f18304d"}},{"arxiv_id":"1603.06147","arxiv_id_is_arxiv":true,"paper":"/paper/a-character-level-decoder-without-explicit","title":"A Character-Level Decoder without Explicit Segmentation for Neural Machine Translation","date":"2016-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nyu-dl/dl4mt-cdec","path":"mixer.py","file_url":"https://github.com/nyu-dl/dl4mt-cdec/blob/HEAD/mixer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from Zhangyuewei98/arctic-captions-py3, and GitHub detected no licence in that repository when it was checked","code_sha256":"73d1b90c1f18304d","code_sha256_prefix":"73d1b90c1f18304d","mcp_get_code":{"code_sha256":"73d1b90c1f18304d"}},{"arxiv_id":"1502.03044","arxiv_id_is_arxiv":true,"paper":"/paper/show-attend-and-tell-neural-image-caption","title":"Show, Attend and Tell: Neural Image Caption Generation with Visual Attention","date":"2015-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhangyuewei98/arctic-captions-py3","path":"capgen.py","file_url":"https://github.com/Zhangyuewei98/arctic-captions-py3/blob/HEAD/capgen.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, Zhangyuewei98/arctic-captions-py3 when it was checked","code_sha256":"73d1b90c1f18304d","code_sha256_prefix":"73d1b90c1f18304d","mcp_get_code":{"code_sha256":"73d1b90c1f18304d"}}],"record_sha256":"96a199936d020d890b81b2ab659e80a74574506442ef1fa55c96cb1dfc97dc4c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}