{"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/count-param","entry":"count_param","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":6,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":4,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"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":"2308.14036","arxiv_id_is_arxiv":true,"paper":"/paper/mb-taylorformer-multi-branch-efficient","title":"MB-TaylorFormer: Multi-branch Efficient Transformer Expanded by Taylor Formula for Image Dehazing","date":"2023-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fvl2020/iccv-2023-mb-taylorformer","path":"basicsr/models/archs/MB_TaylorFormer.py","file_url":"https://github.com/fvl2020/iccv-2023-mb-taylorformer/blob/HEAD/basicsr/models/archs/MB_TaylorFormer.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, fvl2020/iccv-2023-mb-taylorformer when it was checked","code_sha256":"afd3c5ab4cb8face","code_sha256_prefix":"afd3c5ab4cb8face","mcp_get_code":{"code_sha256":"afd3c5ab4cb8face"}},{"arxiv_id":"2305.19141","arxiv_id_is_arxiv":true,"paper":"/paper/taylorformer-probabilistic-predictions-for","title":"Taylorformer: Probabilistic Modelling for Random Processes including Time Series","date":"2023-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FVL2020/ICCV-2023-MB-TaylorFormer","path":"basicsr/models/archs/MB_TaylorFormer.py","file_url":"https://github.com/FVL2020/ICCV-2023-MB-TaylorFormer/blob/HEAD/basicsr/models/archs/MB_TaylorFormer.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, FVL2020/ICCV-2023-MB-TaylorFormer when it was checked","code_sha256":"afd3c5ab4cb8face","code_sha256_prefix":"afd3c5ab4cb8face","mcp_get_code":{"code_sha256":"afd3c5ab4cb8face"}},{"arxiv_id":"2301.05169","arxiv_id_is_arxiv":true,"paper":"/paper/causal-triplet-an-open-challenge-for","title":"Causal Triplet: An Open Challenge for Intervention-centric Causal Representation Learning","date":"2023-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CausalTriplet/causaltriplet","path":"util.py","file_url":"https://github.com/CausalTriplet/causaltriplet/blob/HEAD/util.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":"91e6bfc2eccdd5b5","code_sha256_prefix":"91e6bfc2eccdd5b5","mcp_get_code":{"code_sha256":"91e6bfc2eccdd5b5"}},{"arxiv_id":"2112.05150","arxiv_id_is_arxiv":true,"paper":"/paper/deep-recurrent-neural-network-with-multi","title":"Deep Recurrent Neural Network with Multi-scale Bi-directional Propagation for Video Deblurring","date":"2021-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xjtu-cvlab-lowlevel/rnn-mbp","path":"train/dp.py","file_url":"https://github.com/xjtu-cvlab-lowlevel/rnn-mbp/blob/HEAD/train/dp.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xjtu-cvlab-lowlevel/rnn-mbp when it was checked","code_sha256":"afd3c5ab4cb8face","code_sha256_prefix":"afd3c5ab4cb8face","mcp_get_code":{"code_sha256":"afd3c5ab4cb8face"}},{"arxiv_id":"2106.00487","arxiv_id_is_arxiv":true,"paper":"/paper/dense-nested-attention-network-for-infrared","title":"Dense Nested Attention Network for Infrared Small Target Detection","date":"2021-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YeRen123455/Infrared-Small-Target-Detection","path":"model/utils.py","file_url":"https://github.com/YeRen123455/Infrared-Small-Target-Detection/blob/HEAD/model/utils.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from FVL2020/ICCV-2023-MB-TaylorFormer, and GitHub detected no licence in that repository when it was checked","code_sha256":"afd3c5ab4cb8face","code_sha256_prefix":"afd3c5ab4cb8face","mcp_get_code":{"code_sha256":"afd3c5ab4cb8face"}},{"arxiv_id":"2023.acl-srw.19","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.acl-srw.19","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"nyuolab/text2table","path":"text2table/models/train_model.py","file_url":"https://github.com/nyuolab/text2table/blob/HEAD/text2table/models/train_model.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":"0748888f13df44e1","code_sha256_prefix":"0748888f13df44e1","mcp_get_code":{"code_sha256":"0748888f13df44e1"}}],"record_sha256":"25a01d59317cc9d956826e92a32045b6ffeef4b06941430f64687dade1b80c5f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}