{"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/file-exists","entry":"file_exists","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":8,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"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":7,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":1,"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":3,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":1},"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":"2606.16979","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-16979","title":"Scalable Pairwise Kernel Learning with Stochastic Vec Trick","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"napsu/SPaiK","path":"src/pkl_utility.py","file_url":"https://github.com/napsu/SPaiK/blob/HEAD/src/pkl_utility.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c29f7ec249369df9","code_sha256_prefix":"c29f7ec249369df9","mcp_get_code":{"code_sha256":"c29f7ec249369df9"}},{"arxiv_id":"2402.13113","arxiv_id_is_arxiv":true,"paper":"/paper/when-only-time-will-tell-interpreting-how","title":"When Only Time Will Tell: Interpreting How Transformers Process Local Ambiguities Through the Lens of Restart-Incrementality","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Unipisa/diaparser","path":"diaparser/catalog/catalog.py","file_url":"https://github.com/Unipisa/diaparser/blob/HEAD/diaparser/catalog/catalog.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"979c2e9be614046b","code_sha256_prefix":"979c2e9be614046b","mcp_get_code":{"code_sha256":"979c2e9be614046b"}},{"arxiv_id":"2311.04678","arxiv_id_is_arxiv":true,"paper":"/paper/weakly-supervised-cross-model-learning-in","title":"Weakly supervised cross-modal learning in high-content screening","date":"2023-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gwatkinson/jump_download","path":"jump_download/sanity_check.py","file_url":"https://github.com/gwatkinson/jump_download/blob/HEAD/jump_download/sanity_check.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":"fa041abf8807401e","code_sha256_prefix":"fa041abf8807401e","mcp_get_code":{"code_sha256":"fa041abf8807401e"}},{"arxiv_id":"2306.17723","arxiv_id_is_arxiv":true,"paper":"/paper/flipnerf-flipped-reflection-rays-for-few-shot","title":"FlipNeRF: Flipped Reflection Rays for Few-shot Novel View Synthesis","date":"2023-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shawn615/FlipNeRF","path":"internal/utils.py","file_url":"https://github.com/shawn615/FlipNeRF/blob/HEAD/internal/utils.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":"c850aeef1fd46daa","code_sha256_prefix":"c850aeef1fd46daa","mcp_get_code":{"code_sha256":"c850aeef1fd46daa"}},{"arxiv_id":"2302.08788","arxiv_id_is_arxiv":true,"paper":"/paper/mixnerf-modeling-a-ray-with-mixture-density","title":"MixNeRF: Modeling a Ray with Mixture Density for Novel View Synthesis from Sparse Inputs","date":"2023-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shawn615/MixNeRF","path":"internal/utils.py","file_url":"https://github.com/shawn615/MixNeRF/blob/HEAD/internal/utils.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":"c850aeef1fd46daa","code_sha256_prefix":"c850aeef1fd46daa","mcp_get_code":{"code_sha256":"c850aeef1fd46daa"}},{"arxiv_id":"2211.00593","arxiv_id_is_arxiv":true,"paper":"/paper/interpretability-in-the-wild-a-circuit-for","title":"Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 small","date":"2022-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openai/transformer-debugger","path":"neuron_explainer/file_utils.py","file_url":"https://github.com/openai/transformer-debugger/blob/HEAD/neuron_explainer/file_utils.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":"3bf23c5e5bb20c36","code_sha256_prefix":"3bf23c5e5bb20c36","mcp_get_code":{"code_sha256":"3bf23c5e5bb20c36"}},{"arxiv_id":"2103.13415","arxiv_id_is_arxiv":true,"paper":"/paper/mip-nerf-a-multiscale-representation-for-anti","title":"Mip-NeRF: A Multiscale Representation for Anti-Aliasing Neural Radiance Fields","date":"2021-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google/mipnerf","path":"internal/utils.py","file_url":"https://github.com/google/mipnerf/blob/HEAD/internal/utils.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":"3e443b753d374fda","code_sha256_prefix":"3e443b753d374fda","mcp_get_code":{"code_sha256":"3e443b753d374fda"}},{"arxiv_id":"1812.01276","arxiv_id_is_arxiv":true,"paper":"/paper/time-is-of-the-essence-a-joint-hierarchical","title":"Time is of the Essence: a Joint Hierarchical RNN and Point Process Model for Time and Item Predictions","date":"2018-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BjornarVass/Recsys","path":"preprocess_general.py","file_url":"https://github.com/BjornarVass/Recsys/blob/HEAD/preprocess_general.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, BjornarVass/Recsys when it was checked","code_sha256":"f375518ad291cb28","code_sha256_prefix":"f375518ad291cb28","mcp_get_code":{"code_sha256":"f375518ad291cb28"}}],"record_sha256":"ca4a3342b839a0630c906b88881dd1613c894848794d819ff089ca35e73c72e3","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}