{"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/preprocess-images","entry":"preprocess_images","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":6,"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":7,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":0,"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":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":5,"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":"2602.20459","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-20459","title":"PRESCIENCE: A Dataset and Benchmark for Scientific Forecasting","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"RomGai/BrainVis","path":"evaluate_GA.py","file_url":"https://github.com/RomGai/BrainVis/blob/HEAD/evaluate_GA.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"704d18c7ee43b72e","code_sha256_prefix":"704d18c7ee43b72e","mcp_get_code":{"code_sha256":"704d18c7ee43b72e"}},{"arxiv_id":"2405.01533","arxiv_id_is_arxiv":true,"paper":"/paper/omnidrive-a-holistic-llm-agent-framework-for","title":"OmniDrive: A Holistic Vision-Language Dataset for Autonomous Driving with Counterfactual Reasoning","date":"2024-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nvlabs/omnidrive","path":"data_gen/conversation.py","file_url":"https://github.com/nvlabs/omnidrive/blob/HEAD/data_gen/conversation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, nvlabs/omnidrive (NOASSERTION)","code_sha256":"a5b09e5b75425e5f","code_sha256_prefix":"a5b09e5b75425e5f","mcp_get_code":{"code_sha256":"a5b09e5b75425e5f"}},{"arxiv_id":"2402.12688","arxiv_id_is_arxiv":true,"paper":"/paper/robust-wide-robust-watermarking-against","title":"Robust-Wide: Robust Watermarking against Instruction-driven Image Editing","date":null,"month_inferred_from_arxiv_id":"2024-02","title_source":"archive","repo":"hurunyi/robust-wide","path":"dataset.py","file_url":"https://github.com/hurunyi/robust-wide/blob/HEAD/dataset.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":"6bcd7bd2081d9725","code_sha256_prefix":"6bcd7bd2081d9725","mcp_get_code":{"code_sha256":"6bcd7bd2081d9725"}},{"arxiv_id":"2212.05925","arxiv_id_is_arxiv":true,"paper":"/paper/causalegm-a-general-causal-inference","title":"CausalEGM: a general causal inference framework by encoding generative modeling","date":"2022-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kimmo1019/Roundtrip","path":"src/pyroundtrip/util.py","file_url":"https://github.com/kimmo1019/Roundtrip/blob/HEAD/src/pyroundtrip/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":"b57d6aa19be1ae12","code_sha256_prefix":"b57d6aa19be1ae12","mcp_get_code":{"code_sha256":"b57d6aa19be1ae12"}},{"arxiv_id":"2211.10282","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-through-random-curiosity-with","title":"Exploring through Random Curiosity with General Value Functions","date":"2022-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aditya-ramesh-10/exploring-through-rcgvf","path":"mgrid_utils/format.py","file_url":"https://github.com/aditya-ramesh-10/exploring-through-rcgvf/blob/HEAD/mgrid_utils/format.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":"aae66f156a5e4829","code_sha256_prefix":"aae66f156a5e4829","mcp_get_code":{"code_sha256":"aae66f156a5e4829"}},{"arxiv_id":"2103.11521","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-frechet-inception-distance","title":"Conditional Frechet Inception Distance","date":"2021-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Michael-Soloveitchik/CFID","path":"evaluate_models.py","file_url":"https://github.com/Michael-Soloveitchik/CFID/blob/HEAD/evaluate_models.py","status":"unverified","verification_level":0,"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":"8c753610a14e69fb","code_sha256_prefix":"8c753610a14e69fb","mcp_get_code":{"code_sha256":"8c753610a14e69fb"}},{"arxiv_id":"1609.01064","arxiv_id_is_arxiv":true,"paper":"/paper/a-deep-multi-level-network-for-saliency","title":"A Deep Multi-Level Network for Saliency Prediction","date":"2016-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marcellacornia/mlnet","path":"utilities.py","file_url":"https://github.com/marcellacornia/mlnet/blob/HEAD/utilities.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":"70150474499bfa2e","code_sha256_prefix":"70150474499bfa2e","mcp_get_code":{"code_sha256":"70150474499bfa2e"}},{"arxiv_id":"aaai_20764","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20764","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Giseung-Park/BlockSeq","path":"code_on_policy_minigrid/utils/format.py","file_url":"https://github.com/Giseung-Park/BlockSeq/blob/HEAD/code_on_policy_minigrid/utils/format.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":"aae66f156a5e4829","code_sha256_prefix":"aae66f156a5e4829","mcp_get_code":{"code_sha256":"aae66f156a5e4829"}}],"record_sha256":"dc1ee32698c3ff2d31c9b96f3f28c5185c63cfd6f47148e45d8118b94c0edcf4","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}