{"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-integer","entry":"is_integer","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":8,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":5,"n_places_pointer_only_link_open":2,"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":2,"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":"2506.12860","arxiv_id_is_arxiv":true,"paper":"/paper/qfft-question-free-fine-tuning-for-adaptive","title":"QFFT, Question-Free Fine-Tuning for Adaptive Reasoning","date":"2025-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lwl-cpu/question-free-fine-tuning","path":"eval/utils/math_normalization.py","file_url":"https://github.com/lwl-cpu/question-free-fine-tuning/blob/HEAD/eval/utils/math_normalization.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from gair-nlp/weak-to-strong-reasoning, and GitHub detected no licence in that repository when it was checked","code_sha256":"b804c6d0a0ddb922","code_sha256_prefix":"b804c6d0a0ddb922","mcp_get_code":{"code_sha256":"b804c6d0a0ddb922"}},{"arxiv_id":"2505.15404","arxiv_id_is_arxiv":true,"paper":"/paper/how-should-we-enhance-the-safety-of-large","title":"How Should We Enhance the Safety of Large Reasoning Models: An Empirical Study","date":"2025-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-coai/lrm-safety-study","path":"reasoning_evaluation/utils/math_normalization.py","file_url":"https://github.com/thu-coai/lrm-safety-study/blob/HEAD/reasoning_evaluation/utils/math_normalization.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from gair-nlp/weak-to-strong-reasoning, and GitHub detected no licence in that repository when it was checked","code_sha256":"b804c6d0a0ddb922","code_sha256_prefix":"b804c6d0a0ddb922","mcp_get_code":{"code_sha256":"b804c6d0a0ddb922"}},{"arxiv_id":"2407.13647","arxiv_id_is_arxiv":true,"paper":"/paper/weak-to-strong-reasoning","title":"Weak-to-Strong Reasoning","date":"2024-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gair-nlp/weak-to-strong-reasoning","path":"src/eval/math_normalization.py","file_url":"https://github.com/gair-nlp/weak-to-strong-reasoning/blob/HEAD/src/eval/math_normalization.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, gair-nlp/weak-to-strong-reasoning when it was checked","code_sha256":"b804c6d0a0ddb922","code_sha256_prefix":"b804c6d0a0ddb922","mcp_get_code":{"code_sha256":"b804c6d0a0ddb922"}},{"arxiv_id":"2401.06151","arxiv_id_is_arxiv":true,"paper":"/paper/towards-joint-sequence-structure-generation","title":"Towards Joint Sequence-Structure Generation of Nucleic Acid and Protein Complexes with SE(3)-Discrete Diffusion","date":"2023-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Profluent-Internships/MMDiff","path":"src/utils/utils.py","file_url":"https://github.com/Profluent-Internships/MMDiff/blob/HEAD/src/utils/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bfeed12000667ac6","code_sha256_prefix":"bfeed12000667ac6","mcp_get_code":{"code_sha256":"bfeed12000667ac6"}},{"arxiv_id":"2310.15147","arxiv_id_is_arxiv":true,"paper":"/paper/s3eval-a-synthetic-scalable-systematic","title":"S3Eval: A Synthetic, Scalable, Systematic Evaluation Suite for Large Language Models","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lfy79001/s3eval","path":"s3eval/coarse_template.py","file_url":"https://github.com/lfy79001/s3eval/blob/HEAD/s3eval/coarse_template.py","status":"ran","verification_level":1,"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, lfy79001/s3eval when it was checked","code_sha256":"3aedfdb61c1e5456","code_sha256_prefix":"3aedfdb61c1e5456","mcp_get_code":{"code_sha256":"3aedfdb61c1e5456"}},{"arxiv_id":"2305.01660","arxiv_id_is_arxiv":true,"paper":"/paper/data-valuation-the-partial-ordinal-shapley","title":"Data valuation: The partial ordinal Shapley value for machine learning","date":"2023-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peizhengwang/partialordinalshapley","path":"shap_utils.py","file_url":"https://github.com/peizhengwang/partialordinalshapley/blob/HEAD/shap_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":"cd370e63cb94a43b","code_sha256_prefix":"cd370e63cb94a43b","mcp_get_code":{"code_sha256":"cd370e63cb94a43b"}},{"arxiv_id":"2103.05094","arxiv_id_is_arxiv":true,"paper":"/paper/covidgan-data-augmentation-using-auxiliary","title":"CovidGAN: Data Augmentation Using Auxiliary Classifier GAN for Improved Covid-19 Detection","date":"2021-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"M4rc-C/OPENCovidGAN","path":"generateCXR.py","file_url":"https://github.com/M4rc-C/OPENCovidGAN/blob/HEAD/generateCXR.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, M4rc-C/OPENCovidGAN when it was checked","code_sha256":"3bd06b8baa70e0fb","code_sha256_prefix":"3bd06b8baa70e0fb","mcp_get_code":{"code_sha256":"3bd06b8baa70e0fb"}},{"arxiv_id":"1904.02868","arxiv_id_is_arxiv":true,"paper":"/paper/data-shapley-equitable-valuation-of-data-for","title":"Data Shapley: Equitable Valuation of Data for Machine Learning","date":"2019-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amiratag/DataShapley","path":"shap_utils.py","file_url":"https://github.com/amiratag/DataShapley/blob/HEAD/shap_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":"cd370e63cb94a43b","code_sha256_prefix":"cd370e63cb94a43b","mcp_get_code":{"code_sha256":"cd370e63cb94a43b"}}],"record_sha256":"f582a81de4cba51780650b8c0cf60bdf591e8b1cad4335b14d2b5402c11c2658","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}