{"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/run-with-timeout","entry":"run_with_timeout","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":5,"n_papers_ran_no_instrument_failure":3,"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":8,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":8,"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":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":3,"unverified":2},"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":"2603.01778","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-01778","title":"LLM-as-an-Annotator: Training Lightweight Models with LLM-Annotated Examples for Aspect Sentiment Tuple Prediction","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"NilsHellwig/LA-ABSA","path":"01_create_annotated_examples/01_llm_annotate_train.py","file_url":"https://github.com/NilsHellwig/LA-ABSA/blob/HEAD/01_create_annotated_examples/01_llm_annotate_train.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, NilsHellwig/LA-ABSA when it was checked","code_sha256":"94eed63652a6ce70","code_sha256_prefix":"94eed63652a6ce70","mcp_get_code":{"code_sha256":"94eed63652a6ce70"}},{"arxiv_id":"2510.22849","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-22849","title":"Once Upon an Input: Reasoning via Per-Instance Program Synthesis","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"adaminsky/pips","path":"src/pips/core.py","file_url":"https://github.com/adaminsky/pips/blob/HEAD/src/pips/core.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":"b3efff0266ee76d0","code_sha256_prefix":"b3efff0266ee76d0","mcp_get_code":{"code_sha256":"b3efff0266ee76d0"}},{"arxiv_id":"2412.17596","arxiv_id_is_arxiv":true,"paper":"/paper/liveideabench-evaluating-llms-scientific","title":"LiveIdeaBench: Evaluating LLMs' Scientific Creativity and Idea Generation with Minimal Context","date":"2024-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"x66ccff/liveideabench","path":"utils/utils.py","file_url":"https://github.com/x66ccff/liveideabench/blob/HEAD/utils/utils.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":"72563baa4eb2721e","code_sha256_prefix":"72563baa4eb2721e","mcp_get_code":{"code_sha256":"72563baa4eb2721e"}},{"arxiv_id":"2411.18104","arxiv_id_is_arxiv":true,"paper":"/paper/training-and-evaluating-language-models-with","title":"Training and Evaluating Language Models with Template-based Data Generation","date":"2024-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iiis-ai/templatemath","path":"generate-problems.py","file_url":"https://github.com/iiis-ai/templatemath/blob/HEAD/generate-problems.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, iiis-ai/templatemath when it was checked","code_sha256":"507ce1722c7ae743","code_sha256_prefix":"507ce1722c7ae743","mcp_get_code":{"code_sha256":"507ce1722c7ae743"}},{"arxiv_id":"2411.18104","arxiv_id_is_arxiv":true,"paper":"/paper/training-and-evaluating-language-models-with","title":"Training and Evaluating Language Models with Template-based Data Generation","date":"2024-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iiis-ai/templatemath","path":"generate-problems.py","file_url":"https://github.com/iiis-ai/templatemath/blob/HEAD/generate-problems.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, iiis-ai/templatemath when it was checked","code_sha256":"96472cd1b3e1a245","code_sha256_prefix":"96472cd1b3e1a245","mcp_get_code":{"code_sha256":"96472cd1b3e1a245"}},{"arxiv_id":"2402.15809","arxiv_id_is_arxiv":true,"paper":"/paper/empowering-large-language-model-agents","title":"Empowering Large Language Model Agents through Action Learning","date":"2024-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhao-ht/learnact","path":"aux_func/aux_func.py","file_url":"https://github.com/zhao-ht/learnact/blob/HEAD/aux_func/aux_func.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, zhao-ht/learnact when it was checked","code_sha256":"f8a4de0b6faeff3a","code_sha256_prefix":"f8a4de0b6faeff3a","mcp_get_code":{"code_sha256":"f8a4de0b6faeff3a"}},{"arxiv_id":"2003.04218","arxiv_id_is_arxiv":true,"paper":"/paper/teaching-temporal-logics-to-neural-networks","title":"Teaching Temporal Logics to Neural Networks","date":"2020-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reactive-systems/deepltl","path":"deepltl/utils/utils.py","file_url":"https://github.com/reactive-systems/deepltl/blob/HEAD/deepltl/utils/utils.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":"817e786e14f0e285","code_sha256_prefix":"817e786e14f0e285","mcp_get_code":{"code_sha256":"817e786e14f0e285"}},{"arxiv_id":"ijcai2025_0509","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2025_0509","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"CLMASP/CLMASP","path":"code/clmasp/utils_tool.py","file_url":"https://github.com/CLMASP/CLMASP/blob/HEAD/code/clmasp/utils_tool.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":"985dc407b4d70589","code_sha256_prefix":"985dc407b4d70589","mcp_get_code":{"code_sha256":"985dc407b4d70589"}}],"record_sha256":"50afec0351382daa42e325afd27c45944b8606fbd09054b151c162fdc0311769","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}