{"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-decoder","entry":"get_decoder","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":13,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":4,"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":12,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":3,"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":4,"unverified":7},"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":"2606.15751","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-15751","title":"Acoustic Prompting via Stage-wise Modulation for Few-Shot Learning in Audio Language Models","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"hyebin-c/aspl","path":"pengi/models/decoder.py","file_url":"https://github.com/hyebin-c/aspl/blob/HEAD/pengi/models/decoder.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":"360a191dd28ceec7","code_sha256_prefix":"360a191dd28ceec7","mcp_get_code":{"code_sha256":"360a191dd28ceec7"}},{"arxiv_id":"2503.08540","arxiv_id_is_arxiv":true,"paper":"/paper/mellow-a-small-audio-language-model-for","title":"Mellow: a small audio language model for reasoning","date":"2025-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"soham97/mellow","path":"mellow/model/decoder.py","file_url":"https://github.com/soham97/mellow/blob/HEAD/mellow/model/decoder.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":"3a331962cec26f5b","code_sha256_prefix":"3a331962cec26f5b","mcp_get_code":{"code_sha256":"3a331962cec26f5b"}},{"arxiv_id":"2502.04476","arxiv_id_is_arxiv":true,"paper":"/paper/adiff-explaining-audio-difference-using","title":"ADIFF: Explaining audio difference using natural language","date":"2025-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"soham97/adiff","path":"model/decoder.py","file_url":"https://github.com/soham97/adiff/blob/HEAD/model/decoder.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":"c5b88745758acb28","code_sha256_prefix":"c5b88745758acb28","mcp_get_code":{"code_sha256":"c5b88745758acb28"}},{"arxiv_id":"2407.06124","arxiv_id_is_arxiv":true,"paper":"/paper/structured-generations-using-hierarchical","title":"Structured Generations: Using Hierarchical Clusters to guide Diffusion Models","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JoGo175/diffuse-treevae","path":"models/model.py","file_url":"https://github.com/JoGo175/diffuse-treevae/blob/HEAD/models/model.py","status":"unverified","verification_level":0,"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, JoGo175/diffuse-treevae when it was checked","code_sha256":"9b121c3624f0e249","code_sha256_prefix":"9b121c3624f0e249","mcp_get_code":{"code_sha256":"9b121c3624f0e249"}},{"arxiv_id":"2406.08473","arxiv_id_is_arxiv":true,"paper":"/paper/strategies-for-pretraining-neural-operators","title":"Strategies for Pretraining Neural Operators","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anthonyzhou-1/pretraining_pdes","path":"loss/spatiotemporal_losses.py","file_url":"https://github.com/anthonyzhou-1/pretraining_pdes/blob/HEAD/loss/spatiotemporal_losses.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":"b98e86c5c3097f56","code_sha256_prefix":"b98e86c5c3097f56","mcp_get_code":{"code_sha256":"b98e86c5c3097f56"}},{"arxiv_id":"2403.08335","arxiv_id_is_arxiv":true,"paper":"/paper/a-sparsity-principle-for-partially-observable","title":"A Sparsity Principle for Partially Observable Causal Representation Learning","date":"2024-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danrux/sparsity-crl","path":"Numerical/invertible_network_utils.py","file_url":"https://github.com/danrux/sparsity-crl/blob/HEAD/Numerical/invertible_network_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":"c2621183d830d73f","code_sha256_prefix":"c2621183d830d73f","mcp_get_code":{"code_sha256":"c2621183d830d73f"}},{"arxiv_id":"2305.11834","arxiv_id_is_arxiv":true,"paper":"/paper/pengi-an-audio-language-model-for-audio-tasks-1","title":"Pengi: An Audio Language Model for Audio Tasks","date":"2023-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/pengi","path":"models/decoder.py","file_url":"https://github.com/microsoft/pengi/blob/HEAD/models/decoder.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":"360a191dd28ceec7","code_sha256_prefix":"360a191dd28ceec7","mcp_get_code":{"code_sha256":"360a191dd28ceec7"}},{"arxiv_id":"2208.02955","arxiv_id_is_arxiv":true,"paper":"/paper/zlpr-a-novel-loss-for-multi-label","title":"ZLPR: A Novel Loss for Multi-label Classification","date":"2022-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"whitepurple/HBM-loss-for-HTC","path":"src/model/decoder.py","file_url":"https://github.com/whitepurple/HBM-loss-for-HTC/blob/HEAD/src/model/decoder.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":"d8ec073697b5fb3d","code_sha256_prefix":"d8ec073697b5fb3d","mcp_get_code":{"code_sha256":"d8ec073697b5fb3d"}},{"arxiv_id":"2103.17022","arxiv_id_is_arxiv":true,"paper":"/paper/layout-guided-novel-view-synthesis-from-a","title":"Layout-Guided Novel View Synthesis from a Single Indoor Panorama","date":"2021-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/synsin","path":"models/z_buffermodel.py","file_url":"https://github.com/facebookresearch/synsin/blob/HEAD/models/z_buffermodel.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, facebookresearch/synsin (NOASSERTION)","code_sha256":"76ae72d346f91e29","code_sha256_prefix":"76ae72d346f91e29","mcp_get_code":{"code_sha256":"76ae72d346f91e29"}},{"arxiv_id":"1911.07757","arxiv_id_is_arxiv":true,"paper":"/paper/satellite-image-time-series-classification","title":"Satellite Image Time Series Classification with Pixel-Set Encoders and Temporal Self-Attention","date":"2019-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maja601/pytorch-psetae","path":"models/decoder.py","file_url":"https://github.com/maja601/pytorch-psetae/blob/HEAD/models/decoder.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":"0f8cc107e0a9e7dc","code_sha256_prefix":"0f8cc107e0a9e7dc","mcp_get_code":{"code_sha256":"0f8cc107e0a9e7dc"}},{"arxiv_id":"1909.07877","arxiv_id_is_arxiv":true,"paper":"/paper/multi-mapping-image-to-image-translation-via","title":"Multi-mapping Image-to-Image Translation via Learning Disentanglement","date":"2019-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Xiaoming-Yu/DMIT","path":"models/modules/network.py","file_url":"https://github.com/Xiaoming-Yu/DMIT/blob/HEAD/models/modules/network.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":"871277dfaad89773","code_sha256_prefix":"871277dfaad89773","mcp_get_code":{"code_sha256":"871277dfaad89773"}},{"arxiv_id":"1806.02426","arxiv_id_is_arxiv":true,"paper":"/paper/deep-variational-reinforcement-learning-for","title":"Deep Variational Reinforcement Learning for POMDPs","date":"2018-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maximilianigl/DVRL","path":"code/encoder_decoder.py","file_url":"https://github.com/maximilianigl/DVRL/blob/HEAD/code/encoder_decoder.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":"f9ea843ee6c0d21e","code_sha256_prefix":"f9ea843ee6c0d21e","mcp_get_code":{"code_sha256":"f9ea843ee6c0d21e"}},{"arxiv_id":"1711.00937","arxiv_id_is_arxiv":true,"paper":"/paper/neural-discrete-representation-learning","title":"Neural Discrete Representation Learning","date":"2017-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"explainingai-code/VQVAE-Pytorch","path":"model/vqvae.py","file_url":"https://github.com/explainingai-code/VQVAE-Pytorch/blob/HEAD/model/vqvae.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, explainingai-code/VQVAE-Pytorch when it was checked","code_sha256":"32ad87238c5e79f6","code_sha256_prefix":"32ad87238c5e79f6","mcp_get_code":{"code_sha256":"32ad87238c5e79f6"}}],"record_sha256":"690c6e52ca3e54df19bb0dd423158722a4662ce05abf5cc9d4d956b9c8253951","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}