{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ZUMCUVBKM2FCJFLKOR5DD5CJWC","short_pith_number":"pith:ZUMCUVBK","canonical_record":{"source":{"id":"2310.06356","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-10-10T06:49:43Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"3d2f86b0544f36acc0d8968e32aebf85d7e5774e59de52cf755f020de453c4ef","abstract_canon_sha256":"dee501aadb988833111398b16f28354f2c6b9fd8a581ea4d216c259d8026f215"},"schema_version":"1.0"},"canonical_sha256":"cd182a542a668a24956a747a31f449b09c728428ab74285a3a840d6cdc12d5ff","source":{"kind":"arxiv","id":"2310.06356","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.06356","created_at":"2026-07-05T08:20:24Z"},{"alias_kind":"arxiv_version","alias_value":"2310.06356v3","created_at":"2026-07-05T08:20:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.06356","created_at":"2026-07-05T08:20:24Z"},{"alias_kind":"pith_short_12","alias_value":"ZUMCUVBKM2FC","created_at":"2026-07-05T08:20:24Z"},{"alias_kind":"pith_short_16","alias_value":"ZUMCUVBKM2FCJFLK","created_at":"2026-07-05T08:20:24Z"},{"alias_kind":"pith_short_8","alias_value":"ZUMCUVBK","created_at":"2026-07-05T08:20:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ZUMCUVBKM2FCJFLKOR5DD5CJWC","target":"record","payload":{"canonical_record":{"source":{"id":"2310.06356","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-10-10T06:49:43Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"3d2f86b0544f36acc0d8968e32aebf85d7e5774e59de52cf755f020de453c4ef","abstract_canon_sha256":"dee501aadb988833111398b16f28354f2c6b9fd8a581ea4d216c259d8026f215"},"schema_version":"1.0"},"canonical_sha256":"cd182a542a668a24956a747a31f449b09c728428ab74285a3a840d6cdc12d5ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:20:24.678362Z","signature_b64":"QgpiIn8QJneEIQsE5lqbMcYe6+oHUoOBZlk4sjKpZ9DDglorCEJLPKIup+XQQKg3sTNIA3xVhk3Ffyeb99WEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd182a542a668a24956a747a31f449b09c728428ab74285a3a840d6cdc12d5ff","last_reissued_at":"2026-07-05T08:20:24.677957Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:20:24.677957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.06356","source_version":3,"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-07-05T08:20:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JU5VIF3po2L4i8J+Z+XtaVwymHXEZfPglVKAmY3VMkfOTBWbuk31YRUMtDTBQEBpTRS8lQFJ+x11SDuzmbUZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:47:18.023170Z"},"content_sha256":"c04e2b6df2a530400b91782477759c5347c4b0c30525199ca7e00dd617361428","schema_version":"1.0","event_id":"sha256:c04e2b6df2a530400b91782477759c5347c4b0c30525199ca7e00dd617361428"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ZUMCUVBKM2FCJFLKOR5DD5CJWC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Semantic Invariant Robust Watermark for Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.CR","authors_text":"Aiwei Liu, Leyi Pan, Lijie Wen, Shiao Meng, Xuming Hu","submitted_at":"2023-10-10T06:49:43Z","abstract_excerpt":"Watermark algorithms for large language models (LLMs) have achieved extremely high accuracy in detecting text generated by LLMs. Such algorithms typically involve adding extra watermark logits to the LLM's logits at each generation step. However, prior algorithms face a trade-off between attack robustness and security robustness. This is because the watermark logits for a token are determined by a certain number of preceding tokens; a small number leads to low security robustness, while a large number results in insufficient attack robustness. In this work, we propose a semantic invariant wate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.06356","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/2310.06356/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:20:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oiZ4N4HWgmpVwds7z8K8UI/5Eq7ytZgWqW8eXv4PePqAf3Pj6D1wIqUtHwzlQm+HX8xwtGsKqqS65/D+WKP9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:47:18.023699Z"},"content_sha256":"08e374922c6887e5ec99839e4bdef45637f7fb6f3aa9b9090cfdc795718b96a6","schema_version":"1.0","event_id":"sha256:08e374922c6887e5ec99839e4bdef45637f7fb6f3aa9b9090cfdc795718b96a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZUMCUVBKM2FCJFLKOR5DD5CJWC/bundle.json","state_url":"https://pith.science/pith/ZUMCUVBKM2FCJFLKOR5DD5CJWC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZUMCUVBKM2FCJFLKOR5DD5CJWC/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-08-06T22:47:18Z","links":{"resolver":"https://pith.science/pith/ZUMCUVBKM2FCJFLKOR5DD5CJWC","bundle":"https://pith.science/pith/ZUMCUVBKM2FCJFLKOR5DD5CJWC/bundle.json","state":"https://pith.science/pith/ZUMCUVBKM2FCJFLKOR5DD5CJWC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZUMCUVBKM2FCJFLKOR5DD5CJWC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ZUMCUVBKM2FCJFLKOR5DD5CJWC","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":"dee501aadb988833111398b16f28354f2c6b9fd8a581ea4d216c259d8026f215","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-10-10T06:49:43Z","title_canon_sha256":"3d2f86b0544f36acc0d8968e32aebf85d7e5774e59de52cf755f020de453c4ef"},"schema_version":"1.0","source":{"id":"2310.06356","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.06356","created_at":"2026-07-05T08:20:24Z"},{"alias_kind":"arxiv_version","alias_value":"2310.06356v3","created_at":"2026-07-05T08:20:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.06356","created_at":"2026-07-05T08:20:24Z"},{"alias_kind":"pith_short_12","alias_value":"ZUMCUVBKM2FC","created_at":"2026-07-05T08:20:24Z"},{"alias_kind":"pith_short_16","alias_value":"ZUMCUVBKM2FCJFLK","created_at":"2026-07-05T08:20:24Z"},{"alias_kind":"pith_short_8","alias_value":"ZUMCUVBK","created_at":"2026-07-05T08:20:24Z"}],"graph_snapshots":[{"event_id":"sha256:08e374922c6887e5ec99839e4bdef45637f7fb6f3aa9b9090cfdc795718b96a6","target":"graph","created_at":"2026-07-05T08:20:24Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2310.06356/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Watermark algorithms for large language models (LLMs) have achieved extremely high accuracy in detecting text generated by LLMs. Such algorithms typically involve adding extra watermark logits to the LLM's logits at each generation step. However, prior algorithms face a trade-off between attack robustness and security robustness. This is because the watermark logits for a token are determined by a certain number of preceding tokens; a small number leads to low security robustness, while a large number results in insufficient attack robustness. In this work, we propose a semantic invariant wate","authors_text":"Aiwei Liu, Leyi Pan, Lijie Wen, Shiao Meng, Xuming Hu","cross_cats":["cs.CL"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-10-10T06:49:43Z","title":"A Semantic Invariant Robust Watermark for Large Language Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.06356","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c04e2b6df2a530400b91782477759c5347c4b0c30525199ca7e00dd617361428","target":"record","created_at":"2026-07-05T08:20:24Z","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":"dee501aadb988833111398b16f28354f2c6b9fd8a581ea4d216c259d8026f215","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-10-10T06:49:43Z","title_canon_sha256":"3d2f86b0544f36acc0d8968e32aebf85d7e5774e59de52cf755f020de453c4ef"},"schema_version":"1.0","source":{"id":"2310.06356","kind":"arxiv","version":3}},"canonical_sha256":"cd182a542a668a24956a747a31f449b09c728428ab74285a3a840d6cdc12d5ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd182a542a668a24956a747a31f449b09c728428ab74285a3a840d6cdc12d5ff","first_computed_at":"2026-07-05T08:20:24.677957Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:20:24.677957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QgpiIn8QJneEIQsE5lqbMcYe6+oHUoOBZlk4sjKpZ9DDglorCEJLPKIup+XQQKg3sTNIA3xVhk3Ffyeb99WEBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:20:24.678362Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.06356","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c04e2b6df2a530400b91782477759c5347c4b0c30525199ca7e00dd617361428","sha256:08e374922c6887e5ec99839e4bdef45637f7fb6f3aa9b9090cfdc795718b96a6"],"state_sha256":"ce492fd5d7f54d8374c93f114b2b1bba46d482d9933092a5e42b852046ec40db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aF5Dq62+ePtzNL7WB32Tm7hEhJUM4wFrUdwwd7Wvq3pRz6MVT8KNDq54Y7aZjP5yf79wcuvinr40jnVj9uzYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T22:47:18.029819Z","bundle_sha256":"f791fe252b5aa6f4b608e9af790b52ce1364351fa015bd27c2356e9c4d69bb35"}}