{"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/basicupdateblock","entry":"BasicUpdateBlock","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":3,"n_papers_ran_no_instrument_failure":3,"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":8,"n_samples_ran":3,"n_samples_constructed":1,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":8,"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":3,"unverified":5},"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":"2507.23595","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhuyaoye/MamV2XCalib when it was checked","code_sha256":"6a0b217b4d53c47c","code_sha256_prefix":"6a0b217b4d53c47c","mcp_get_code":{"code_sha256":"6a0b217b4d53c47c"}},{"arxiv_id":"2405.14793","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"922a2070529c18e5","code_sha256_prefix":"922a2070529c18e5","mcp_get_code":{"code_sha256":"922a2070529c18e5"}},{"arxiv_id":"2211.14052","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, huangzy225/3d-gcl when it was checked","code_sha256":"9aa675cfa6631479","code_sha256_prefix":"9aa675cfa6631479","mcp_get_code":{"code_sha256":"9aa675cfa6631479"}},{"arxiv_id":"2204.00330","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b10dd2198a786fb9","code_sha256_prefix":"b10dd2198a786fb9","mcp_get_code":{"code_sha256":"b10dd2198a786fb9"}},{"arxiv_id":"2203.11483","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ibaiGorordo/CREStereo-Pytorch when it was checked","code_sha256":"42ddea5b49e5bf83","code_sha256_prefix":"42ddea5b49e5bf83","mcp_get_code":{"code_sha256":"42ddea5b49e5bf83"}},{"arxiv_id":"2203.11335","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8025ceaeea5ca5a2","code_sha256_prefix":"8025ceaeea5ca5a2","mcp_get_code":{"code_sha256":"8025ceaeea5ca5a2"}},{"arxiv_id":"2003.12039","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, plusgood-steven/id-blau when it was checked","code_sha256":"405f48802a21a4f4","code_sha256_prefix":"405f48802a21a4f4","mcp_get_code":{"code_sha256":"405f48802a21a4f4"}},{"arxiv_id":"2003.12039","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f8f994317c0ac6e7","code_sha256_prefix":"f8f994317c0ac6e7","mcp_get_code":{"code_sha256":"f8f994317c0ac6e7"}}],"record_sha256":"8d6593eb2fef0a61ac875c1006ca924cffe4bf8386808e49384bd7307eaac54a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}