{"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/scm","entry":"SCM","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":8,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":3,"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":8,"n_samples_ran":3,"n_samples_constructed":2,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":4,"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":0,"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.14892","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-14892","title":"Relational Structural Causal Models","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"CausalAILab/RelationalCausalModels","path":"NCMCounterfactuals/src/scm/rscm.py","file_url":"https://github.com/CausalAILab/RelationalCausalModels/blob/HEAD/NCMCounterfactuals/src/scm/rscm.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, CausalAILab/RelationalCausalModels when it was checked","code_sha256":"921c1cbfb7221616","code_sha256_prefix":"921c1cbfb7221616","mcp_get_code":{"code_sha256":"921c1cbfb7221616"}},{"arxiv_id":"2601.06909","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-06909","title":"UDPNet: Unleashing Depth-based Priors for Robust Image Dehazing","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Harbinzzy/UDPNet","path":"Dehazing/ITS/models/ConvIR_UDPNet.py","file_url":"https://github.com/Harbinzzy/UDPNet/blob/HEAD/Dehazing/ITS/models/ConvIR_UDPNet.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":"fca030b4641fcd24","code_sha256_prefix":"fca030b4641fcd24","mcp_get_code":{"code_sha256":"fca030b4641fcd24"}},{"arxiv_id":"2405.05663","arxiv_id_is_arxiv":true,"paper":"/paper/rpbg-towards-robust-neural-point-based","title":"RPBG: Towards Robust Neural Point-based Graphics in the Wild","date":"2024-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"QT-Zhu/RPBG","path":"RPBG/models/mimounet.py","file_url":"https://github.com/QT-Zhu/RPBG/blob/HEAD/RPBG/models/mimounet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2b1106c990cc59b9","code_sha256_prefix":"2b1106c990cc59b9","mcp_get_code":{"code_sha256":"2b1106c990cc59b9"}},{"arxiv_id":"2306.03929","arxiv_id_is_arxiv":true,"paper":"/paper/finding-counterfactually-optimal-action","title":"Finding Counterfactually Optimal Action Sequences in Continuous State Spaces","date":"2023-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"networks-learning/counterfactual-continuous-mdp","path":"src/mimic_mdp.py","file_url":"https://github.com/networks-learning/counterfactual-continuous-mdp/blob/HEAD/src/mimic_mdp.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, networks-learning/counterfactual-continuous-mdp when it was checked","code_sha256":"21b964db8b70436e","code_sha256_prefix":"21b964db8b70436e","mcp_get_code":{"code_sha256":"21b964db8b70436e"}},{"arxiv_id":"2303.11011","arxiv_id_is_arxiv":true,"paper":"/paper/learning-optical-flow-from-event-camera-with","title":"Learning Optical Flow from Event Camera with Rendered Dataset","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"boomluo02/ADMFlow","path":"model/adm.py","file_url":"https://github.com/boomluo02/ADMFlow/blob/HEAD/model/adm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, boomluo02/ADMFlow when it was checked","code_sha256":"79c36765ac408a0b","code_sha256_prefix":"79c36765ac408a0b","mcp_get_code":{"code_sha256":"79c36765ac408a0b"}},{"arxiv_id":"2301.08249","arxiv_id_is_arxiv":true,"paper":"/paper/causal-conditional-hidden-markov-model-for","title":"Causal conditional hidden Markov model for multimodal traffic prediction","date":"2023-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EternityZY/CCHMM","path":"models/CausalHMM.py","file_url":"https://github.com/EternityZY/CCHMM/blob/HEAD/models/CausalHMM.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":"90f0422e78153086","code_sha256_prefix":"90f0422e78153086","mcp_get_code":{"code_sha256":"90f0422e78153086"}},{"arxiv_id":"2207.10447","arxiv_id_is_arxiv":true,"paper":"/paper/weakly-supervised-object-localization-via","title":"Weakly Supervised Object Localization via Transformer with Implicit Spatial Calibration","date":"2022-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"164140757/SCM","path":"lib/models/deit.py","file_url":"https://github.com/164140757/SCM/blob/HEAD/lib/models/deit.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":"c2d706c181c15ef2","code_sha256_prefix":"c2d706c181c15ef2","mcp_get_code":{"code_sha256":"c2d706c181c15ef2"}},{"arxiv_id":"2108.05054","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-coarse-to-fine-approach-in-single","title":"Rethinking Coarse-to-Fine Approach in Single Image Deblurring","date":"2021-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chosj95/mimo-unet","path":"models/MIMOUNet.py","file_url":"https://github.com/chosj95/mimo-unet/blob/HEAD/models/MIMOUNet.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, chosj95/mimo-unet when it was checked","code_sha256":"c5a460a8a5c0da6a","code_sha256_prefix":"c5a460a8a5c0da6a","mcp_get_code":{"code_sha256":"c5a460a8a5c0da6a"}}],"record_sha256":"0eca140583d16724bbee6b733e793c1c509f50e5cf1db5c62bb31aedf129d6a0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}