{"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/get-template","entry":"get_template","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":10,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":5,"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":12,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":4,"n_samples_fingerprinted":2,"n_places":12,"n_places_pointer_only":7,"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":7,"unverified":4},"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.04017","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-04017","title":"GeoBrowse: A Geolocation Benchmark for Agentic Tool Use with Expert-Annotated Reasoning Traces","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"ornamentt/GeoBrowse","path":"System/ckv3/agents/agent.py","file_url":"https://github.com/ornamentt/GeoBrowse/blob/HEAD/System/ckv3/agents/agent.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":"400fc092b5b46134","code_sha256_prefix":"400fc092b5b46134","mcp_get_code":{"code_sha256":"400fc092b5b46134"}},{"arxiv_id":"2506.21458","arxiv_id_is_arxiv":true,"paper":"/paper/spatial-mental-modeling-from-limited-views","title":"Spatial Mental Modeling from Limited Views","date":"2025-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mll-lab-nu/mindcube","path":"src/prompt_generation/templates.py","file_url":"https://github.com/mll-lab-nu/mindcube/blob/HEAD/src/prompt_generation/templates.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, mll-lab-nu/mindcube when it was checked","code_sha256":"6af73b3efc06d0f8","code_sha256_prefix":"6af73b3efc06d0f8","mcp_get_code":{"code_sha256":"6af73b3efc06d0f8"}},{"arxiv_id":"2405.10860","arxiv_id_is_arxiv":true,"paper":"/paper/ecr-chain-advancing-generative-language","title":"ECR-Chain: Advancing Generative Language Models to Better Emotion-Cause Reasoners through Reasoning Chains","date":"2024-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hzp3517/ECR-Chain","path":"chatgpt/get_prompt_from_template.py","file_url":"https://github.com/hzp3517/ECR-Chain/blob/HEAD/chatgpt/get_prompt_from_template.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, hzp3517/ECR-Chain when it was checked","code_sha256":"164e0309168e60b9","code_sha256_prefix":"164e0309168e60b9","mcp_get_code":{"code_sha256":"164e0309168e60b9"}},{"arxiv_id":"2403.03536","arxiv_id_is_arxiv":true,"paper":"/paper/towards-efficient-and-effective-unlearning-of","title":"Towards Efficient and Effective Unlearning of Large Language Models for Recommendation","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"justarter/e2urec","path":"data_preprocess/load_prompt_ml1m.py","file_url":"https://github.com/justarter/e2urec/blob/HEAD/data_preprocess/load_prompt_ml1m.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, justarter/e2urec when it was checked","code_sha256":"16250931a2596ae8","code_sha256_prefix":"16250931a2596ae8","mcp_get_code":{"code_sha256":"16250931a2596ae8"}},{"arxiv_id":"2402.10738","arxiv_id_is_arxiv":true,"paper":"/paper/let-s-learn-step-by-step-enhancing-in-context","title":"Let's Learn Step by Step: Enhancing In-Context Learning Ability with Curriculum Learning","date":"2024-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"61peng/curri_learning","path":"src/datasets/instructions.py","file_url":"https://github.com/61peng/curri_learning/blob/HEAD/src/datasets/instructions.py","status":"ran","verification_level":1,"contract_check":null,"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, 61peng/curri_learning when it was checked","code_sha256":"8d56b3db40af6433","code_sha256_prefix":"8d56b3db40af6433","mcp_get_code":{"code_sha256":"8d56b3db40af6433"}},{"arxiv_id":"2312.15901","arxiv_id_is_arxiv":true,"paper":"/paper/black-box-tuning-of-vision-language-models","title":"Black-Box Tuning of Vision-Language Models with Effective Gradient Approximation","date":"2023-12-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guozix/cbbt","path":"datasets/data_helpers.py","file_url":"https://github.com/guozix/cbbt/blob/HEAD/datasets/data_helpers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a109da7c9b2e197b","code_sha256_prefix":"a109da7c9b2e197b","mcp_get_code":{"code_sha256":"a109da7c9b2e197b"}},{"arxiv_id":"2308.11131","arxiv_id_is_arxiv":true,"paper":"/paper/rella-retrieval-enhanced-large-language","title":"ReLLa: Retrieval-enhanced Large Language Models for Lifelong Sequential Behavior Comprehension in Recommendation","date":"2023-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lavieenrose365/rella","path":"load_prompt_BookCrossing.py","file_url":"https://github.com/lavieenrose365/rella/blob/HEAD/load_prompt_BookCrossing.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, lavieenrose365/rella when it was checked","code_sha256":"215b58cabb52b84b","code_sha256_prefix":"215b58cabb52b84b","mcp_get_code":{"code_sha256":"215b58cabb52b84b"}},{"arxiv_id":"2308.11131","arxiv_id_is_arxiv":true,"paper":"/paper/rella-retrieval-enhanced-large-language","title":"ReLLa: Retrieval-enhanced Large Language Models for Lifelong Sequential Behavior Comprehension in Recommendation","date":"2023-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lavieenrose365/rella","path":"load_prompt_ml1m.py","file_url":"https://github.com/lavieenrose365/rella/blob/HEAD/load_prompt_ml1m.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, lavieenrose365/rella when it was checked","code_sha256":"9b2107ea7ebc55bb","code_sha256_prefix":"9b2107ea7ebc55bb","mcp_get_code":{"code_sha256":"9b2107ea7ebc55bb"}},{"arxiv_id":"2308.11131","arxiv_id_is_arxiv":true,"paper":"/paper/rella-retrieval-enhanced-large-language","title":"ReLLa: Retrieval-enhanced Large Language Models for Lifelong Sequential Behavior Comprehension in Recommendation","date":"2023-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lavieenrose365/rella","path":"load_prompt_ml25m.py","file_url":"https://github.com/lavieenrose365/rella/blob/HEAD/load_prompt_ml25m.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, lavieenrose365/rella when it was checked","code_sha256":"7295846e5ff4d44d","code_sha256_prefix":"7295846e5ff4d44d","mcp_get_code":{"code_sha256":"7295846e5ff4d44d"}},{"arxiv_id":"2303.15389","arxiv_id_is_arxiv":true,"paper":"/paper/eva-clip-improved-training-techniques-for","title":"EVA-CLIP: Improved Training Techniques for CLIP at Scale","date":"2023-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PaddlePaddle/PaddleMIX","path":"paddlemix/MULLM_WebUI/common.py","file_url":"https://github.com/PaddlePaddle/PaddleMIX/blob/HEAD/paddlemix/MULLM_WebUI/common.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":"903eaa561fc807bb","code_sha256_prefix":"903eaa561fc807bb","mcp_get_code":{"code_sha256":"903eaa561fc807bb"}},{"arxiv_id":"2212.02437","arxiv_id_is_arxiv":true,"paper":"/paper/in-context-examples-selection-for-machine","title":"In-context Examples Selection for Machine Translation","date":"2022-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"armelrandy/icl-mt","path":"templates.py","file_url":"https://github.com/armelrandy/icl-mt/blob/HEAD/templates.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":"5c0c0ea656370837","code_sha256_prefix":"5c0c0ea656370837","mcp_get_code":{"code_sha256":"5c0c0ea656370837"}},{"arxiv_id":"2108.07639","arxiv_id_is_arxiv":true,"paper":"/paper/learning-c-to-x86-translation-an-experiment","title":"Learning C to x86 Translation: An Experiment in Neural Compilation","date":"2021-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jordiae/neural-compilers","path":"job-gen.py","file_url":"https://github.com/jordiae/neural-compilers/blob/HEAD/job-gen.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":"85746b9ed3a859e7","code_sha256_prefix":"85746b9ed3a859e7","mcp_get_code":{"code_sha256":"85746b9ed3a859e7"}}],"record_sha256":"2d43dd81d407c115bd11ad5d41f391fbbb820bc6a9066f4f80c18df512369fcd","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}