{"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/raft","entry":"RAFT","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":5,"n_papers_ran":2,"n_papers_ran_no_instrument_failure":2,"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":2,"n_samples_constructed":2,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":3,"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":2,"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":"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":"772cdc8f5fa96a41","code_sha256_prefix":"772cdc8f5fa96a41","mcp_get_code":{"code_sha256":"772cdc8f5fa96a41"}},{"arxiv_id":"2207.10123","arxiv_id_is_arxiv":true,"paper":"/paper/animation-from-blur-multi-modal-blur","title":"Animation from Blur: Multi-modal Blur Decomposition with Motion Guidance","date":"2022-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzh-tech/Animation-from-Blur","path":"model/MBD.py","file_url":"https://github.com/zzh-tech/Animation-from-Blur/blob/HEAD/model/MBD.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, zzh-tech/Animation-from-Blur when it was checked","code_sha256":"f3a27045bdf4d8f0","code_sha256_prefix":"f3a27045bdf4d8f0","mcp_get_code":{"code_sha256":"f3a27045bdf4d8f0"}},{"arxiv_id":"2207.03790","arxiv_id_is_arxiv":true,"paper":"/paper/complementing-brightness-constancy-with-deep","title":"Complementing Brightness Constancy with Deep Networks for Optical Flow Prediction","date":"2022-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vincent-leguen/COMBO","path":"core/combo_model.py","file_url":"https://github.com/vincent-leguen/COMBO/blob/HEAD/core/combo_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":"bb6e4ee8c173c606","code_sha256_prefix":"bb6e4ee8c173c606","mcp_get_code":{"code_sha256":"bb6e4ee8c173c606"}},{"arxiv_id":"2105.07014","arxiv_id_is_arxiv":true,"paper":"/paper/smurf-self-teaching-multi-frame-unsupervised","title":"SMURF: Self-Teaching Multi-Frame Unsupervised RAFT with Full-Image Warping","date":"2021-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChristophReich1996/SMURF","path":"smurf/_raft.py","file_url":"https://github.com/ChristophReich1996/SMURF/blob/HEAD/smurf/_raft.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"CC-BY-4.0, as GitHub detects it on this paper's repository, ChristophReich1996/SMURF, is not in the permissive set Syntology serves inline","code_sha256":"57a7a4888b8cde01","code_sha256_prefix":"57a7a4888b8cde01","mcp_get_code":{"code_sha256":"57a7a4888b8cde01"}},{"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":"pytorch/vision","path":"torchvision/models/optical_flow/raft.py","file_url":"https://github.com/pytorch/vision/blob/HEAD/torchvision/models/optical_flow/raft.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0ba6555db6828c81","code_sha256_prefix":"0ba6555db6828c81","mcp_get_code":{"code_sha256":"0ba6555db6828c81"}},{"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":"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, plusgood-steven/id-blau when it was checked","code_sha256":"c9bcaa550ff44555","code_sha256_prefix":"c9bcaa550ff44555","mcp_get_code":{"code_sha256":"c9bcaa550ff44555"}},{"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":"osmr/pytorchcv","path":"pytorchcv/models/raft.py","file_url":"https://github.com/osmr/pytorchcv/blob/HEAD/pytorchcv/models/raft.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":"bd49469ee4db2086","code_sha256_prefix":"bd49469ee4db2086","mcp_get_code":{"code_sha256":"bd49469ee4db2086"}},{"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":"princeton-vl/RAFT","path":"core/raft.py","file_url":"https://github.com/princeton-vl/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":"cb380d6b60e23020","code_sha256_prefix":"cb380d6b60e23020","mcp_get_code":{"code_sha256":"cb380d6b60e23020"}}],"record_sha256":"2fa9acea702a07df6e3a1dc4a1d0b0bdb6fb16e6230c00c69469a8e50858c84b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}