{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:D3Y4Y3UAAIG6KAO46HDCS56J5X","short_pith_number":"pith:D3Y4Y3UA","canonical_record":{"source":{"id":"2605.00348","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-05-01T02:14:38Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"4ca2bdde56b513257ff507ae1f28d029ffdf3873c9723cf3edcfb4f1ca49c364","abstract_canon_sha256":"28a72ea14f482ecaa8763aeed73cc9423891c6b77830fe2e3feccf2f3150e2a9"},"schema_version":"1.0"},"canonical_sha256":"1ef1cc6e80020de501dcf1c62977c9edec3afd3058762feefda014f45f60d26c","source":{"kind":"arxiv","id":"2605.00348","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.00348","created_at":"2026-06-24T01:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"2605.00348v2","created_at":"2026-06-24T01:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.00348","created_at":"2026-06-24T01:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"D3Y4Y3UAAIG6","created_at":"2026-06-24T01:14:28Z"},{"alias_kind":"pith_short_16","alias_value":"D3Y4Y3UAAIG6KAO4","created_at":"2026-06-24T01:14:28Z"},{"alias_kind":"pith_short_8","alias_value":"D3Y4Y3UA","created_at":"2026-06-24T01:14:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:D3Y4Y3UAAIG6KAO46HDCS56J5X","target":"record","payload":{"canonical_record":{"source":{"id":"2605.00348","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-05-01T02:14:38Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"4ca2bdde56b513257ff507ae1f28d029ffdf3873c9723cf3edcfb4f1ca49c364","abstract_canon_sha256":"28a72ea14f482ecaa8763aeed73cc9423891c6b77830fe2e3feccf2f3150e2a9"},"schema_version":"1.0"},"canonical_sha256":"1ef1cc6e80020de501dcf1c62977c9edec3afd3058762feefda014f45f60d26c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:14:28.156403Z","signature_b64":"gDd7GlMQ2uFkaMdUrJzRPgjFHip3q4W4dm+7lzctfcu8dnFufT4DM0h1FKhIPtNEdG40ApVCvLMpgLrli7WKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ef1cc6e80020de501dcf1c62977c9edec3afd3058762feefda014f45f60d26c","last_reissued_at":"2026-06-24T01:14:28.155958Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:14:28.155958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.00348","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-24T01:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WBVzDD938jmRKM4ivYGzxqumIykqYq2aQ2VZUDGW4E0ZkGLCfW/zHyjff0vun/zHTuwFj0uc3+F6dceU45ELCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T09:40:38.170155Z"},"content_sha256":"75e4fe54d3df89d5bafd01978456e38349cc461346d79eacb5c0de6a03e55b99","schema_version":"1.0","event_id":"sha256:75e4fe54d3df89d5bafd01978456e38349cc461346d79eacb5c0de6a03e55b99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:D3Y4Y3UAAIG6KAO46HDCS56J5X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Block-wise Codeword Embedding for Reliable Multi-bit Text Watermarking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Multi-bit LLM watermarking can reach 96.5 percent true positives at only 2 percent false positives by separating block-wise message estimation from window-shifting verification.","cross_cats":["cs.CL"],"primary_cat":"cs.CR","authors_text":"Dongsup Jin, HoEun Kim, Joeun Kim, Young-Sik Kim","submitted_at":"2026-05-01T02:14:38Z","abstract_excerpt":"Recent multi-bit watermarking methods for large language models (LLMs) prioritize capacity over reliability, often conflating decoding with detection. Our analysis reveals that existing ECC-based extractors suffer from catastrophic false positive rates (FPR), and applying rejection thresholds merely collapses detection sensitivity (TPR) to random guessing. To resolve this structural limitation, we propose BREW (Block-wise Reliable Embedding for Watermarking), a framework shifting the paradigm to designated verification. BREW employs a two-stage mechanism: (i) blind message estimation via indep"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"BREW achieves a TPR of 0.965 with an FPR of 0.02 under 10% synonym substitution, demonstrating that the high-FPR issue is not an inherent trade-off of multi-bit watermarking, but a solvable structural flaw of prior decoding-centric designs.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The two-stage mechanism of blind message estimation via independent block voting followed by window-shifting verification will rigorously validate the payload against local edits without introducing new failure modes or depending on unstated properties of the underlying LLM distribution.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"BREW achieves TPR of 0.965 and FPR of 0.02 under 10% synonym substitution by shifting from ECC decoding to designated verification with block voting and local validation.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Multi-bit LLM watermarking can reach 96.5 percent true positives at only 2 percent false positives by separating block-wise message estimation from window-shifting verification.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b93ed408c18f70d046c26235e83451050cc8471d734ee87a55802ce99ea28909"},"source":{"id":"2605.00348","kind":"arxiv","version":2},"verdict":{"id":"a3784704-10ea-49a3-811c-face440ae33c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-09T19:47:21.320421Z","strongest_claim":"BREW achieves a TPR of 0.965 with an FPR of 0.02 under 10% synonym substitution, demonstrating that the high-FPR issue is not an inherent trade-off of multi-bit watermarking, but a solvable structural flaw of prior decoding-centric designs.","one_line_summary":"BREW achieves TPR of 0.965 and FPR of 0.02 under 10% synonym substitution by shifting from ECC decoding to designated verification with block voting and local validation.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The two-stage mechanism of blind message estimation via independent block voting followed by window-shifting verification will rigorously validate the payload against local edits without introducing new failure modes or depending on unstated properties of the underlying LLM distribution.","pith_extraction_headline":"Multi-bit LLM watermarking can reach 96.5 percent true positives at only 2 percent false positives by separating block-wise message estimation from window-shifting verification."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.00348/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T20:34:05.716902Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T18:15:09.473497Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"ea0137a75a35335d6421602ebe27dce79a09b89064afabd2a75d2f30a6a6258a"},"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"},"verdict_id":"a3784704-10ea-49a3-811c-face440ae33c"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-24T01:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4IwlKkylRZRtEnR6zFuPlaMBOc9SKhy2nqOd/gVPXrsoZzDVPO+IyzOwzR2YvibyhWG8sBWje5XxZwuBmbxiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T09:40:38.170645Z"},"content_sha256":"7d25a7314f02aec9c916cc4bc7b96f1f0f76bf78c84e4bb00a4257b726db4503","schema_version":"1.0","event_id":"sha256:7d25a7314f02aec9c916cc4bc7b96f1f0f76bf78c84e4bb00a4257b726db4503"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D3Y4Y3UAAIG6KAO46HDCS56J5X/bundle.json","state_url":"https://pith.science/pith/D3Y4Y3UAAIG6KAO46HDCS56J5X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D3Y4Y3UAAIG6KAO46HDCS56J5X/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-29T09:40:38Z","links":{"resolver":"https://pith.science/pith/D3Y4Y3UAAIG6KAO46HDCS56J5X","bundle":"https://pith.science/pith/D3Y4Y3UAAIG6KAO46HDCS56J5X/bundle.json","state":"https://pith.science/pith/D3Y4Y3UAAIG6KAO46HDCS56J5X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D3Y4Y3UAAIG6KAO46HDCS56J5X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:D3Y4Y3UAAIG6KAO46HDCS56J5X","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"28a72ea14f482ecaa8763aeed73cc9423891c6b77830fe2e3feccf2f3150e2a9","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-05-01T02:14:38Z","title_canon_sha256":"4ca2bdde56b513257ff507ae1f28d029ffdf3873c9723cf3edcfb4f1ca49c364"},"schema_version":"1.0","source":{"id":"2605.00348","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.00348","created_at":"2026-06-24T01:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"2605.00348v2","created_at":"2026-06-24T01:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.00348","created_at":"2026-06-24T01:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"D3Y4Y3UAAIG6","created_at":"2026-06-24T01:14:28Z"},{"alias_kind":"pith_short_16","alias_value":"D3Y4Y3UAAIG6KAO4","created_at":"2026-06-24T01:14:28Z"},{"alias_kind":"pith_short_8","alias_value":"D3Y4Y3UA","created_at":"2026-06-24T01:14:28Z"}],"graph_snapshots":[{"event_id":"sha256:7d25a7314f02aec9c916cc4bc7b96f1f0f76bf78c84e4bb00a4257b726db4503","target":"graph","created_at":"2026-06-24T01:14:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"BREW achieves a TPR of 0.965 with an FPR of 0.02 under 10% synonym substitution, demonstrating that the high-FPR issue is not an inherent trade-off of multi-bit watermarking, but a solvable structural flaw of prior decoding-centric designs."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The two-stage mechanism of blind message estimation via independent block voting followed by window-shifting verification will rigorously validate the payload against local edits without introducing new failure modes or depending on unstated properties of the underlying LLM distribution."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"BREW achieves TPR of 0.965 and FPR of 0.02 under 10% synonym substitution by shifting from ECC decoding to designated verification with block voting and local validation."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Multi-bit LLM watermarking can reach 96.5 percent true positives at only 2 percent false positives by separating block-wise message estimation from window-shifting verification."}],"snapshot_sha256":"b93ed408c18f70d046c26235e83451050cc8471d734ee87a55802ce99ea28909"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T20:34:05.716902Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T18:15:09.473497Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.00348/integrity.json","findings":[],"snapshot_sha256":"ea0137a75a35335d6421602ebe27dce79a09b89064afabd2a75d2f30a6a6258a","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent multi-bit watermarking methods for large language models (LLMs) prioritize capacity over reliability, often conflating decoding with detection. Our analysis reveals that existing ECC-based extractors suffer from catastrophic false positive rates (FPR), and applying rejection thresholds merely collapses detection sensitivity (TPR) to random guessing. To resolve this structural limitation, we propose BREW (Block-wise Reliable Embedding for Watermarking), a framework shifting the paradigm to designated verification. BREW employs a two-stage mechanism: (i) blind message estimation via indep","authors_text":"Dongsup Jin, HoEun Kim, Joeun Kim, Young-Sik Kim","cross_cats":["cs.CL"],"headline":"Multi-bit LLM watermarking can reach 96.5 percent true positives at only 2 percent false positives by separating block-wise message estimation from window-shifting verification.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-05-01T02:14:38Z","title":"Block-wise Codeword Embedding for Reliable Multi-bit Text Watermarking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.00348","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-09T19:47:21.320421Z","id":"a3784704-10ea-49a3-811c-face440ae33c","model_set":{"reader":"grok-4.3"},"one_line_summary":"BREW achieves TPR of 0.965 and FPR of 0.02 under 10% synonym substitution by shifting from ECC decoding to designated verification with block voting and local validation.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Multi-bit LLM watermarking can reach 96.5 percent true positives at only 2 percent false positives by separating block-wise message estimation from window-shifting verification.","strongest_claim":"BREW achieves a TPR of 0.965 with an FPR of 0.02 under 10% synonym substitution, demonstrating that the high-FPR issue is not an inherent trade-off of multi-bit watermarking, but a solvable structural flaw of prior decoding-centric designs.","weakest_assumption":"The two-stage mechanism of blind message estimation via independent block voting followed by window-shifting verification will rigorously validate the payload against local edits without introducing new failure modes or depending on unstated properties of the underlying LLM distribution."}},"verdict_id":"a3784704-10ea-49a3-811c-face440ae33c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:75e4fe54d3df89d5bafd01978456e38349cc461346d79eacb5c0de6a03e55b99","target":"record","created_at":"2026-06-24T01:14:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"28a72ea14f482ecaa8763aeed73cc9423891c6b77830fe2e3feccf2f3150e2a9","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-05-01T02:14:38Z","title_canon_sha256":"4ca2bdde56b513257ff507ae1f28d029ffdf3873c9723cf3edcfb4f1ca49c364"},"schema_version":"1.0","source":{"id":"2605.00348","kind":"arxiv","version":2}},"canonical_sha256":"1ef1cc6e80020de501dcf1c62977c9edec3afd3058762feefda014f45f60d26c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ef1cc6e80020de501dcf1c62977c9edec3afd3058762feefda014f45f60d26c","first_computed_at":"2026-06-24T01:14:28.155958Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T01:14:28.155958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gDd7GlMQ2uFkaMdUrJzRPgjFHip3q4W4dm+7lzctfcu8dnFufT4DM0h1FKhIPtNEdG40ApVCvLMpgLrli7WKDA==","signature_status":"signed_v1","signed_at":"2026-06-24T01:14:28.156403Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.00348","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75e4fe54d3df89d5bafd01978456e38349cc461346d79eacb5c0de6a03e55b99","sha256:7d25a7314f02aec9c916cc4bc7b96f1f0f76bf78c84e4bb00a4257b726db4503"],"state_sha256":"a41470006c56b5918cc15a41b0cbe35b5be72cdff29c0d21177c93cd9d923937"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ieUGSK9EyzODkM3c1wuE3Brq70ecAWFPgHVfCyJpTOAP5viX3nOcjaeCn3eec5M86tqJd5fGXgs1USifvBOZBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T09:40:38.172947Z","bundle_sha256":"3a771298043a07848d1c7b49676441602ca23b3072c4b060e721a1dfa9c06fb6"}}