{"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/coverage","entry":"coverage","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":7,"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":7,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":7,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"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":"2605.12208","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-12208","title":"Self-Supervised Laplace Approximation for Bayesian Uncertainty Quantification","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"rodemann/ssla","path":"src/utils.py","file_url":"https://github.com/rodemann/ssla/blob/HEAD/src/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, rodemann/ssla when it was checked","code_sha256":"9453837b3140e8b3","code_sha256_prefix":"9453837b3140e8b3","mcp_get_code":{"code_sha256":"9453837b3140e8b3"}},{"arxiv_id":"2312.12450","arxiv_id_is_arxiv":true,"paper":"/paper/can-it-edit-evaluating-the-ability-of-large","title":"Can It Edit? Evaluating the Ability of Large Language Models to Follow Code Editing Instructions","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nuprl/canitedit","path":"benchmark/evaluator_overlay.py","file_url":"https://github.com/nuprl/canitedit/blob/HEAD/benchmark/evaluator_overlay.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, nuprl/canitedit (NOASSERTION)","code_sha256":"e627f4b3cdef11ff","code_sha256_prefix":"e627f4b3cdef11ff","mcp_get_code":{"code_sha256":"e627f4b3cdef11ff"}},{"arxiv_id":"2203.11364","arxiv_id_is_arxiv":true,"paper":"/paper/an-information-theoretic-approach-to-prompt-1","title":"An Information-theoretic Approach to Prompt Engineering Without Ground Truth Labels","date":"2022-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BYU-PCCL/information-theoretic-prompts","path":"postprocessor.py","file_url":"https://github.com/BYU-PCCL/information-theoretic-prompts/blob/HEAD/postprocessor.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cf113e434acb350f","code_sha256_prefix":"cf113e434acb350f","mcp_get_code":{"code_sha256":"cf113e434acb350f"}},{"arxiv_id":"2103.05354","arxiv_id_is_arxiv":true,"paper":"/paper/selective-and-features-based-adversarial","title":"Revisiting Model's Uncertainty and Confidences for Adversarial Example Detection","date":"2021-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aldahdooh/SFAD","path":"test_defense_mnist_model_v7.py","file_url":"https://github.com/aldahdooh/SFAD/blob/HEAD/test_defense_mnist_model_v7.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, aldahdooh/SFAD, is not in the permissive set Syntology serves inline","code_sha256":"ba877915c3085301","code_sha256_prefix":"ba877915c3085301","mcp_get_code":{"code_sha256":"ba877915c3085301"}},{"arxiv_id":"2004.00445","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-cluster-faces-via-confidence-and","title":"Learning to Cluster Faces via Confidence and Connectivity Estimation","date":"2020-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yl-1993/learn-to-cluster","path":"proposals/stat_cluster.py","file_url":"https://github.com/yl-1993/learn-to-cluster/blob/HEAD/proposals/stat_cluster.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":"f011ce5a79dd2638","code_sha256_prefix":"f011ce5a79dd2638","mcp_get_code":{"code_sha256":"f011ce5a79dd2638"}},{"arxiv_id":"1909.12201","arxiv_id_is_arxiv":true,"paper":"/paper/overlapping-community-detection-with-graph-1","title":"Overlapping Community Detection with Graph Neural Networks","date":"2019-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shchur/overlapping-community-detection","path":"nocd/metrics/unsupervised.py","file_url":"https://github.com/shchur/overlapping-community-detection/blob/HEAD/nocd/metrics/unsupervised.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":"1a89f3b438368b8c","code_sha256_prefix":"1a89f3b438368b8c","mcp_get_code":{"code_sha256":"1a89f3b438368b8c"}},{"arxiv_id":"2020.acl-main.514","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2020.acl-main.514","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"bfelbo/DeepMoji","path":"deepmoji/sentence_tokenizer.py","file_url":"https://github.com/bfelbo/DeepMoji/blob/HEAD/deepmoji/sentence_tokenizer.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":"c27bf850a8813db6","code_sha256_prefix":"c27bf850a8813db6","mcp_get_code":{"code_sha256":"c27bf850a8813db6"}}],"record_sha256":"a61127eb8251374cac0269b15e150e04906cc0bd66180307654b37c29e7c7c4f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}