{"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/epe","entry":"EPE","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":8,"n_papers_ran_no_instrument_failure":8,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":8,"n_places_pointer_only":3,"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":0,"ran_fixture":0,"ran":5,"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.13133","arxiv_id_is_arxiv":true,"paper":"/paper/accflow-backward-accumulation-for-long-range","title":"AccFlow: Backward Accumulation for Long-Range Optical Flow","date":"2023-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mulns/accflow","path":"networks/losses.py","file_url":"https://github.com/mulns/accflow/blob/HEAD/networks/losses.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 Jia-Research-Lab/MSAD, and GitHub detected no licence in that repository when it was checked","code_sha256":"6baff9bff3755d04","code_sha256_prefix":"6baff9bff3755d04","mcp_get_code":{"code_sha256":"6baff9bff3755d04"}},{"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_honours","verification_level":1,"contract_check":"HONOURS","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":"6baff9bff3755d04","code_sha256_prefix":"6baff9bff3755d04","mcp_get_code":{"code_sha256":"6baff9bff3755d04"}},{"arxiv_id":"2005.10954","arxiv_id_is_arxiv":true,"paper":"/paper/head2head-video-based-neural-head-synthesis","title":"Head2Head: Video-based Neural Head Synthesis","date":"2020-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michaildoukas/head2head","path":"models/flownet2_pytorch/losses.py","file_url":"https://github.com/michaildoukas/head2head/blob/HEAD/models/flownet2_pytorch/losses.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 Jia-Research-Lab/MSAD, and GitHub detected no licence in that repository when it was checked","code_sha256":"6baff9bff3755d04","code_sha256_prefix":"6baff9bff3755d04","mcp_get_code":{"code_sha256":"6baff9bff3755d04"}},{"arxiv_id":"1910.13136","arxiv_id_is_arxiv":true,"paper":"/paper/an-matte-boundary-defocus-model-based","title":"An α-Matte Boundary Defocus Model Based Cascaded Network for Multi-focus Image Fusion","date":"2019-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xytmhy/MMF-Net-alpha-Matte-Boundary-Defocus-Model-Fusion","path":"multiscaleloss.py","file_url":"https://github.com/xytmhy/MMF-Net-alpha-Matte-Boundary-Defocus-Model-Fusion/blob/HEAD/multiscaleloss.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":"c4e8c04d1cd3f12c","code_sha256_prefix":"c4e8c04d1cd3f12c","mcp_get_code":{"code_sha256":"c4e8c04d1cd3f12c"}},{"arxiv_id":"1907.11628","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-learning-for-optical-flow","title":"Unsupervised Learning for Optical Flow Estimation Using Pyramid Convolution LSTM","date":"2019-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Kwanss/PCLNet","path":"Losses/loss_func.py","file_url":"https://github.com/Kwanss/PCLNet/blob/HEAD/Losses/loss_func.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":"8fb8eddd497537e6","code_sha256_prefix":"8fb8eddd497537e6","mcp_get_code":{"code_sha256":"8fb8eddd497537e6"}},{"arxiv_id":"1904.05065","arxiv_id_is_arxiv":true,"paper":"/paper/davanet-stereo-deblurring-with-view","title":"DAVANet: Stereo Deblurring with View Aggregation","date":"2019-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sczhou/DAVANet","path":"losses/multiscaleloss.py","file_url":"https://github.com/sczhou/DAVANet/blob/HEAD/losses/multiscaleloss.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":"fc3905ddb47a182b","code_sha256_prefix":"fc3905ddb47a182b","mcp_get_code":{"code_sha256":"fc3905ddb47a182b"}},{"arxiv_id":"1504.06852","arxiv_id_is_arxiv":true,"paper":"/paper/flownet-learning-optical-flow-with","title":"FlowNet: Learning Optical Flow with Convolutional Networks","date":"2015-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"McDo/LightFlowPytorch","path":"loss.py","file_url":"https://github.com/McDo/LightFlowPytorch/blob/HEAD/loss.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":"b77a7cb2a29a19c7","code_sha256_prefix":"b77a7cb2a29a19c7","mcp_get_code":{"code_sha256":"b77a7cb2a29a19c7"}},{"arxiv_id":"Sun_Pixel-level_Semantic_Correspondence_through_Layout-aware_Representation_Learning_and_Multi-scale_Matching_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Sun_Pixel-level_Semantic_Correspondence_through_Layout-aware_Representation_Learning_and_Multi-scale_Matching_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"YXSUNMADMAX/LPMFlow","path":"utils_training/optimize.py","file_url":"https://github.com/YXSUNMADMAX/LPMFlow/blob/HEAD/utils_training/optimize.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":"07d0e70ee97c932d","code_sha256_prefix":"07d0e70ee97c932d","mcp_get_code":{"code_sha256":"07d0e70ee97c932d"}}],"record_sha256":"1d3d6597c6708ec67128170817d29605f0f1b13f4f9db0f493a1ae7ec3c174f0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}