{"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/l1-2","entry":"L1","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":4,"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":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":3,"n_places":7,"n_places_pointer_only":5,"n_places_pointer_only_link_open":2,"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":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":"2204.02977","arxiv_id_is_arxiv":true,"paper":"/paper/multi-scale-memory-based-video-deblurring","title":"Multi-Scale Memory-Based Video Deblurring","date":"2022-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jibo27/MemDeblur","path":"train/loss.py","file_url":"https://github.com/jibo27/MemDeblur/blob/HEAD/train/loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"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 xjtu-cvlab-lowlevel/rnn-mbp, and GitHub detected no licence in that repository when it was checked","code_sha256":"308d7e741a6c1d7e","code_sha256_prefix":"308d7e741a6c1d7e","mcp_get_code":{"code_sha256":"308d7e741a6c1d7e"}},{"arxiv_id":"2203.01241","arxiv_id_is_arxiv":true,"paper":"/paper/optimal-deletion-robust-coreset-for","title":"Coresets remembered and items forgotten: submodular maximization with deletions","date":null,"month_inferred_from_arxiv_id":"2022-03","title_source":"archive","repo":"guangyi-zhang/robust-subm-coreset","path":"data_scripts/face.py","file_url":"https://github.com/guangyi-zhang/robust-subm-coreset/blob/HEAD/data_scripts/face.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":"1d15235c08285149","code_sha256_prefix":"1d15235c08285149","mcp_get_code":{"code_sha256":"1d15235c08285149"}},{"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/loss.py","file_url":"https://github.com/xjtu-cvlab-lowlevel/rnn-mbp/blob/HEAD/train/loss.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":"308d7e741a6c1d7e","code_sha256_prefix":"308d7e741a6c1d7e","mcp_get_code":{"code_sha256":"308d7e741a6c1d7e"}},{"arxiv_id":"2109.06875","arxiv_id_is_arxiv":true,"paper":"/paper/multi-scale-aligned-distillation-for-low-1","title":"Multi-Scale Aligned Distillation for Low-Resolution Detection","date":"2021-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jia-Research-Lab/MSAD","path":"msad/layers/loss.py","file_url":"https://github.com/Jia-Research-Lab/MSAD/blob/HEAD/msad/layers/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Jia-Research-Lab/MSAD when it was checked","code_sha256":"5f22bd913308e42f","code_sha256_prefix":"5f22bd913308e42f","mcp_get_code":{"code_sha256":"5f22bd913308e42f"}},{"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":"train/loss.py","file_url":"https://github.com/zzh-tech/ESTRNN/blob/HEAD/train/loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"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 xjtu-cvlab-lowlevel/rnn-mbp, and GitHub detected no licence in that repository when it was checked","code_sha256":"308d7e741a6c1d7e","code_sha256_prefix":"308d7e741a6c1d7e","mcp_get_code":{"code_sha256":"308d7e741a6c1d7e"}},{"arxiv_id":"2003.00973","arxiv_id_is_arxiv":true,"paper":"/paper/differential-privacy-at-risk-bridging","title":"Differential Privacy at Risk: Bridging Randomness and Privacy Budget","date":"2020-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ashishdandekar/Privacy-at-risk","path":"new_expt.py","file_url":"https://github.com/ashishdandekar/Privacy-at-risk/blob/HEAD/new_expt.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, ashishdandekar/Privacy-at-risk, is not in the permissive set Syntology serves inline","code_sha256":"9966c955580f8296","code_sha256_prefix":"9966c955580f8296","mcp_get_code":{"code_sha256":"9966c955580f8296"}},{"arxiv_id":"1803.06585","arxiv_id_is_arxiv":true,"paper":"/paper/learning-long-term-dependencies-via-fourier","title":"Learning Long Term Dependencies via Fourier Recurrent Units","date":"2018-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"limbo018/FRU","path":"code/tflearn/tflearn/losses.py","file_url":"https://github.com/limbo018/FRU/blob/HEAD/code/tflearn/tflearn/losses.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":"ea1bd8127dd59ae6","code_sha256_prefix":"ea1bd8127dd59ae6","mcp_get_code":{"code_sha256":"ea1bd8127dd59ae6"}}],"record_sha256":"3afca6498d1af778cb387bbb9e1c543ed32f83cba03465cab0933dff6b60a376","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}