{"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/num-tokens-consumed-from-request","entry":"num_tokens_consumed_from_request","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":10,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":0,"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":6,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":9,"n_places_pointer_only_link_open":3,"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":0,"ran_fixture":0,"ran":0,"unverified":6},"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":"2406.06040","arxiv_id_is_arxiv":true,"paper":"/paper/vript-a-video-is-worth-thousands-of-words","title":"Vript: A Video Is Worth Thousands of Words","date":"2024-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mutonix/Vript","path":"vript-hard/verification_pipeline/verify_vript-rr_open_answer.py","file_url":"https://github.com/mutonix/Vript/blob/HEAD/vript-hard/verification_pipeline/verify_vript-rr_open_answer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, mutonix/Vript (NOASSERTION)","code_sha256":"980b8c8c57db1559","code_sha256_prefix":"980b8c8c57db1559","mcp_get_code":{"code_sha256":"980b8c8c57db1559"}},{"arxiv_id":"2405.16405","arxiv_id_is_arxiv":true,"paper":"/paper/intruding-with-words-towards-understanding","title":"Intruding with Words: Towards Understanding Graph Injection Attacks at the Text Level","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Leirunlin/Text-level-Graph-Attack","path":"async_api.py","file_url":"https://github.com/Leirunlin/Text-level-Graph-Attack/blob/HEAD/async_api.py","status":"unverified","verification_level":0,"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, Leirunlin/Text-level-Graph-Attack when it was checked","code_sha256":"27007d0ec4adb00b","code_sha256_prefix":"27007d0ec4adb00b","mcp_get_code":{"code_sha256":"27007d0ec4adb00b"}},{"arxiv_id":"2405.07248","arxiv_id_is_arxiv":true,"paper":"/paper/limited-ability-of-llms-to-simulate-human","title":"Limited Ability of LLMs to Simulate Human Psychological Behaviours: a Psychometric Analysis","date":"2024-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nikbpetrov/llms-simulate-humans","path":"shared/api_request_parallel_processor.py","file_url":"https://github.com/nikbpetrov/llms-simulate-humans/blob/HEAD/shared/api_request_parallel_processor.py","status":"unverified","verification_level":0,"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, nikbpetrov/llms-simulate-humans when it was checked","code_sha256":"f4c22f93497c3118","code_sha256_prefix":"f4c22f93497c3118","mcp_get_code":{"code_sha256":"f4c22f93497c3118"}},{"arxiv_id":"2403.06754","arxiv_id_is_arxiv":true,"paper":"/paper/alarm-align-language-models-via-hierarchical","title":"ALaRM: Align Language Models via Hierarchical Rewards Modeling","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"halfrot/ALaRM","path":"eval/api_request_parallel_processor.py","file_url":"https://github.com/halfrot/ALaRM/blob/HEAD/eval/api_request_parallel_processor.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from Leirunlin/Text-level-Graph-Attack, and GitHub detected no licence in that repository when it was checked","code_sha256":"27007d0ec4adb00b","code_sha256_prefix":"27007d0ec4adb00b","mcp_get_code":{"code_sha256":"27007d0ec4adb00b"}},{"arxiv_id":"2402.14007","arxiv_id_is_arxiv":true,"paper":"/paper/can-watermarks-survive-translation-on-the","title":"Can Watermarks Survive Translation? On the Cross-lingual Consistency of Text Watermark for Large Language Models","date":"2024-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zwhe99/x-sir","path":"attack/call_openai.py","file_url":"https://github.com/zwhe99/x-sir/blob/HEAD/attack/call_openai.py","status":"unverified","verification_level":0,"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, zwhe99/x-sir when it was checked","code_sha256":"0bb66ead98840b56","code_sha256_prefix":"0bb66ead98840b56","mcp_get_code":{"code_sha256":"0bb66ead98840b56"}},{"arxiv_id":"2311.07054","arxiv_id_is_arxiv":true,"paper":"/paper/do-llms-implicitly-exhibit-user","title":"A Study of Implicit Ranking Unfairness in Large Language Models","date":"2023-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuchen0427/implicit_rank_unfairness","path":"API/openai.py","file_url":"https://github.com/xuchen0427/implicit_rank_unfairness/blob/HEAD/API/openai.py","status":"unverified","verification_level":0,"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, xuchen0427/implicit_rank_unfairness when it was checked","code_sha256":"766df5c74af871f7","code_sha256_prefix":"766df5c74af871f7","mcp_get_code":{"code_sha256":"766df5c74af871f7"}},{"arxiv_id":"2309.16595","arxiv_id_is_arxiv":true,"paper":"/paper/can-llms-effectively-leverage-structural","title":"Can LLMs Effectively Leverage Graph Structural Information through Prompts, and Why?","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CurryTang/Graph-LLM","path":"async_api.py","file_url":"https://github.com/CurryTang/Graph-LLM/blob/HEAD/async_api.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Leirunlin/Text-level-Graph-Attack, and GitHub detected no licence in that repository when it was checked","code_sha256":"27007d0ec4adb00b","code_sha256_prefix":"27007d0ec4adb00b","mcp_get_code":{"code_sha256":"27007d0ec4adb00b"}},{"arxiv_id":"2309.07430","arxiv_id_is_arxiv":true,"paper":"/paper/clinical-text-summarization-adapting-large","title":"Adapted Large Language Models Can Outperform Medical Experts in Clinical Text Summarization","date":"2023-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanfordmimi/clin-summ","path":"api/call_api.py","file_url":"https://github.com/stanfordmimi/clin-summ/blob/HEAD/api/call_api.py","status":"unverified","verification_level":0,"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, stanfordmimi/clin-summ when it was checked","code_sha256":"27007d0ec4adb00b","code_sha256_prefix":"27007d0ec4adb00b","mcp_get_code":{"code_sha256":"27007d0ec4adb00b"}},{"arxiv_id":"2025.naacl-long.309","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.naacl-long.309","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"shengminp/TinyThinker","path":"datasets/openai_request.py","file_url":"https://github.com/shengminp/TinyThinker/blob/HEAD/datasets/openai_request.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":"dc69b0c72c7a93c2","code_sha256_prefix":"dc69b0c72c7a93c2","mcp_get_code":{"code_sha256":"dc69b0c72c7a93c2"}},{"arxiv_id":"2025.findings-acl.605","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.605","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ytyz1307zzh/RefAug","path":"src/utils/openai_parallel_request.py","file_url":"https://github.com/ytyz1307zzh/RefAug/blob/HEAD/src/utils/openai_parallel_request.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from Leirunlin/Text-level-Graph-Attack, and GitHub detected no licence in that repository when it was checked","code_sha256":"27007d0ec4adb00b","code_sha256_prefix":"27007d0ec4adb00b","mcp_get_code":{"code_sha256":"27007d0ec4adb00b"}}],"record_sha256":"3b9c3333c2f765e8e944ea3121ada5c2f7a5ab7d575b8092a078339f5661e2ef","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}