{"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/readfile","entry":"readfile","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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":9,"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":12,"n_samples_ran":12,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":2,"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":2,"ran_fixture":0,"ran":10,"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":"2402.19085","arxiv_id_is_arxiv":true,"paper":"/paper/controllable-preference-optimization-toward","title":"Controllable Preference Optimization: Toward Controllable Multi-Objective Alignment","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OpenBMB/CPO","path":"src/CDPO/data_preparation/lib/file_func.py","file_url":"https://github.com/OpenBMB/CPO/blob/HEAD/src/CDPO/data_preparation/lib/file_func.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":"4334eae9875cd51c","code_sha256_prefix":"4334eae9875cd51c","mcp_get_code":{"code_sha256":"4334eae9875cd51c"}},{"arxiv_id":"2303.02226","arxiv_id_is_arxiv":true,"paper":"/paper/an-efficient-algorithm-for-integer-lattice","title":"An efficient algorithm for integer lattice reduction","date":null,"month_inferred_from_arxiv_id":"2023-03","title_source":"archive","repo":"facebookresearch/latticer","path":"codes/graph.py","file_url":"https://github.com/facebookresearch/latticer/blob/HEAD/codes/graph.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, facebookresearch/latticer, 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":"c3cce05d250afa45","code_sha256_prefix":"c3cce05d250afa45","mcp_get_code":{"code_sha256":"c3cce05d250afa45"}},{"arxiv_id":"2210.03920","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-label-errors-in-token","title":"Detecting Label Errors in Token Classification Data","date":"2022-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cleanlab/token-label-error-benchmarks","path":"utils.py","file_url":"https://github.com/cleanlab/token-label-error-benchmarks/blob/HEAD/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":"4a2ea73644772367","code_sha256_prefix":"4a2ea73644772367","mcp_get_code":{"code_sha256":"4a2ea73644772367"}},{"arxiv_id":"2106.10575","arxiv_id_is_arxiv":true,"paper":"/paper/evograd-efficient-gradient-based-meta","title":"EvoGrad: Efficient Gradient-Based Meta-Learning and Hyperparameter Optimization","date":"2021-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ondrejbohdal/evograd","path":"CrossLingualLearningMetaXL/mtrain.py","file_url":"https://github.com/ondrejbohdal/evograd/blob/HEAD/CrossLingualLearningMetaXL/mtrain.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b23c45da1891b8ed","code_sha256_prefix":"b23c45da1891b8ed","mcp_get_code":{"code_sha256":"b23c45da1891b8ed"}},{"arxiv_id":"2010.00475","arxiv_id_is_arxiv":true,"paper":"/paper/fsd50k-an-open-dataset-of-human-labeled-sound","title":"FSD50K: An Open Dataset of Human-Labeled Sound Events","date":"2020-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SarthakYadav/GISE-51-pytorch","path":"pack_mixtures_into_lmdb.py","file_url":"https://github.com/SarthakYadav/GISE-51-pytorch/blob/HEAD/pack_mixtures_into_lmdb.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":"28f561c79edca3de","code_sha256_prefix":"28f561c79edca3de","mcp_get_code":{"code_sha256":"28f561c79edca3de"}},{"arxiv_id":"2004.09733","arxiv_id_is_arxiv":true,"paper":"/paper/train-no-evil-selective-masking-for-task","title":"Train No Evil: Selective Masking for Task-Guided Pre-Training","date":"2020-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/SelectiveMasking","path":"mask_model_pretrain.py","file_url":"https://github.com/thunlp/SelectiveMasking/blob/HEAD/mask_model_pretrain.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/SelectiveMasking when it was checked","code_sha256":"e4c84991f65ae5cf","code_sha256_prefix":"e4c84991f65ae5cf","mcp_get_code":{"code_sha256":"e4c84991f65ae5cf"}},{"arxiv_id":"2003.04297","arxiv_id_is_arxiv":true,"paper":"/paper/improved-baselines-with-momentum-contrastive","title":"Improved Baselines with Momentum Contrastive Learning","date":"2020-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"derrickwang005/mosrep","path":"imagenet2wds.py","file_url":"https://github.com/derrickwang005/mosrep/blob/HEAD/imagenet2wds.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":"efba4631d8880f62","code_sha256_prefix":"efba4631d8880f62","mcp_get_code":{"code_sha256":"efba4631d8880f62"}},{"arxiv_id":"1911.00720","arxiv_id_is_arxiv":true,"paper":"/paper/zen-pre-training-chinese-text-encoder","title":"ZEN: Pre-training Chinese Text Encoder Enhanced by N-gram Representations","date":"2019-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SVAIGBA/TwASP","path":"twasp_model.py","file_url":"https://github.com/SVAIGBA/TwASP/blob/HEAD/twasp_model.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":"013a1a80d4e2be45","code_sha256_prefix":"013a1a80d4e2be45","mcp_get_code":{"code_sha256":"013a1a80d4e2be45"}},{"arxiv_id":"1911.00720","arxiv_id_is_arxiv":true,"paper":"/paper/zen-pre-training-chinese-text-encoder","title":"ZEN: Pre-training Chinese Text Encoder Enhanced by N-gram Representations","date":"2019-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SVAIGBA/WMSeg","path":"wmseg_model.py","file_url":"https://github.com/SVAIGBA/WMSeg/blob/HEAD/wmseg_model.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":"3e642a8045e6ba92","code_sha256_prefix":"3e642a8045e6ba92","mcp_get_code":{"code_sha256":"3e642a8045e6ba92"}},{"arxiv_id":"1911.00068","arxiv_id_is_arxiv":true,"paper":"/paper/confident-learning-estimating-uncertainty-in","title":"Confident Learning: Estimating Uncertainty in Dataset Labels","date":"2019-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cleanlab/examples","path":"entity_recognition/run_ner.py","file_url":"https://github.com/cleanlab/examples/blob/HEAD/entity_recognition/run_ner.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":"217e4fc276ef67c1","code_sha256_prefix":"217e4fc276ef67c1","mcp_get_code":{"code_sha256":"217e4fc276ef67c1"}},{"arxiv_id":"1511.08308","arxiv_id_is_arxiv":true,"paper":"/paper/named-entity-recognition-with-bidirectional","title":"Named Entity Recognition with Bidirectional LSTM-CNNs","date":"2015-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mxhofer/Named-Entity-Recognition-BidirectionalLSTM-CNN-CoNLL","path":"prepro.py","file_url":"https://github.com/mxhofer/Named-Entity-Recognition-BidirectionalLSTM-CNN-CoNLL/blob/HEAD/prepro.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":"5b7a20a3a09ffb47","code_sha256_prefix":"5b7a20a3a09ffb47","mcp_get_code":{"code_sha256":"5b7a20a3a09ffb47"}},{"arxiv_id":"2021.emnlp-main.721","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2021.emnlp-main.721","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yangheng95/LCF-ATEPC","path":"utils/data_utils.py","file_url":"https://github.com/yangheng95/LCF-ATEPC/blob/HEAD/utils/data_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":"68cbb50f1dc71156","code_sha256_prefix":"68cbb50f1dc71156","mcp_get_code":{"code_sha256":"68cbb50f1dc71156"}}],"record_sha256":"0af7f9c88d2bd1c9f78631c4fcc8cb267100966d0c908bf5fa95966ece8ca0a9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}