{"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/process-json","entry":"process_json","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":5,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":1,"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":5,"ran_fixture":0,"ran":2,"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":"2412.04905","arxiv_id_is_arxiv":true,"paper":"/paper/demo-reframing-dialogue-interaction-with-fine","title":"DEMO: Reframing Dialogue Interaction with Fine-grained Element Modeling","date":"2024-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mozerwang/demo","path":"step3_result.py","file_url":"https://github.com/mozerwang/demo/blob/HEAD/step3_result.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":"47be6626f245bb96","code_sha256_prefix":"47be6626f245bb96","mcp_get_code":{"code_sha256":"47be6626f245bb96"}},{"arxiv_id":"2407.20906","arxiv_id_is_arxiv":true,"paper":"/paper/automated-review-generation-method-based-on","title":"Automated Review Generation Method Based on Large Language Models","date":"2024-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tju-ecat-ai/automaticreviewgeneration","path":"ReviewComposition/Advanced_ComparedScore.py","file_url":"https://github.com/tju-ecat-ai/automaticreviewgeneration/blob/HEAD/ReviewComposition/Advanced_ComparedScore.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":"6f352bd68526a5d4","code_sha256_prefix":"6f352bd68526a5d4","mcp_get_code":{"code_sha256":"6f352bd68526a5d4"}},{"arxiv_id":"2406.18522","arxiv_id_is_arxiv":true,"paper":"/paper/chronomagic-bench-a-benchmark-for-metamorphic","title":"ChronoMagic-Bench: A Benchmark for Metamorphic Evaluation of Text-to-Time-lapse Video Generation","date":"2024-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pku-yuangroup/magictime","path":"data_preprocess/step3_2_preprocess_video_caption.py","file_url":"https://github.com/pku-yuangroup/magictime/blob/HEAD/data_preprocess/step3_2_preprocess_video_caption.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":"f877f7eeafa5e4b6","code_sha256_prefix":"f877f7eeafa5e4b6","mcp_get_code":{"code_sha256":"f877f7eeafa5e4b6"}},{"arxiv_id":"2406.11911","arxiv_id_is_arxiv":true,"paper":"/paper/a-notion-of-complexity-for-theory-of-mind-via","title":"A Notion of Complexity for Theory of Mind via Discrete World Models","date":"2024-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flecart/complexity-tom-dwm","path":"statefulness/copy_state_data.py","file_url":"https://github.com/flecart/complexity-tom-dwm/blob/HEAD/statefulness/copy_state_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e8a7d9a22231b3b4","code_sha256_prefix":"e8a7d9a22231b3b4","mcp_get_code":{"code_sha256":"e8a7d9a22231b3b4"}},{"arxiv_id":"2404.07677","arxiv_id_is_arxiv":true,"paper":"/paper/oda-observation-driven-agent-for-integrating","title":"ODA: Observation-Driven Agent for integrating LLMs and Knowledge Graphs","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lanjiuqing64/kgdata","path":"generate_subgraph/Wikidata/simple_wikidata_db/preprocess_utils/worker_process.py","file_url":"https://github.com/lanjiuqing64/kgdata/blob/HEAD/generate_subgraph/Wikidata/simple_wikidata_db/preprocess_utils/worker_process.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, lanjiuqing64/kgdata when it was checked","code_sha256":"eb7dec0d83eca48d","code_sha256_prefix":"eb7dec0d83eca48d","mcp_get_code":{"code_sha256":"eb7dec0d83eca48d"}},{"arxiv_id":"2312.03801","arxiv_id_is_arxiv":true,"paper":"/paper/generalization-to-new-sequential-decision","title":"Generalization to New Sequential Decision Making Tasks with In-Context Learning","date":"2023-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/minihack","path":"minihack/wiki.py","file_url":"https://github.com/facebookresearch/minihack/blob/HEAD/minihack/wiki.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":"3f38d26a50d12011","code_sha256_prefix":"3f38d26a50d12011","mcp_get_code":{"code_sha256":"3f38d26a50d12011"}},{"arxiv_id":"1906.09444","arxiv_id_is_arxiv":true,"paper":"/paper/retrieving-sequential-information-for-non","title":"Retrieving Sequential Information for Non-Autoregressive Neural Machine Translation","date":"2019-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ictnlp/RSI-NAT","path":"mscoco.py","file_url":"https://github.com/ictnlp/RSI-NAT/blob/HEAD/mscoco.py","status":"ran","verification_level":1,"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":"e78e0b040c6b7e43","code_sha256_prefix":"e78e0b040c6b7e43","mcp_get_code":{"code_sha256":"e78e0b040c6b7e43"}}],"record_sha256":"a4dc00938aa9f4c0e4fb3a306b92d1cacea439f1550e685bf25781212ed386e6","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}