{"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/decode-sequence","entry":"decode_sequence","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":5,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":2,"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":2,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":6,"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":0,"ran_fixture":2,"ran":2,"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":"2601.01778","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-01778","title":"BanglaIPA: Towards Robust Text-to-IPA Transcription with Contextual Rewriting in Bengali","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Jak57/BanglaIPA","path":"inference.py","file_url":"https://github.com/Jak57/BanglaIPA/blob/HEAD/inference.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, Jak57/BanglaIPA when it was checked","code_sha256":"604ac5eecfb77fbb","code_sha256_prefix":"604ac5eecfb77fbb","mcp_get_code":{"code_sha256":"604ac5eecfb77fbb"}},{"arxiv_id":"2109.06387","arxiv_id_is_arxiv":true,"paper":"/paper/rationales-for-sequential-predictions","title":"Rationales for Sequential Predictions","date":"2021-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keyonvafa/career-code","path":"fairseq/rationalization.py","file_url":"https://github.com/keyonvafa/career-code/blob/HEAD/fairseq/rationalization.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6e11afaf3878d5ad","code_sha256_prefix":"6e11afaf3878d5ad","mcp_get_code":{"code_sha256":"6e11afaf3878d5ad"}},{"arxiv_id":"2109.06387","arxiv_id_is_arxiv":true,"paper":"/paper/rationales-for-sequential-predictions","title":"Rationales for Sequential Predictions","date":"2021-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keyonvafa/sequential-rationales","path":"fairseq/rationalization.py","file_url":"https://github.com/keyonvafa/sequential-rationales/blob/HEAD/fairseq/rationalization.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"81307176d91be885","code_sha256_prefix":"81307176d91be885","mcp_get_code":{"code_sha256":"81307176d91be885"}},{"arxiv_id":"2105.13889","arxiv_id_is_arxiv":true,"paper":"/paper/equilibrium-and-non-equilibrium-regimes-in","title":"Equilibrium and non-Equilibrium regimes in the learning of Restricted Boltzmann Machines","date":"2021-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AurelienDecelle/TorchRBM","path":"rbm/fasta_utils.py","file_url":"https://github.com/AurelienDecelle/TorchRBM/blob/HEAD/rbm/fasta_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":"e663927a1fd4a268","code_sha256_prefix":"e663927a1fd4a268","mcp_get_code":{"code_sha256":"e663927a1fd4a268"}},{"arxiv_id":"1806.00807","arxiv_id_is_arxiv":true,"paper":"/paper/learning-semantic-sentence-embeddings-using-1","title":"Learning Semantic Sentence Embeddings using Sequential Pair-wise Discriminator","date":"2018-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dev-chauhan/PQG-pytorch","path":"misc/net_utils.py","file_url":"https://github.com/dev-chauhan/PQG-pytorch/blob/HEAD/misc/net_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":"0fd52e308ba7327b","code_sha256_prefix":"0fd52e308ba7327b","mcp_get_code":{"code_sha256":"0fd52e308ba7327b"}},{"arxiv_id":"1804.09160","arxiv_id_is_arxiv":true,"paper":"/paper/no-metrics-are-perfect-adversarial-reward","title":"No Metrics Are Perfect: Adversarial Reward Learning for Visual Storytelling","date":"2018-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"littlekobe/AREL","path":"misc/utils.py","file_url":"https://github.com/littlekobe/AREL/blob/HEAD/misc/utils.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":"38a2f6d54ec130e7","code_sha256_prefix":"38a2f6d54ec130e7","mcp_get_code":{"code_sha256":"38a2f6d54ec130e7"}}],"record_sha256":"7cce44c44183d3d9a8350ea9b5711ff70ac5f30b822f1495dfc35210b567a255","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}