{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:I2OSNQKPWGB7QUIFNBTDSXDR5J","short_pith_number":"pith:I2OSNQKP","schema_version":"1.0","canonical_sha256":"469d26c14fb183f851056866395c71ea7a45a35868e4b6fdc572fa5d73916b88","source":{"kind":"arxiv","id":"2307.15992","version":3},"attestation_state":"computed","paper":{"title":"Towards Codable Watermarking for Injecting Multi-bits Information to LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Deli Chen, Fandong Meng, Hao Zhou, Jie Zhou, Lean Wang, Wenkai Yang, Xu Sun, Yankai Lin","submitted_at":"2023-07-29T14:11:15Z","abstract_excerpt":"As large language models (LLMs) generate texts with increasing fluency and realism, there is a growing need to identify the source of texts to prevent the abuse of LLMs. Text watermarking techniques have proven reliable in distinguishing whether a text is generated by LLMs by injecting hidden patterns. However, we argue that existing LLM watermarking methods are encoding-inefficient and cannot flexibly meet the diverse information encoding needs (such as encoding model version, generation time, user id, etc.). In this work, we conduct the first systematic study on the topic of Codable Text Wat"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2307.15992","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-07-29T14:11:15Z","cross_cats_sorted":[],"title_canon_sha256":"f73f8f4fbab0b53791b5f19ad0c01906045d6d13fcabd19ff6e4458270df086a","abstract_canon_sha256":"b8380fbda201e1013c0314f0067db19d0eb9ef9b9d0a3b491e3a45240bbea5ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:03:42.980854Z","signature_b64":"YPbRtIfMZk7nYhNWK1IwjRenAFlzGfpk29wAY841dRX9yNlczkXbNDbCLq0Nu5KreLA9mRifS/BjIBcKdKHBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"469d26c14fb183f851056866395c71ea7a45a35868e4b6fdc572fa5d73916b88","last_reissued_at":"2026-07-05T08:03:42.980242Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:03:42.980242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Codable Watermarking for Injecting Multi-bits Information to LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Deli Chen, Fandong Meng, Hao Zhou, Jie Zhou, Lean Wang, Wenkai Yang, Xu Sun, Yankai Lin","submitted_at":"2023-07-29T14:11:15Z","abstract_excerpt":"As large language models (LLMs) generate texts with increasing fluency and realism, there is a growing need to identify the source of texts to prevent the abuse of LLMs. Text watermarking techniques have proven reliable in distinguishing whether a text is generated by LLMs by injecting hidden patterns. However, we argue that existing LLM watermarking methods are encoding-inefficient and cannot flexibly meet the diverse information encoding needs (such as encoding model version, generation time, user id, etc.). In this work, we conduct the first systematic study on the topic of Codable Text Wat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.15992","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.15992/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2307.15992","created_at":"2026-07-05T08:03:42.980312+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.15992v3","created_at":"2026-07-05T08:03:42.980312+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.15992","created_at":"2026-07-05T08:03:42.980312+00:00"},{"alias_kind":"pith_short_12","alias_value":"I2OSNQKPWGB7","created_at":"2026-07-05T08:03:42.980312+00:00"},{"alias_kind":"pith_short_16","alias_value":"I2OSNQKPWGB7QUIF","created_at":"2026-07-05T08:03:42.980312+00:00"},{"alias_kind":"pith_short_8","alias_value":"I2OSNQKP","created_at":"2026-07-05T08:03:42.980312+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20835","citing_title":"PromptMark: A Prompt-Guided Iterative-Feedback Framework for Source Code Watermarking","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25796","citing_title":"SAMark: A Self-Anchored Text Watermarking with Paragraph-Level Paraphrase Robustness","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16709","citing_title":"Covert Multi-bit LLM Watermarking: An Information Theory and Coding Approach","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2510.18333","citing_title":"Position: LLM Watermarking Should Align Stakeholders' Incentives for Practical Adoption","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25247","citing_title":"R-CoT: A Reasoning-Layer Watermark via Redundant Chain-of-Thought in Large Language Models","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08759","citing_title":"Optimal Multi-bit Generative Watermarking Schemes Under Worst-Case False-Alarm Constraints","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06987","citing_title":"Response Time Enhances Alignment with Heterogeneous Preferences","ref_index":103,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I2OSNQKPWGB7QUIFNBTDSXDR5J","json":"https://pith.science/pith/I2OSNQKPWGB7QUIFNBTDSXDR5J.json","graph_json":"https://pith.science/api/pith-number/I2OSNQKPWGB7QUIFNBTDSXDR5J/graph.json","events_json":"https://pith.science/api/pith-number/I2OSNQKPWGB7QUIFNBTDSXDR5J/events.json","paper":"https://pith.science/paper/I2OSNQKP"},"agent_actions":{"view_html":"https://pith.science/pith/I2OSNQKPWGB7QUIFNBTDSXDR5J","download_json":"https://pith.science/pith/I2OSNQKPWGB7QUIFNBTDSXDR5J.json","view_paper":"https://pith.science/paper/I2OSNQKP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.15992&json=true","fetch_graph":"https://pith.science/api/pith-number/I2OSNQKPWGB7QUIFNBTDSXDR5J/graph.json","fetch_events":"https://pith.science/api/pith-number/I2OSNQKPWGB7QUIFNBTDSXDR5J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I2OSNQKPWGB7QUIFNBTDSXDR5J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I2OSNQKPWGB7QUIFNBTDSXDR5J/action/storage_attestation","attest_author":"https://pith.science/pith/I2OSNQKPWGB7QUIFNBTDSXDR5J/action/author_attestation","sign_citation":"https://pith.science/pith/I2OSNQKPWGB7QUIFNBTDSXDR5J/action/citation_signature","submit_replication":"https://pith.science/pith/I2OSNQKPWGB7QUIFNBTDSXDR5J/action/replication_record"}},"created_at":"2026-07-05T08:03:42.980312+00:00","updated_at":"2026-07-05T08:03:42.980312+00:00"}