{"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/check-type","entry":"check_type","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":6,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":6,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":1,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":1},"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":"2302.07253","arxiv_id_is_arxiv":true,"paper":"/paper/energy-transformer","title":"Energy Transformer","date":"2023-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lemon-cmd/energy-transformer-graph","path":"src/model/et.py","file_url":"https://github.com/Lemon-cmd/energy-transformer-graph/blob/HEAD/src/model/et.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9f8fb6db436eff3e","code_sha256_prefix":"9f8fb6db436eff3e","mcp_get_code":{"code_sha256":"9f8fb6db436eff3e"}},{"arxiv_id":"2212.03411","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-nadaraya-watson-head-can-offer","title":"A Flexible Nadaraya-Watson Head Can Offer Explainable and Calibrated Classification","date":"2022-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alanqrwang/nwhead","path":"util/metric.py","file_url":"https://github.com/alanqrwang/nwhead/blob/HEAD/util/metric.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, alanqrwang/nwhead when it was checked","code_sha256":"2ded8f5408a0985d","code_sha256_prefix":"2ded8f5408a0985d","mcp_get_code":{"code_sha256":"2ded8f5408a0985d"}},{"arxiv_id":"2203.01825","arxiv_id_is_arxiv":true,"paper":"/paper/what-makes-transfer-learning-work-for-medical","title":"What Makes Transfer Learning Work For Medical Images: Feature Reuse & Other Factors","date":"2022-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChrisMats/feature-reuse","path":"ablations/layer_importance/trainer.py","file_url":"https://github.com/ChrisMats/feature-reuse/blob/HEAD/ablations/layer_importance/trainer.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":"7938be06505212fe","code_sha256_prefix":"7938be06505212fe","mcp_get_code":{"code_sha256":"7938be06505212fe"}},{"arxiv_id":"2110.00810","arxiv_id_is_arxiv":true,"paper":"/paper/punzi-loss-a-non-differentiable-metric","title":"Punzi-loss: A non-differentiable metric approximation for sensitivity optimisation in the search for new particles","date":null,"month_inferred_from_arxiv_id":"2021-10","title_source":"archive","repo":"feichtip/punzinet","path":"src/punzinet/fom.py","file_url":"https://github.com/feichtip/punzinet/blob/HEAD/src/punzinet/fom.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":"4b0ea1c0693e9e94","code_sha256_prefix":"4b0ea1c0693e9e94","mcp_get_code":{"code_sha256":"4b0ea1c0693e9e94"}},{"arxiv_id":"2108.13643","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-synthesize-programs-as","title":"Learning to Synthesize Programs as Interpretable and Generalizable Policies","date":"2021-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clvrai/leaps","path":"pretrain/models.py","file_url":"https://github.com/clvrai/leaps/blob/HEAD/pretrain/models.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":"5e9899cd4f3029e3","code_sha256_prefix":"5e9899cd4f3029e3","mcp_get_code":{"code_sha256":"5e9899cd4f3029e3"}},{"arxiv_id":"1811.03604","arxiv_id_is_arxiv":true,"paper":"/paper/federated-learning-for-mobile-keyboard","title":"Federated Learning for Mobile Keyboard Prediction","date":"2018-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gregor160300/federated","path":"tensorflow_federated/python/common_libs/py_typecheck.py","file_url":"https://github.com/gregor160300/federated/blob/HEAD/tensorflow_federated/python/common_libs/py_typecheck.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":"32a9add4ffaaa75e","code_sha256_prefix":"32a9add4ffaaa75e","mcp_get_code":{"code_sha256":"32a9add4ffaaa75e"}}],"record_sha256":"faadf81e04dd045707b034d4c40f87b117f2a1d834175101ff3c5a874df7001b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}