{"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/extract-answer-from-response","entry":"extract_answer_from_response","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":5,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":3,"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":6,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":1,"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":1,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":2,"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":"2605.17937","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-17937","title":"BacktestBench: Benchmarking Large Language Models for Automated Quantitative Strategy Backtesting","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"jensenw1/BacktestBench","path":"AutoBacktest/003_BackTest/utils.py","file_url":"https://github.com/jensenw1/BacktestBench/blob/HEAD/AutoBacktest/003_BackTest/utils.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, jensenw1/BacktestBench when it was checked","code_sha256":"c7e4a4439fc947ba","code_sha256_prefix":"c7e4a4439fc947ba","mcp_get_code":{"code_sha256":"c7e4a4439fc947ba"}},{"arxiv_id":"2602.07892","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-07892","title":"Safety Alignment as Continual Learning: Mitigating the Alignment Tax via Orthogonal Gradient Projection","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"SunGL001/OGPSA","path":"eval/AIME2024.py","file_url":"https://github.com/SunGL001/OGPSA/blob/HEAD/eval/AIME2024.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e704f14bfb984d51","code_sha256_prefix":"e704f14bfb984d51","mcp_get_code":{"code_sha256":"e704f14bfb984d51"}},{"arxiv_id":"2602.07892","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-07892","title":"Safety Alignment as Continual Learning: Mitigating the Alignment Tax via Orthogonal Gradient Projection","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"SunGL001/OGPSA","path":"eval/GPQA.py","file_url":"https://github.com/SunGL001/OGPSA/blob/HEAD/eval/GPQA.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"996c1c7807871550","code_sha256_prefix":"996c1c7807871550","mcp_get_code":{"code_sha256":"996c1c7807871550"}},{"arxiv_id":"2504.07114","arxiv_id_is_arxiv":true,"paper":"/paper/chatbench-from-static-benchmarks-to-human-ai","title":"ChatBench: From Static Benchmarks to Human-AI Evaluation","date":"2025-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"serinachang5/interactive-eval","path":"qa_reasoning.py","file_url":"https://github.com/serinachang5/interactive-eval/blob/HEAD/qa_reasoning.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, serinachang5/interactive-eval when it was checked","code_sha256":"dbd40b5329f4e864","code_sha256_prefix":"dbd40b5329f4e864","mcp_get_code":{"code_sha256":"dbd40b5329f4e864"}},{"arxiv_id":"openreview_HJ0JFzdwUo","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_HJ0JFzdwUo","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"showlab/Code2Video","path":"src/utils.py","file_url":"https://github.com/showlab/Code2Video/blob/HEAD/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":"5152f62813877f7d","code_sha256_prefix":"5152f62813877f7d","mcp_get_code":{"code_sha256":"5152f62813877f7d"}},{"arxiv_id":"2025.findings-acl.51","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.51","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ModeEric/ORBIT-Llama","path":"orbit/evaluation/astrobench_tests.py","file_url":"https://github.com/ModeEric/ORBIT-Llama/blob/HEAD/orbit/evaluation/astrobench_tests.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fbc0207f0893adb4","code_sha256_prefix":"fbc0207f0893adb4","mcp_get_code":{"code_sha256":"fbc0207f0893adb4"}}],"record_sha256":"4d5edd66a6d6ae92572b0ff6f152523d4f9aa4813d8ae644faa3a36160a4b8fa","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}