{"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/hourglass","entry":"hourglass","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":1,"n_papers_ran_no_instrument_failure":1,"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":1,"n_samples_constructed":1,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":2,"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":1,"unverified":7},"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.09898","arxiv_id_is_arxiv":true,"paper":"/paper/foundationstereo-zero-shot-stereo-matching","title":"FoundationStereo: Zero-Shot Stereo Matching","date":"2025-01-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/FoundationStereo","path":"core/foundation_stereo.py","file_url":"https://github.com/NVlabs/FoundationStereo/blob/HEAD/core/foundation_stereo.py","status":"unverified","verification_level":0,"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, NVlabs/FoundationStereo (NOASSERTION)","code_sha256":"9a2d5c3211b11558","code_sha256_prefix":"9a2d5c3211b11558","mcp_get_code":{"code_sha256":"9a2d5c3211b11558"}},{"arxiv_id":"2501.09898","arxiv_id_is_arxiv":true,"paper":"/paper/foundationstereo-zero-shot-stereo-matching","title":"FoundationStereo: Zero-Shot Stereo Matching","date":"2025-01-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiandaguo/openstereo","path":"stereo/modeling/models/foundationstereo/core/foundation_stereo.py","file_url":"https://github.com/xiandaguo/openstereo/blob/HEAD/stereo/modeling/models/foundationstereo/core/foundation_stereo.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, xiandaguo/openstereo when it was checked","code_sha256":"fe3bd1e7fff7cb5c","code_sha256_prefix":"fe3bd1e7fff7cb5c","mcp_get_code":{"code_sha256":"fe3bd1e7fff7cb5c"}},{"arxiv_id":"2203.11018","arxiv_id_is_arxiv":true,"paper":"/paper/stereo-neural-vernier-caliper","title":"Stereo Neural Vernier Caliper","date":"2022-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Nicholasli1995/SNVC","path":"snvc/models/vernier.py","file_url":"https://github.com/Nicholasli1995/SNVC/blob/HEAD/snvc/models/vernier.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":"cbc0b5237a72da12","code_sha256_prefix":"cbc0b5237a72da12","mcp_get_code":{"code_sha256":"cbc0b5237a72da12"}},{"arxiv_id":"2203.02146","arxiv_id_is_arxiv":true,"paper":"/paper/acvnet-attention-concatenation-volume-for","title":"Attention Concatenation Volume for Accurate and Efficient Stereo Matching","date":"2022-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gangweiX/ACVNet","path":"models/acv.py","file_url":"https://github.com/gangweiX/ACVNet/blob/HEAD/models/acv.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":"59871f207b1cdeff","code_sha256_prefix":"59871f207b1cdeff","mcp_get_code":{"code_sha256":"59871f207b1cdeff"}},{"arxiv_id":"2201.02263","arxiv_id_is_arxiv":true,"paper":"/paper/itsa-an-information-theoretic-approach-to","title":"ITSA: An Information-Theoretic Approach to Automatic Shortcut Avoidance and Domain Generalization in Stereo Matching Networks","date":"2022-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"waychin-weiqin/ITSA","path":"models/CFNet/stackhourglass.py","file_url":"https://github.com/waychin-weiqin/ITSA/blob/HEAD/models/CFNet/stackhourglass.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":"acda6ac790578411","code_sha256_prefix":"acda6ac790578411","mcp_get_code":{"code_sha256":"acda6ac790578411"}},{"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/CFNet","path":"models/cfnet.py","file_url":"https://github.com/gallenszl/CFNet/blob/HEAD/models/cfnet.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":"8d7de0be86b5a6fe","code_sha256_prefix":"8d7de0be86b5a6fe","mcp_get_code":{"code_sha256":"8d7de0be86b5a6fe"}},{"arxiv_id":"2104.03866","arxiv_id_is_arxiv":true,"paper":"/paper/smd-nets-stereo-mixture-density-networks","title":"SMD-Nets: Stereo Mixture Density Networks","date":"2021-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fabiotosi92/SMD-Nets","path":"lib/model/SMDHead.py","file_url":"https://github.com/fabiotosi92/SMD-Nets/blob/HEAD/lib/model/SMDHead.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":"47c7f7aa6bec2802","code_sha256_prefix":"47c7f7aa6bec2802","mcp_get_code":{"code_sha256":"47c7f7aa6bec2802"}},{"arxiv_id":"1611.05424","arxiv_id_is_arxiv":true,"paper":"/paper/associative-embedding-end-to-end-learning-for","title":"Associative Embedding: End-to-End Learning for Joint Detection and Grouping","date":"2016-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stevehjc/pose-ae-demo-tf","path":"model.py","file_url":"https://github.com/stevehjc/pose-ae-demo-tf/blob/HEAD/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e8d7f1d24ee48e59","code_sha256_prefix":"e8d7f1d24ee48e59","mcp_get_code":{"code_sha256":"e8d7f1d24ee48e59"}}],"record_sha256":"93bed72e7c7a9b66d77a6f53dc5abe8cd13f5a3d4342c5536a03879ce26603c0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}