{"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/to-markdown","entry":"to_markdown","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":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":0,"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":4,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":0,"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":0,"ran_fixture":0,"ran":2,"unverified":2},"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":"2608.28281","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-28281","title":"LoopArena: Benchmarking Models as Runtime Controllers for Loop Engineering","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"AMAP-ML/LoopArena","path":"src/looparena/commands/type2_summarize.py","file_url":"https://github.com/AMAP-ML/LoopArena/blob/HEAD/src/looparena/commands/type2_summarize.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":"b316e927dce3ae6a","code_sha256_prefix":"b316e927dce3ae6a","mcp_get_code":{"code_sha256":"b316e927dce3ae6a"}},{"arxiv_id":"2605.17041","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-17041","title":"Agentic AI Translate: An Agentic Translator Prototype for Translation as Communication Design","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"chuckmy/agentic-translator","path":"tracelog.py","file_url":"https://github.com/chuckmy/agentic-translator/blob/HEAD/tracelog.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":"de4a0da62c7a251e","code_sha256_prefix":"de4a0da62c7a251e","mcp_get_code":{"code_sha256":"de4a0da62c7a251e"}},{"arxiv_id":"2306.05685","arxiv_id_is_arxiv":true,"paper":"/paper/judging-llm-as-a-judge-with-mt-bench-and-1","title":"Judging LLM-as-a-Judge with MT-Bench and Chatbot Arena","date":"2023-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ilyagusev/ping_pong_bench","path":"src/browser.py","file_url":"https://github.com/ilyagusev/ping_pong_bench/blob/HEAD/src/browser.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":"5f0936b6dd8764d2","code_sha256_prefix":"5f0936b6dd8764d2","mcp_get_code":{"code_sha256":"5f0936b6dd8764d2"}},{"arxiv_id":"2112.14436","arxiv_id_is_arxiv":true,"paper":"/paper/monte-carlo-em-for-deep-time-series-anomaly","title":"Monte Carlo EM for Deep Time Series Anomaly Detection","date":"2021-12-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Francois-Aubet/gluon-ts","path":"evaluations/show_results.py","file_url":"https://github.com/Francois-Aubet/gluon-ts/blob/HEAD/evaluations/show_results.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":"d6d507841deaf78b","code_sha256_prefix":"d6d507841deaf78b","mcp_get_code":{"code_sha256":"d6d507841deaf78b"}},{"arxiv_id":"1910.03002","arxiv_id_is_arxiv":true,"paper":"/paper/high-dimensional-multivariate-forecasting","title":"High-Dimensional Multivariate Forecasting with Low-Rank Gaussian Copula Processes","date":"2019-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mbohlkeschneider/gluon-ts","path":"evaluations/show_results.py","file_url":"https://github.com/mbohlkeschneider/gluon-ts/blob/HEAD/evaluations/show_results.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":"d6d507841deaf78b","code_sha256_prefix":"d6d507841deaf78b","mcp_get_code":{"code_sha256":"d6d507841deaf78b"}},{"arxiv_id":"1906.05264","arxiv_id_is_arxiv":true,"paper":"/paper/gluonts-probabilistic-time-series-models-in","title":"GluonTS: Probabilistic Time Series Models in Python","date":"2019-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elenaehrlich/gluon-ts","path":"evaluations/show_results.py","file_url":"https://github.com/elenaehrlich/gluon-ts/blob/HEAD/evaluations/show_results.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":"d6d507841deaf78b","code_sha256_prefix":"d6d507841deaf78b","mcp_get_code":{"code_sha256":"d6d507841deaf78b"}}],"record_sha256":"413bf4e1338ea6e8f9ff65ef6872f780d9ebfcf729be76acdb279651b854198e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}