{"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-yaml-file","entry":"read_yaml_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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":3,"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":7,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":7,"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":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":"2409.04409","arxiv_id_is_arxiv":true,"paper":"/paper/train-till-you-drop-towards-stable-and-robust","title":"Train Till You Drop: Towards Stable and Robust Source-free Unsupervised 3D Domain Adaptation","date":"2024-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"valeoai/ttyd","path":"configs_and_mappings.py","file_url":"https://github.com/valeoai/ttyd/blob/HEAD/configs_and_mappings.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, valeoai/ttyd when it was checked","code_sha256":"5db569379bf8e3f7","code_sha256_prefix":"5db569379bf8e3f7","mcp_get_code":{"code_sha256":"5db569379bf8e3f7"}},{"arxiv_id":"2406.12546","arxiv_id_is_arxiv":true,"paper":"/paper/liar-liar-logical-mire-a-benchmark-for","title":"Liar, Liar, Logical Mire: A Benchmark for Suppositional Reasoning in Large Language Models","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mainlp/TruthQuest","path":"metareasoning/utils/utils.py","file_url":"https://github.com/mainlp/TruthQuest/blob/HEAD/metareasoning/utils/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-SA-4.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"CC-BY-SA-4.0, as GitHub detects it on this paper's repository, mainlp/TruthQuest, is not in the permissive set Syntology serves inline","code_sha256":"d05488b912cd3af0","code_sha256_prefix":"d05488b912cd3af0","mcp_get_code":{"code_sha256":"d05488b912cd3af0"}},{"arxiv_id":"2402.14856","arxiv_id_is_arxiv":true,"paper":"/paper/comparing-inferential-strategies-of-humans","title":"Comparing Inferential Strategies of Humans and Large Language Models in Deductive Reasoning","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mainlp/inferential-strategies","path":"reasoning_strategies/utils/utils.py","file_url":"https://github.com/mainlp/inferential-strategies/blob/HEAD/reasoning_strategies/utils/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-SA-4.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"CC-BY-SA-4.0, as GitHub detects it on this paper's repository, mainlp/inferential-strategies, is not in the permissive set Syntology serves inline","code_sha256":"3f821e04d5d9a0fe","code_sha256_prefix":"3f821e04d5d9a0fe","mcp_get_code":{"code_sha256":"3f821e04d5d9a0fe"}},{"arxiv_id":"2311.09071","arxiv_id_is_arxiv":true,"paper":"/paper/how-multilingual-is-multilingual-llm","title":"How Vocabulary Sharing Facilitates Multilingualism in LLaMA?","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cone-mt/vocabulary-sharing-facilitates-multilingualism","path":"Shorten/inference.py","file_url":"https://github.com/cone-mt/vocabulary-sharing-facilitates-multilingualism/blob/HEAD/Shorten/inference.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, cone-mt/vocabulary-sharing-facilitates-multilingualism when it was checked","code_sha256":"9826ffe893c1e6a5","code_sha256_prefix":"9826ffe893c1e6a5","mcp_get_code":{"code_sha256":"9826ffe893c1e6a5"}},{"arxiv_id":"2305.14314","arxiv_id_is_arxiv":true,"paper":"/paper/qlora-efficient-finetuning-of-quantized-llms","title":"QLoRA: Efficient Finetuning of Quantized LLMs","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"georgesung/llm_qlora","path":"inference.py","file_url":"https://github.com/georgesung/llm_qlora/blob/HEAD/inference.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"38a41485b6f05e08","code_sha256_prefix":"38a41485b6f05e08","mcp_get_code":{"code_sha256":"38a41485b6f05e08"}},{"arxiv_id":"2007.09548","arxiv_id_is_arxiv":true,"paper":"/paper/kinematic-3d-object-detection-in-monocular","title":"Kinematic 3D Object Detection in Monocular Video","date":"2020-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Nicholasli1995/EgoNet","path":"libs/arguments/parse.py","file_url":"https://github.com/Nicholasli1995/EgoNet/blob/HEAD/libs/arguments/parse.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":"b4f9a04dd604efae","code_sha256_prefix":"b4f9a04dd604efae","mcp_get_code":{"code_sha256":"b4f9a04dd604efae"}},{"arxiv_id":"2005.11079","arxiv_id_is_arxiv":true,"paper":"/paper/graph-random-neural-network","title":"Graph Random Neural Network for Semi-Supervised Learning on Graphs","date":"2020-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junzhuang-code/lindt","path":"src/utils.py","file_url":"https://github.com/junzhuang-code/lindt/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":"50cce9ad0aedf824","code_sha256_prefix":"50cce9ad0aedf824","mcp_get_code":{"code_sha256":"50cce9ad0aedf824"}}],"record_sha256":"09ea7c947ec3aa689972ed06530831ede03f9108d3e439771e3245651a929808","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}