{"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/natural-keys","entry":"natural_keys","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":14,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":13,"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":1,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":14,"n_places_pointer_only":6,"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":4,"ran_fixture":0,"ran":1,"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":"2505.21906","arxiv_id_is_arxiv":true,"paper":"/paper/vision-language-action-model-with-open-world","title":"ChatVLA-2: Vision-Language-Action Model with Open-World Embodied Reasoning from Pretrained Knowledge","date":"2025-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tutujingyugang1/ChatVLA_public","path":"evaluate/zero_to_fp32.py","file_url":"https://github.com/tutujingyugang1/ChatVLA_public/blob/HEAD/evaluate/zero_to_fp32.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":"7052cf0436949e37","code_sha256_prefix":"7052cf0436949e37","mcp_get_code":{"code_sha256":"7052cf0436949e37"}},{"arxiv_id":"2502.14735","arxiv_id_is_arxiv":true,"paper":"/paper/eager-llm-enhancing-large-language-models-as","title":"EAGER-LLM: Enhancing Large Language Models as Recommenders through Exogenous Behavior-Semantic Integration","date":"2025-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Indolent-Kawhi/EAGER-LLM","path":"convert/zero_to_fp32.py","file_url":"https://github.com/Indolent-Kawhi/EAGER-LLM/blob/HEAD/convert/zero_to_fp32.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":"7052cf0436949e37","code_sha256_prefix":"7052cf0436949e37","mcp_get_code":{"code_sha256":"7052cf0436949e37"}},{"arxiv_id":"2407.10910","arxiv_id_is_arxiv":true,"paper":"/paper/datadream-few-shot-guided-dataset-generation","title":"DataDream: Few-shot Guided Dataset Generation","date":"2024-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"explainableml/datadream","path":"DataDream/util.py","file_url":"https://github.com/explainableml/datadream/blob/HEAD/DataDream/util.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, explainableml/datadream when it was checked","code_sha256":"5d0ab01cafdf38db","code_sha256_prefix":"5d0ab01cafdf38db","mcp_get_code":{"code_sha256":"5d0ab01cafdf38db"}},{"arxiv_id":"2404.05892","arxiv_id_is_arxiv":true,"paper":"/paper/eagle-and-finch-rwkv-with-matrix-valued","title":"Eagle and Finch: RWKV with Matrix-Valued States and Dynamic Recurrence","date":"2024-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rwkv/rwkv-infctx-trainer","path":"RWKV-v4neo/export_checkpoint.py","file_url":"https://github.com/rwkv/rwkv-infctx-trainer/blob/HEAD/RWKV-v4neo/export_checkpoint.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":"7052cf0436949e37","code_sha256_prefix":"7052cf0436949e37","mcp_get_code":{"code_sha256":"7052cf0436949e37"}},{"arxiv_id":"2311.09049","arxiv_id_is_arxiv":true,"paper":"/paper/adapting-large-language-models-by-integrating","title":"Adapting Large Language Models by Integrating Collaborative Semantics for Recommendation","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rucaibox/lc-rec","path":"convert/zero_to_fp32.py","file_url":"https://github.com/rucaibox/lc-rec/blob/HEAD/convert/zero_to_fp32.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, rucaibox/lc-rec when it was checked","code_sha256":"7052cf0436949e37","code_sha256_prefix":"7052cf0436949e37","mcp_get_code":{"code_sha256":"7052cf0436949e37"}},{"arxiv_id":"2311.04072","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-imitation-leveraging-fine-grained","title":"Beyond Imitation: Leveraging Fine-grained Quality Signals for Alignment","date":"2023-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rucaibox/figa","path":"utils/zero_to_fp32.py","file_url":"https://github.com/rucaibox/figa/blob/HEAD/utils/zero_to_fp32.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, rucaibox/figa when it was checked","code_sha256":"7052cf0436949e37","code_sha256_prefix":"7052cf0436949e37","mcp_get_code":{"code_sha256":"7052cf0436949e37"}},{"arxiv_id":"2310.09168","arxiv_id_is_arxiv":true,"paper":"/paper/explore-instruct-enhancing-domain-specific","title":"Explore-Instruct: Enhancing Domain-Specific Instruction Coverage through Active Exploration","date":"2023-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fanqiwan/Explore-Instruct","path":"train/zero_to_fp32.py","file_url":"https://github.com/fanqiwan/Explore-Instruct/blob/HEAD/train/zero_to_fp32.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":"7052cf0436949e37","code_sha256_prefix":"7052cf0436949e37","mcp_get_code":{"code_sha256":"7052cf0436949e37"}},{"arxiv_id":"2308.14034","arxiv_id_is_arxiv":true,"paper":"/paper/confucius-iterative-tool-learning-from","title":"Confucius: Iterative Tool Learning from Introspection Feedback by Easy-to-Difficult Curriculum","date":"2023-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shizhl/ctl","path":"zero_to_fp.py","file_url":"https://github.com/shizhl/ctl/blob/HEAD/zero_to_fp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, shizhl/ctl when it was checked","code_sha256":"7052cf0436949e37","code_sha256_prefix":"7052cf0436949e37","mcp_get_code":{"code_sha256":"7052cf0436949e37"}},{"arxiv_id":"2208.13645","arxiv_id_is_arxiv":true,"paper":"/paper/finding-near-optimal-weight-independent-sets","title":"Finding Near-Optimal Weight Independent Sets at Scale","date":null,"month_inferred_from_arxiv_id":"2022-08","title_source":"archive","repo":"karlsruhemis/kamis","path":"misc/conversion/dimacs_to_metis.py","file_url":"https://github.com/karlsruhemis/kamis/blob/HEAD/misc/conversion/dimacs_to_metis.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"001b399417880b63","code_sha256_prefix":"001b399417880b63","mcp_get_code":{"code_sha256":"001b399417880b63"}},{"arxiv_id":"2203.03339","arxiv_id_is_arxiv":true,"paper":"/paper/l2cs-net-fine-grained-gaze-estimation-in","title":"L2CS-Net: Fine-Grained Gaze Estimation in Unconstrained Environments","date":"2022-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahmednull/l2cs-net","path":"l2cs/utils.py","file_url":"https://github.com/ahmednull/l2cs-net/blob/HEAD/l2cs/utils.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":"7052cf0436949e37","code_sha256_prefix":"7052cf0436949e37","mcp_get_code":{"code_sha256":"7052cf0436949e37"}},{"arxiv_id":"2002.07911","arxiv_id_is_arxiv":true,"paper":"/paper/generating-automatic-curricula-via-self","title":"Generating Automatic Curricula via Self-Supervised Active Domain Randomization","date":"2020-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"montrealrobotics/unsupervised-adr","path":"experiments/evaluate_ergo_envs.py","file_url":"https://github.com/montrealrobotics/unsupervised-adr/blob/HEAD/experiments/evaluate_ergo_envs.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, montrealrobotics/unsupervised-adr when it was checked","code_sha256":"8347cfd15b697cc4","code_sha256_prefix":"8347cfd15b697cc4","mcp_get_code":{"code_sha256":"8347cfd15b697cc4"}},{"arxiv_id":"1908.03706","arxiv_id_is_arxiv":true,"paper":"/paper/exploiting-temporal-consistency-for-real-time","title":"Exploiting temporal consistency for real-time video depth estimation","date":"2019-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weihaox/ST-CLSTM","path":"create_list_nyuv2.py","file_url":"https://github.com/weihaox/ST-CLSTM/blob/HEAD/create_list_nyuv2.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":"7052cf0436949e37","code_sha256_prefix":"7052cf0436949e37","mcp_get_code":{"code_sha256":"7052cf0436949e37"}},{"arxiv_id":"1511.07122","arxiv_id_is_arxiv":true,"paper":"/paper/multi-scale-context-aggregation-by-dilated","title":"Multi-Scale Context Aggregation by Dilated Convolutions","date":"2015-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"harshmaru7/DilatedConv","path":"Model.py","file_url":"https://github.com/harshmaru7/DilatedConv/blob/HEAD/Model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, harshmaru7/DilatedConv when it was checked","code_sha256":"77b5bfbe056c7d67","code_sha256_prefix":"77b5bfbe056c7d67","mcp_get_code":{"code_sha256":"77b5bfbe056c7d67"}},{"arxiv_id":"aaai_28138","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28138","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Linyou/Ced-NeRF","path":"convert_video2image.py","file_url":"https://github.com/Linyou/Ced-NeRF/blob/HEAD/convert_video2image.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":"7052cf0436949e37","code_sha256_prefix":"7052cf0436949e37","mcp_get_code":{"code_sha256":"7052cf0436949e37"}}],"record_sha256":"da0ef3fb42da898c60d933e7f3f5e30624450c22f3e15495ff068e430fe95031","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}