{"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/is-chinese","entry":"is_chinese","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":6,"n_papers_ran_no_instrument_failure":6,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"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":3,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"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":"2503.01785","arxiv_id_is_arxiv":true,"paper":"/paper/visual-rft-visual-reinforcement-fine-tuning","title":"Visual-RFT: Visual Reinforcement Fine-Tuning","date":"2025-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuziyu77/visual-rft","path":"Visual-ARFT/evaluation_coding/evaluation_mat_coding_visual_arft.py","file_url":"https://github.com/liuziyu77/visual-rft/blob/HEAD/Visual-ARFT/evaluation_coding/evaluation_mat_coding_visual_arft.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":"f00494929cf64608","code_sha256_prefix":"f00494929cf64608","mcp_get_code":{"code_sha256":"f00494929cf64608"}},{"arxiv_id":"2503.01183","arxiv_id_is_arxiv":true,"paper":"/paper/diffrhythm-blazingly-fast-and-embarrassingly","title":"DiffRhythm: Blazingly Fast and Embarrassingly Simple End-to-End Full-Length Song Generation with Latent Diffusion","date":"2025-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aslp-lab/diffrhythm","path":"g2p/g2p_generation.py","file_url":"https://github.com/aslp-lab/diffrhythm/blob/HEAD/g2p/g2p_generation.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":"1067e52152c1a73b","code_sha256_prefix":"1067e52152c1a73b","mcp_get_code":{"code_sha256":"1067e52152c1a73b"}},{"arxiv_id":"2310.16809","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-ocr-capabilities-of-gpt-4v-ision-a","title":"Exploring OCR Capabilities of GPT-4V(ision) : A Quantitative and In-depth Evaluation","date":"2023-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scut-dlvclab/gpt-4v_ocr","path":"src/common/string_utils.py","file_url":"https://github.com/scut-dlvclab/gpt-4v_ocr/blob/HEAD/src/common/string_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, scut-dlvclab/gpt-4v_ocr when it was checked","code_sha256":"71017b83f2989c5f","code_sha256_prefix":"71017b83f2989c5f","mcp_get_code":{"code_sha256":"71017b83f2989c5f"}},{"arxiv_id":"2310.14265","arxiv_id_is_arxiv":true,"paper":"/paper/ct-gat-cross-task-generative-adversarial","title":"CT-GAT: Cross-Task Generative Adversarial Attack based on Transferability","date":"2023-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaoxuanNLP/CT-GAT","path":"src/CT-GAT.py","file_url":"https://github.com/xiaoxuanNLP/CT-GAT/blob/HEAD/src/CT-GAT.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4b812e89f35c77c9","code_sha256_prefix":"4b812e89f35c77c9","mcp_get_code":{"code_sha256":"4b812e89f35c77c9"}},{"arxiv_id":"2305.12524","arxiv_id_is_arxiv":true,"paper":"/paper/theoremqa-a-theorem-driven-question-answering","title":"TheoremQA: A Theorem-driven Question Answering dataset","date":"2023-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THUDM/VisualGLM-6B","path":"model/infer_util.py","file_url":"https://github.com/THUDM/VisualGLM-6B/blob/HEAD/model/infer_util.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":"04cb5cd9927c6c03","code_sha256_prefix":"04cb5cd9927c6c03","mcp_get_code":{"code_sha256":"04cb5cd9927c6c03"}},{"arxiv_id":"2104.14690","arxiv_id_is_arxiv":true,"paper":"/paper/entailment-as-few-shot-learner","title":"Entailment as Few-Shot Learner","date":"2021-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunyilgdx/prompts4keras","path":"baselines/efl_classification_roberta.py","file_url":"https://github.com/sunyilgdx/prompts4keras/blob/HEAD/baselines/efl_classification_roberta.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e551df2d82036969","code_sha256_prefix":"e551df2d82036969","mcp_get_code":{"code_sha256":"e551df2d82036969"}}],"record_sha256":"d84776b5294134be837b48a570eae2219117c017645e7b622cdcb961114459d3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}