{"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/find-index","entry":"find_index","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":8,"n_papers_ran_no_instrument_failure":7,"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":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":8,"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":0,"ran_fixture":1,"ran":7,"unverified":0},"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.21089","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-21089","title":"An efficient, accurate, and interpretable machine learning method for computing probability of failure","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"jacobz0106/classificationGE","path":"POFdarts.py","file_url":"https://github.com/jacobz0106/classificationGE/blob/HEAD/POFdarts.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jacobz0106/classificationGE when it was checked","code_sha256":"874ece62881b0d91","code_sha256_prefix":"874ece62881b0d91","mcp_get_code":{"code_sha256":"874ece62881b0d91"}},{"arxiv_id":"2310.09672","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2310.09672","date":null,"month_inferred_from_arxiv_id":"2023-10","title_source":null,"repo":"LuChang-CS/semi-structured-icd-coding","path":"segment.py","file_url":"https://github.com/LuChang-CS/semi-structured-icd-coding/blob/HEAD/segment.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, LuChang-CS/semi-structured-icd-coding when it was checked","code_sha256":"8917547cd2d87fb0","code_sha256_prefix":"8917547cd2d87fb0","mcp_get_code":{"code_sha256":"8917547cd2d87fb0"}},{"arxiv_id":"2301.00704","arxiv_id_is_arxiv":true,"paper":"/paper/muse-text-to-image-generation-via-masked","title":"Muse: Text-To-Image Generation via Masked Generative Transformers","date":"2023-01-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/muse-pytorch","path":"muse_maskgit_pytorch/trainers.py","file_url":"https://github.com/lucidrains/muse-pytorch/blob/HEAD/muse_maskgit_pytorch/trainers.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":"3474c6be94998255","code_sha256_prefix":"3474c6be94998255","mcp_get_code":{"code_sha256":"3474c6be94998255"}},{"arxiv_id":"2212.10097","arxiv_id_is_arxiv":true,"paper":"/paper/toward-a-unified-framework-for-unsupervised","title":"Optimization Techniques for Unsupervised Complex Table Reasoning via Self-Training Framework","date":"2022-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leezythu/uctr","path":"FEVEROUS/fill_in_template.py","file_url":"https://github.com/leezythu/uctr/blob/HEAD/FEVEROUS/fill_in_template.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":"534cdb9a35bb5f05","code_sha256_prefix":"534cdb9a35bb5f05","mcp_get_code":{"code_sha256":"534cdb9a35bb5f05"}},{"arxiv_id":"2105.15033","arxiv_id_is_arxiv":true,"paper":"/paper/diakg-an-annotated-diabetes-dataset-for","title":"DiaKG: an Annotated Diabetes Dataset for Medical Knowledge Graph Construction","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"changdejie/diaKG-code","path":"RE/initial.py","file_url":"https://github.com/changdejie/diaKG-code/blob/HEAD/RE/initial.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3e317efbb7931165","code_sha256_prefix":"3e317efbb7931165","mcp_get_code":{"code_sha256":"3e317efbb7931165"}},{"arxiv_id":"2104.07908","arxiv_id_is_arxiv":true,"paper":"/paper/metaxl-meta-representation-transformation-for","title":"MetaXL: Meta Representation Transformation for Low-resource Cross-lingual Learning","date":"2021-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liatb282/metaxlr","path":"utils.py","file_url":"https://github.com/liatb282/metaxlr/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, liatb282/metaxlr, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"b00098ec748c4d57","code_sha256_prefix":"b00098ec748c4d57","mcp_get_code":{"code_sha256":"b00098ec748c4d57"}},{"arxiv_id":"2009.08107","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-unsupervised-continual-learning","title":"Few-Shot Unsupervised Continual Learning through Meta-Examples","date":"2020-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alessiabertugli/FUSION","path":"model/meta_learner.py","file_url":"https://github.com/alessiabertugli/FUSION/blob/HEAD/model/meta_learner.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9573e1d8cdd1e4b8","code_sha256_prefix":"9573e1d8cdd1e4b8","mcp_get_code":{"code_sha256":"9573e1d8cdd1e4b8"}},{"arxiv_id":"1607.04606","arxiv_id_is_arxiv":true,"paper":"/paper/enriching-word-vectors-with-subword","title":"Enriching Word Vectors with Subword Information","date":"2016-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ulf1/augtxt","path":"augtxt/keyboard_layouts.py","file_url":"https://github.com/ulf1/augtxt/blob/HEAD/augtxt/keyboard_layouts.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":"8742e7667cc1dafa","code_sha256_prefix":"8742e7667cc1dafa","mcp_get_code":{"code_sha256":"8742e7667cc1dafa"}}],"record_sha256":"000129e5587dea8c89c89c40c57f7656947e873202d7a80e52aed4a773e85ee0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}