{"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/create-config","entry":"create_config","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":11,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":3,"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":10,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":2,"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":2,"ran_fixture":0,"ran":3,"unverified":5},"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":"2606.13818","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-13818","title":"PAC-Chernoff Bounds: Understanding Generalization in the Interpolation Regime","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"PGM-Lab/2022-AISTATS-diversity","path":"uncertainty_baselines/models/bert.py","file_url":"https://github.com/PGM-Lab/2022-AISTATS-diversity/blob/HEAD/uncertainty_baselines/models/bert.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"295ee5b09ae2c97c","code_sha256_prefix":"295ee5b09ae2c97c","mcp_get_code":{"code_sha256":"295ee5b09ae2c97c"}},{"arxiv_id":"2601.12055","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-12055","title":"Automating Parameter Selection in Deep Image Prior for Fluorescence Microscopy Image Denoising via Similarity-Based Parameter Transfer","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"IPMI-ICNS-UKE/AUTO-DIP","path":"data_loaders/create_configs_fmd.py","file_url":"https://github.com/IPMI-ICNS-UKE/AUTO-DIP/blob/HEAD/data_loaders/create_configs_fmd.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":"593b5a6395d8d993","code_sha256_prefix":"593b5a6395d8d993","mcp_get_code":{"code_sha256":"593b5a6395d8d993"}},{"arxiv_id":"2506.12687","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2506.12687","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"Yuzt-zju/CoCorrRec","path":"module/config.py","file_url":"https://github.com/Yuzt-zju/CoCorrRec/blob/HEAD/module/config.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"61476ed48967cec6","code_sha256_prefix":"61476ed48967cec6","mcp_get_code":{"code_sha256":"61476ed48967cec6"}},{"arxiv_id":"2406.03946","arxiv_id_is_arxiv":true,"paper":"/paper/a-probabilistic-approach-to-learning-the","title":"A Probabilistic Approach to Learning the Degree of Equivariance in Steerable CNNs","date":"2024-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"QUVA-Lab/partial-escnn","path":"experiments/eval_model.py","file_url":"https://github.com/QUVA-Lab/partial-escnn/blob/HEAD/experiments/eval_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause-Clear","inline_ok":false,"inline_ok_link":false,"withheld_clause":"BSD-3-Clause-Clear, as GitHub detects it on this paper's repository, QUVA-Lab/partial-escnn, is not in the permissive set Syntology serves inline","code_sha256":"c660e35bb41e7b32","code_sha256_prefix":"c660e35bb41e7b32","mcp_get_code":{"code_sha256":"c660e35bb41e7b32"}},{"arxiv_id":"2310.04678","arxiv_id_is_arxiv":true,"paper":"/paper/doris-mae-scientific-document-retrieval-using","title":"DORIS-MAE: Scientific Document Retrieval using Multi-level Aspect-based Queries","date":"2023-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Real-Doris-Mae/Doris-Mae-Dataset","path":"benchmarking/config.py","file_url":"https://github.com/Real-Doris-Mae/Doris-Mae-Dataset/blob/HEAD/benchmarking/config.py","status":"ran","verification_level":1,"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, Real-Doris-Mae/Doris-Mae-Dataset (NOASSERTION)","code_sha256":"29ff7e283ebb4d2f","code_sha256_prefix":"29ff7e283ebb4d2f","mcp_get_code":{"code_sha256":"29ff7e283ebb4d2f"}},{"arxiv_id":"2307.16177","arxiv_id_is_arxiv":true,"paper":"/paper/fusing-vhr-post-disaster-aerial-imagery-and","title":"Fusing VHR Post-disaster Aerial Imagery and LiDAR Data for Roof Classification in the Caribbean","date":"2023-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GFDRR/caribbean-rooftop-classification","path":"utils/config.py","file_url":"https://github.com/GFDRR/caribbean-rooftop-classification/blob/HEAD/utils/config.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":"53d45e52e02599a7","code_sha256_prefix":"53d45e52e02599a7","mcp_get_code":{"code_sha256":"53d45e52e02599a7"}},{"arxiv_id":"2301.11558","arxiv_id_is_arxiv":true,"paper":"/paper/accelerating-guided-diffusion-sampling-with","title":"Accelerating Guided Diffusion Sampling with Splitting Numerical Methods","date":"2023-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"swizad/split-diffusion","path":"config.py","file_url":"https://github.com/swizad/split-diffusion/blob/HEAD/config.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3b0e100c928e4d3f","code_sha256_prefix":"3b0e100c928e4d3f","mcp_get_code":{"code_sha256":"3b0e100c928e4d3f"}},{"arxiv_id":"2106.04015","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-baselines-benchmarks-for","title":"Uncertainty Baselines: Benchmarks for Uncertainty & Robustness in Deep Learning","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thlarsen13/thlarsen_uncertainty_models","path":"uncertainty_baselines/models/bert.py","file_url":"https://github.com/thlarsen13/thlarsen_uncertainty_models/blob/HEAD/uncertainty_baselines/models/bert.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"295ee5b09ae2c97c","code_sha256_prefix":"295ee5b09ae2c97c","mcp_get_code":{"code_sha256":"295ee5b09ae2c97c"}},{"arxiv_id":"2003.13830","arxiv_id_is_arxiv":true,"paper":"/paper/sign-language-transformers-joint-end-to-end","title":"Sign Language Transformers: Joint End-to-end Sign Language Recognition and Translation","date":"2020-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OvrK12/slt","path":"configs/generate_config.py","file_url":"https://github.com/OvrK12/slt/blob/HEAD/configs/generate_config.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":"e6f5331cdef4924c","code_sha256_prefix":"e6f5331cdef4924c","mcp_get_code":{"code_sha256":"e6f5331cdef4924c"}},{"arxiv_id":"1902.06704","arxiv_id_is_arxiv":true,"paper":"/paper/towards-non-saturating-recurrent-units-for","title":"Towards Non-saturating Recurrent Units for Modelling Long-term Dependencies","date":"2019-01-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apsarath/NRU","path":"nru_project/utils/utils.py","file_url":"https://github.com/apsarath/NRU/blob/HEAD/nru_project/utils/utils.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":"33a1f20d474facef","code_sha256_prefix":"33a1f20d474facef","mcp_get_code":{"code_sha256":"33a1f20d474facef"}},{"arxiv_id":"aaai_5479","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_5479","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"thunlp/QAjudge","path":"config_parser/parser.py","file_url":"https://github.com/thunlp/QAjudge/blob/HEAD/config_parser/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":"313ff292e85c84e9","code_sha256_prefix":"313ff292e85c84e9","mcp_get_code":{"code_sha256":"313ff292e85c84e9"}}],"record_sha256":"b3ad562c921de176cd2361abdcbd298caf54d5c2daeaecb703e4f27406188531","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}