{"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/to-variable","entry":"to_variable","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":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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":6,"n_places_pointer_only":0,"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":1,"ran_fixture":0,"ran":3,"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":"2404.13153","arxiv_id_is_arxiv":true,"paper":"/paper/motion-adaptive-separable-collaborative","title":"Motion-adaptive Separable Collaborative Filters for Blind Motion Deblurring","date":"2024-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChengxuLiu/MISCFilter","path":"models/utility.py","file_url":"https://github.com/ChengxuLiu/MISCFilter/blob/HEAD/models/utility.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"989c91edb537cd8f","code_sha256_prefix":"989c91edb537cd8f","mcp_get_code":{"code_sha256":"989c91edb537cd8f"}},{"arxiv_id":"2008.02627","arxiv_id_is_arxiv":true,"paper":"/paper/notes-on-the-behavior-of-mc-dropout","title":"Notes on the Behavior of MC Dropout","date":"2020-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aalto-intelligent-robotics/mc-dropout-notebooks","path":"nets.py","file_url":"https://github.com/aalto-intelligent-robotics/mc-dropout-notebooks/blob/HEAD/nets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cf417f6499909dfa","code_sha256_prefix":"cf417f6499909dfa","mcp_get_code":{"code_sha256":"cf417f6499909dfa"}},{"arxiv_id":"2006.08437","arxiv_id_is_arxiv":true,"paper":"/paper/depth-uncertainty-in-neural-networks","title":"Depth Uncertainty in Neural Networks","date":"2020-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cambridge-mlg/DUN","path":"src/utils.py","file_url":"https://github.com/cambridge-mlg/DUN/blob/HEAD/src/utils.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":"8a157fc7489ab5e4","code_sha256_prefix":"8a157fc7489ab5e4","mcp_get_code":{"code_sha256":"8a157fc7489ab5e4"}},{"arxiv_id":"1908.04781","arxiv_id_is_arxiv":true,"paper":"/paper/predicting-3d-human-dynamics-from-video","title":"Predicting 3D Human Dynamics from Video","date":"2019-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jasonyzhang/phd","path":"src/renderer.py","file_url":"https://github.com/jasonyzhang/phd/blob/HEAD/src/renderer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2e0b2d1dc17197f6","code_sha256_prefix":"2e0b2d1dc17197f6","mcp_get_code":{"code_sha256":"2e0b2d1dc17197f6"}},{"arxiv_id":"1907.10244","arxiv_id_is_arxiv":true,"paper":"/paper/learning-spatial-transform-for-video-frame","title":"AdaCoF: Adaptive Collaboration of Flows for Video Frame Interpolation","date":"2019-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HyeongminLEE/AdaCoF-pytorch","path":"interpolate_twoframe.py","file_url":"https://github.com/HyeongminLEE/AdaCoF-pytorch/blob/HEAD/interpolate_twoframe.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"989c91edb537cd8f","code_sha256_prefix":"989c91edb537cd8f","mcp_get_code":{"code_sha256":"989c91edb537cd8f"}},{"arxiv_id":"1905.13613","arxiv_id_is_arxiv":true,"paper":"/paper/subspace-networks-for-few-shot-classification","title":"Regression Networks for Meta-Learning Few-Shot Classification","date":"2019-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ArnoutDevos/RegressionNet","path":"methods/r2d2.py","file_url":"https://github.com/ArnoutDevos/RegressionNet/blob/HEAD/methods/r2d2.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"989c91edb537cd8f","code_sha256_prefix":"989c91edb537cd8f","mcp_get_code":{"code_sha256":"989c91edb537cd8f"}}],"record_sha256":"980fa175765648dd7fa38de35ad57d5d4e8017a4c775a5de5f67e90d9fe68711","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}