{"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/update-model","entry":"update_model","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":2,"n_papers_ran_no_instrument_failure":2,"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":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":3,"n_places_pointer_only_link_open":1,"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":1,"unverified":6},"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":"2604.01173","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-01173","title":"Safe learning-based control via function-based uncertainty quantification","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"tokmaka1/CDC-2026","path":"safe_BO.py","file_url":"https://github.com/tokmaka1/CDC-2026/blob/HEAD/safe_BO.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, tokmaka1/CDC-2026 when it was checked","code_sha256":"de9f735f773a7c0c","code_sha256_prefix":"de9f735f773a7c0c","mcp_get_code":{"code_sha256":"de9f735f773a7c0c"}},{"arxiv_id":"2309.01624","arxiv_id_is_arxiv":true,"paper":"/paper/agg-net-attention-guided-gated-convolutional","title":"AGG-Net: Attention Guided Gated-convolutional Network for Depth Image Completion","date":"2023-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"htx0601/AGG-Net","path":"utils.py","file_url":"https://github.com/htx0601/AGG-Net/blob/HEAD/utils.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, htx0601/AGG-Net when it was checked","code_sha256":"885f7d8c5df224ca","code_sha256_prefix":"885f7d8c5df224ca","mcp_get_code":{"code_sha256":"885f7d8c5df224ca"}},{"arxiv_id":"2212.02098","arxiv_id_is_arxiv":true,"paper":"/paper/a-machine-with-short-term-episodic-and","title":"A Machine with Short-Term, Episodic, and Semantic Memory Systems","date":"2022-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"humemai/agent-room-env-v1","path":"agent/dqn/utils.py","file_url":"https://github.com/humemai/agent-room-env-v1/blob/HEAD/agent/dqn/utils.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":"83251feeaee5549b","code_sha256_prefix":"83251feeaee5549b","mcp_get_code":{"code_sha256":"83251feeaee5549b"}},{"arxiv_id":"2212.02098","arxiv_id_is_arxiv":true,"paper":"/paper/a-machine-with-short-term-episodic-and","title":"A Machine with Short-Term, Episodic, and Semantic Memory Systems","date":"2022-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"humemai/agent-room-env-v1","path":"agent/ppo/utils.py","file_url":"https://github.com/humemai/agent-room-env-v1/blob/HEAD/agent/ppo/utils.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":"f152566ebadd51ec","code_sha256_prefix":"f152566ebadd51ec","mcp_get_code":{"code_sha256":"f152566ebadd51ec"}},{"arxiv_id":"2107.03356","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-matrix-free-approximations-of","title":"M-FAC: Efficient Matrix-Free Approximations of Second-Order Information","date":"2021-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ist-daslab/efcp","path":"optimizers/dense/MFAC.py","file_url":"https://github.com/ist-daslab/efcp/blob/HEAD/optimizers/dense/MFAC.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":"c2dc9537f5e560fa","code_sha256_prefix":"c2dc9537f5e560fa","mcp_get_code":{"code_sha256":"c2dc9537f5e560fa"}},{"arxiv_id":"2105.06337","arxiv_id_is_arxiv":true,"paper":"/paper/grad-tts-a-diffusion-probabilistic-model-for","title":"Grad-TTS: A Diffusion Probabilistic Model for Text-to-Speech","date":"2021-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WelkinYang/GradTTS","path":"waveglow/convert_model.py","file_url":"https://github.com/WelkinYang/GradTTS/blob/HEAD/waveglow/convert_model.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":"22c86725da4140b0","code_sha256_prefix":"22c86725da4140b0","mcp_get_code":{"code_sha256":"22c86725da4140b0"}},{"arxiv_id":"2007.08854","arxiv_id_is_arxiv":true,"paper":"/paper/dvi-depth-guided-video-inpainting-for","title":"DVI: Depth Guided Video Inpainting for Autonomous Driving","date":"2020-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ApolloScapeAuto/dataset-api","path":"stereo/finetune.py","file_url":"https://github.com/ApolloScapeAuto/dataset-api/blob/HEAD/stereo/finetune.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from htx0601/AGG-Net, and GitHub detected no licence in that repository when it was checked","code_sha256":"885f7d8c5df224ca","code_sha256_prefix":"885f7d8c5df224ca","mcp_get_code":{"code_sha256":"885f7d8c5df224ca"}},{"arxiv_id":"1811.00002","arxiv_id_is_arxiv":true,"paper":"/paper/waveglow-a-flow-based-generative-network-for","title":"WaveGlow: A Flow-based Generative Network for Speech Synthesis","date":"2018-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVIDIA/waveglow","path":"convert_model.py","file_url":"https://github.com/NVIDIA/waveglow/blob/HEAD/convert_model.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":"a9d6d7e0a940e260","code_sha256_prefix":"a9d6d7e0a940e260","mcp_get_code":{"code_sha256":"a9d6d7e0a940e260"}}],"record_sha256":"25ea86baeecdfdf41aa0d3ca89370a729d5d8405bc704802095bb63c0cb47e77","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}