{"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-depth","entry":"get_depth","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":2,"n_papers_ran_no_instrument_failure":2,"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":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":5,"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":2,"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":"2505.15185","arxiv_id_is_arxiv":true,"paper":"/paper/monosplat-generalizable-3d-gaussian-splatting","title":"MonoSplat: Generalizable 3D Gaussian Splatting from Monocular Depth Foundation Models","date":"2025-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CUHK-AIM-Group/MonoSplat","path":"src/geometry/epipolar_lines.py","file_url":"https://github.com/CUHK-AIM-Group/MonoSplat/blob/HEAD/src/geometry/epipolar_lines.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":"46a9932db8763d5a","code_sha256_prefix":"46a9932db8763d5a","mcp_get_code":{"code_sha256":"46a9932db8763d5a"}},{"arxiv_id":"2409.19967","arxiv_id_is_arxiv":true,"paper":"/paper/magnet-we-never-know-how-text-to-image","title":"Magnet: We Never Know How Text-to-Image Diffusion Models Work, Until We Learn How Vision-Language Models Function","date":"2024-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"I2-Multimedia-Lab/Magnet","path":"run_with_controlnet.py","file_url":"https://github.com/I2-Multimedia-Lab/Magnet/blob/HEAD/run_with_controlnet.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, I2-Multimedia-Lab/Magnet when it was checked","code_sha256":"d2e162bceb23fb8b","code_sha256_prefix":"d2e162bceb23fb8b","mcp_get_code":{"code_sha256":"d2e162bceb23fb8b"}},{"arxiv_id":"2312.12337","arxiv_id_is_arxiv":true,"paper":"/paper/pixelsplat-3d-gaussian-splats-from-image","title":"pixelSplat: 3D Gaussian Splats from Image Pairs for Scalable Generalizable 3D Reconstruction","date":"2023-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dcharatan/pixelsplat","path":"src/geometry/epipolar_lines.py","file_url":"https://github.com/dcharatan/pixelsplat/blob/HEAD/src/geometry/epipolar_lines.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":"46a9932db8763d5a","code_sha256_prefix":"46a9932db8763d5a","mcp_get_code":{"code_sha256":"46a9932db8763d5a"}},{"arxiv_id":"2308.11928","arxiv_id_is_arxiv":true,"paper":"/paper/ofvl-ms-once-for-visual-localization-across","title":"OFVL-MS: Once for Visual Localization across Multiple Indoor Scenes","date":"2023-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mooncake199809/UFVL-Net","path":"ufvl_net/datasets/seven_scenes.py","file_url":"https://github.com/mooncake199809/UFVL-Net/blob/HEAD/ufvl_net/datasets/seven_scenes.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, mooncake199809/UFVL-Net when it was checked","code_sha256":"8c687975217ab5d5","code_sha256_prefix":"8c687975217ab5d5","mcp_get_code":{"code_sha256":"8c687975217ab5d5"}},{"arxiv_id":"2109.09628","arxiv_id_is_arxiv":true,"paper":"/paper/advancing-self-supervised-monocular-depth","title":"Advancing Self-supervised Monocular Depth Learning with Sparse LiDAR","date":"2021-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AutoAILab/FusionDepth","path":"gen2cha_completion.py","file_url":"https://github.com/AutoAILab/FusionDepth/blob/HEAD/gen2cha_completion.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":"13035b58e28992f7","code_sha256_prefix":"13035b58e28992f7","mcp_get_code":{"code_sha256":"13035b58e28992f7"}}],"record_sha256":"d5758e78cce012512d171f718e5dbf1774db2d80fbdf1ca56dca48213db070f0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}