{"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","entry":"Beam","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":8,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":0,"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":8,"n_samples_ran":6,"n_samples_constructed":6,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":5,"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":0,"ran":6,"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":"2203.03850","arxiv_id_is_arxiv":true,"paper":"/paper/unixcoder-unified-cross-modal-pre-training","title":"UniXcoder: Unified Cross-Modal Pre-training for Code Representation","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/CodeBERT","path":"UniXcoder/unixcoder.py","file_url":"https://github.com/microsoft/CodeBERT/blob/HEAD/UniXcoder/unixcoder.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":"2af39b0537b177ac","code_sha256_prefix":"2af39b0537b177ac","mcp_get_code":{"code_sha256":"2af39b0537b177ac"}},{"arxiv_id":"2106.15135","arxiv_id_is_arxiv":true,"paper":"/paper/twag-a-topic-guided-wikipedia-abstract","title":"TWAG: A Topic-Guided Wikipedia Abstract Generator","date":"2021-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THU-KEG/TWAG","path":"src/c_generate_soft/model.py","file_url":"https://github.com/THU-KEG/TWAG/blob/HEAD/src/c_generate_soft/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, THU-KEG/TWAG when it was checked","code_sha256":"1aaafb7fbdb31aba","code_sha256_prefix":"1aaafb7fbdb31aba","mcp_get_code":{"code_sha256":"1aaafb7fbdb31aba"}},{"arxiv_id":"2105.11269","arxiv_id_is_arxiv":true,"paper":"/paper/neural-machine-translation-with-monolingual","title":"Neural Machine Translation with Monolingual Translation Memory","date":"2021-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jcyk/copyisallyouneed","path":"generator.py","file_url":"https://github.com/jcyk/copyisallyouneed/blob/HEAD/generator.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, jcyk/copyisallyouneed when it was checked","code_sha256":"3f5788b4374477b9","code_sha256_prefix":"3f5788b4374477b9","mcp_get_code":{"code_sha256":"3f5788b4374477b9"}},{"arxiv_id":"2004.05572","arxiv_id_is_arxiv":true,"paper":"/paper/amr-parsing-via-graph-sequence-iterative","title":"AMR Parsing via Graph-Sequence Iterative Inference","date":"2020-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bjascob/amrlib","path":"amrlib/models/parse_gsii/modules/parser.py","file_url":"https://github.com/bjascob/amrlib/blob/HEAD/amrlib/models/parse_gsii/modules/parser.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":"9422195a9817c9f0","code_sha256_prefix":"9422195a9817c9f0","mcp_get_code":{"code_sha256":"9422195a9817c9f0"}},{"arxiv_id":"2002.08155","arxiv_id_is_arxiv":true,"paper":"/paper/codebert-a-pre-trained-model-for-programming","title":"CodeBERT: A Pre-Trained Model for Programming and Natural Languages","date":"2020-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zfj1998/CodeBert-Code2Text","path":"code/model.py","file_url":"https://github.com/zfj1998/CodeBert-Code2Text/blob/HEAD/code/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, zfj1998/CodeBert-Code2Text when it was checked","code_sha256":"fe20afbd1ed12d33","code_sha256_prefix":"fe20afbd1ed12d33","mcp_get_code":{"code_sha256":"fe20afbd1ed12d33"}},{"arxiv_id":"2002.03912","arxiv_id_is_arxiv":true,"paper":"/paper/a-probabilistic-formulation-of-unsupervised-1","title":"A Probabilistic Formulation of Unsupervised Text Style Transfer","date":"2020-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cindyxinyiwang/TextStyleTransfer","path":"src/transformer.py","file_url":"https://github.com/cindyxinyiwang/TextStyleTransfer/blob/HEAD/src/transformer.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, cindyxinyiwang/TextStyleTransfer when it was checked","code_sha256":"2a0fe14622f8497d","code_sha256_prefix":"2a0fe14622f8497d","mcp_get_code":{"code_sha256":"2a0fe14622f8497d"}},{"arxiv_id":"1704.04368","arxiv_id_is_arxiv":true,"paper":"/paper/get-to-the-point-summarization-with-pointer","title":"Get To The Point: Summarization with Pointer-Generator Networks","date":"2017-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zide05/pointer-gen-fastnlp","path":"model/model.py","file_url":"https://github.com/zide05/pointer-gen-fastnlp/blob/HEAD/model/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, zide05/pointer-gen-fastnlp when it was checked","code_sha256":"d0573c4de7b89c13","code_sha256_prefix":"d0573c4de7b89c13","mcp_get_code":{"code_sha256":"d0573c4de7b89c13"}},{"arxiv_id":"1609.07843","arxiv_id_is_arxiv":true,"paper":"/paper/pointer-sentinel-mixture-models","title":"Pointer Sentinel Mixture Models","date":"2016-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"emanjavacas/pie","path":"pie/models/decoder.py","file_url":"https://github.com/emanjavacas/pie/blob/HEAD/pie/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":"53b424349970dcd4","code_sha256_prefix":"53b424349970dcd4","mcp_get_code":{"code_sha256":"53b424349970dcd4"}}],"record_sha256":"08300eabd6215faa630f79e80291804c3cc3500d2e8e23ba1a2bbd5c9ef62928","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}