{"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/beam-search","entry":"beam_search","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":25,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":11,"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":24,"n_samples_ran":12,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":2,"n_samples_unverified":12,"n_samples_fingerprinted":1,"n_places":26,"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":2,"ran_fixture":0,"ran":10,"unverified":12},"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":"2411.07428","arxiv_id_is_arxiv":true,"paper":"/paper/just-label-the-repeats-for-in-the-wild-audio","title":"Just Label the Repeats for In-The-Wild Audio-to-Score Alignment","date":"2024-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"irmakbky/jltr-alignment","path":"magenta/common/beam_search.py","file_url":"https://github.com/irmakbky/jltr-alignment/blob/HEAD/magenta/common/beam_search.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":"fc965e87e24dc01d","code_sha256_prefix":"fc965e87e24dc01d","mcp_get_code":{"code_sha256":"fc965e87e24dc01d"}},{"arxiv_id":"2405.19100","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-zero-shot-facial-expression","title":"Enhancing Zero-Shot Facial Expression Recognition by LLM Knowledge Transfer","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zengqunzhao/exp-clip","path":"models/BLIP2_T5.py","file_url":"https://github.com/zengqunzhao/exp-clip/blob/HEAD/models/BLIP2_T5.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":"9a9839a0184a9bc9","code_sha256_prefix":"9a9839a0184a9bc9","mcp_get_code":{"code_sha256":"9a9839a0184a9bc9"}},{"arxiv_id":"2312.16045","arxiv_id_is_arxiv":true,"paper":"/paper/algebraic-positional-encodings","title":"Algebraic Positional Encodings","date":"2023-12-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"konstantinoskokos/unitarype","path":"eval/models/nmt/base.py","file_url":"https://github.com/konstantinoskokos/unitarype/blob/HEAD/eval/models/nmt/base.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-SA-4.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"CC-BY-SA-4.0, as GitHub detects it on this paper's repository, konstantinoskokos/unitarype, is not in the permissive set Syntology serves inline","code_sha256":"1b5b1a8a40b47b92","code_sha256_prefix":"1b5b1a8a40b47b92","mcp_get_code":{"code_sha256":"1b5b1a8a40b47b92"}},{"arxiv_id":"2312.12469","arxiv_id_is_arxiv":true,"paper":"/paper/distilling-autoregressive-models-to-obtain","title":"Distilling Autoregressive Models to Obtain High-Performance Non-Autoregressive Solvers for Vehicle Routing Problems with Faster Inference Speed","date":"2023-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xybfight/gnarkd","path":"GNARKD-POMO/TSP/Test_file.py","file_url":"https://github.com/xybfight/gnarkd/blob/HEAD/GNARKD-POMO/TSP/Test_file.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, xybfight/gnarkd when it was checked","code_sha256":"d9ac4f54def47957","code_sha256_prefix":"d9ac4f54def47957","mcp_get_code":{"code_sha256":"d9ac4f54def47957"}},{"arxiv_id":"2310.18443","arxiv_id_is_arxiv":true,"paper":"/paper/towards-a-fuller-understanding-of-neurons-1","title":"Towards a fuller understanding of neurons with Clustered Compositional Explanations","date":"2023-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"krlgroup/clustered-compositional-explanations","path":"src/heuristic_search.py","file_url":"https://github.com/krlgroup/clustered-compositional-explanations/blob/HEAD/src/heuristic_search.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":"4cbadf168b410b2a","code_sha256_prefix":"4cbadf168b410b2a","mcp_get_code":{"code_sha256":"4cbadf168b410b2a"}},{"arxiv_id":"2306.14256","arxiv_id_is_arxiv":true,"paper":"/paper/a-multilingual-translator-to-sql-with","title":"A Multilingual Translator to SQL with Database Schema Pruning to Improve Self-Attention","date":"2023-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"c4ai/gap-text2sql","path":"mrat-sql-gap/seq2struct/beam_search.py","file_url":"https://github.com/c4ai/gap-text2sql/blob/HEAD/mrat-sql-gap/seq2struct/beam_search.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":"7be6d4f60f88de6f","code_sha256_prefix":"7be6d4f60f88de6f","mcp_get_code":{"code_sha256":"7be6d4f60f88de6f"}},{"arxiv_id":"2207.00301","arxiv_id_is_arxiv":true,"paper":"/paper/can-we-learn-from-developer-mistakes-learning","title":"Can we learn from developer mistakes? Learning to localize and repair real bugs from real bug fixes","date":"2022-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cedricrupb/nbfbaselines","path":"nbfbaselines/nbfbase.py","file_url":"https://github.com/cedricrupb/nbfbaselines/blob/HEAD/nbfbaselines/nbfbase.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":"3de1111ec7a95d67","code_sha256_prefix":"3de1111ec7a95d67","mcp_get_code":{"code_sha256":"3de1111ec7a95d67"}},{"arxiv_id":"2203.10452","arxiv_id_is_arxiv":true,"paper":"/paper/crossbeam-learning-to-search-in-bottom-up-1","title":"CrossBeam: Learning to Search in Bottom-Up Program Synthesis","date":"2022-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/crossbeam","path":"crossbeam/algorithm/synthesis.py","file_url":"https://github.com/google-research/crossbeam/blob/HEAD/crossbeam/algorithm/synthesis.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d66de1c630616a06","code_sha256_prefix":"d66de1c630616a06","mcp_get_code":{"code_sha256":"d66de1c630616a06"}},{"arxiv_id":"2203.09509","arxiv_id_is_arxiv":true,"paper":"/paper/toxigen-a-large-scale-machine-generated","title":"ToxiGen: A Large-Scale Machine-Generated Dataset for Adversarial and Implicit Hate Speech Detection","date":"2022-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/toxigen","path":"toxigen/alice.py","file_url":"https://github.com/microsoft/toxigen/blob/HEAD/toxigen/alice.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/toxigen (NOASSERTION)","code_sha256":"9211eff610499042","code_sha256_prefix":"9211eff610499042","mcp_get_code":{"code_sha256":"9211eff610499042"}},{"arxiv_id":"2110.15797","arxiv_id_is_arxiv":true,"paper":"/paper/discovering-non-monotonic-autoregressive","title":"Discovering Non-monotonic Autoregressive Orderings with Variational Inference","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuanlinli17/autoregressive_inference","path":"voi/algorithms/beam_search.py","file_url":"https://github.com/xuanlinli17/autoregressive_inference/blob/HEAD/voi/algorithms/beam_search.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":"ec90483fc2b722f6","code_sha256_prefix":"ec90483fc2b722f6","mcp_get_code":{"code_sha256":"ec90483fc2b722f6"}},{"arxiv_id":"2109.03792","arxiv_id_is_arxiv":true,"paper":"/paper/highly-parallel-autoregressive-entity-linking","title":"Highly Parallel Autoregressive Entity Linking with Discriminative Correction","date":"2021-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nicola-decao/efficient-autoregressive-EL","path":"src/beam_search.py","file_url":"https://github.com/nicola-decao/efficient-autoregressive-EL/blob/HEAD/src/beam_search.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":"f8d1fe362ffd1e5e","code_sha256_prefix":"f8d1fe362ffd1e5e","mcp_get_code":{"code_sha256":"f8d1fe362ffd1e5e"}},{"arxiv_id":"2107.05697","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-language-coordination-by-modeling","title":"Few-shot Language Coordination by Modeling Theory of Mind","date":"2021-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CLAW-Lab/ToM","path":"ibr_game/beam_search.py","file_url":"https://github.com/CLAW-Lab/ToM/blob/HEAD/ibr_game/beam_search.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":"aa908768350f33fc","code_sha256_prefix":"aa908768350f33fc","mcp_get_code":{"code_sha256":"aa908768350f33fc"}},{"arxiv_id":"2106.02039","arxiv_id_is_arxiv":true,"paper":"/paper/reinforcement-learning-as-one-big-sequence","title":"Offline Reinforcement Learning as One Big Sequence Modeling Problem","date":"2021-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JannerM/trajectory-transformer","path":"trajectory/search/core.py","file_url":"https://github.com/JannerM/trajectory-transformer/blob/HEAD/trajectory/search/core.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":"c6b3fddb40879156","code_sha256_prefix":"c6b3fddb40879156","mcp_get_code":{"code_sha256":"c6b3fddb40879156"}},{"arxiv_id":"2007.08742","arxiv_id_is_arxiv":true,"paper":"/paper/a-novel-graph-based-multi-modal-fusion-1","title":"A Novel Graph-based Multi-modal Fusion Encoder for Neural Machine Translation","date":"2020-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"middlekisser/GMNMT","path":"model/generator.py","file_url":"https://github.com/middlekisser/GMNMT/blob/HEAD/model/generator.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":"80b47e9d3749347c","code_sha256_prefix":"80b47e9d3749347c","mcp_get_code":{"code_sha256":"80b47e9d3749347c"}},{"arxiv_id":"2007.06943","arxiv_id_is_arxiv":true,"paper":"/paper/modeling-voting-for-system-combination-in","title":"Modeling Voting for System Combination in Machine Translation","date":"2020-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THUNLP-MT/THUMT","path":"thumt/utils/inference.py","file_url":"https://github.com/THUNLP-MT/THUMT/blob/HEAD/thumt/utils/inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5ca040d32880306a","code_sha256_prefix":"5ca040d32880306a","mcp_get_code":{"code_sha256":"5ca040d32880306a"}},{"arxiv_id":"1912.08777","arxiv_id_is_arxiv":true,"paper":"/paper/pegasus-pre-training-with-extracted-gap","title":"PEGASUS: Pre-training with Extracted Gap-sentences for Abstractive Summarization","date":"2019-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/pegasus","path":"pegasus/layers/beam_search.py","file_url":"https://github.com/google-research/pegasus/blob/HEAD/pegasus/layers/beam_search.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":"f57d0063335e8a9b","code_sha256_prefix":"f57d0063335e8a9b","mcp_get_code":{"code_sha256":"f57d0063335e8a9b"}},{"arxiv_id":"1912.08777","arxiv_id_is_arxiv":true,"paper":"/paper/pegasus-pre-training-with-extracted-gap","title":"PEGASUS: Pre-training with Extracted Gap-sentences for Abstractive Summarization","date":"2019-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amiyamandal-dev/pegasus","path":"pegasus/layers/beam_search.py","file_url":"https://github.com/amiyamandal-dev/pegasus/blob/HEAD/pegasus/layers/beam_search.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":"e631e67cdf964175","code_sha256_prefix":"e631e67cdf964175","mcp_get_code":{"code_sha256":"e631e67cdf964175"}},{"arxiv_id":"1911.04942","arxiv_id_is_arxiv":true,"paper":"/paper/rat-sql-relation-aware-schema-encoding-and-1","title":"RAT-SQL: Relation-Aware Schema Encoding and Linking for Text-to-SQL Parsers","date":"2019-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Microsoft/rat-sql","path":"ratsql/beam_search.py","file_url":"https://github.com/Microsoft/rat-sql/blob/HEAD/ratsql/beam_search.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":"3c377f8696988de8","code_sha256_prefix":"3c377f8696988de8","mcp_get_code":{"code_sha256":"3c377f8696988de8"}},{"arxiv_id":"1907.04138","arxiv_id_is_arxiv":true,"paper":"/paper/characterization-of-overlap-in-observational","title":"Characterization of Overlap in Observational Studies","date":"2019-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clinicalml/overlap-code","path":"overrule/BCS/beam_search.py","file_url":"https://github.com/clinicalml/overlap-code/blob/HEAD/overrule/BCS/beam_search.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":"02dc109ffee84309","code_sha256_prefix":"02dc109ffee84309","mcp_get_code":{"code_sha256":"02dc109ffee84309"}},{"arxiv_id":"1904.02632","arxiv_id_is_arxiv":true,"paper":"/paper/a-learned-representation-for-scalable-vector","title":"A Learned Representation for Scalable Vector Graphics","date":"2019-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tensorflow/magenta","path":"magenta/common/beam_search.py","file_url":"https://github.com/tensorflow/magenta/blob/HEAD/magenta/common/beam_search.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":"fc965e87e24dc01d","code_sha256_prefix":"fc965e87e24dc01d","mcp_get_code":{"code_sha256":"fc965e87e24dc01d"}},{"arxiv_id":"1901.04112","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-neural-machine-translation-with","title":"Unsupervised Neural Machine Translation with SMT as Posterior Regularization","date":"2019-01-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Imagist-Shuo/UNMT-SPR","path":"t2tlight/models/beamsearch.py","file_url":"https://github.com/Imagist-Shuo/UNMT-SPR/blob/HEAD/t2tlight/models/beamsearch.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":"922e19f82ba4a0c8","code_sha256_prefix":"922e19f82ba4a0c8","mcp_get_code":{"code_sha256":"922e19f82ba4a0c8"}},{"arxiv_id":"1808.10122","arxiv_id_is_arxiv":true,"paper":"/paper/learning-neural-templates-for-text-generation","title":"Learning Neural Templates for Text Generation","date":"2018-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TobeyYang/S2S_Temp","path":"generate.py","file_url":"https://github.com/TobeyYang/S2S_Temp/blob/HEAD/generate.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":"2b7644a99136563a","code_sha256_prefix":"2b7644a99136563a","mcp_get_code":{"code_sha256":"2b7644a99136563a"}},{"arxiv_id":"1804.09399","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-generative-adversarial-networks","title":"Convolutional Generative Adversarial Networks with Binary Neurons for Polyphonic Music Generation","date":"2018-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucylow/Stochastic_SoundCloud","path":"common/beam_search.py","file_url":"https://github.com/lucylow/Stochastic_SoundCloud/blob/HEAD/common/beam_search.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":"fc965e87e24dc01d","code_sha256_prefix":"fc965e87e24dc01d","mcp_get_code":{"code_sha256":"fc965e87e24dc01d"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"demelin/nematode","path":"codebase/transformer.py","file_url":"https://github.com/demelin/nematode/blob/HEAD/codebase/transformer.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":"67a85dfd520243e6","code_sha256_prefix":"67a85dfd520243e6","mcp_get_code":{"code_sha256":"67a85dfd520243e6"}},{"arxiv_id":"1508.01211","arxiv_id_is_arxiv":true,"paper":"/paper/listen-attend-and-spell","title":"Listen, Attend and Spell","date":"2015-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anjandeepsahni/automatic_speech_recognition","path":"Code/beamsearch.py","file_url":"https://github.com/anjandeepsahni/automatic_speech_recognition/blob/HEAD/Code/beamsearch.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":"515dc628f1216f81","code_sha256_prefix":"515dc628f1216f81","mcp_get_code":{"code_sha256":"515dc628f1216f81"}},{"arxiv_id":"1411.4555","arxiv_id_is_arxiv":true,"paper":"/paper/show-and-tell-a-neural-image-caption","title":"Show and Tell: A Neural Image Caption Generator","date":"2014-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guptakhil12/show-tell","path":"beam_search.py","file_url":"https://github.com/guptakhil12/show-tell/blob/HEAD/beam_search.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":"3b20293ce047ab05","code_sha256_prefix":"3b20293ce047ab05","mcp_get_code":{"code_sha256":"3b20293ce047ab05"}}],"record_sha256":"65b45e08d68f8b56f6edddfee73e45ab65ec08a194ac007b27adbfe21e6d2293","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}