{"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/split-feature","entry":"split_feature","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":5,"n_papers_ran_instrument_only":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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":7,"n_places_pointer_only_link_open":3,"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":2,"ran_fixture":1,"ran":2,"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":"2503.01257","arxiv_id_is_arxiv":true,"paper":"/paper/svdc-consistent-direct-time-of-flight-video","title":"SVDC: Consistent Direct Time-of-Flight Video Depth Completion with Frequency Selective Fusion","date":"2025-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lan1eve/SVDC","path":"gmflow/utils.py","file_url":"https://github.com/Lan1eve/SVDC/blob/HEAD/gmflow/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from cvlab-kaist/PF3plat, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"4df5b1dd5d60d6cb","code_sha256_prefix":"4df5b1dd5d60d6cb","mcp_get_code":{"code_sha256":"4df5b1dd5d60d6cb"}},{"arxiv_id":"2410.22128","arxiv_id_is_arxiv":true,"paper":"/paper/pf3plat-pose-free-feed-forward-3d-gaussian","title":"PF3plat: Pose-Free Feed-Forward 3D Gaussian Splatting","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cvlab-kaist/PF3plat","path":"src/flow_util.py","file_url":"https://github.com/cvlab-kaist/PF3plat/blob/HEAD/src/flow_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, cvlab-kaist/PF3plat (NOASSERTION)","code_sha256":"4df5b1dd5d60d6cb","code_sha256_prefix":"4df5b1dd5d60d6cb","mcp_get_code":{"code_sha256":"4df5b1dd5d60d6cb"}},{"arxiv_id":"2409.16288","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-any-point-tracking-by","title":"Self-Supervised Any-Point Tracking by Contrastive Random Walks","date":"2024-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ayshrv/gmrw","path":"models/gmflow_model/utils.py","file_url":"https://github.com/ayshrv/gmrw/blob/HEAD/models/gmflow_model/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 cvlab-kaist/PF3plat, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"4df5b1dd5d60d6cb","code_sha256_prefix":"4df5b1dd5d60d6cb","mcp_get_code":{"code_sha256":"4df5b1dd5d60d6cb"}},{"arxiv_id":"2310.14064","arxiv_id_is_arxiv":true,"paper":"/paper/counterfactual-prediction-under-selective","title":"Counterfactual Prediction Under Selective Confounding","date":"2023-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sohaib730/causalml","path":"RWData_Experiments/Double_Robust.py","file_url":"https://github.com/sohaib730/causalml/blob/HEAD/RWData_Experiments/Double_Robust.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, sohaib730/causalml when it was checked","code_sha256":"0d7131437ab2f079","code_sha256_prefix":"0d7131437ab2f079","mcp_get_code":{"code_sha256":"0d7131437ab2f079"}},{"arxiv_id":"2111.13680","arxiv_id_is_arxiv":true,"paper":"/paper/gmflow-learning-optical-flow-via-global","title":"GMFlow: Learning Optical Flow via Global Matching","date":"2021-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haofeixu/gmflow","path":"gmflow/utils.py","file_url":"https://github.com/haofeixu/gmflow/blob/HEAD/gmflow/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from cvlab-kaist/PF3plat, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"4df5b1dd5d60d6cb","code_sha256_prefix":"4df5b1dd5d60d6cb","mcp_get_code":{"code_sha256":"4df5b1dd5d60d6cb"}},{"arxiv_id":"2103.03089","arxiv_id_is_arxiv":true,"paper":"/paper/memory-efficient-network-for-large-scale","title":"Memory-Efficient Network for Large-scale Video Compressive Sensing","date":"2021-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BoChenGroup/RevSCI-net","path":"my_tools.py","file_url":"https://github.com/BoChenGroup/RevSCI-net/blob/HEAD/my_tools.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, BoChenGroup/RevSCI-net when it was checked","code_sha256":"52b543fad77c7162","code_sha256_prefix":"52b543fad77c7162","mcp_get_code":{"code_sha256":"52b543fad77c7162"}},{"arxiv_id":"2002.11896","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-boosted-flows","title":"Gradient Boosted Normalizing Flows","date":"2020-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robert-giaquinto/gradient-boosted-normalizing-flows","path":"models/boosted_flow.py","file_url":"https://github.com/robert-giaquinto/gradient-boosted-normalizing-flows/blob/HEAD/models/boosted_flow.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"45f3824dcc7faec1","code_sha256_prefix":"45f3824dcc7faec1","mcp_get_code":{"code_sha256":"45f3824dcc7faec1"}},{"arxiv_id":"1807.03039","arxiv_id_is_arxiv":true,"paper":"/paper/glow-generative-flow-with-invertible-1x1","title":"Glow: Generative Flow with Invertible 1x1 Convolutions","date":"2018-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"y0ast/Glow-PyTorch","path":"model.py","file_url":"https://github.com/y0ast/Glow-PyTorch/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, y0ast/Glow-PyTorch (NOASSERTION)","code_sha256":"ab29b88c57d4121e","code_sha256_prefix":"ab29b88c57d4121e","mcp_get_code":{"code_sha256":"ab29b88c57d4121e"}}],"record_sha256":"c87e3592bbb75a811e56cb385ddeef1b7b31247d7c345718e5e6d006f361e33d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}