{"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/processdigitarticle","entry":"processDigitArticle","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":6,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":6,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":6,"n_places_pointer_only":6,"n_places_pointer_only_link_open":2,"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":3,"ran_fixture":0,"ran":0,"unverified":0},"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":"2403.06764","arxiv_id_is_arxiv":true,"paper":"/paper/an-image-is-worth-1-2-tokens-after-layer-2","title":"An Image is Worth 1/2 Tokens After Layer 2: Plug-and-Play Inference Acceleration for Large Vision-Language Models","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pkunlp-icler/fastv","path":"src/FastV/inference/eval/inference_aokvqa.py","file_url":"https://github.com/pkunlp-icler/fastv/blob/HEAD/src/FastV/inference/eval/inference_aokvqa.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, pkunlp-icler/fastv when it was checked","code_sha256":"dd4fbc83b18bbb10","code_sha256_prefix":"dd4fbc83b18bbb10","mcp_get_code":{"code_sha256":"dd4fbc83b18bbb10"}},{"arxiv_id":"2401.03201","arxiv_id_is_arxiv":true,"paper":"/paper/3dmit-3d-multi-modal-instruction-tuning-for","title":"3DMIT: 3D Multi-modal Instruction Tuning for Scene Understanding","date":"2024-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"staymylove/3DMIT","path":"src/cal_scanqa_score.py","file_url":"https://github.com/staymylove/3DMIT/blob/HEAD/src/cal_scanqa_score.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, staymylove/3DMIT when it was checked","code_sha256":"4e436e13094b20cb","code_sha256_prefix":"4e436e13094b20cb","mcp_get_code":{"code_sha256":"4e436e13094b20cb"}},{"arxiv_id":"2311.06411","arxiv_id_is_arxiv":true,"paper":"/paper/analyzing-modular-approaches-for-visual","title":"Analyzing Modular Approaches for Visual Question Decomposition","date":"2023-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brown-palm/visual-question-decomposition","path":"src/eval/vqa.py","file_url":"https://github.com/brown-palm/visual-question-decomposition/blob/HEAD/src/eval/vqa.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"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 pkunlp-icler/fastv, and GitHub detected no licence in that repository when it was checked","code_sha256":"dd4fbc83b18bbb10","code_sha256_prefix":"dd4fbc83b18bbb10","mcp_get_code":{"code_sha256":"dd4fbc83b18bbb10"}},{"arxiv_id":"2307.12981","arxiv_id_is_arxiv":true,"paper":"/paper/3d-llm-injecting-the-3d-world-into-large","title":"3D-LLM: Injecting the 3D World into Large Language Models","date":"2023-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"umass-foundation-model/3d-llm","path":"3DLLM_BLIP2-base/calculate_scores/calculate_score_3dmvvqa.py","file_url":"https://github.com/umass-foundation-model/3d-llm/blob/HEAD/3DLLM_BLIP2-base/calculate_scores/calculate_score_3dmvvqa.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, umass-foundation-model/3d-llm, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"4e436e13094b20cb","code_sha256_prefix":"4e436e13094b20cb","mcp_get_code":{"code_sha256":"4e436e13094b20cb"}},{"arxiv_id":"2211.09778","arxiv_id_is_arxiv":true,"paper":"/paper/i-can-t-believe-there-s-no-images-learning","title":"I Can't Believe There's No Images! Learning Visual Tasks Using only Language Supervision","date":"2022-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/close","path":"close/eval/vqa_eval.py","file_url":"https://github.com/allenai/close/blob/HEAD/close/eval/vqa_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from pkunlp-icler/fastv, and GitHub detected no licence in that repository when it was checked","code_sha256":"dd4fbc83b18bbb10","code_sha256_prefix":"dd4fbc83b18bbb10","mcp_get_code":{"code_sha256":"dd4fbc83b18bbb10"}},{"arxiv_id":"2202.01993","arxiv_id_is_arxiv":true,"paper":"/paper/grounding-answers-for-visual-questions-asked","title":"Grounding Answers for Visual Questions Asked by Visually Impaired People","date":"2022-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ccychongyanchen/vizwizvqagroundingcrowdsourcing","path":"static/QA_annotations/Preprocess.py","file_url":"https://github.com/ccychongyanchen/vizwizvqagroundingcrowdsourcing/blob/HEAD/static/QA_annotations/Preprocess.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, ccychongyanchen/vizwizvqagroundingcrowdsourcing (NOASSERTION)","code_sha256":"659fc8b13b5e12da","code_sha256_prefix":"659fc8b13b5e12da","mcp_get_code":{"code_sha256":"659fc8b13b5e12da"}}],"record_sha256":"8904bc1dc1bd29569b2f948f6c77130937f90ff86ef11c51d24c3929f96bf5a2","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}