{"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/conv5x5","entry":"conv5x5","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":4,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":9,"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":1,"ran_fixture":0,"ran":4,"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":"2407.09059","arxiv_id_is_arxiv":true,"paper":"/paper/domain-adaptive-video-deblurring-via-test","title":"Domain-adaptive Video Deblurring via Test-time Blurring","date":"2024-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jin-ting-he/dadeblur","path":"DeblurringModel/ESTRNN/arches.py","file_url":"https://github.com/jin-ting-he/dadeblur/blob/HEAD/DeblurringModel/ESTRNN/arches.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, jin-ting-he/dadeblur when it was checked","code_sha256":"05b9fb4be8292106","code_sha256_prefix":"05b9fb4be8292106","mcp_get_code":{"code_sha256":"05b9fb4be8292106"}},{"arxiv_id":"2406.10391","arxiv_id_is_arxiv":true,"paper":"/paper/beacon-benchmark-for-comprehensive-rna-tasks","title":"BEACON: Benchmark for Comprehensive RNA Tasks and Language Models","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"terry-r123/RNABenchmark","path":"downstream/structure/resnet.py","file_url":"https://github.com/terry-r123/RNABenchmark/blob/HEAD/downstream/structure/resnet.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":"c74f81523af71e2a","code_sha256_prefix":"c74f81523af71e2a","mcp_get_code":{"code_sha256":"c74f81523af71e2a"}},{"arxiv_id":"2404.06842","arxiv_id_is_arxiv":true,"paper":"/paper/mocha-stereo-motif-channel-attention-network","title":"MoCha-Stereo: Motif Channel Attention Network for Stereo Matching","date":"2024-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zyangchen/mocha-stereo","path":"MoCha-Stereo/nets/feature.py","file_url":"https://github.com/zyangchen/mocha-stereo/blob/HEAD/MoCha-Stereo/nets/feature.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":"af5d1e93b7cc0884","code_sha256_prefix":"af5d1e93b7cc0884","mcp_get_code":{"code_sha256":"af5d1e93b7cc0884"}},{"arxiv_id":"2207.13374","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-video-deblurring-guided-by-motion","title":"Efficient Video Deblurring Guided by Motion Magnitude","date":"2022-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sollynoay/MMP-RNN","path":"MMP-RNN/model/MMPRNN.py","file_url":"https://github.com/sollynoay/MMP-RNN/blob/HEAD/MMP-RNN/model/MMPRNN.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"05b9fb4be8292106","code_sha256_prefix":"05b9fb4be8292106","mcp_get_code":{"code_sha256":"05b9fb4be8292106"}},{"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":"model/arches.py","file_url":"https://github.com/xjtu-cvlab-lowlevel/rnn-mbp/blob/HEAD/model/arches.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, xjtu-cvlab-lowlevel/rnn-mbp when it was checked","code_sha256":"05b9fb4be8292106","code_sha256_prefix":"05b9fb4be8292106","mcp_get_code":{"code_sha256":"05b9fb4be8292106"}},{"arxiv_id":"2106.16028","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-spatio-temporal-recurrent-neural-1","title":"Real-world Video Deblurring: A Benchmark Dataset and An Efficient Recurrent Neural Network","date":"2021-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzh-tech/ESTRNN","path":"model/arches.py","file_url":"https://github.com/zzh-tech/ESTRNN/blob/HEAD/model/arches.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"05b9fb4be8292106","code_sha256_prefix":"05b9fb4be8292106","mcp_get_code":{"code_sha256":"05b9fb4be8292106"}},{"arxiv_id":"2106.13358","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-perception-action-communication","title":"Scalable Perception-Action-Communication Loops with Convolutional and Graph Neural Networks","date":"2021-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/VGAI","path":"joint_network.py","file_url":"https://github.com/VITA-Group/VGAI/blob/HEAD/joint_network.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":"495f0015aace0c41","code_sha256_prefix":"495f0015aace0c41","mcp_get_code":{"code_sha256":"495f0015aace0c41"}},{"arxiv_id":"2106.09309","arxiv_id_is_arxiv":true,"paper":"/paper/layer-folding-neural-network-depth-reduction","title":"Layer Folding: Neural Network Depth Reduction using Activation Linearization","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LayerFolding/Layer-Folding","path":"VGG_Cifar10_postfold.py","file_url":"https://github.com/LayerFolding/Layer-Folding/blob/HEAD/VGG_Cifar10_postfold.py","status":"ran","verification_level":1,"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":"09dcc50c884b217d","code_sha256_prefix":"09dcc50c884b217d","mcp_get_code":{"code_sha256":"09dcc50c884b217d"}},{"arxiv_id":"2004.09548","arxiv_id_is_arxiv":true,"paper":"/paper/aanet-adaptive-aggregation-network-for","title":"AANet: Adaptive Aggregation Network for Efficient Stereo Matching","date":"2020-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haofeixu/aanet","path":"nets/feature.py","file_url":"https://github.com/haofeixu/aanet/blob/HEAD/nets/feature.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":"af5d1e93b7cc0884","code_sha256_prefix":"af5d1e93b7cc0884","mcp_get_code":{"code_sha256":"af5d1e93b7cc0884"}}],"record_sha256":"5c1fbfaeb90453e35534cfccfb4cd523a38ca4447d06fd18a8f3cadb1701c881","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}