{"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/readpfm","entry":"readPFM","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":24,"n_papers_ran":23,"n_papers_ran_no_instrument_failure":21,"n_papers_ran_instrument_only":2,"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":14,"n_samples_ran":12,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":26,"n_places_pointer_only":1,"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":1,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":9,"unverified":2},"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":"2501.09466","arxiv_id_is_arxiv":true,"paper":"/paper/defom-stereo-depth-foundation-model-based","title":"DEFOM-Stereo: Depth Foundation Model Based Stereo Matching","date":"2025-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"insta360-research-team/defom-stereo","path":"core/utils/frame_utils.py","file_url":"https://github.com/insta360-research-team/defom-stereo/blob/HEAD/core/utils/frame_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7c3fbc1f552de802","code_sha256_prefix":"7c3fbc1f552de802","mcp_get_code":{"code_sha256":"7c3fbc1f552de802"}},{"arxiv_id":"2407.11950","arxiv_id_is_arxiv":true,"paper":"/paper/temporally-consistent-stereo-matching","title":"Temporally Consistent Stereo Matching","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaxiZeng/Temporally-Consistent-Stereo-Matching","path":"core/utils/frame_utils.py","file_url":"https://github.com/jiaxiZeng/Temporally-Consistent-Stereo-Matching/blob/HEAD/core/utils/frame_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7c3fbc1f552de802","code_sha256_prefix":"7c3fbc1f552de802","mcp_get_code":{"code_sha256":"7c3fbc1f552de802"}},{"arxiv_id":"2403.10362","arxiv_id_is_arxiv":true,"paper":"/paper/cpga-coding-priors-guided-aggregation-network","title":"CPGA: Coding Priors-Guided Aggregation Network for Compressed Video Quality Enhancement","date":"2024-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VQE-CPGA/CPGA","path":"utils/frame_utils.py","file_url":"https://github.com/VQE-CPGA/CPGA/blob/HEAD/utils/frame_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, VQE-CPGA/CPGA when it was checked","code_sha256":"7c3fbc1f552de802","code_sha256_prefix":"7c3fbc1f552de802","mcp_get_code":{"code_sha256":"7c3fbc1f552de802"}},{"arxiv_id":"2209.08430","arxiv_id_is_arxiv":true,"paper":"/paper/dytanvo-joint-refinement-of-visual-odometry","title":"DytanVO: Joint Refinement of Visual Odometry and Motion Segmentation in Dynamic Environments","date":"2022-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"geniussh/dytanvo","path":"Datasets/util_flow.py","file_url":"https://github.com/geniussh/dytanvo/blob/HEAD/Datasets/util_flow.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":"5b0e5fbaa471b5a6","code_sha256_prefix":"5b0e5fbaa471b5a6","mcp_get_code":{"code_sha256":"5b0e5fbaa471b5a6"}},{"arxiv_id":"2204.04153","arxiv_id_is_arxiv":true,"paper":"/paper/particle-videos-revisited-tracking-through","title":"Particle Video Revisited: Tracking Through Occlusions Using Point Trajectories","date":"2022-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aharley/pips","path":"flyingthingsdataset.py","file_url":"https://github.com/aharley/pips/blob/HEAD/flyingthingsdataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d4c1dfe6e2a09277","code_sha256_prefix":"d4c1dfe6e2a09277","mcp_get_code":{"code_sha256":"d4c1dfe6e2a09277"}},{"arxiv_id":"2109.15321","arxiv_id_is_arxiv":true,"paper":"/paper/sensor-guided-optical-flow","title":"Sensor-Guided Optical Flow","date":"2021-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mattpoggi/sensor-guided-flow","path":"core/utils/frame_utils.py","file_url":"https://github.com/mattpoggi/sensor-guided-flow/blob/HEAD/core/utils/frame_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7c3fbc1f552de802","code_sha256_prefix":"7c3fbc1f552de802","mcp_get_code":{"code_sha256":"7c3fbc1f552de802"}},{"arxiv_id":"2108.09770","arxiv_id_is_arxiv":true,"paper":"/paper/mobilestereonet-towards-lightweight-deep","title":"MobileStereoNet: Towards Lightweight Deep Networks for Stereo Matching","date":"2021-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UCI-ISA-Lab/MultiHeadDepth-HomoDepth","path":"utils.py","file_url":"https://github.com/UCI-ISA-Lab/MultiHeadDepth-HomoDepth/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a8f2a79258b4f21b","code_sha256_prefix":"a8f2a79258b4f21b","mcp_get_code":{"code_sha256":"a8f2a79258b4f21b"}},{"arxiv_id":"2105.11587","arxiv_id_is_arxiv":true,"paper":"/paper/srh-net-stacked-recurrent-hourglass-network","title":"SRH-Net: Stacked Recurrent Hourglass Network for Stereo Matching","date":"2021-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hongzhidu/SRHNet","path":"evaluation.py","file_url":"https://github.com/hongzhidu/SRHNet/blob/HEAD/evaluation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"259c1efb59c8cc6f","code_sha256_prefix":"259c1efb59c8cc6f","mcp_get_code":{"code_sha256":"259c1efb59c8cc6f"}},{"arxiv_id":"2105.11587","arxiv_id_is_arxiv":true,"paper":"/paper/srh-net-stacked-recurrent-hourglass-network","title":"SRH-Net: Stacked Recurrent Hourglass Network for Stereo Matching","date":"2021-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hongzhidu/SRHNet","path":"dataloader/dataset.py","file_url":"https://github.com/hongzhidu/SRHNet/blob/HEAD/dataloader/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8bebef679adf02fe","code_sha256_prefix":"8bebef679adf02fe","mcp_get_code":{"code_sha256":"8bebef679adf02fe"}},{"arxiv_id":"2104.13918","arxiv_id_is_arxiv":true,"paper":"/paper/high-resolution-optical-flow-from-1d","title":"High-Resolution Optical Flow from 1D Attention and Correlation","date":"2021-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haofeixu/flow1d","path":"utils/frame_utils.py","file_url":"https://github.com/haofeixu/flow1d/blob/HEAD/utils/frame_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7c3fbc1f552de802","code_sha256_prefix":"7c3fbc1f552de802","mcp_get_code":{"code_sha256":"7c3fbc1f552de802"}},{"arxiv_id":"2104.04314","arxiv_id_is_arxiv":true,"paper":"/paper/cfnet-cascade-and-fused-cost-volume-for","title":"CFNet: Cascade and Fused Cost Volume for Robust Stereo Matching","date":"2021-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gallenszl/MSMD-Net","path":"datasets/readpfm.py","file_url":"https://github.com/gallenszl/MSMD-Net/blob/HEAD/datasets/readpfm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d8dba6f53d86a041","code_sha256_prefix":"d8dba6f53d86a041","mcp_get_code":{"code_sha256":"d8dba6f53d86a041"}},{"arxiv_id":"2010.14851","arxiv_id_is_arxiv":true,"paper":"/paper/displacement-invariant-matching-cost-learning","title":"Displacement-Invariant Matching Cost Learning for Accurate Optical Flow Estimation","date":"2020-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jytime/DICL-Flow","path":"utils/frame_utils.py","file_url":"https://github.com/jytime/DICL-Flow/blob/HEAD/utils/frame_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7c3fbc1f552de802","code_sha256_prefix":"7c3fbc1f552de802","mcp_get_code":{"code_sha256":"7c3fbc1f552de802"}},{"arxiv_id":"2010.13501","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-neural-architecture-search-for-1","title":"Hierarchical Neural Architecture Search for Deep Stereo Matching","date":"2020-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XuelianCheng/LEAStereo","path":"predict.py","file_url":"https://github.com/XuelianCheng/LEAStereo/blob/HEAD/predict.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"135cb558ec24e0e8","code_sha256_prefix":"135cb558ec24e0e8","mcp_get_code":{"code_sha256":"135cb558ec24e0e8"}},{"arxiv_id":"2007.05233","arxiv_id_is_arxiv":true,"paper":"/paper/continual-adaptation-for-deep-stereo","title":"Continual Adaptation for Deep Stereo","date":"2020-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CVLAB-Unibo/Real-time-self-adaptive-deep-stereo","path":"Data_utils/continual_data_reader.py","file_url":"https://github.com/CVLAB-Unibo/Real-time-self-adaptive-deep-stereo/blob/HEAD/Data_utils/continual_data_reader.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":"5bd87bf6c7536635","code_sha256_prefix":"5bd87bf6c7536635","mcp_get_code":{"code_sha256":"5bd87bf6c7536635"}},{"arxiv_id":"2007.03085","arxiv_id_is_arxiv":true,"paper":"/paper/wasserstein-distances-for-stereo-disparity","title":"Wasserstein Distances for Stereo Disparity Estimation","date":"2020-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Div99/W-Stereo-Disp","path":"src/disp_dataloader/readpfm.py","file_url":"https://github.com/Div99/W-Stereo-Disp/blob/HEAD/src/disp_dataloader/readpfm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aaea02c311c902eb","code_sha256_prefix":"aaea02c311c902eb","mcp_get_code":{"code_sha256":"aaea02c311c902eb"}},{"arxiv_id":"1912.04958","arxiv_id_is_arxiv":true,"paper":"/paper/analyzing-and-improving-the-image-quality-of","title":"Analyzing and Improving the Image Quality of StyleGAN","date":"2019-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EmptySamurai/pytorch-reconet","path":"IO.py","file_url":"https://github.com/EmptySamurai/pytorch-reconet/blob/HEAD/IO.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0564ba38597daf7c","code_sha256_prefix":"0564ba38597daf7c","mcp_get_code":{"code_sha256":"0564ba38597daf7c"}},{"arxiv_id":"1910.00130","arxiv_id_is_arxiv":true,"paper":"/paper/track-to-reconstruct-and-reconstruct-to-track","title":"Track to Reconstruct and Reconstruct to Track","date":"2019-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tobiasfshr/MOTSFusion","path":"file_io/io_utils.py","file_url":"https://github.com/tobiasfshr/MOTSFusion/blob/HEAD/file_io/io_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0564ba38597daf7c","code_sha256_prefix":"0564ba38597daf7c","mcp_get_code":{"code_sha256":"0564ba38597daf7c"}},{"arxiv_id":"1904.12257","arxiv_id_is_arxiv":true,"paper":"/paper/spatio-temporal-filter-adaptive-network-for","title":"Spatio-Temporal Filter Adaptive Network for Video Deblurring","date":"2019-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sczhou/STFAN","path":"utils/imgio_gen.py","file_url":"https://github.com/sczhou/STFAN/blob/HEAD/utils/imgio_gen.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0564ba38597daf7c","code_sha256_prefix":"0564ba38597daf7c","mcp_get_code":{"code_sha256":"0564ba38597daf7c"}},{"arxiv_id":"1904.06587","arxiv_id_is_arxiv":true,"paper":"/paper/ga-net-guided-aggregation-net-for-end-to-end","title":"GA-Net: Guided Aggregation Net for End-to-end Stereo Matching","date":"2019-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"feihuzhang/GANet","path":"evaluation.py","file_url":"https://github.com/feihuzhang/GANet/blob/HEAD/evaluation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"259c1efb59c8cc6f","code_sha256_prefix":"259c1efb59c8cc6f","mcp_get_code":{"code_sha256":"259c1efb59c8cc6f"}},{"arxiv_id":"1904.06587","arxiv_id_is_arxiv":true,"paper":"/paper/ga-net-guided-aggregation-net-for-end-to-end","title":"GA-Net: Guided Aggregation Net for End-to-end Stereo Matching","date":"2019-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skumailraza/FRSNet-GA","path":"evaluation.py","file_url":"https://github.com/skumailraza/FRSNet-GA/blob/HEAD/evaluation.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":"e614bb1349b10c4f","code_sha256_prefix":"e614bb1349b10c4f","mcp_get_code":{"code_sha256":"e614bb1349b10c4f"}},{"arxiv_id":"1904.02957","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-adapt-for-stereo","title":"Learning to Adapt for Stereo","date":"2019-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CVLAB-Unibo/Learning2AdaptForStereo","path":"Data_utils/data_reader.py","file_url":"https://github.com/CVLAB-Unibo/Learning2AdaptForStereo/blob/HEAD/Data_utils/data_reader.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":"5bd87bf6c7536635","code_sha256_prefix":"5bd87bf6c7536635","mcp_get_code":{"code_sha256":"5bd87bf6c7536635"}},{"arxiv_id":"1812.06264","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-discrete-distribution","title":"Hierarchical Discrete Distribution Decomposition for Match Density Estimation","date":"2018-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucbdrive/hd3","path":"utils/pfm.py","file_url":"https://github.com/ucbdrive/hd3/blob/HEAD/utils/pfm.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":"9c71f0f578921ed1","code_sha256_prefix":"9c71f0f578921ed1","mcp_get_code":{"code_sha256":"9c71f0f578921ed1"}},{"arxiv_id":"1810.11408","arxiv_id_is_arxiv":true,"paper":"/paper/anytime-stereo-image-depth-estimation-on","title":"Anytime Stereo Image Depth Estimation on Mobile Devices","date":"2018-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mileyan/AnyNet","path":"dataloader/readpfm.py","file_url":"https://github.com/mileyan/AnyNet/blob/HEAD/dataloader/readpfm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aaea02c311c902eb","code_sha256_prefix":"aaea02c311c902eb","mcp_get_code":{"code_sha256":"aaea02c311c902eb"}},{"arxiv_id":"1409.1556","arxiv_id_is_arxiv":true,"paper":"/paper/very-deep-convolutional-networks-for-large","title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","date":"2014-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vwegn/dm","path":"flow_IO.py","file_url":"https://github.com/vwegn/dm/blob/HEAD/flow_IO.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0564ba38597daf7c","code_sha256_prefix":"0564ba38597daf7c","mcp_get_code":{"code_sha256":"0564ba38597daf7c"}},{"arxiv_id":"aaai_20056","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20056","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SpadeLiu/Lac-GwcNet","path":"dataloader/readpfm.py","file_url":"https://github.com/SpadeLiu/Lac-GwcNet/blob/HEAD/dataloader/readpfm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"973b549613a75154","code_sha256_prefix":"973b549613a75154","mcp_get_code":{"code_sha256":"973b549613a75154"}},{"arxiv_id":"Zeng_Parameterized_Cost_Volume_for_Stereo_Matching_ICCV_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Zeng_Parameterized_Cost_Volume_for_Stereo_Matching_ICCV_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jiaxiZeng/Parameterized-Cost-Volume-for-Stereo-Matching","path":"core/utils/frame_utils.py","file_url":"https://github.com/jiaxiZeng/Parameterized-Cost-Volume-for-Stereo-Matching/blob/HEAD/core/utils/frame_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7c3fbc1f552de802","code_sha256_prefix":"7c3fbc1f552de802","mcp_get_code":{"code_sha256":"7c3fbc1f552de802"}}],"record_sha256":"ece916ade75ae1573490c8ae7848e7f4563e08eb4edda324e74c836c56e4e9f7","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}