{"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/query-llm","entry":"query_llm","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":3,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":2,"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":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":5,"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":2,"ran_fixture":0,"ran":2,"unverified":3},"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":"2604.01432","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-01432","title":"Are Finer Citations Always Better? Rethinking Granularity for Attributed Generation","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"JHU-CLSP/citation-granularity","path":"utils/llm_api.py","file_url":"https://github.com/JHU-CLSP/citation-granularity/blob/HEAD/utils/llm_api.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, JHU-CLSP/citation-granularity when it was checked","code_sha256":"5f1bd4130fb0e230","code_sha256_prefix":"5f1bd4130fb0e230","mcp_get_code":{"code_sha256":"5f1bd4130fb0e230"}},{"arxiv_id":"2603.02176","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-02176","title":"Organizing, Orchestrating, and Benchmarking Agent Skills at Ecosystem Scale","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"ynulihao/AgentSkillOS","path":"benchmark/AgentSkillOS_bench/utils/llm_clients.py","file_url":"https://github.com/ynulihao/AgentSkillOS/blob/HEAD/benchmark/AgentSkillOS_bench/utils/llm_clients.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, ynulihao/AgentSkillOS when it was checked","code_sha256":"debaef85ade9e3d0","code_sha256_prefix":"debaef85ade9e3d0","mcp_get_code":{"code_sha256":"debaef85ade9e3d0"}},{"arxiv_id":"2505.13237","arxiv_id_is_arxiv":true,"paper":"/paper/sakura-on-the-multi-hop-reasoning-of-large","title":"SAKURA: On the Multi-hop Reasoning of Large Audio-Language Models Based on Speech and Audio Information","date":"2025-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ckyang1124/sakura","path":"evaluation/llm_judge.py","file_url":"https://github.com/ckyang1124/sakura/blob/HEAD/evaluation/llm_judge.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ckyang1124/sakura when it was checked","code_sha256":"4c6c9926d43d2ecf","code_sha256_prefix":"4c6c9926d43d2ecf","mcp_get_code":{"code_sha256":"4c6c9926d43d2ecf"}},{"arxiv_id":"2407.18525","arxiv_id_is_arxiv":true,"paper":"/paper/is-larger-always-better-evaluating-and","title":"ClinicRealm: Re-evaluating Large Language Models with Conventional Machine Learning for Non-Generative Clinical Prediction Tasks","date":"2024-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yhzhu99/ehr-llm-benchmark","path":"src/structured_ehr/query_llm.py","file_url":"https://github.com/yhzhu99/ehr-llm-benchmark/blob/HEAD/src/structured_ehr/query_llm.py","status":"ran","verification_level":1,"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, yhzhu99/ehr-llm-benchmark when it was checked","code_sha256":"f67c74bf273cfe78","code_sha256_prefix":"f67c74bf273cfe78","mcp_get_code":{"code_sha256":"f67c74bf273cfe78"}},{"arxiv_id":"2407.18525","arxiv_id_is_arxiv":true,"paper":"/paper/is-larger-always-better-evaluating-and","title":"ClinicRealm: Re-evaluating Large Language Models with Conventional Machine Learning for Non-Generative Clinical Prediction Tasks","date":"2024-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yhzhu99/ehr-llm-benchmark","path":"src/multimodal/query_llm.py","file_url":"https://github.com/yhzhu99/ehr-llm-benchmark/blob/HEAD/src/multimodal/query_llm.py","status":"ran","verification_level":1,"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, yhzhu99/ehr-llm-benchmark when it was checked","code_sha256":"b1cd5549432dbd63","code_sha256_prefix":"b1cd5549432dbd63","mcp_get_code":{"code_sha256":"b1cd5549432dbd63"}},{"arxiv_id":"2402.03620","arxiv_id_is_arxiv":true,"paper":"/paper/self-discover-large-language-models-self","title":"Self-Discover: Large Language Models Self-Compose Reasoning Structures","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"catid/self-discover","path":"langs/kor.py","file_url":"https://github.com/catid/self-discover/blob/HEAD/langs/kor.py","status":"unverified","verification_level":0,"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":"72f354ebceb04921","code_sha256_prefix":"72f354ebceb04921","mcp_get_code":{"code_sha256":"72f354ebceb04921"}},{"arxiv_id":"2307.13883","arxiv_id_is_arxiv":true,"paper":"/paper/exedec-execution-decomposition-for","title":"ExeDec: Execution Decomposition for Compositional Generalization in Neural Program Synthesis","date":"2023-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-deepmind/exedec","path":"spec_decomposition/cached_llm_access.py","file_url":"https://github.com/google-deepmind/exedec/blob/HEAD/spec_decomposition/cached_llm_access.py","status":"unverified","verification_level":0,"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":"d204dbbda2b2669f","code_sha256_prefix":"d204dbbda2b2669f","mcp_get_code":{"code_sha256":"d204dbbda2b2669f"}}],"record_sha256":"b370361da84681ff2965def4b8665700bae13c7a83772b8614abbe6b69dbd7d6","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}