{"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/match-score","entry":"match_score","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":7,"n_papers_ran_no_instrument_failure":5,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":6,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":2,"ran":3,"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":"2601.10712","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-10712","title":"MatchTIR: Fine-Grained Supervision for Tool-Integrated Reasoning via Bipartite Matching","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"quchangle1/MatchTIR","path":"Code/verl/utils/reward_score/tool.py","file_url":"https://github.com/quchangle1/MatchTIR/blob/HEAD/Code/verl/utils/reward_score/tool.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, quchangle1/MatchTIR when it was checked","code_sha256":"94757c508755516a","code_sha256_prefix":"94757c508755516a","mcp_get_code":{"code_sha256":"94757c508755516a"}},{"arxiv_id":"2504.13958","arxiv_id_is_arxiv":true,"paper":"/paper/toolrl-reward-is-all-tool-learning-needs","title":"ToolRL: Reward is All Tool Learning Needs","date":"2025-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiancheng0/toolrl","path":"verl/utils/reward_score/rlla.py","file_url":"https://github.com/qiancheng0/toolrl/blob/HEAD/verl/utils/reward_score/rlla.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6281513745ecdf4e","code_sha256_prefix":"6281513745ecdf4e","mcp_get_code":{"code_sha256":"6281513745ecdf4e"}},{"arxiv_id":"2502.08265","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-the-potential-of-large-language-12","title":"Exploring the Potential of Large Language Models to Simulate Personality","date":"2025-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mary-silence/simulating_personality","path":"experiment_functions/questionnaire.py","file_url":"https://github.com/mary-silence/simulating_personality/blob/HEAD/experiment_functions/questionnaire.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"10fc91019ecc483f","code_sha256_prefix":"10fc91019ecc483f","mcp_get_code":{"code_sha256":"10fc91019ecc483f"}},{"arxiv_id":"2412.00207","arxiv_id_is_arxiv":true,"paper":"/paper/can-llm-self-report-evaluating-the-validity","title":"Can LLM \"Self-report\"?: Evaluating the Validity of Self-report Scales in Measuring Personality Design in LLM-based Chatbots","date":null,"month_inferred_from_arxiv_id":"2024-12","title_source":"archive","repo":"isle-dev/self-report","path":"self_report.py","file_url":"https://github.com/isle-dev/self-report/blob/HEAD/self_report.py","status":"ran","verification_level":1,"contract_check":null,"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, isle-dev/self-report when it was checked","code_sha256":"328a2e7aef54aed2","code_sha256_prefix":"328a2e7aef54aed2","mcp_get_code":{"code_sha256":"328a2e7aef54aed2"}},{"arxiv_id":"2402.18025","arxiv_id_is_arxiv":true,"paper":"/paper/hire-a-linguist-learning-endangered-languages","title":"Hire a Linguist!: Learning Endangered Languages with In-Context Linguistic Descriptions","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"llilab/llm4endangeredlang","path":"fst_src/ilg_helpers.py","file_url":"https://github.com/llilab/llm4endangeredlang/blob/HEAD/fst_src/ilg_helpers.py","status":"ran","verification_level":1,"contract_check":null,"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, llilab/llm4endangeredlang when it was checked","code_sha256":"fa9257629938eebf","code_sha256_prefix":"fa9257629938eebf","mcp_get_code":{"code_sha256":"fa9257629938eebf"}},{"arxiv_id":"2402.11100","arxiv_id_is_arxiv":true,"paper":"/paper/when-llms-meet-cunning-questions-a-fallacy","title":"When LLMs Meet Cunning Texts: A Fallacy Understanding Benchmark for Large Language Models","date":"2024-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thukelab/flub","path":"code/analysis.py","file_url":"https://github.com/thukelab/flub/blob/HEAD/code/analysis.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, thukelab/flub (NOASSERTION)","code_sha256":"480af19711021070","code_sha256_prefix":"480af19711021070","mcp_get_code":{"code_sha256":"480af19711021070"}},{"arxiv_id":"2310.13774","arxiv_id_is_arxiv":true,"paper":"/paper/seq2seq-is-all-you-need-for-coreference","title":"Seq2seq is All You Need for Coreference Resolution","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WenzhengZhang/Seq2seqCoref","path":"alignment.py","file_url":"https://github.com/WenzhengZhang/Seq2seqCoref/blob/HEAD/alignment.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2f6a512c201dda17","code_sha256_prefix":"2f6a512c201dda17","mcp_get_code":{"code_sha256":"2f6a512c201dda17"}}],"record_sha256":"61b270278683b7d0192eaa94f3ae5372dc269f07882cdcaa95db82ac775f878d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}