{"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/highlight","entry":"highlight","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":6,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":5,"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":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":8,"n_places_pointer_only":3,"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":3,"ran_fixture":0,"ran":1,"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":"2408.08872","arxiv_id_is_arxiv":true,"paper":"/paper/xgen-mm-blip-3-a-family-of-open-large","title":"xGen-MM (BLIP-3): A Family of Open Large Multimodal Models","date":"2024-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzxslp/som-llava","path":"SoM/demo_gpt4v_som.py","file_url":"https://github.com/zzxslp/som-llava/blob/HEAD/SoM/demo_gpt4v_som.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, zzxslp/som-llava when it was checked","code_sha256":"bf3338796e883021","code_sha256_prefix":"bf3338796e883021","mcp_get_code":{"code_sha256":"bf3338796e883021"}},{"arxiv_id":"2408.03617","arxiv_id_is_arxiv":true,"paper":"/paper/is-child-directed-speech-effective-training","title":"Is Child-Directed Speech Effective Training Data for Language Models?","date":"2024-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"styfeng/TinyDialogues","path":"promptsource/templates.py","file_url":"https://github.com/styfeng/TinyDialogues/blob/HEAD/promptsource/templates.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"406e3e3a9886da66","code_sha256_prefix":"406e3e3a9886da66","mcp_get_code":{"code_sha256":"406e3e3a9886da66"}},{"arxiv_id":"2406.19934","arxiv_id_is_arxiv":true,"paper":"/paper/from-the-least-to-the-most-building-a-plug","title":"From the Least to the Most: Building a Plug-and-Play Visual Reasoner via Data Synthesis","date":"2024-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"steven-ccq/VisualReasoner","path":"utils.py","file_url":"https://github.com/steven-ccq/VisualReasoner/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, steven-ccq/VisualReasoner when it was checked","code_sha256":"4b9837cd50427259","code_sha256_prefix":"4b9837cd50427259","mcp_get_code":{"code_sha256":"4b9837cd50427259"}},{"arxiv_id":"2403.01976","arxiv_id_is_arxiv":true,"paper":"/paper/sciassess-benchmarking-llm-proficiency-in","title":"SciAssess: Benchmarking LLM Proficiency in Scientific Literature Analysis","date":"2024-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sci-assess/sciassess","path":"collect.py","file_url":"https://github.com/sci-assess/sciassess/blob/HEAD/collect.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"LGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"LGPL-3.0, as GitHub detects it on this paper's repository, sci-assess/sciassess, is not in the permissive set Syntology serves inline","code_sha256":"27b0ed0fe976587d","code_sha256_prefix":"27b0ed0fe976587d","mcp_get_code":{"code_sha256":"27b0ed0fe976587d"}},{"arxiv_id":"2310.20707","arxiv_id_is_arxiv":true,"paper":"/paper/what-s-in-my-big-data","title":"What's In My Big Data?","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/wimbd","path":"wimbd/contamination/templates.py","file_url":"https://github.com/allenai/wimbd/blob/HEAD/wimbd/contamination/templates.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"406e3e3a9886da66","code_sha256_prefix":"406e3e3a9886da66","mcp_get_code":{"code_sha256":"406e3e3a9886da66"}},{"arxiv_id":"2310.11441","arxiv_id_is_arxiv":true,"paper":"/paper/set-of-mark-prompting-unleashes-extraordinary","title":"Set-of-Mark Prompting Unleashes Extraordinary Visual Grounding in GPT-4V","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/SoM","path":"demo_gpt4v_som.py","file_url":"https://github.com/microsoft/SoM/blob/HEAD/demo_gpt4v_som.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":"bf3338796e883021","code_sha256_prefix":"bf3338796e883021","mcp_get_code":{"code_sha256":"bf3338796e883021"}},{"arxiv_id":"2110.08207","arxiv_id_is_arxiv":true,"paper":"/paper/multitask-prompted-training-enables-zero-shot-1","title":"Multitask Prompted Training Enables Zero-Shot Task Generalization","date":"2021-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigscience-workshop/promptsource","path":"promptsource/templates.py","file_url":"https://github.com/bigscience-workshop/promptsource/blob/HEAD/promptsource/templates.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"406e3e3a9886da66","code_sha256_prefix":"406e3e3a9886da66","mcp_get_code":{"code_sha256":"406e3e3a9886da66"}},{"arxiv_id":"1710.07629","arxiv_id_is_arxiv":true,"paper":"/paper/openfermion-the-electronic-structure-package","title":"OpenFermion: The Electronic Structure Package for Quantum Computers","date":null,"month_inferred_from_arxiv_id":"2017-10","title_source":"archive","repo":"olansog/bidlabs-sherlock-fermion-code","path":"dev_tools/shell_tools.py","file_url":"https://github.com/olansog/bidlabs-sherlock-fermion-code/blob/HEAD/dev_tools/shell_tools.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":"bf7fa4434e39a565","code_sha256_prefix":"bf7fa4434e39a565","mcp_get_code":{"code_sha256":"bf7fa4434e39a565"}}],"record_sha256":"c1992f475542622c6d6495f09dac8341fd3f8e2f15e499278ca2dc611052c07d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}