{"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-bool","entry":"parse_bool","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":1,"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":9,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":4,"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":2,"ran_draft_wrong":1,"ran_fixture":0,"ran":6,"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":"2605.18374","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-18374","title":"Beyond Inference-Time Search: Reinforcement Learning Synthesizes Reusable Solvers","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"IDEALLab/neural-solver-synthesis","path":"evaluation/sds/aggregate_program_audits.py","file_url":"https://github.com/IDEALLab/neural-solver-synthesis/blob/HEAD/evaluation/sds/aggregate_program_audits.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, IDEALLab/neural-solver-synthesis when it was checked","code_sha256":"358b643f6ac0a2d5","code_sha256_prefix":"358b643f6ac0a2d5","mcp_get_code":{"code_sha256":"358b643f6ac0a2d5"}},{"arxiv_id":"2504.15466","arxiv_id_is_arxiv":true,"paper":"/paper/learning-adaptive-parallel-reasoning-with","title":"Learning Adaptive Parallel Reasoning with Language Models","date":"2025-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"parallel-reasoning/apr","path":"src/eval/eval_apr.py","file_url":"https://github.com/parallel-reasoning/apr/blob/HEAD/src/eval/eval_apr.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":"bb04fa2661e23ef6","code_sha256_prefix":"bb04fa2661e23ef6","mcp_get_code":{"code_sha256":"bb04fa2661e23ef6"}},{"arxiv_id":"2501.01005","arxiv_id_is_arxiv":true,"paper":"/paper/flashinfer-efficient-and-customizable","title":"FlashInfer: Efficient and Customizable Attention Engine for LLM Inference Serving","date":"2025-01-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flashinfer-ai/flashinfer","path":"flashinfer/aot.py","file_url":"https://github.com/flashinfer-ai/flashinfer/blob/HEAD/flashinfer/aot.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":"c6baeb0a93584501","code_sha256_prefix":"c6baeb0a93584501","mcp_get_code":{"code_sha256":"c6baeb0a93584501"}},{"arxiv_id":"2403.04483","arxiv_id_is_arxiv":true,"paper":"/paper/graphinstruct-empowering-large-language","title":"GraphInstruct: Empowering Large Language Models with Graph Understanding and Reasoning Capability","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cgcl-codes/graphinstruct","path":"GTG/utils/parse_output.py","file_url":"https://github.com/cgcl-codes/graphinstruct/blob/HEAD/GTG/utils/parse_output.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, cgcl-codes/graphinstruct when it was checked","code_sha256":"cb27cfbf649cb064","code_sha256_prefix":"cb27cfbf649cb064","mcp_get_code":{"code_sha256":"cb27cfbf649cb064"}},{"arxiv_id":"2311.01927","arxiv_id_is_arxiv":true,"paper":"/paper/gateloop-fully-data-controlled-linear","title":"GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling","date":"2023-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tobiaskatsch/GateLoop","path":"run_experiment.py","file_url":"https://github.com/tobiaskatsch/GateLoop/blob/HEAD/run_experiment.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":"594b1aafd15bf575","code_sha256_prefix":"594b1aafd15bf575","mcp_get_code":{"code_sha256":"594b1aafd15bf575"}},{"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":"480b3d5e5171def6","code_sha256_prefix":"480b3d5e5171def6","mcp_get_code":{"code_sha256":"480b3d5e5171def6"}},{"arxiv_id":"2306.01244","arxiv_id_is_arxiv":true,"paper":"/paper/towards-sustainable-learning-coresets-for","title":"Towards Sustainable Learning: Coresets for Data-efficient Deep Learning","date":"2023-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigml-cs-ucla/crest","path":"utils/arguments.py","file_url":"https://github.com/bigml-cs-ucla/crest/blob/HEAD/utils/arguments.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ca310e514e9e6527","code_sha256_prefix":"ca310e514e9e6527","mcp_get_code":{"code_sha256":"ca310e514e9e6527"}},{"arxiv_id":"2202.10261","arxiv_id_is_arxiv":true,"paper":"/paper/a-self-supervised-descriptor-for-image-copy","title":"A Self-Supervised Descriptor for Image Copy Detection","date":"2022-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/sscd-copy-detection","path":"sscd/lib/util.py","file_url":"https://github.com/facebookresearch/sscd-copy-detection/blob/HEAD/sscd/lib/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, facebookresearch/sscd-copy-detection, 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":"b78a605710379f86","code_sha256_prefix":"b78a605710379f86","mcp_get_code":{"code_sha256":"b78a605710379f86"}},{"arxiv_id":"2109.04003","arxiv_id_is_arxiv":true,"paper":"/paper/improving-deep-metric-learning-by-divide-and","title":"Improving Deep Metric Learning by Divide and Conquer","date":"2021-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"compvis/metric-learning-divide-and-conquer-improved","path":"experiment/margin_loss_resnet50.py","file_url":"https://github.com/compvis/metric-learning-divide-and-conquer-improved/blob/HEAD/experiment/margin_loss_resnet50.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":"88137d9a7fe8cbfe","code_sha256_prefix":"88137d9a7fe8cbfe","mcp_get_code":{"code_sha256":"88137d9a7fe8cbfe"}}],"record_sha256":"e572ce9df10b49b2b0aac4f89b5fb9dfc58ba790d85ca522959d806c551a9f68","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}