{"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/resolve-model-path","entry":"resolve_model_path","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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":6,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":6,"n_places_pointer_only":2,"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":6,"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":"2609.14872","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-14872","title":"AgentKV: Phase-Aware KV Eviction for Agentic LLMs","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"LiuTaowen-Tony/agentkv","path":"experiment/runners/common.py","file_url":"https://github.com/LiuTaowen-Tony/agentkv/blob/HEAD/experiment/runners/common.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b109979c9005d347","code_sha256_prefix":"b109979c9005d347","mcp_get_code":{"code_sha256":"b109979c9005d347"}},{"arxiv_id":"2606.20629","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-20629","title":"Specialize Roles, Mix Deployments: Pushing the Cost-Accuracy Frontier of LLM Agent Teams","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Auto-CAP/AgentCAP","path":"agent_cap/run_imo_answerbench_4.py","file_url":"https://github.com/Auto-CAP/AgentCAP/blob/HEAD/agent_cap/run_imo_answerbench_4.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f4edb838b05216e5","code_sha256_prefix":"f4edb838b05216e5","mcp_get_code":{"code_sha256":"f4edb838b05216e5"}},{"arxiv_id":"2605.05993","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-05993","title":"TabCF: Distributional Control Function Estimation with Tabular Foundation Models","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"GepingChen/TabCF","path":"tabcf_core/stage2_outcome.py","file_url":"https://github.com/GepingChen/TabCF/blob/HEAD/tabcf_core/stage2_outcome.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"32662710c301f6db","code_sha256_prefix":"32662710c301f6db","mcp_get_code":{"code_sha256":"32662710c301f6db"}},{"arxiv_id":"2604.18556","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-18556","title":"GSQ: Highly-Accurate Low-Precision Scalar Quantization for LLMs via Gumbel-Softmax Sampling","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"IST-DASLab/GSQ","path":"save_model.py","file_url":"https://github.com/IST-DASLab/GSQ/blob/HEAD/save_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"726199d718f25c3b","code_sha256_prefix":"726199d718f25c3b","mcp_get_code":{"code_sha256":"726199d718f25c3b"}},{"arxiv_id":"2601.00223","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-00223","title":"JP-TL-Bench: Anchored Pairwise LLM Evaluation for Bidirectional Japanese-English Translation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"lhl/liquid-ai-hackathon-tokyo","path":"test-hello.py","file_url":"https://github.com/lhl/liquid-ai-hackathon-tokyo/blob/HEAD/test-hello.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, lhl/liquid-ai-hackathon-tokyo when it was checked","code_sha256":"d7713331931084ec","code_sha256_prefix":"d7713331931084ec","mcp_get_code":{"code_sha256":"d7713331931084ec"}},{"arxiv_id":"2407.07311","arxiv_id_is_arxiv":true,"paper":"/paper/vitime-a-visual-intelligence-based-foundation","title":"ViTime: A Visual Intelligence-Based Foundation Model for Time Series Forecasting","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ikeyang/vitime","path":"config.py","file_url":"https://github.com/ikeyang/vitime/blob/HEAD/config.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, ikeyang/vitime when it was checked","code_sha256":"762d3318d443782a","code_sha256_prefix":"762d3318d443782a","mcp_get_code":{"code_sha256":"762d3318d443782a"}}],"record_sha256":"c73669deffa4b61515c698f4f22d59a08aa330e72469846fd97a7f8add7df27f","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}