{"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/parse-float","entry":"parse_float","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":4,"n_places":6,"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":3,"ran_violates":0,"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":"2607.25886","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-25886","title":"RSIBench-Data: Benchmarking Data-Centric Research for Recursive Self-Improvement","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"evolvent-ai/RSIBench-Data","path":"runner/lib/validate_agent_run_config.py","file_url":"https://github.com/evolvent-ai/RSIBench-Data/blob/HEAD/runner/lib/validate_agent_run_config.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, evolvent-ai/RSIBench-Data when it was checked","code_sha256":"796b0fb8c704c558","code_sha256_prefix":"796b0fb8c704c558","mcp_get_code":{"code_sha256":"796b0fb8c704c558"}},{"arxiv_id":"2606.00660","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-00660","title":"FINEVERIFY: Scaling Test-Time Compute with Fine-Grained Self-Verification for Agentic Search","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"XuZhao0/fineverify","path":"tools.py","file_url":"https://github.com/XuZhao0/fineverify/blob/HEAD/tools.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"33ddee9096d20923","code_sha256_prefix":"33ddee9096d20923","mcp_get_code":{"code_sha256":"33ddee9096d20923"}},{"arxiv_id":"2602.19131","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-19131","title":"Test-Time Learning of Causal Structure from Interventional Data","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"huawei-noah/trustworthyAI","path":"TabbyTSFM/benchmarks/classification/ucr_rf_layer_fusion.py","file_url":"https://github.com/huawei-noah/trustworthyAI/blob/HEAD/TabbyTSFM/benchmarks/classification/ucr_rf_layer_fusion.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1a5e89a8e5f54553","code_sha256_prefix":"1a5e89a8e5f54553","mcp_get_code":{"code_sha256":"1a5e89a8e5f54553"}},{"arxiv_id":"2309.03904","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-sparse-moe-in-gans-for-text","title":"Exploring Sparse MoE in GANs for Text-conditioned Image Synthesis","date":"2023-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhujiapeng/aurora","path":"utils/parsing_utils.py","file_url":"https://github.com/zhujiapeng/aurora/blob/HEAD/utils/parsing_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, zhujiapeng/aurora (NOASSERTION)","code_sha256":"77045e5d954b160a","code_sha256_prefix":"77045e5d954b160a","mcp_get_code":{"code_sha256":"77045e5d954b160a"}},{"arxiv_id":"2006.01938","arxiv_id_is_arxiv":true,"paper":"/paper/nurse-is-closer-to-woman-than-surgeon","title":"Nurse is Closer to Woman than Surgeon? Mitigating Gender-Biased Proximities in Word Embeddings","date":"2020-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TimeTraveller-San/RAN-Debias","path":"src/RANDebias.py","file_url":"https://github.com/TimeTraveller-San/RAN-Debias/blob/HEAD/src/RANDebias.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":"7c933676f9aafa31","code_sha256_prefix":"7c933676f9aafa31","mcp_get_code":{"code_sha256":"7c933676f9aafa31"}},{"arxiv_id":"Wang_How_Do_Multimodal_Large_Language_Models_Handle_Complex_Multimodal_Reasoning_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wang_How_Do_Multimodal_Large_Language_Models_Handle_Complex_Multimodal_Reasoning_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"THUNLP-MT/EscapeCraft","path":"src/legent/action/action.py","file_url":"https://github.com/THUNLP-MT/EscapeCraft/blob/HEAD/src/legent/action/action.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":"a3360001b877ba79","code_sha256_prefix":"a3360001b877ba79","mcp_get_code":{"code_sha256":"a3360001b877ba79"}}],"record_sha256":"ea33ee4b561bf92ddcc145bec739ba4697605ca73bda094c62deddda9aeca37d","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}