{"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-string","entry":"process_string","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":7,"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":4,"n_places":8,"n_places_pointer_only":3,"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":"2602.08031","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-08031","title":"Beyond Raw Detection Scores: Markov-Informed Calibration for Boosting Machine-Generated Text Detection","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"tmlr-group/MRF_Calibration","path":"methods/IntrinsicDim.py","file_url":"https://github.com/tmlr-group/MRF_Calibration/blob/HEAD/methods/IntrinsicDim.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":"ad5f00016ee9222a","code_sha256_prefix":"ad5f00016ee9222a","mcp_get_code":{"code_sha256":"ad5f00016ee9222a"}},{"arxiv_id":"2411.02937","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-multimodal-retrieval-augmented","title":"Benchmarking Multimodal Retrieval Augmented Generation with Dynamic VQA Dataset and Self-adaptive Planning Agent","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alibaba-nlp/omnisearch","path":"src/Omnisearch_gpt/evaluate.py","file_url":"https://github.com/alibaba-nlp/omnisearch/blob/HEAD/src/Omnisearch_gpt/evaluate.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, alibaba-nlp/omnisearch when it was checked","code_sha256":"30e6a5ac8f0f7f8f","code_sha256_prefix":"30e6a5ac8f0f7f8f","mcp_get_code":{"code_sha256":"30e6a5ac8f0f7f8f"}},{"arxiv_id":"2402.19248","arxiv_id_is_arxiv":true,"paper":"/paper/let-llms-take-on-the-latest-challenges-a","title":"Let LLMs Take on the Latest Challenges! A Chinese Dynamic Question Answering Benchmark","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alibaba-nlp/cdqa","path":"cdqa_eval.py","file_url":"https://github.com/alibaba-nlp/cdqa/blob/HEAD/cdqa_eval.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, alibaba-nlp/cdqa when it was checked","code_sha256":"23193098026f155d","code_sha256_prefix":"23193098026f155d","mcp_get_code":{"code_sha256":"23193098026f155d"}},{"arxiv_id":"2306.04723","arxiv_id_is_arxiv":true,"paper":"/paper/intrinsic-dimension-estimation-for-robust","title":"Intrinsic Dimension Estimation for Robust Detection of AI-Generated Texts","date":"2023-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"argintum/gptid","path":"IntrinsicDim.py","file_url":"https://github.com/argintum/gptid/blob/HEAD/IntrinsicDim.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":"ad5f00016ee9222a","code_sha256_prefix":"ad5f00016ee9222a","mcp_get_code":{"code_sha256":"ad5f00016ee9222a"}},{"arxiv_id":"2303.14822","arxiv_id_is_arxiv":true,"paper":"/paper/mgtbench-benchmarking-machine-generated-text","title":"MGTBench: Benchmarking Machine-Generated Text Detection","date":"2023-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trustairlab/mgtbench","path":"methods/IntrinsicDim.py","file_url":"https://github.com/trustairlab/mgtbench/blob/HEAD/methods/IntrinsicDim.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":"ad5f00016ee9222a","code_sha256_prefix":"ad5f00016ee9222a","mcp_get_code":{"code_sha256":"ad5f00016ee9222a"}},{"arxiv_id":"2109.07263","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-learning-of-flowchart-grounded","title":"End-to-End Learning of Flowchart Grounded Task-Oriented Dialogs","date":"2021-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dair-iitd/flonet","path":"code/flonet.py","file_url":"https://github.com/dair-iitd/flonet/blob/HEAD/code/flonet.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, dair-iitd/flonet when it was checked","code_sha256":"2f703bcccbbd0509","code_sha256_prefix":"2f703bcccbbd0509","mcp_get_code":{"code_sha256":"2f703bcccbbd0509"}},{"arxiv_id":"1910.13461","arxiv_id_is_arxiv":true,"paper":"/paper/bart-denoising-sequence-to-sequence-pre","title":"BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension","date":"2019-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bayer-science-for-a-better-life/data2text-bioleaflets","path":"bioleaflets/preparation/parse_json.py","file_url":"https://github.com/bayer-science-for-a-better-life/data2text-bioleaflets/blob/HEAD/bioleaflets/preparation/parse_json.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cc1fd572c2800793","code_sha256_prefix":"cc1fd572c2800793","mcp_get_code":{"code_sha256":"cc1fd572c2800793"}},{"arxiv_id":"2023.emnlp-main.616","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.emnlp-main.616","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"xinleihe/MGTBench","path":"methods/IntrinsicDim.py","file_url":"https://github.com/xinleihe/MGTBench/blob/HEAD/methods/IntrinsicDim.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":"ad5f00016ee9222a","code_sha256_prefix":"ad5f00016ee9222a","mcp_get_code":{"code_sha256":"ad5f00016ee9222a"}}],"record_sha256":"80d0190f19fd0de641e6f5071fe4450a69433ffa03f27b516e70b66405bf566c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}