{"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/fopen","entry":"fopen","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":6,"n_papers_ran_no_instrument_failure":6,"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":5,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":0,"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":0,"ran_fixture":0,"ran":3,"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":"2511.17399","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-17399","title":"Stable Coresets via Posterior Sampling: Aligning Induced and Full Loss Landscapes","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"decile-team/cords","path":"cords/utils/config_utils.py","file_url":"https://github.com/decile-team/cords/blob/HEAD/cords/utils/config_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6255b9f39cbbc395","code_sha256_prefix":"6255b9f39cbbc395","mcp_get_code":{"code_sha256":"6255b9f39cbbc395"}},{"arxiv_id":"2304.12308","arxiv_id_is_arxiv":true,"paper":"/paper/segment-anything-in-3d-with-nerfs","title":"Segment Anything in 3D with Radiance Fields","date":"2023-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jumpat/SegmentAnythingin3D","path":"lib/config_path.py","file_url":"https://github.com/Jumpat/SegmentAnythingin3D/blob/HEAD/lib/config_path.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":"1c99e80d5edb7a50","code_sha256_prefix":"1c99e80d5edb7a50","mcp_get_code":{"code_sha256":"1c99e80d5edb7a50"}},{"arxiv_id":"2006.15408","arxiv_id_is_arxiv":true,"paper":"/paper/learning-optimal-tree-models-under-beam","title":"Learning Optimal Tree Models Under Beam Search","date":"2020-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alibaba/x-deeplearning","path":"xdl-algorithm-solution/DIEN/script/data_iterator.py","file_url":"https://github.com/alibaba/x-deeplearning/blob/HEAD/xdl-algorithm-solution/DIEN/script/data_iterator.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":"de1047be4a671cdf","code_sha256_prefix":"de1047be4a671cdf","mcp_get_code":{"code_sha256":"de1047be4a671cdf"}},{"arxiv_id":"1805.11462","arxiv_id_is_arxiv":true,"paper":"/paper/opennmt-neural-machine-translation-toolkit","title":"OpenNMT: Neural Machine Translation Toolkit","date":"2018-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rsennrich/nematus","path":"nematus/data_iterator.py","file_url":"https://github.com/rsennrich/nematus/blob/HEAD/nematus/data_iterator.py","status":"ran","verification_level":1,"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":"3552dcfdf6c80e3b","code_sha256_prefix":"3552dcfdf6c80e3b","mcp_get_code":{"code_sha256":"3552dcfdf6c80e3b"}},{"arxiv_id":"1805.01252","arxiv_id_is_arxiv":true,"paper":"/paper/improving-a-neural-semantic-parser-by","title":"Improving a Neural Semantic Parser by Counterfactual Learning from Human Bandit Feedback","date":"2018-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"carolinlawrence/nematus","path":"nematus/cl_log_iterator.py","file_url":"https://github.com/carolinlawrence/nematus/blob/HEAD/nematus/cl_log_iterator.py","status":"ran","verification_level":1,"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":"171953963fb4d022","code_sha256_prefix":"171953963fb4d022","mcp_get_code":{"code_sha256":"171953963fb4d022"}},{"arxiv_id":"1703.04887","arxiv_id_is_arxiv":true,"paper":"/paper/improving-neural-machine-translation-with","title":"Improving Neural Machine Translation with Conditional Sequence Generative Adversarial Nets","date":"2017-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhenYangIACAS/NMT_GAN","path":"RNNsearch_GAN/data_iterator.py","file_url":"https://github.com/ZhenYangIACAS/NMT_GAN/blob/HEAD/RNNsearch_GAN/data_iterator.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":"171953963fb4d022","code_sha256_prefix":"171953963fb4d022","mcp_get_code":{"code_sha256":"171953963fb4d022"}},{"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/data_iterator.py","file_url":"https://github.com/nyu-dl/dl4mt-c2c/blob/HEAD/bpe2char/data_iterator.py","status":"ran","verification_level":1,"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":"171953963fb4d022","code_sha256_prefix":"171953963fb4d022","mcp_get_code":{"code_sha256":"171953963fb4d022"}},{"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":"data_iterator.py","file_url":"https://github.com/nyu-dl/dl4mt-cdec/blob/HEAD/data_iterator.py","status":"ran","verification_level":1,"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":"171953963fb4d022","code_sha256_prefix":"171953963fb4d022","mcp_get_code":{"code_sha256":"171953963fb4d022"}}],"record_sha256":"f19736c9873b276773dfdd08d3e9fcd9f593d27a72cbfc1f0b7f647aad51a229","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}