{"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/show-image","entry":"show_image","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":4,"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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":6,"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":0,"ran":4,"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":"2406.12814","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-attacks-on-multimodal-agents","title":"Dissecting Adversarial Robustness of Multimodal LM Agents","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChenWu98/agent-attack","path":"agent_attack/util/image_handling.py","file_url":"https://github.com/ChenWu98/agent-attack/blob/HEAD/agent_attack/util/image_handling.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":"014944e169d043ef","code_sha256_prefix":"014944e169d043ef","mcp_get_code":{"code_sha256":"014944e169d043ef"}},{"arxiv_id":"2405.02793","arxiv_id_is_arxiv":true,"paper":"/paper/imageinwords-unlocking-hyper-detailed-image","title":"ImageInWords: Unlocking Hyper-Detailed Image Descriptions","date":"2024-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-deepmind/proactive_t2i_agents","path":"agent/image_utils.py","file_url":"https://github.com/google-deepmind/proactive_t2i_agents/blob/HEAD/agent/image_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":"dce5b9144b3351bc","code_sha256_prefix":"dce5b9144b3351bc","mcp_get_code":{"code_sha256":"dce5b9144b3351bc"}},{"arxiv_id":"2402.06191","arxiv_id_is_arxiv":true,"paper":"/paper/the-berkeley-single-cell-computational","title":"The Berkeley Single Cell Computational Microscopy (BSCCM) Dataset","date":"2024-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"waller-lab/bsccm","path":"bsccm/creation/plot_util.py","file_url":"https://github.com/waller-lab/bsccm/blob/HEAD/bsccm/creation/plot_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f17e3af3cae2563d","code_sha256_prefix":"f17e3af3cae2563d","mcp_get_code":{"code_sha256":"f17e3af3cae2563d"}},{"arxiv_id":"2310.15061","arxiv_id_is_arxiv":true,"paper":"/paper/the-bla-benchmark-investigating-basic","title":"The BLA Benchmark: Investigating Basic Language Abilities of Pre-Trained Multimodal Models","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shin-ee-chen/BLA","path":"evaluation_models/clip/utils.py","file_url":"https://github.com/shin-ee-chen/BLA/blob/HEAD/evaluation_models/clip/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":"e7c98e8f0375bb0f","code_sha256_prefix":"e7c98e8f0375bb0f","mcp_get_code":{"code_sha256":"e7c98e8f0375bb0f"}},{"arxiv_id":"2109.12218","arxiv_id_is_arxiv":true,"paper":"/paper/long-range-transformers-for-dynamic","title":"Long-Range Transformers for Dynamic Spatiotemporal Forecasting","date":"2021-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qdata/spacetimeformer","path":"spacetimeformer/plot.py","file_url":"https://github.com/qdata/spacetimeformer/blob/HEAD/spacetimeformer/plot.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":"1afe2c606d53b4b8","code_sha256_prefix":"1afe2c606d53b4b8","mcp_get_code":{"code_sha256":"1afe2c606d53b4b8"}},{"arxiv_id":"1612.01105","arxiv_id_is_arxiv":true,"paper":"/paper/pyramid-scene-parsing-network","title":"Pyramid Scene Parsing Network","date":"2016-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AnirudhAchal/Human-Parsing","path":"inference.py","file_url":"https://github.com/AnirudhAchal/Human-Parsing/blob/HEAD/inference.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, AnirudhAchal/Human-Parsing when it was checked","code_sha256":"3ac84d37ba5ffd7e","code_sha256_prefix":"3ac84d37ba5ffd7e","mcp_get_code":{"code_sha256":"3ac84d37ba5ffd7e"}}],"record_sha256":"e40bc4fcb13337643b941098ef2633d63aa0baaaaa051505151b7902ef34c667","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}