{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/basicupdateblock","entry":"BasicUpdateBlock","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":7,"n_papers_ran":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":8,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":5},"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":"2507.23595","paper":null,"title":"arXiv:2507.23595","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"zhuyaoye/MamV2XCalib","path":"models/mamraft.py","file_url":"https://github.com/zhuyaoye/MamV2XCalib/blob/HEAD/models/mamraft.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6a0b217b4d53c47c","mcp_get_code":{"code_sha256":"6a0b217b4d53c47c"}},{"arxiv_id":"2405.14793","paper":"/paper/sea-raft-simple-efficient-accurate-raft-for","title":"SEA-RAFT: Simple, Efficient, Accurate RAFT for Optical Flow","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-vl/SEA-RAFT","path":"core/raft.py","file_url":"https://github.com/princeton-vl/SEA-RAFT/blob/HEAD/core/raft.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"922a2070529c18e5","mcp_get_code":{"code_sha256":"922a2070529c18e5"}},{"arxiv_id":"2211.14052","paper":"/paper/towards-hard-pose-virtual-try-on-via-3d-aware","title":"Towards Hard-pose Virtual Try-on via 3D-aware Global Correspondence Learning","date":"2022-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huangzy225/3d-gcl","path":"models/networks/correspondence.py","file_url":"https://github.com/huangzy225/3d-gcl/blob/HEAD/models/networks/correspondence.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9aa675cfa6631479","mcp_get_code":{"code_sha256":"9aa675cfa6631479"}},{"arxiv_id":"2204.00330","paper":"/paper/dip-deep-inverse-patchmatch-for-high","title":"DIP: Deep Inverse Patchmatch for High-Resolution Optical Flow","date":"2022-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zihuazheng/DIP","path":"nets/dip.py","file_url":"https://github.com/zihuazheng/DIP/blob/HEAD/nets/dip.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"b10dd2198a786fb9","mcp_get_code":{"code_sha256":"b10dd2198a786fb9"}},{"arxiv_id":"2203.11483","paper":"/paper/practical-stereo-matching-via-cascaded","title":"Practical Stereo Matching via Cascaded Recurrent Network with Adaptive Correlation","date":"2022-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibaiGorordo/CREStereo-Pytorch","path":"nets/crestereo.py","file_url":"https://github.com/ibaiGorordo/CREStereo-Pytorch/blob/HEAD/nets/crestereo.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"42ddea5b49e5bf83","mcp_get_code":{"code_sha256":"42ddea5b49e5bf83"}},{"arxiv_id":"2203.11335","paper":"/paper/global-matching-with-overlapping-attention","title":"Global Matching with Overlapping Attention for Optical Flow Estimation","date":"2022-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaofeng94/gmflownet","path":"core/gmflownet_model.py","file_url":"https://github.com/xiaofeng94/gmflownet/blob/HEAD/core/gmflownet_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8025ceaeea5ca5a2","mcp_get_code":{"code_sha256":"8025ceaeea5ca5a2"}},{"arxiv_id":"2003.12039","paper":"/paper/raft-recurrent-all-pairs-field-transforms-for","title":"RAFT: Recurrent All-Pairs Field Transforms for Optical Flow","date":"2020-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plusgood-steven/id-blau","path":"PrepareCondition/core/raft.py","file_url":"https://github.com/plusgood-steven/id-blau/blob/HEAD/PrepareCondition/core/raft.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"405f48802a21a4f4","mcp_get_code":{"code_sha256":"405f48802a21a4f4"}},{"arxiv_id":"2003.12039","paper":"/paper/raft-recurrent-all-pairs-field-transforms-for","title":"RAFT: Recurrent All-Pairs Field Transforms for Optical Flow","date":"2020-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aliciachenw/PIPsUS","path":"nets/update.py","file_url":"https://github.com/aliciachenw/PIPsUS/blob/HEAD/nets/update.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f8f994317c0ac6e7","mcp_get_code":{"code_sha256":"f8f994317c0ac6e7"}}]}