{"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/standardization","entry":"standardization","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":7,"n_papers_ran_no_instrument_failure":7,"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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":6,"n_places":8,"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":2,"ran_violates":1,"ran_draft_wrong":0,"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":"2412.07186","arxiv_id_is_arxiv":true,"paper":"/paper/monte-carlo-tree-search-based-space-transfer","title":"Monte Carlo Tree Search based Space Transfer for Black-box Optimization","date":"2024-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lamda-bbo/mcts-transfer","path":"mcts/MCTS.py","file_url":"https://github.com/lamda-bbo/mcts-transfer/blob/HEAD/mcts/MCTS.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lamda-bbo/mcts-transfer when it was checked","code_sha256":"3760c50860f8cbc1","code_sha256_prefix":"3760c50860f8cbc1","mcp_get_code":{"code_sha256":"3760c50860f8cbc1"}},{"arxiv_id":"2407.00002","arxiv_id_is_arxiv":true,"paper":"/paper/protein-property-prediction-with","title":"Kermut: Composite kernel regression for protein variant effects","date":"2024-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OATML-Markslab/ProteinGym","path":"proteingym/merge.py","file_url":"https://github.com/OATML-Markslab/ProteinGym/blob/HEAD/proteingym/merge.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"21fcd446fc722326","code_sha256_prefix":"21fcd446fc722326","mcp_get_code":{"code_sha256":"21fcd446fc722326"}},{"arxiv_id":"2309.15048","arxiv_id_is_arxiv":true,"paper":"/paper/class-incremental-learning-via-likelihood","title":"Class Incremental Learning via Likelihood Ratio Based Task Prediction","date":"2023-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linhaowei1/tpl","path":"utils/utils.py","file_url":"https://github.com/linhaowei1/tpl/blob/HEAD/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, linhaowei1/tpl when it was checked","code_sha256":"c4ebbf8910b5366b","code_sha256_prefix":"c4ebbf8910b5366b","mcp_get_code":{"code_sha256":"c4ebbf8910b5366b"}},{"arxiv_id":"2205.13760","arxiv_id_is_arxiv":true,"paper":"/paper/tranception-protein-fitness-prediction-with","title":"Tranception: protein fitness prediction with autoregressive transformers and inference-time retrieval","date":"2022-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OATML-Markslab/Tranception","path":"performance_analysis_proteingym.py","file_url":"https://github.com/OATML-Markslab/Tranception/blob/HEAD/performance_analysis_proteingym.py","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3b99aecc12883bf5","code_sha256_prefix":"3b99aecc12883bf5","mcp_get_code":{"code_sha256":"3b99aecc12883bf5"}},{"arxiv_id":"2203.01570","arxiv_id_is_arxiv":true,"paper":"/paper/representing-mixtures-of-word-embeddings-with-1","title":"Representing Mixtures of Word Embeddings with Mixtures of Topic Embeddings","date":"2022-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bochengroup/wete","path":"cluster_clc.py","file_url":"https://github.com/bochengroup/wete/blob/HEAD/cluster_clc.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a06b554c49675416","code_sha256_prefix":"a06b554c49675416","mcp_get_code":{"code_sha256":"a06b554c49675416"}},{"arxiv_id":"1904.01569","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-randomly-wired-neural-networks-for","title":"Exploring Randomly Wired Neural Networks for Image Recognition","date":"2019-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"swdsld/RandWire_tensorflow","path":"dataset/iter_utils.py","file_url":"https://github.com/swdsld/RandWire_tensorflow/blob/HEAD/dataset/iter_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":"63508099a4ccf94d","code_sha256_prefix":"63508099a4ccf94d","mcp_get_code":{"code_sha256":"63508099a4ccf94d"}},{"arxiv_id":"1711.00614","arxiv_id_is_arxiv":true,"paper":"/paper/a-multimodal-anomaly-detector-for-robot","title":"A Multimodal Anomaly Detector for Robot-Assisted Feeding Using an LSTM-based Variational Autoencoder","date":"2017-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chickenbestlover/RNN-Time-series-Anomaly-Detection","path":"preprocess_data.py","file_url":"https://github.com/chickenbestlover/RNN-Time-series-Anomaly-Detection/blob/HEAD/preprocess_data.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":"61729d480bdea1de","code_sha256_prefix":"61729d480bdea1de","mcp_get_code":{"code_sha256":"61729d480bdea1de"}},{"arxiv_id":"1702.05373","arxiv_id_is_arxiv":true,"paper":"/paper/emnist-an-extension-of-mnist-to-handwritten","title":"EMNIST: an extension of MNIST to handwritten letters","date":"2017-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Chizuchizu/amplify-hackathon","path":"src/utils.py","file_url":"https://github.com/Chizuchizu/amplify-hackathon/blob/HEAD/src/utils.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":"2dc8b2021e28ec53","code_sha256_prefix":"2dc8b2021e28ec53","mcp_get_code":{"code_sha256":"2dc8b2021e28ec53"}}],"record_sha256":"b1d5504c080a9a6d693aee01953ffa1ed03f68324d39de29ebf82c421499c7f5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}