{"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/get-ratio","entry":"get_ratio","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":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":2,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":7,"n_places_pointer_only":5,"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":1,"ran_fixture":1,"ran":4,"unverified":1},"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":"2604.18235","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-18235","title":"Negative Advantages Is a Double-Edged Sword: Calibrating advantages in GRPO for Search Agents","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"wujwyi/CalibAdv","path":"verl/trainer/ppo/core_algos.py","file_url":"https://github.com/wujwyi/CalibAdv/blob/HEAD/verl/trainer/ppo/core_algos.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, wujwyi/CalibAdv when it was checked","code_sha256":"162e6fe3ddc290b0","code_sha256_prefix":"162e6fe3ddc290b0","mcp_get_code":{"code_sha256":"162e6fe3ddc290b0"}},{"arxiv_id":"2503.09642","arxiv_id_is_arxiv":true,"paper":"/paper/open-sora-2-0-training-a-commercial-level","title":"Open-Sora 2.0: Training a Commercial-Level Video Generation Model in $200k","date":"2025-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hpcaitech/open-sora","path":"opensora/datasets/aspect.py","file_url":"https://github.com/hpcaitech/open-sora/blob/HEAD/opensora/datasets/aspect.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, hpcaitech/open-sora, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"898176aac6eec0f7","code_sha256_prefix":"898176aac6eec0f7","mcp_get_code":{"code_sha256":"898176aac6eec0f7"}},{"arxiv_id":"2406.12349","arxiv_id_is_arxiv":true,"paper":"/paper/effective-generation-of-feasible-solutions","title":"Effective Generation of Feasible Solutions for Integer Programming via Guided Diffusion","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agent-lab/diffusion-integer-programming","path":"contrast_plot.py","file_url":"https://github.com/agent-lab/diffusion-integer-programming/blob/HEAD/contrast_plot.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, agent-lab/diffusion-integer-programming when it was checked","code_sha256":"1f15810c03da8249","code_sha256_prefix":"1f15810c03da8249","mcp_get_code":{"code_sha256":"1f15810c03da8249"}},{"arxiv_id":"2405.09851","arxiv_id_is_arxiv":true,"paper":"/paper/region-of-interest-detection-in-melanocytic-1","title":"Region of Interest Detection in Melanocytic Skin Tumor Whole Slide Images -- Nevus & Melanoma","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cymichael/roi_detection","path":"analysis.py","file_url":"https://github.com/cymichael/roi_detection/blob/HEAD/analysis.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2a98aecb42d0e1bb","code_sha256_prefix":"2a98aecb42d0e1bb","mcp_get_code":{"code_sha256":"2a98aecb42d0e1bb"}},{"arxiv_id":"2404.02657","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-kullback-leibler-divergence-in","title":"Rethinking Kullback-Leibler Divergence in Knowledge Distillation for Large Language Models","date":"2024-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wutaiqiang/llm_kd_akl","path":"AKL.py","file_url":"https://github.com/wutaiqiang/llm_kd_akl/blob/HEAD/AKL.py","status":"unverified","verification_level":0,"contract_check":null,"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, wutaiqiang/llm_kd_akl when it was checked","code_sha256":"d3899606a14f9ba5","code_sha256_prefix":"d3899606a14f9ba5","mcp_get_code":{"code_sha256":"d3899606a14f9ba5"}},{"arxiv_id":"2403.18548","arxiv_id_is_arxiv":true,"paper":"/paper/a-semi-supervised-nighttime-dehazing-baseline","title":"A Semi-supervised Nighttime Dehazing Baseline with Spatial-Frequency Aware and Realistic Brightness Constraint","date":"2024-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaofeng-life/sfsnid","path":"task_SFSNiD/train_SFSNiD_semi_supervised.py","file_url":"https://github.com/xiaofeng-life/sfsnid/blob/HEAD/task_SFSNiD/train_SFSNiD_semi_supervised.py","status":"ran","verification_level":1,"contract_check":null,"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, xiaofeng-life/sfsnid when it was checked","code_sha256":"98b93da88040b6ab","code_sha256_prefix":"98b93da88040b6ab","mcp_get_code":{"code_sha256":"98b93da88040b6ab"}},{"arxiv_id":"2203.02378","arxiv_id_is_arxiv":true,"paper":"/paper/dit-self-supervised-pre-training-for-document","title":"DiT: Self-supervised Pre-training for Document Image Transformer","date":"2022-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thibaultvt/Diard","path":"modules/sections.py","file_url":"https://github.com/thibaultvt/Diard/blob/HEAD/modules/sections.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":"4777134b6ed19f10","code_sha256_prefix":"4777134b6ed19f10","mcp_get_code":{"code_sha256":"4777134b6ed19f10"}}],"record_sha256":"7dd41aa33859479a04969b60f068d3caec58fa8bcae00549528c9700d8608496","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}