{"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/get-pixel-grids","entry":"get_pixel_grids","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":5,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":5,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"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":"2303.11989","arxiv_id_is_arxiv":true,"paper":"/paper/text2room-extracting-textured-3d-meshes-from","title":"Text2Room: Extracting Textured 3D Meshes from 2D Text-to-Image Models","date":"2023-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lukashoel/text2room","path":"model/mesh_fusion/util.py","file_url":"https://github.com/lukashoel/text2room/blob/HEAD/model/mesh_fusion/util.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":"721d622f67a06ca3","code_sha256_prefix":"721d622f67a06ca3","mcp_get_code":{"code_sha256":"721d622f67a06ca3"}},{"arxiv_id":"2108.09964","arxiv_id_is_arxiv":true,"paper":"/paper/learning-signed-distance-field-for-multi-view","title":"Learning Signed Distance Field for Multi-view Surface Reconstruction","date":"2021-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jzhangbs/MVSDF","path":"code/model/implicit_differentiable_renderer.py","file_url":"https://github.com/jzhangbs/MVSDF/blob/HEAD/code/model/implicit_differentiable_renderer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e3df656c5b4c9cc6","code_sha256_prefix":"e3df656c5b4c9cc6","mcp_get_code":{"code_sha256":"e3df656c5b4c9cc6"}},{"arxiv_id":"2003.13017","arxiv_id_is_arxiv":true,"paper":"/paper/fast-mvsnet-sparse-to-dense-multi-view-stereo","title":"Fast-MVSNet: Sparse-to-Dense Multi-View Stereo With Learned Propagation and Gauss-Newton Refinement","date":"2020-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"svip-lab/FastMVSNet","path":"fastmvsnet/functions/functions.py","file_url":"https://github.com/svip-lab/FastMVSNet/blob/HEAD/fastmvsnet/functions/functions.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":"c1d5bc61af47dd3d","code_sha256_prefix":"c1d5bc61af47dd3d","mcp_get_code":{"code_sha256":"c1d5bc61af47dd3d"}},{"arxiv_id":"1902.10556","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-mvsnet-for-high-resolution-multi","title":"Recurrent MVSNet for High-resolution Multi-view Stereo Depth Inference","date":"2019-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YoYo000/MVSNet","path":"mvsnet/homography_warping.py","file_url":"https://github.com/YoYo000/MVSNet/blob/HEAD/mvsnet/homography_warping.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":"65b4ef5776e10fbc","code_sha256_prefix":"65b4ef5776e10fbc","mcp_get_code":{"code_sha256":"65b4ef5776e10fbc"}},{"arxiv_id":"Mi_Generalized_Binary_Search_Network_for_Highly-Efficient_Multi-View_Stereo_CVPR_2022_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Mi_Generalized_Binary_Search_Network_for_Highly-Efficient_Multi-View_Stereo_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"MiZhenxing/GBi-Net","path":"modules/gbinet_submodules.py","file_url":"https://github.com/MiZhenxing/GBi-Net/blob/HEAD/modules/gbinet_submodules.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":"c1d5bc61af47dd3d","code_sha256_prefix":"c1d5bc61af47dd3d","mcp_get_code":{"code_sha256":"c1d5bc61af47dd3d"}}],"record_sha256":"01e2e7feb1c63cc5c038c2951dbfccafa60554d29feab776f5082de0c16dae2c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}