{"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/sequential","entry":"sequential","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":0,"n_papers_ran_no_instrument_failure":0,"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":6,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":6,"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":0,"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":"2607.11025","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-11025","title":"Reference-Based Face Super-Resolution Using the Spatial Transformer","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"varun-jois/FSRST","path":"models/FSRST.py","file_url":"https://github.com/varun-jois/FSRST/blob/HEAD/models/FSRST.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, varun-jois/FSRST when it was checked","code_sha256":"9287bb06d307bde7","code_sha256_prefix":"9287bb06d307bde7","mcp_get_code":{"code_sha256":"9287bb06d307bde7"}},{"arxiv_id":"2403.06977","arxiv_id_is_arxiv":true,"paper":"/paper/videomamba-state-space-model-for-efficient","title":"VideoMamba: State Space Model for Efficient Video Understanding","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hongyuanyu/span","path":"basicsr/archs/span_arch.py","file_url":"https://github.com/hongyuanyu/span/blob/HEAD/basicsr/archs/span_arch.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":"28179fe9fd01ec78","code_sha256_prefix":"28179fe9fd01ec78","mcp_get_code":{"code_sha256":"28179fe9fd01ec78"}},{"arxiv_id":"2301.10034","arxiv_id_is_arxiv":true,"paper":"/paper/open-world-multi-task-control-through-goal","title":"Open-World Multi-Task Control Through Goal-Aware Representation Learning and Adaptive Horizon Prediction","date":"2023-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"craftjarvis/mc-planner","path":"src/utils/impala_lib/goal_impala_cnn.py","file_url":"https://github.com/craftjarvis/mc-planner/blob/HEAD/src/utils/impala_lib/goal_impala_cnn.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, craftjarvis/mc-planner when it was checked","code_sha256":"5cc13b732c5e938c","code_sha256_prefix":"5cc13b732c5e938c","mcp_get_code":{"code_sha256":"5cc13b732c5e938c"}},{"arxiv_id":"2110.00984","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-unfolding-total-variation-network","title":"Adaptive Unfolding Total Variation Network for Low-Light Image Enhancement","date":"2021-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"charliezcj/utvnet","path":"models/network.py","file_url":"https://github.com/charliezcj/utvnet/blob/HEAD/models/network.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, charliezcj/utvnet when it was checked","code_sha256":"e36a9db892549b43","code_sha256_prefix":"e36a9db892549b43","mcp_get_code":{"code_sha256":"e36a9db892549b43"}},{"arxiv_id":"2109.14573","arxiv_id_is_arxiv":true,"paper":"/paper/towards-flexible-blind-jpeg-artifacts-removal","title":"Towards Flexible Blind JPEG Artifacts Removal","date":"2021-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaxi-jiang/fbcnn","path":"models/network_fbcnn.py","file_url":"https://github.com/jiaxi-jiang/fbcnn/blob/HEAD/models/network_fbcnn.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":"17f1c0ea54159076","code_sha256_prefix":"17f1c0ea54159076","mcp_get_code":{"code_sha256":"17f1c0ea54159076"}},{"arxiv_id":"2104.09556","arxiv_id_is_arxiv":true,"paper":"/paper/removing-diffraction-image-artifacts-in-under","title":"Removing Diffraction Image Artifacts in Under-Display Camera via Dynamic Skip Connection Network","date":"2021-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jnjaby/DISCNet","path":"basicsr/models/archs/discnet_arch.py","file_url":"https://github.com/jnjaby/DISCNet/blob/HEAD/basicsr/models/archs/discnet_arch.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, jnjaby/DISCNet when it was checked","code_sha256":"e4f6817e59050117","code_sha256_prefix":"e4f6817e59050117","mcp_get_code":{"code_sha256":"e4f6817e59050117"}}],"record_sha256":"85c7b8f2f5af5a9af75ed04c78c042c0b75e5f9020a9a0a6d399121845ed7a61","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}