{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/additive-prf","entry":"additive_prf","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":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":2,"n_samples_ran":2,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":0},"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":"2404.01245","paper":"/paper/a-statistical-framework-of-watermarks-for","title":"A Statistical Framework of Watermarks for Large Language Models: Pivot, Detection Efficiency and Optimal Rules","date":"2024-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lx10077/WatermarkFramework","path":"watermark_demo.py","file_url":"https://github.com/lx10077/WatermarkFramework/blob/HEAD/watermark_demo.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2868d7ea31eb2daf","mcp_get_code":{"code_sha256":"2868d7ea31eb2daf"}},{"arxiv_id":"2403.17983","paper":"/paper/is-watermarking-llm-generated-code-robust","title":"Is The Watermarking Of LLM-Generated Code Robust?","date":"2024-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uiuc-arc/llm-code-watermark","path":"lpw/lmw/watermark_reliability_release/alternative_prf_schemes.py","file_url":"https://github.com/uiuc-arc/llm-code-watermark/blob/HEAD/lpw/lmw/watermark_reliability_release/alternative_prf_schemes.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3e107246e54539b5","mcp_get_code":{"code_sha256":"3e107246e54539b5"}},{"arxiv_id":"2403.13027","paper":"/paper/towards-better-statistical-understanding-of","title":"Towards Better Statistical Understanding of Watermarking LLMs","date":"2024-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongzecai/dualga","path":"WatermarkAlgorithm/utils/alternative_prf_schemes.py","file_url":"https://github.com/zhongzecai/dualga/blob/HEAD/WatermarkAlgorithm/utils/alternative_prf_schemes.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3e107246e54539b5","mcp_get_code":{"code_sha256":"3e107246e54539b5"}},{"arxiv_id":"2402.14007","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":"src_watermark/kgw/alternative_prf_schemes.py","file_url":"https://github.com/zwhe99/x-sir/blob/HEAD/src_watermark/kgw/alternative_prf_schemes.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3e107246e54539b5","mcp_get_code":{"code_sha256":"3e107246e54539b5"}},{"arxiv_id":"2311.08721","paper":"/paper/a-robust-semantics-based-watermark-for-large","title":"A Robust Semantics-based Watermark for Large Language Model against Paraphrasing","date":null,"month_inferred_from_arxiv_id":"2023-11","title_source":"archive","repo":"renjie3/semamark","path":"alternative_prf_schemes.py","file_url":"https://github.com/renjie3/semamark/blob/HEAD/alternative_prf_schemes.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3e107246e54539b5","mcp_get_code":{"code_sha256":"3e107246e54539b5"}}]}