{"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-input","entry":"read_input","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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":10,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":6,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":11,"n_places_pointer_only":9,"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":6,"ran_fixture":0,"ran":1,"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":"2602.10863","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-10863","title":"ICA: Information-Aware Credit Assignment for Visually Grounded Long-Horizon Information-Seeking Agents","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"pc-inno/ICA_MM_deepsearch","path":"run_inference.py","file_url":"https://github.com/pc-inno/ICA_MM_deepsearch/blob/HEAD/run_inference.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, pc-inno/ICA_MM_deepsearch when it was checked","code_sha256":"8362cbe6a0734d97","code_sha256_prefix":"8362cbe6a0734d97","mcp_get_code":{"code_sha256":"8362cbe6a0734d97"}},{"arxiv_id":"2411.16600","arxiv_id_is_arxiv":true,"paper":"/paper/approximation-algorithms-for-combinatorial","title":"Approximation Algorithms for Combinatorial Optimization with Predictions","date":"2024-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adampolak/steiner-tree-with-predictions","path":"steiner.py","file_url":"https://github.com/adampolak/steiner-tree-with-predictions/blob/HEAD/steiner.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, adampolak/steiner-tree-with-predictions when it was checked","code_sha256":"a11a6508cfe969df","code_sha256_prefix":"a11a6508cfe969df","mcp_get_code":{"code_sha256":"a11a6508cfe969df"}},{"arxiv_id":"2407.09121","arxiv_id_is_arxiv":true,"paper":"/paper/refuse-whenever-you-feel-unsafe-improving","title":"Refuse Whenever You Feel Unsafe: Improving Safety in LLMs via Decoupled Refusal Training","date":"2024-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robustnlp/derta","path":"evaluation.py","file_url":"https://github.com/robustnlp/derta/blob/HEAD/evaluation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2a686c7dfc4f6740","code_sha256_prefix":"2a686c7dfc4f6740","mcp_get_code":{"code_sha256":"2a686c7dfc4f6740"}},{"arxiv_id":"2402.07616","arxiv_id_is_arxiv":true,"paper":"/paper/anchor-based-large-language-models","title":"Anchor-based Large Language Models","date":"2024-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pangjh3/anllm","path":"inference.py","file_url":"https://github.com/pangjh3/anllm/blob/HEAD/inference.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, pangjh3/anllm when it was checked","code_sha256":"2a686c7dfc4f6740","code_sha256_prefix":"2a686c7dfc4f6740","mcp_get_code":{"code_sha256":"2a686c7dfc4f6740"}},{"arxiv_id":"2401.12873","arxiv_id_is_arxiv":true,"paper":"/paper/improving-machine-translation-with-human","title":"Improving Machine Translation with Human Feedback: An Exploration of Quality Estimation as a Reward Model","date":"2024-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zwhe99/FeedbackMT","path":"src/inference_sft.py","file_url":"https://github.com/zwhe99/FeedbackMT/blob/HEAD/src/inference_sft.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, zwhe99/FeedbackMT when it was checked","code_sha256":"249d0dda07bcb0de","code_sha256_prefix":"249d0dda07bcb0de","mcp_get_code":{"code_sha256":"249d0dda07bcb0de"}},{"arxiv_id":"2401.08350","arxiv_id_is_arxiv":true,"paper":"/paper/salute-the-classic-revisiting-challenges-of","title":"Salute the Classic: Revisiting Challenges of Machine Translation in the Age of Large Language Models","date":"2024-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pangjh3/llm4mt","path":"train/attention_alignment_llama2.py","file_url":"https://github.com/pangjh3/llm4mt/blob/HEAD/train/attention_alignment_llama2.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, pangjh3/llm4mt when it was checked","code_sha256":"2a686c7dfc4f6740","code_sha256_prefix":"2a686c7dfc4f6740","mcp_get_code":{"code_sha256":"2a686c7dfc4f6740"}},{"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/src/datasets/flores.py","file_url":"https://github.com/cone-mt/vocabulary-sharing-facilitates-multilingualism/blob/HEAD/Shorten/src/datasets/flores.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, cone-mt/vocabulary-sharing-facilitates-multilingualism when it was checked","code_sha256":"2a686c7dfc4f6740","code_sha256_prefix":"2a686c7dfc4f6740","mcp_get_code":{"code_sha256":"2a686c7dfc4f6740"}},{"arxiv_id":"2308.12674","arxiv_id_is_arxiv":true,"paper":"/paper/improving-translation-faithfulness-of-large","title":"Improving Translation Faithfulness of Large Language Models via Augmenting Instructions","date":"2023-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pppa2019/swie_overmiss_llm4mt","path":"src/inference.py","file_url":"https://github.com/pppa2019/swie_overmiss_llm4mt/blob/HEAD/src/inference.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, pppa2019/swie_overmiss_llm4mt when it was checked","code_sha256":"2a686c7dfc4f6740","code_sha256_prefix":"2a686c7dfc4f6740","mcp_get_code":{"code_sha256":"2a686c7dfc4f6740"}},{"arxiv_id":"2308.12097","arxiv_id_is_arxiv":true,"paper":"/paper/instruction-position-matters-in-sequence","title":"Instruction Position Matters in Sequence Generation with Large Language Models","date":"2023-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adaxry/post-instruction","path":"test/inference.py","file_url":"https://github.com/adaxry/post-instruction/blob/HEAD/test/inference.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, adaxry/post-instruction when it was checked","code_sha256":"66a40715e67ec0d9","code_sha256_prefix":"66a40715e67ec0d9","mcp_get_code":{"code_sha256":"66a40715e67ec0d9"}},{"arxiv_id":"2107.05983","arxiv_id_is_arxiv":true,"paper":"/paper/metallicity-estimation-of-rr-lyrae-stars-from","title":"Metallicity estimation of RR Lyrae stars from their I-band light curves","date":null,"month_inferred_from_arxiv_id":"2021-07","title_source":"archive","repo":"idekany/lcfit","path":"lcfit_utils.py","file_url":"https://github.com/idekany/lcfit/blob/HEAD/lcfit_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":"d235676bd33522b0","code_sha256_prefix":"d235676bd33522b0","mcp_get_code":{"code_sha256":"d235676bd33522b0"}},{"arxiv_id":"2004.15011","arxiv_id_is_arxiv":true,"paper":"/paper/tldr-extreme-summarization-of-scientific","title":"TLDR: Extreme Summarization of Scientific Documents","date":"2020-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jungokasai/twist_decoding","path":"fairseq/twist/generate_twist_tldr.py","file_url":"https://github.com/jungokasai/twist_decoding/blob/HEAD/fairseq/twist/generate_twist_tldr.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, jungokasai/twist_decoding when it was checked","code_sha256":"53d5b85264377a72","code_sha256_prefix":"53d5b85264377a72","mcp_get_code":{"code_sha256":"53d5b85264377a72"}}],"record_sha256":"7908ab6fd9a32c260e24cead8ebb9c3a205dcf2a3a50a8bd21f20c1e81068e16","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}