{"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/get-anyres-image-grid-shape","entry":"get_anyres_image_grid_shape","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":0,"n_papers_ran_instrument_only":4,"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":5,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"n_places_pointer_only_link_open":1,"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":1,"ran_fixture":2,"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":"2606.00535","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-00535","title":"DREAM-S: Speculative Decoding with Searchable Drafting and Target-Aware Refinement for Multimodal Generation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"SAI-Lab-NYU/DREAM-S","path":"dream_s/model/modeling_llava_next.py","file_url":"https://github.com/SAI-Lab-NYU/DREAM-S/blob/HEAD/dream_s/model/modeling_llava_next.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, SAI-Lab-NYU/DREAM-S when it was checked","code_sha256":"7e5d8d5db6a63859","code_sha256_prefix":"7e5d8d5db6a63859","mcp_get_code":{"code_sha256":"7e5d8d5db6a63859"}},{"arxiv_id":"2503.11187","arxiv_id_is_arxiv":true,"paper":"/paper/fastvid-dynamic-density-pruning-for-fast","title":"FastVID: Dynamic Density Pruning for Fast Video Large Language Models","date":"2025-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cokeshao/holitom","path":"holitom/llava_arch.py","file_url":"https://github.com/cokeshao/holitom/blob/HEAD/holitom/llava_arch.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dd90994dc116b84b","code_sha256_prefix":"dd90994dc116b84b","mcp_get_code":{"code_sha256":"dd90994dc116b84b"}},{"arxiv_id":"2408.10945","arxiv_id_is_arxiv":true,"paper":"/paper/hired-attention-guided-token-dropping-for","title":"HiRED: Attention-Guided Token Dropping for Efficient Inference of High-Resolution Vision-Language Models","date":"2024-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hasanar1f/hired","path":"transformers/src/transformers/models/llava_next/modeling_llava_next.py","file_url":"https://github.com/hasanar1f/hired/blob/HEAD/transformers/src/transformers/models/llava_next/modeling_llava_next.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":"84035f2c3da335dd","code_sha256_prefix":"84035f2c3da335dd","mcp_get_code":{"code_sha256":"84035f2c3da335dd"}},{"arxiv_id":"2408.08849","arxiv_id_is_arxiv":true,"paper":"/paper/ecg-chat-a-large-ecg-language-model-for","title":"ECG-Chat: A Large ECG-Language Model for Cardiac Disease Diagnosis","date":"2024-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YubaoZhao/ECG-Chat","path":"llava/llava/mm_utils.py","file_url":"https://github.com/YubaoZhao/ECG-Chat/blob/HEAD/llava/llava/mm_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, YubaoZhao/ECG-Chat when it was checked","code_sha256":"fe18e00416933036","code_sha256_prefix":"fe18e00416933036","mcp_get_code":{"code_sha256":"fe18e00416933036"}},{"arxiv_id":"2304.08485","arxiv_id_is_arxiv":true,"paper":"/paper/visual-instruction-tuning-1","title":"Visual Instruction Tuning","date":"2023-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haotian-liu/LLaVA","path":"llava/model/language_model/llava_llama.py","file_url":"https://github.com/haotian-liu/LLaVA/blob/HEAD/llava/model/language_model/llava_llama.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2ff0d742a84cb8e2","code_sha256_prefix":"2ff0d742a84cb8e2","mcp_get_code":{"code_sha256":"2ff0d742a84cb8e2"}},{"arxiv_id":"2025.findings-acl.433","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.433","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"haon-chen/mmE5","path":"src/vlm_backbone/llava_next/modeling_llava_next.py","file_url":"https://github.com/haon-chen/mmE5/blob/HEAD/src/vlm_backbone/llava_next/modeling_llava_next.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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 SAI-Lab-NYU/DREAM-S, and GitHub detected no licence in that repository when it was checked","code_sha256":"7e5d8d5db6a63859","code_sha256_prefix":"7e5d8d5db6a63859","mcp_get_code":{"code_sha256":"7e5d8d5db6a63859"}}],"record_sha256":"692017aa035864250999b098e9cb8118b7dbc195670437b23981b9ad48a4cb25","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}