{"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/make-context","entry":"make_context","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":1,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":5,"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":1,"ran_fixture":0,"ran":4,"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":"2606.05917","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-05917","title":"MEMORYCARD: Topic-Aware Multi-Modal Clue Compression for Long-Video Question Answering","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"NEUIR/MemoryCard","path":"lmms_eval/models/cambrian.py","file_url":"https://github.com/NEUIR/MemoryCard/blob/HEAD/lmms_eval/models/cambrian.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be348573c1a9db9c","code_sha256_prefix":"be348573c1a9db9c","mcp_get_code":{"code_sha256":"be348573c1a9db9c"}},{"arxiv_id":"2502.06884","arxiv_id_is_arxiv":true,"paper":"/paper/learning-conformal-abstention-policies-for","title":"Learning Conformal Abstention Policies for Adaptive Risk Management in Large Language and Vision-Language Models","date":"2025-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sinatayebati/vlm-uncertainty","path":"input_utils/qwen_chat_utils.py","file_url":"https://github.com/sinatayebati/vlm-uncertainty/blob/HEAD/input_utils/qwen_chat_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2ef1e2c47c52a331","code_sha256_prefix":"2ef1e2c47c52a331","mcp_get_code":{"code_sha256":"2ef1e2c47c52a331"}},{"arxiv_id":"2405.01533","arxiv_id_is_arxiv":true,"paper":"/paper/omnidrive-a-holistic-llm-agent-framework-for","title":"OmniDrive: A Holistic Vision-Language Dataset for Autonomous Driving with Counterfactual Reasoning","date":"2024-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nvlabs/omnidrive","path":"data_gen/prompt_vision.py","file_url":"https://github.com/nvlabs/omnidrive/blob/HEAD/data_gen/prompt_vision.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, nvlabs/omnidrive (NOASSERTION)","code_sha256":"7691d2ae1020562a","code_sha256_prefix":"7691d2ae1020562a","mcp_get_code":{"code_sha256":"7691d2ae1020562a"}},{"arxiv_id":"2402.12052","arxiv_id_is_arxiv":true,"paper":"/paper/small-models-big-insights-leveraging-slim","title":"Small Models, Big Insights: Leveraging Slim Proxy Models To Decide When and What to Retrieve for LLMs","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plageon/slimplm","path":"SKR/vllm_wrapper.py","file_url":"https://github.com/plageon/slimplm/blob/HEAD/SKR/vllm_wrapper.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, plageon/slimplm when it was checked","code_sha256":"cc910a23dfa4faf9","code_sha256_prefix":"cc910a23dfa4faf9","mcp_get_code":{"code_sha256":"cc910a23dfa4faf9"}},{"arxiv_id":"2309.16609","arxiv_id_is_arxiv":true,"paper":"/paper/qwen-technical-report","title":"Qwen Technical Report","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qwenlm/qwen","path":"recipes/inference/vllm/vllm_wrapper.py","file_url":"https://github.com/qwenlm/qwen/blob/HEAD/recipes/inference/vllm/vllm_wrapper.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7c0630b819324850","code_sha256_prefix":"7c0630b819324850","mcp_get_code":{"code_sha256":"7c0630b819324850"}}],"record_sha256":"2a390cfd5415e2ab1ccb693f403028bcc7d33d14d4c95d213f78557d5b94567c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}