{"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/disparity-loader","entry":"disparity_loader","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":7,"n_papers_ran_no_instrument_failure":7,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":0,"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":4,"unverified":1},"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":"2209.12699","arxiv_id_is_arxiv":true,"paper":"/paper/accurate-and-efficient-stereo-matching-via","title":"Accurate and Efficient Stereo Matching via Attention Concatenation Volume","date":"2022-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gangweix/fast-acvnet","path":"datasets/MiddleburyLoader.py","file_url":"https://github.com/gangweix/fast-acvnet/blob/HEAD/datasets/MiddleburyLoader.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":"6f290af6f9436c6b","code_sha256_prefix":"6f290af6f9436c6b","mcp_get_code":{"code_sha256":"6f290af6f9436c6b"}},{"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/MiddleburyLoader.py","file_url":"https://github.com/gallenszl/MSMD-Net/blob/HEAD/datasets/MiddleburyLoader.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":"6f290af6f9436c6b","code_sha256_prefix":"6f290af6f9436c6b","mcp_get_code":{"code_sha256":"6f290af6f9436c6b"}},{"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/KITTILoader_dataset3d.py","file_url":"https://github.com/Div99/W-Stereo-Disp/blob/HEAD/src/disp_dataloader/KITTILoader_dataset3d.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":"8d9f5f6ce951aa15","code_sha256_prefix":"8d9f5f6ce951aa15","mcp_get_code":{"code_sha256":"8d9f5f6ce951aa15"}},{"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/SceneFlowLoader.py","file_url":"https://github.com/Div99/W-Stereo-Disp/blob/HEAD/src/disp_dataloader/SceneFlowLoader.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":"aaf877e27c4a3c3e","code_sha256_prefix":"aaf877e27c4a3c3e","mcp_get_code":{"code_sha256":"aaf877e27c4a3c3e"}},{"arxiv_id":"1911.04460","arxiv_id_is_arxiv":true,"paper":"/paper/360sd-net-360-stereo-depth-estimation-with","title":"360SD-Net: 360° Stereo Depth Estimation with Learnable Cost Volume","date":"2019-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"albert100121/360SD-Net","path":"dataloader/RGB_Loader.py","file_url":"https://github.com/albert100121/360SD-Net/blob/HEAD/dataloader/RGB_Loader.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":"65d90cc99b34e88e","code_sha256_prefix":"65d90cc99b34e88e","mcp_get_code":{"code_sha256":"65d90cc99b34e88e"}},{"arxiv_id":"1906.06310","arxiv_id_is_arxiv":true,"paper":"/paper/pseudo-lidar-accurate-depth-for-3d-object","title":"Pseudo-LiDAR++: Accurate Depth for 3D Object Detection in Autonomous Driving","date":"2019-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mileyan/Pseudo_Lidar_V2","path":"src/dataloader/KITTILoader_dataset3d.py","file_url":"https://github.com/mileyan/Pseudo_Lidar_V2/blob/HEAD/src/dataloader/KITTILoader_dataset3d.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":"8d9f5f6ce951aa15","code_sha256_prefix":"8d9f5f6ce951aa15","mcp_get_code":{"code_sha256":"8d9f5f6ce951aa15"}},{"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":"mamoanwar97/Anynet_modified","path":"dataloader/KITTILoader3D.py","file_url":"https://github.com/mamoanwar97/Anynet_modified/blob/HEAD/dataloader/KITTILoader3D.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":"8d9f5f6ce951aa15","code_sha256_prefix":"8d9f5f6ce951aa15","mcp_get_code":{"code_sha256":"8d9f5f6ce951aa15"}},{"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/KITTILoader.py","file_url":"https://github.com/mileyan/AnyNet/blob/HEAD/dataloader/KITTILoader.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":"c0ce2ceaa41309b3","code_sha256_prefix":"c0ce2ceaa41309b3","mcp_get_code":{"code_sha256":"c0ce2ceaa41309b3"}},{"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/SecenFlowLoader.py","file_url":"https://github.com/mileyan/AnyNet/blob/HEAD/dataloader/SecenFlowLoader.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":"aaf877e27c4a3c3e","code_sha256_prefix":"aaf877e27c4a3c3e","mcp_get_code":{"code_sha256":"aaf877e27c4a3c3e"}},{"arxiv_id":"1803.08669","arxiv_id_is_arxiv":true,"paper":"/paper/pyramid-stereo-matching-network","title":"Pyramid Stereo Matching Network","date":"2018-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JiaRenChang/PSMNet","path":"dataloader/KITTILoader.py","file_url":"https://github.com/JiaRenChang/PSMNet/blob/HEAD/dataloader/KITTILoader.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":"c0ce2ceaa41309b3","code_sha256_prefix":"c0ce2ceaa41309b3","mcp_get_code":{"code_sha256":"c0ce2ceaa41309b3"}},{"arxiv_id":"1803.08669","arxiv_id_is_arxiv":true,"paper":"/paper/pyramid-stereo-matching-network","title":"Pyramid Stereo Matching Network","date":"2018-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JiaRenChang/PSMNet","path":"dataloader/SecenFlowLoader.py","file_url":"https://github.com/JiaRenChang/PSMNet/blob/HEAD/dataloader/SecenFlowLoader.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":"aaf877e27c4a3c3e","code_sha256_prefix":"aaf877e27c4a3c3e","mcp_get_code":{"code_sha256":"aaf877e27c4a3c3e"}}],"record_sha256":"afd7a48c647b3f114206ed22ed0b346838d575515a7857669a7bfda301ba81b7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}