{"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/find-path","entry":"find_path","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":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":1,"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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":6,"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":1,"ran":3,"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":"2311.15732","arxiv_id_is_arxiv":true,"paper":"/paper/gpt4vis-what-can-gpt-4-do-for-zero-shot","title":"GPT4Vis: What Can GPT-4 Do for Zero-shot Visual Recognition?","date":"2023-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"whwu95/GPT4Vis","path":"config_path.py","file_url":"https://github.com/whwu95/GPT4Vis/blob/HEAD/config_path.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":"861471c7e955d754","code_sha256_prefix":"861471c7e955d754","mcp_get_code":{"code_sha256":"861471c7e955d754"}},{"arxiv_id":"2310.10704","arxiv_id_is_arxiv":true,"paper":"/paper/optimized-tokenization-for-transcribed-error","title":"Optimized Tokenization for Transcribed Error Correction","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google/sentencepiece","path":"lite/amalgamate.py","file_url":"https://github.com/google/sentencepiece/blob/HEAD/lite/amalgamate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1bb442f626c04c70","code_sha256_prefix":"1bb442f626c04c70","mcp_get_code":{"code_sha256":"1bb442f626c04c70"}},{"arxiv_id":"2306.05401","arxiv_id_is_arxiv":true,"paper":"/paper/rdumb-a-simple-approach-that-questions-our-1","title":"RDumb: A simple approach that questions our progress in continual test-time adaptation","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oripress/ccc","path":"generate.py","file_url":"https://github.com/oripress/ccc/blob/HEAD/generate.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d72aff7ada7f2b7b","code_sha256_prefix":"d72aff7ada7f2b7b","mcp_get_code":{"code_sha256":"d72aff7ada7f2b7b"}},{"arxiv_id":"2202.04599","arxiv_id_is_arxiv":true,"paper":"/paper/missing-data-imputation-and-acquisition-with","title":"Missing Data Imputation and Acquisition with Deep Hierarchical Models and Hamiltonian Monte Carlo","date":"2022-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ipeis/HH-VAEM","path":"src/load_models.py","file_url":"https://github.com/ipeis/HH-VAEM/blob/HEAD/src/load_models.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":"b2e25fb00193df4f","code_sha256_prefix":"b2e25fb00193df4f","mcp_get_code":{"code_sha256":"b2e25fb00193df4f"}},{"arxiv_id":"2107.10970","arxiv_id_is_arxiv":true,"paper":"/paper/the-decomposition-of-the-higher-order","title":"The decomposition of the higher-order homology embedding constructed from the $k$-Laplacian","date":"2021-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuchaz/homology_emb","path":"homology_emb/cycles.py","file_url":"https://github.com/yuchaz/homology_emb/blob/HEAD/homology_emb/cycles.py","status":"ran","verification_level":1,"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":"c6b62f4263593568","code_sha256_prefix":"c6b62f4263593568","mcp_get_code":{"code_sha256":"c6b62f4263593568"}},{"arxiv_id":"aaai_20553","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20553","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"wylee/Dijkstar","path":"src/dijkstar/algorithm.py","file_url":"https://github.com/wylee/Dijkstar/blob/HEAD/src/dijkstar/algorithm.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":"58b8430f629ef315","code_sha256_prefix":"58b8430f629ef315","mcp_get_code":{"code_sha256":"58b8430f629ef315"}}],"record_sha256":"4bc649458ea24f221ec56edc6ec54874a8579a84990303ef288505e34b17cc53","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}