{"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/instantiate-class","entry":"instantiate_class","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":7,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":1,"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":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":1,"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":1,"unverified":3},"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":"2410.16928","arxiv_id_is_arxiv":true,"paper":"/paper/xlstm-mixer-multivariate-time-series","title":"xLSTM-Mixer: Multivariate Time Series Forecasting by Mixing via Scalar Memories","date":"2024-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mauricekraus/xlstm-mixer","path":"xlstm_mixer/cli_helper.py","file_url":"https://github.com/mauricekraus/xlstm-mixer/blob/HEAD/xlstm_mixer/cli_helper.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":"ccc3fc88ae244eac","code_sha256_prefix":"ccc3fc88ae244eac","mcp_get_code":{"code_sha256":"ccc3fc88ae244eac"}},{"arxiv_id":"2408.16532","arxiv_id_is_arxiv":true,"paper":"/paper/wavtokenizer-an-efficient-acoustic-discrete","title":"WavTokenizer: an Efficient Acoustic Discrete Codec Tokenizer for Audio Language Modeling","date":"2024-08-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jishengpeng/WavTokenizer","path":"decoder/pretrained.py","file_url":"https://github.com/jishengpeng/WavTokenizer/blob/HEAD/decoder/pretrained.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":"705b857d58937815","code_sha256_prefix":"705b857d58937815","mcp_get_code":{"code_sha256":"705b857d58937815"}},{"arxiv_id":"2405.17009","arxiv_id_is_arxiv":true,"paper":"/paper/position-foundation-agents-as-the-paradigm","title":"Position: Foundation Agents as the Paradigm Shift for Decision Making","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/smart","path":"src/utils/pl_utils.py","file_url":"https://github.com/microsoft/smart/blob/HEAD/src/utils/pl_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, microsoft/smart (NOASSERTION)","code_sha256":"1a2d1c7ac64dc5c6","code_sha256_prefix":"1a2d1c7ac64dc5c6","mcp_get_code":{"code_sha256":"1a2d1c7ac64dc5c6"}},{"arxiv_id":"2402.12208","arxiv_id_is_arxiv":true,"paper":"/paper/language-codec-reducing-the-gaps-between","title":"Language-Codec: Bridging Discrete Codec Representations and Speech Language Models","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jishengpeng/languagecodec","path":"languagecodec_decoder/pretrained_model.py","file_url":"https://github.com/jishengpeng/languagecodec/blob/HEAD/languagecodec_decoder/pretrained_model.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":"705b857d58937815","code_sha256_prefix":"705b857d58937815","mcp_get_code":{"code_sha256":"705b857d58937815"}},{"arxiv_id":"2306.00814","arxiv_id_is_arxiv":true,"paper":"/paper/vocos-closing-the-gap-between-time-domain-and","title":"Vocos: Closing the gap between time-domain and Fourier-based neural vocoders for high-quality audio synthesis","date":"2023-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gemelo-ai/vocos","path":"vocos/pretrained.py","file_url":"https://github.com/gemelo-ai/vocos/blob/HEAD/vocos/pretrained.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":"72b5e0a028285276","code_sha256_prefix":"72b5e0a028285276","mcp_get_code":{"code_sha256":"72b5e0a028285276"}},{"arxiv_id":"2305.16114","arxiv_id_is_arxiv":true,"paper":"/paper/fascinating-supervisory-signals-and-where-to","title":"Fascinating Supervisory Signals and Where to Find Them: Deep Anomaly Detection with Scale Learning","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuhongzuo/scale-learning","path":"algorithms/slad.py","file_url":"https://github.com/xuhongzuo/scale-learning/blob/HEAD/algorithms/slad.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"83a9af4ceb0fe772","code_sha256_prefix":"83a9af4ceb0fe772","mcp_get_code":{"code_sha256":"83a9af4ceb0fe772"}},{"arxiv_id":"2106.01345","arxiv_id_is_arxiv":true,"paper":"/paper/decision-transformer-reinforcement-learning","title":"Decision Transformer: Reinforcement Learning via Sequence Modeling","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/salina","path":"salina_examples/offline_rl/decision_transformer/agents.py","file_url":"https://github.com/facebookresearch/salina/blob/HEAD/salina_examples/offline_rl/decision_transformer/agents.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":"77a7fd5bc546c3a1","code_sha256_prefix":"77a7fd5bc546c3a1","mcp_get_code":{"code_sha256":"77a7fd5bc546c3a1"}}],"record_sha256":"c96c62ccb0efeb252ae6ff1d271d10a9b3c68a267bdff0cd1b7435e4183568c7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}