{"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/load-url-dist","entry":"load_url_dist","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":0,"n_papers_ran_no_instrument_failure":0,"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":2,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":8,"n_places_pointer_only_link_open":3,"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":0,"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":"2410.14980","arxiv_id_is_arxiv":true,"paper":"/paper/dcdepth-progressive-monocular-depth","title":"DCDepth: Progressive Monocular Depth Estimation in Discrete Cosine Domain","date":"2024-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"w2kun/DCDepth","path":"networks/newcrf_utils.py","file_url":"https://github.com/w2kun/DCDepth/blob/HEAD/networks/newcrf_utils.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, w2kun/DCDepth when it was checked","code_sha256":"92dad73ee855852f","code_sha256_prefix":"92dad73ee855852f","mcp_get_code":{"code_sha256":"92dad73ee855852f"}},{"arxiv_id":"2404.03635","arxiv_id_is_arxiv":true,"paper":"/paper/wordepth-variational-language-prior-for","title":"WorDepth: Variational Language Prior for Monocular Depth Estimation","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Adonis-galaxy/WorDepth","path":"src/networks/wordepth.py","file_url":"https://github.com/Adonis-galaxy/WorDepth/blob/HEAD/src/networks/wordepth.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, Adonis-galaxy/WorDepth when it was checked","code_sha256":"3b1a511338023426","code_sha256_prefix":"3b1a511338023426","mcp_get_code":{"code_sha256":"3b1a511338023426"}},{"arxiv_id":"2404.03635","arxiv_id_is_arxiv":true,"paper":"/paper/wordepth-variational-language-prior-for","title":"WorDepth: Variational Language Prior for Monocular Depth Estimation","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adonis-galaxy/wordepth","path":"src/networks/utils.py","file_url":"https://github.com/adonis-galaxy/wordepth/blob/HEAD/src/networks/utils.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, adonis-galaxy/wordepth when it was checked","code_sha256":"92dad73ee855852f","code_sha256_prefix":"92dad73ee855852f","mcp_get_code":{"code_sha256":"92dad73ee855852f"}},{"arxiv_id":"2311.07166","arxiv_id_is_arxiv":true,"paper":"/paper/nddepth-normal-distance-assisted-monocular-1","title":"NDDepth: Normal-Distance Assisted Monocular Depth Estimation and Completion","date":"2023-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShuweiShao/NDDepth","path":"Estimation/nddepth/networks/newcrf_utils.py","file_url":"https://github.com/ShuweiShao/NDDepth/blob/HEAD/Estimation/nddepth/networks/newcrf_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from w2kun/DCDepth, and GitHub detected no licence in that repository when it was checked","code_sha256":"92dad73ee855852f","code_sha256_prefix":"92dad73ee855852f","mcp_get_code":{"code_sha256":"92dad73ee855852f"}},{"arxiv_id":"2309.14137","arxiv_id_is_arxiv":true,"paper":"/paper/iebins-iterative-elastic-bins-for-monocular-1","title":"IEBins: Iterative Elastic Bins for Monocular Depth Estimation","date":"2023-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShuweiShao/IEBins","path":"iebins/networks/newcrf_utils.py","file_url":"https://github.com/ShuweiShao/IEBins/blob/HEAD/iebins/networks/newcrf_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from w2kun/DCDepth, and GitHub detected no licence in that repository when it was checked","code_sha256":"92dad73ee855852f","code_sha256_prefix":"92dad73ee855852f","mcp_get_code":{"code_sha256":"92dad73ee855852f"}},{"arxiv_id":"2302.08149","arxiv_id_is_arxiv":true,"paper":"/paper/urcdc-depth-uncertainty-rectified-cross","title":"URCDC-Depth: Uncertainty Rectified Cross-Distillation with CutFlip for Monocular Depth Estimation","date":"2023-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shuweishao/urcdc-depth","path":"urcdc/networks/newcrf_utils.py","file_url":"https://github.com/shuweishao/urcdc-depth/blob/HEAD/urcdc/networks/newcrf_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from w2kun/DCDepth, and GitHub detected no licence in that repository when it was checked","code_sha256":"92dad73ee855852f","code_sha256_prefix":"92dad73ee855852f","mcp_get_code":{"code_sha256":"92dad73ee855852f"}},{"arxiv_id":"2210.09071","arxiv_id_is_arxiv":true,"paper":"/paper/attention-attention-everywhere-monocular","title":"Attention Attention Everywhere: Monocular Depth Prediction with Skip Attention","date":"2022-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ashutosh1807/pixelformer","path":"pixelformer/networks/utils.py","file_url":"https://github.com/ashutosh1807/pixelformer/blob/HEAD/pixelformer/networks/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, ashutosh1807/pixelformer, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"92dad73ee855852f","code_sha256_prefix":"92dad73ee855852f","mcp_get_code":{"code_sha256":"92dad73ee855852f"}},{"arxiv_id":"2203.01502","arxiv_id_is_arxiv":true,"paper":"/paper/new-crfs-neural-window-fully-connected-crfs-1","title":"NeW CRFs: Neural Window Fully-connected CRFs for Monocular Depth Estimation","date":"2022-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aliyun/NeWCRFs","path":"newcrfs/networks/newcrf_utils.py","file_url":"https://github.com/aliyun/NeWCRFs/blob/HEAD/newcrfs/networks/newcrf_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, aliyun/NeWCRFs, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"92dad73ee855852f","code_sha256_prefix":"92dad73ee855852f","mcp_get_code":{"code_sha256":"92dad73ee855852f"}}],"record_sha256":"d26b9261006c8b299b4bf65802a91a7a89138d5e94db4a8601e6370bf21872db","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}