{"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/flowhead","entry":"FlowHead","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":5,"n_papers_ran_no_instrument_failure":5,"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":5,"n_samples_constructed":4,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":5,"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":5,"unverified":3},"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":"2602.17586","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-17586","title":"Conditional Flow Matching for Continuous Anomaly Detection in Autonomous Driving on a Manifold-Aware Spectral Space","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"AntonioAlgaida/FlowMatchingTrajectoryAnomaly","path":"src/models/deep_flow.py","file_url":"https://github.com/AntonioAlgaida/FlowMatchingTrajectoryAnomaly/blob/HEAD/src/models/deep_flow.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":"bb7558aa04d81f4c","code_sha256_prefix":"bb7558aa04d81f4c","mcp_get_code":{"code_sha256":"bb7558aa04d81f4c"}},{"arxiv_id":"2503.16709","arxiv_id_is_arxiv":true,"paper":"/paper/quartdepth-post-training-quantization-for-1","title":"QuartDepth: Post-Training Quantization for Real-Time Depth Estimation on the Edge","date":"2025-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shawnricecake/quart-depth","path":"metric3d/mono/model/decode_heads/RAFTDepthNormalDPTDecoder5_quant.py","file_url":"https://github.com/shawnricecake/quart-depth/blob/HEAD/metric3d/mono/model/decode_heads/RAFTDepthNormalDPTDecoder5_quant.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, shawnricecake/quart-depth when it was checked","code_sha256":"ae321a434f934a35","code_sha256_prefix":"ae321a434f934a35","mcp_get_code":{"code_sha256":"ae321a434f934a35"}},{"arxiv_id":"2503.06471","arxiv_id_is_arxiv":true,"paper":"/paper/online-dense-point-tracking-with-streaming","title":"Online Dense Point Tracking with Streaming Memory","date":"2025-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dqiaole/spot","path":"spot/models/shelf/spot.py","file_url":"https://github.com/dqiaole/spot/blob/HEAD/spot/models/shelf/spot.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e937dd70d848868a","code_sha256_prefix":"e937dd70d848868a","mcp_get_code":{"code_sha256":"e937dd70d848868a"}},{"arxiv_id":"2409.11211","arxiv_id_is_arxiv":true,"paper":"/paper/splatfields-neural-gaussian-splats-for-sparse","title":"SplatFields: Neural Gaussian Splats for Sparse 3D and 4D Reconstruction","date":"2024-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"markomih/splatfields","path":"scene/deform_model.py","file_url":"https://github.com/markomih/splatfields/blob/HEAD/scene/deform_model.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, markomih/splatfields when it was checked","code_sha256":"46ae9697f6cb588d","code_sha256_prefix":"46ae9697f6cb588d","mcp_get_code":{"code_sha256":"46ae9697f6cb588d"}},{"arxiv_id":"2303.11629","arxiv_id_is_arxiv":true,"paper":"/paper/tma-temporal-motion-aggregation-for-event","title":"TMA: Temporal Motion Aggregation for Event-based Optical Flow","date":"2023-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ispc-lab/tma","path":"model/TMA.py","file_url":"https://github.com/ispc-lab/tma/blob/HEAD/model/TMA.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, ispc-lab/tma when it was checked","code_sha256":"29f026182606690d","code_sha256_prefix":"29f026182606690d","mcp_get_code":{"code_sha256":"29f026182606690d"}},{"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":"deterministic","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":"888987ee817d33e8","code_sha256_prefix":"888987ee817d33e8","mcp_get_code":{"code_sha256":"888987ee817d33e8"}},{"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":"919b54dd2d2863a6","code_sha256_prefix":"919b54dd2d2863a6","mcp_get_code":{"code_sha256":"919b54dd2d2863a6"}},{"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":"576170c699910f7c","code_sha256_prefix":"576170c699910f7c","mcp_get_code":{"code_sha256":"576170c699910f7c"}}],"record_sha256":"a806ecb47fce7707116b070ae6b326eedb6347e572c7af43435829fd3807c626","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}