{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:OBT6XKU5DEE4BGCJBRGZJ2X6DB","short_pith_number":"pith:OBT6XKU5","schema_version":"1.0","canonical_sha256":"7067ebaa9d1909c098490c4d94eafe1859efd9e7e86f1eff85b61ba9797d3a5d","source":{"kind":"arxiv","id":"2310.18491","version":4},"attestation_state":"computed","paper":{"title":"Publicly-Detectable Watermarking for Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.CR"],"primary_cat":"cs.LG","authors_text":"Jaiden Fairoze, Mingyuan Wang, Mohammad Mahmoody, Saeed Mahloujifar, Sanjam Garg, Somesh Jha","submitted_at":"2023-10-27T21:08:51Z","abstract_excerpt":"We present a publicly-detectable watermarking scheme for LMs: the detection algorithm contains no secret information, and it is executable by anyone. We embed a publicly-verifiable cryptographic signature into LM output using rejection sampling and prove that this produces unforgeable and distortion-free (i.e., undetectable without access to the public key) text output. We make use of error-correction to overcome periods of low entropy, a barrier for all prior watermarking schemes. We implement our scheme and find that our formal claims are met in practice."},"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":"2310.18491","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-27T21:08:51Z","cross_cats_sorted":["cs.CL","cs.CR"],"title_canon_sha256":"6f61fcd95e59db609cd60c88a91e537535f80491b8c47aa0d115a6397ae22112","abstract_canon_sha256":"8609bf25d1176b47342e9ee867755b29666deef2578678cde998a0e52f7206e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:48.324677Z","signature_b64":"4MrCqawtyXqb74gBkDBDWkYiHqLd7+N1/RsqVvzEcpkqMwvdrsYCXiujTVJOhxfoWZkgr7b70HTbEt73HH0qAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7067ebaa9d1909c098490c4d94eafe1859efd9e7e86f1eff85b61ba9797d3a5d","last_reissued_at":"2026-07-05T09:56:48.324055Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:48.324055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Publicly-Detectable Watermarking for Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.CR"],"primary_cat":"cs.LG","authors_text":"Jaiden Fairoze, Mingyuan Wang, Mohammad Mahmoody, Saeed Mahloujifar, Sanjam Garg, Somesh Jha","submitted_at":"2023-10-27T21:08:51Z","abstract_excerpt":"We present a publicly-detectable watermarking scheme for LMs: the detection algorithm contains no secret information, and it is executable by anyone. We embed a publicly-verifiable cryptographic signature into LM output using rejection sampling and prove that this produces unforgeable and distortion-free (i.e., undetectable without access to the public key) text output. We make use of error-correction to overcome periods of low entropy, a barrier for all prior watermarking schemes. We implement our scheme and find that our formal claims are met in practice."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.18491","kind":"arxiv","version":4},"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/2310.18491/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":"2310.18491","created_at":"2026-07-05T09:56:48.324129+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.18491v4","created_at":"2026-07-05T09:56:48.324129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.18491","created_at":"2026-07-05T09:56:48.324129+00:00"},{"alias_kind":"pith_short_12","alias_value":"OBT6XKU5DEE4","created_at":"2026-07-05T09:56:48.324129+00:00"},{"alias_kind":"pith_short_16","alias_value":"OBT6XKU5DEE4BGCJ","created_at":"2026-07-05T09:56:48.324129+00:00"},{"alias_kind":"pith_short_8","alias_value":"OBT6XKU5","created_at":"2026-07-05T09:56:48.324129+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04486","citing_title":"Global Sketch-Based Watermarking for Diffusion Language Models","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01532","citing_title":"Rethinking the Role of Positional Encoding: Sliding-Window Transformers without PE Remain Turing Complete","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25796","citing_title":"SAMark: A Self-Anchored Text Watermarking with Paragraph-Level Paraphrase Robustness","ref_index":40,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OBT6XKU5DEE4BGCJBRGZJ2X6DB","json":"https://pith.science/pith/OBT6XKU5DEE4BGCJBRGZJ2X6DB.json","graph_json":"https://pith.science/api/pith-number/OBT6XKU5DEE4BGCJBRGZJ2X6DB/graph.json","events_json":"https://pith.science/api/pith-number/OBT6XKU5DEE4BGCJBRGZJ2X6DB/events.json","paper":"https://pith.science/paper/OBT6XKU5"},"agent_actions":{"view_html":"https://pith.science/pith/OBT6XKU5DEE4BGCJBRGZJ2X6DB","download_json":"https://pith.science/pith/OBT6XKU5DEE4BGCJBRGZJ2X6DB.json","view_paper":"https://pith.science/paper/OBT6XKU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.18491&json=true","fetch_graph":"https://pith.science/api/pith-number/OBT6XKU5DEE4BGCJBRGZJ2X6DB/graph.json","fetch_events":"https://pith.science/api/pith-number/OBT6XKU5DEE4BGCJBRGZJ2X6DB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OBT6XKU5DEE4BGCJBRGZJ2X6DB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OBT6XKU5DEE4BGCJBRGZJ2X6DB/action/storage_attestation","attest_author":"https://pith.science/pith/OBT6XKU5DEE4BGCJBRGZJ2X6DB/action/author_attestation","sign_citation":"https://pith.science/pith/OBT6XKU5DEE4BGCJBRGZJ2X6DB/action/citation_signature","submit_replication":"https://pith.science/pith/OBT6XKU5DEE4BGCJBRGZJ2X6DB/action/replication_record"}},"created_at":"2026-07-05T09:56:48.324129+00:00","updated_at":"2026-07-05T09:56:48.324129+00:00"}