{"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-stat","entry":"get_stat","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":2,"n_places":7,"n_places_pointer_only":2,"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":"2608.10553","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-10553","title":"Retrieval-Corrected Conformal Prediction for Time Series","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"jinsaaang/rccp","path":"src/enbPI/utils_latest.py","file_url":"https://github.com/jinsaaang/rccp/blob/HEAD/src/enbPI/utils_latest.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, jinsaaang/rccp when it was checked","code_sha256":"d44564ef40f9701e","code_sha256_prefix":"d44564ef40f9701e","mcp_get_code":{"code_sha256":"d44564ef40f9701e"}},{"arxiv_id":"2306.16819","arxiv_id_is_arxiv":true,"paper":"/paper/graph-denoising-diffusion-for-inverse-protein","title":"Graph Denoising Diffusion for Inverse Protein Folding","date":"2023-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ykiiiiii/GraDe_IF","path":"dataset_src/utils.py","file_url":"https://github.com/ykiiiiii/GraDe_IF/blob/HEAD/dataset_src/utils.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":"d04f9a6f7f21ed3c","code_sha256_prefix":"d04f9a6f7f21ed3c","mcp_get_code":{"code_sha256":"d04f9a6f7f21ed3c"}},{"arxiv_id":"2105.05498","arxiv_id_is_arxiv":true,"paper":"/paper/improving-lexically-constrained-neural","title":"Improving Lexically Constrained Neural Machine Translation with Source-Conditioned Masked Span Prediction","date":"2021-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wns823/NMT_SSP","path":"ngram_inference.py","file_url":"https://github.com/wns823/NMT_SSP/blob/HEAD/ngram_inference.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, wns823/NMT_SSP, 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":"3cc4fb8f11d2d084","code_sha256_prefix":"3cc4fb8f11d2d084","mcp_get_code":{"code_sha256":"3cc4fb8f11d2d084"}},{"arxiv_id":"2010.08887","arxiv_id_is_arxiv":true,"paper":"/paper/i-mix-a-strategy-for-regularizing-contrastive-1","title":"i-Mix: A Domain-Agnostic Strategy for Contrastive Representation Learning","date":"2020-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kibok90/imix","path":"main_pretext.py","file_url":"https://github.com/kibok90/imix/blob/HEAD/main_pretext.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f56462ce688fd5e0","code_sha256_prefix":"f56462ce688fd5e0","mcp_get_code":{"code_sha256":"f56462ce688fd5e0"}},{"arxiv_id":"2006.04292","arxiv_id_is_arxiv":true,"paper":"/paper/achieving-equalized-odds-by-resampling","title":"Achieving Equalized Odds by Resampling Sensitive Attributes","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yromano/fair_dummies","path":"fair_dummies/cf_classification.py","file_url":"https://github.com/yromano/fair_dummies/blob/HEAD/fair_dummies/cf_classification.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":"50b70e5728cd9316","code_sha256_prefix":"50b70e5728cd9316","mcp_get_code":{"code_sha256":"50b70e5728cd9316"}},{"arxiv_id":"1701.02967","arxiv_id_is_arxiv":true,"paper":"/paper/a-large-dimensional-analysis-of-least-squares","title":"A Large Dimensional Analysis of Least Squares Support Vector Machines","date":"2017-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhenyu-LIAO/RMT4LSSVM","path":"RMT4LSSVM.py","file_url":"https://github.com/Zhenyu-LIAO/RMT4LSSVM/blob/HEAD/RMT4LSSVM.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":"5f2fd641f6b2ad26","code_sha256_prefix":"5f2fd641f6b2ad26","mcp_get_code":{"code_sha256":"5f2fd641f6b2ad26"}},{"arxiv_id":"1612.08242","arxiv_id_is_arxiv":true,"paper":"/paper/yolo9000-better-faster-stronger","title":"YOLO9000: Better, Faster, Stronger","date":"2016-12-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"preste-ai/camera_ai_whiteboard","path":"metrics.py","file_url":"https://github.com/preste-ai/camera_ai_whiteboard/blob/HEAD/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"43d2dd422fda72e4","code_sha256_prefix":"43d2dd422fda72e4","mcp_get_code":{"code_sha256":"43d2dd422fda72e4"}}],"record_sha256":"6ede0689c2607f40c2d70c7070c8594c00b66c792d3d039e1de4cb6d14c41b7b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}