{"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/greedy-decode","entry":"greedy_decode","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":9,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":3,"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":7,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":2,"n_places_pointer_only_link_open":1,"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":1,"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":"2607.21274","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-21274","title":"A Comparative Evaluation of Embeddings and LLMs in a Greek Book Publisher Setting -The CUP Dataset","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"beir-cellar/beir","path":"beir/reranking/models/mono_t5.py","file_url":"https://github.com/beir-cellar/beir/blob/HEAD/beir/reranking/models/mono_t5.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":"d85aa8152436724b","code_sha256_prefix":"d85aa8152436724b","mcp_get_code":{"code_sha256":"d85aa8152436724b"}},{"arxiv_id":"2312.10763","arxiv_id_is_arxiv":true,"paper":"/paper/m3dbench-let-s-instruct-large-models-with","title":"M3DBench: Let's Instruct Large Models with Multi-modal 3D Prompts","date":"2023-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OpenM3D/M3DBench","path":"models/llm_decoder/generation_utils.py","file_url":"https://github.com/OpenM3D/M3DBench/blob/HEAD/models/llm_decoder/generation_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, OpenM3D/M3DBench when it was checked","code_sha256":"775ed3f78bf348a5","code_sha256_prefix":"775ed3f78bf348a5","mcp_get_code":{"code_sha256":"775ed3f78bf348a5"}},{"arxiv_id":"2311.18651","arxiv_id_is_arxiv":true,"paper":"/paper/ll3da-visual-interactive-instruction-tuning","title":"LL3DA: Visual Interactive Instruction Tuning for Omni-3D Understanding, Reasoning, and Planning","date":"2023-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"open3da/ll3da","path":"models/ll3da/generation_utils.py","file_url":"https://github.com/open3da/ll3da/blob/HEAD/models/ll3da/generation_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from OpenM3D/M3DBench, and GitHub detected no licence in that repository when it was checked","code_sha256":"775ed3f78bf348a5","code_sha256_prefix":"775ed3f78bf348a5","mcp_get_code":{"code_sha256":"775ed3f78bf348a5"}},{"arxiv_id":"2305.03010","arxiv_id_is_arxiv":true,"paper":"/paper/sentence-embedding-leaks-more-information","title":"Sentence Embedding Leaks More Information than You Expect: Generative Embedding Inversion Attack to Recover the Whole Sentence","date":"2023-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkust-knowcomp/geia","path":"decode_beam_search.py","file_url":"https://github.com/hkust-knowcomp/geia/blob/HEAD/decode_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":"352397365a26270f","code_sha256_prefix":"352397365a26270f","mcp_get_code":{"code_sha256":"352397365a26270f"}},{"arxiv_id":"2210.04123","arxiv_id_is_arxiv":true,"paper":"/paper/dimes-a-differentiable-meta-solver-for","title":"DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problems","date":"2022-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dimesteam/dimes","path":"MIS/solvers/intel_treesearch/NPHard/gcn/models.py","file_url":"https://github.com/dimesteam/dimes/blob/HEAD/MIS/solvers/intel_treesearch/NPHard/gcn/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4def9750b7938697","code_sha256_prefix":"4def9750b7938697","mcp_get_code":{"code_sha256":"4def9750b7938697"}},{"arxiv_id":"2106.00920","arxiv_id_is_arxiv":true,"paper":"/paper/dialograph-incorporating-interpretable-1","title":"DialoGraph: Incorporating Interpretable Strategy-Graph Networks into Negotiation Dialogues","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rishabhjoshi/DialoGraph_ICLR21","path":"src/bot/bot_models.py","file_url":"https://github.com/rishabhjoshi/DialoGraph_ICLR21/blob/HEAD/src/bot/bot_models.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":"8e2d784cf34c95cd","code_sha256_prefix":"8e2d784cf34c95cd","mcp_get_code":{"code_sha256":"8e2d784cf34c95cd"}},{"arxiv_id":"2104.08663","arxiv_id_is_arxiv":true,"paper":"/paper/beir-a-heterogenous-benchmark-for-zero-shot","title":"BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Models","date":"2021-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UKPLab/beir","path":"beir/reranking/models/mono_t5.py","file_url":"https://github.com/UKPLab/beir/blob/HEAD/beir/reranking/models/mono_t5.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":"d85aa8152436724b","code_sha256_prefix":"d85aa8152436724b","mcp_get_code":{"code_sha256":"d85aa8152436724b"}},{"arxiv_id":"2006.09286","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-computational-power-of-transformers","title":"On the Computational Power of Transformers and its Implications in Sequence Modeling","date":"2020-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"satwik77/Transformer-Computation-Analysis","path":"Transformer/src/components/utils.py","file_url":"https://github.com/satwik77/Transformer-Computation-Analysis/blob/HEAD/Transformer/src/components/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":"5f0fe04ab8eb68da","code_sha256_prefix":"5f0fe04ab8eb68da","mcp_get_code":{"code_sha256":"5f0fe04ab8eb68da"}},{"arxiv_id":"1507.05717","arxiv_id_is_arxiv":true,"paper":"/paper/an-end-to-end-trainable-neural-network-for","title":"An End-to-End Trainable Neural Network for Image-based Sequence Recognition and Its Application to Scene Text Recognition","date":"2015-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GitYCC/crnn-pytorch","path":"src/ctc_decoder.py","file_url":"https://github.com/GitYCC/crnn-pytorch/blob/HEAD/src/ctc_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":"f056f6c91ff28c7e","code_sha256_prefix":"f056f6c91ff28c7e","mcp_get_code":{"code_sha256":"f056f6c91ff28c7e"}}],"record_sha256":"008c63e99c3736205d0d3359cd16036c26c54d40a1df061cb97a138515294292","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}