{"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/read-txt-file","entry":"read_txt_file","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":8,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":5,"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":8,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":9,"n_places_pointer_only":1,"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":5,"ran_fixture":0,"ran":3,"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":"2608.12626","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-12626","title":"LLMs Are Not Good Strategists, Yet Memory-Enhanced Agency Boosts Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"ethanyiwu/EpicStar","path":"data_generation/convert.py","file_url":"https://github.com/ethanyiwu/EpicStar/blob/HEAD/data_generation/convert.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":"506ba28e158583c8","code_sha256_prefix":"506ba28e158583c8","mcp_get_code":{"code_sha256":"506ba28e158583c8"}},{"arxiv_id":"2604.06854","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-06854","title":"To Adapt or not to Adapt, Rethinking the Value of Medical Knowledge-Aware Large Language Models To Adapt or not to Adapt, Rethinking the Value of Medical Knowledge-Aware Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"Maits27/Deduplication","path":"deduplication/dolma/preprocess/crear_jsonl_de_txt_dolma.py","file_url":"https://github.com/Maits27/Deduplication/blob/HEAD/deduplication/dolma/preprocess/crear_jsonl_de_txt_dolma.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, Maits27/Deduplication when it was checked","code_sha256":"366c7219adb664b0","code_sha256_prefix":"366c7219adb664b0","mcp_get_code":{"code_sha256":"366c7219adb664b0"}},{"arxiv_id":"2503.08683","arxiv_id_is_arxiv":true,"paper":"/paper/colmdriver-llm-based-negotiation-benefits","title":"CoLMDriver: LLM-based Negotiation Benefits Cooperative Autonomous Driving","date":"2025-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cxliu0314/CoLMDriver","path":"simulation/leaderboard/team_code/colmdriver_action.py","file_url":"https://github.com/cxliu0314/CoLMDriver/blob/HEAD/simulation/leaderboard/team_code/colmdriver_action.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":"41d7718e9e6c8c83","code_sha256_prefix":"41d7718e9e6c8c83","mcp_get_code":{"code_sha256":"41d7718e9e6c8c83"}},{"arxiv_id":"2408.05093","arxiv_id_is_arxiv":true,"paper":"/paper/order-matters-in-hallucination-reasoning","title":"Order Matters in Hallucination: Reasoning Order as Benchmark and Reflexive Prompting for Large-Language-Models","date":"2024-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiezikai/reflexiveprompting","path":"self_contradictory_comparison.py","file_url":"https://github.com/xiezikai/reflexiveprompting/blob/HEAD/self_contradictory_comparison.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":"8baf7ca3db1e6bbd","code_sha256_prefix":"8baf7ca3db1e6bbd","mcp_get_code":{"code_sha256":"8baf7ca3db1e6bbd"}},{"arxiv_id":"2407.12857","arxiv_id_is_arxiv":true,"paper":"/paper/automated-peer-reviewing-in-paper-sea","title":"Automated Peer Reviewing in Paper SEA: Standardization, Evaluation, and Analysis","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ecnu-sea/SEA","path":"inference/inference.py","file_url":"https://github.com/ecnu-sea/SEA/blob/HEAD/inference/inference.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"377f44324f8d06fe","code_sha256_prefix":"377f44324f8d06fe","mcp_get_code":{"code_sha256":"377f44324f8d06fe"}},{"arxiv_id":"2407.01502","arxiv_id_is_arxiv":true,"paper":"/paper/ai-agents-that-matter","title":"AI Agents That Matter","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benediktstroebl/agent-evals","path":"NovelQA/novelQA-gpt-4.py","file_url":"https://github.com/benediktstroebl/agent-evals/blob/HEAD/NovelQA/novelQA-gpt-4.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":"6bf8e275f958a588","code_sha256_prefix":"6bf8e275f958a588","mcp_get_code":{"code_sha256":"6bf8e275f958a588"}},{"arxiv_id":"2309.12307","arxiv_id_is_arxiv":true,"paper":"/paper/longlora-efficient-fine-tuning-of-long","title":"LongLoRA: Efficient Fine-tuning of Long-Context Large Language Models","date":"2023-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dexter-gt-86/sinklora","path":"inference.py","file_url":"https://github.com/dexter-gt-86/sinklora/blob/HEAD/inference.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fd83f4f62a5a7d95","code_sha256_prefix":"fd83f4f62a5a7d95","mcp_get_code":{"code_sha256":"fd83f4f62a5a7d95"}},{"arxiv_id":"2210.11065","arxiv_id_is_arxiv":true,"paper":"/paper/movieclip-visual-scene-recognition-in-movies","title":"MovieCLIP: Visual Scene Recognition in Movies","date":"2022-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"usc-sail/mica-MovieCLIP","path":"preprocess_scripts/compute_distribution_visual_scene_labels.py","file_url":"https://github.com/usc-sail/mica-MovieCLIP/blob/HEAD/preprocess_scripts/compute_distribution_visual_scene_labels.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":"7596f0e252f8018d","code_sha256_prefix":"7596f0e252f8018d","mcp_get_code":{"code_sha256":"7596f0e252f8018d"}},{"arxiv_id":"1710.10891","arxiv_id_is_arxiv":true,"paper":"/paper/open-set-logo-detection-and-retrieval","title":"Open Set Logo Detection and Retrieval","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ilmonteux/logohunter","path":"src/metrics.py","file_url":"https://github.com/ilmonteux/logohunter/blob/HEAD/src/metrics.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":"7760c3ab7c4efb54","code_sha256_prefix":"7760c3ab7c4efb54","mcp_get_code":{"code_sha256":"7760c3ab7c4efb54"}}],"record_sha256":"dc49ca92d8fd16ec8a5f08aa1c6e2c07b0954f6912cbc82e99f16a311168d73e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}