{"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/get-position-ids","entry":"get_position_ids","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":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":1,"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":3,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":6,"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":1,"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":"2604.22225","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-22225","title":"TTS-PRISM: A Perceptual Reasoning and Interpretable Speech Model for Fine-Grained Diagnosis","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"xiaomi-research/tts-prism","path":"models/mimo_audio_tokenizer/modeling_audio_tokenizer.py","file_url":"https://github.com/xiaomi-research/tts-prism/blob/HEAD/models/mimo_audio_tokenizer/modeling_audio_tokenizer.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":"1eac8c2f5179d506","code_sha256_prefix":"1eac8c2f5179d506","mcp_get_code":{"code_sha256":"1eac8c2f5179d506"}},{"arxiv_id":"2504.10421","arxiv_id_is_arxiv":true,"paper":"/paper/can-we-edit-llms-for-long-tail-biomedical","title":"Can We Edit LLMs for Long-Tail Biomedical Knowledge?","date":"2025-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xinhaoyi/edit_bio_long_tail","path":"experiments/knowledge_probing.py","file_url":"https://github.com/xinhaoyi/edit_bio_long_tail/blob/HEAD/experiments/knowledge_probing.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xinhaoyi/edit_bio_long_tail when it was checked","code_sha256":"b902e8caaa14ca37","code_sha256_prefix":"b902e8caaa14ca37","mcp_get_code":{"code_sha256":"b902e8caaa14ca37"}},{"arxiv_id":"2503.23367","arxiv_id_is_arxiv":true,"paper":"/paper/fastvar-linear-visual-autoregressive-modeling","title":"FastVAR: Linear Visual Autoregressive Modeling via Cached Token Pruning","date":"2025-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csguoh/fastvar","path":"HART/hart/modules/networks/fastvar_basic.py","file_url":"https://github.com/csguoh/fastvar/blob/HEAD/HART/hart/modules/networks/fastvar_basic.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":"9bd25e1e6d3188a3","code_sha256_prefix":"9bd25e1e6d3188a3","mcp_get_code":{"code_sha256":"9bd25e1e6d3188a3"}},{"arxiv_id":"2410.10812","arxiv_id_is_arxiv":true,"paper":"/paper/hart-efficient-visual-generation-with-hybrid","title":"HART: Efficient Visual Generation with Hybrid Autoregressive Transformer","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-han-lab/hart","path":"hart/modules/networks/basic_hart.py","file_url":"https://github.com/mit-han-lab/hart/blob/HEAD/hart/modules/networks/basic_hart.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":"fda451de9b534788","code_sha256_prefix":"fda451de9b534788","mcp_get_code":{"code_sha256":"fda451de9b534788"}},{"arxiv_id":"2404.12096","arxiv_id_is_arxiv":true,"paper":"/paper/longembed-extending-embedding-models-for-long","title":"LongEmbed: Extending Embedding Models for Long Context Retrieval","date":"2024-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dwzhu-pku/longembed","path":"src/encoder_model.py","file_url":"https://github.com/dwzhu-pku/longembed/blob/HEAD/src/encoder_model.py","status":"ran","verification_level":1,"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, dwzhu-pku/longembed when it was checked","code_sha256":"adc7a7dffaf286aa","code_sha256_prefix":"adc7a7dffaf286aa","mcp_get_code":{"code_sha256":"adc7a7dffaf286aa"}},{"arxiv_id":"2310.01405","arxiv_id_is_arxiv":true,"paper":"/paper/representation-engineering-a-top-down","title":"Representation Engineering: A Top-Down Approach to AI Transparency","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andyzoujm/representation-engineering","path":"lorra_finetune/src/train_val_datasets.py","file_url":"https://github.com/andyzoujm/representation-engineering/blob/HEAD/lorra_finetune/src/train_val_datasets.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":"db75f13051c04007","code_sha256_prefix":"db75f13051c04007","mcp_get_code":{"code_sha256":"db75f13051c04007"}}],"record_sha256":"ee38ac8a28f616f2e3d6640268cd17994628fe838ada5e735df554adf42f2857","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}