{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZUMCUVBKM2FCJFLKOR5DD5CJWC","short_pith_number":"pith:ZUMCUVBK","schema_version":"1.0","canonical_sha256":"cd182a542a668a24956a747a31f449b09c728428ab74285a3a840d6cdc12d5ff","source":{"kind":"arxiv","id":"2310.06356","version":3},"attestation_state":"computed","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"},"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.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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2310.06356","created_at":"2026-07-05T08:20:24.678015+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.06356v3","created_at":"2026-07-05T08:20:24.678015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.06356","created_at":"2026-07-05T08:20:24.678015+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZUMCUVBKM2FC","created_at":"2026-07-05T08:20:24.678015+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZUMCUVBKM2FCJFLK","created_at":"2026-07-05T08:20:24.678015+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZUMCUVBK","created_at":"2026-07-05T08:20:24.678015+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2404.02138","citing_title":"Topic-Based Watermarks for Large Language Models","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12456","citing_title":"TextSeal: A Localized LLM Watermark for Provenance & Distillation Protection","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2509.20924","citing_title":"RLCracker: Evaluating the Worst-Case Vulnerability of LLM Watermarks with Adaptive RL Attacks","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12456","citing_title":"TextSeal: A Localized LLM Watermark for Provenance & Distillation Protection","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22335","citing_title":"Context-Fidelity Boosting: Enhancing Faithful Generation through Watermark-Inspired Decoding","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05443","citing_title":"SLAM: Structural Linguistic Activation Marking for Language Models","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04305","citing_title":"SWAN: Semantic Watermarking with Abstract Meaning Representation","ref_index":55,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZUMCUVBKM2FCJFLKOR5DD5CJWC","json":"https://pith.science/pith/ZUMCUVBKM2FCJFLKOR5DD5CJWC.json","graph_json":"https://pith.science/api/pith-number/ZUMCUVBKM2FCJFLKOR5DD5CJWC/graph.json","events_json":"https://pith.science/api/pith-number/ZUMCUVBKM2FCJFLKOR5DD5CJWC/events.json","paper":"https://pith.science/paper/ZUMCUVBK"},"agent_actions":{"view_html":"https://pith.science/pith/ZUMCUVBKM2FCJFLKOR5DD5CJWC","download_json":"https://pith.science/pith/ZUMCUVBKM2FCJFLKOR5DD5CJWC.json","view_paper":"https://pith.science/paper/ZUMCUVBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.06356&json=true","fetch_graph":"https://pith.science/api/pith-number/ZUMCUVBKM2FCJFLKOR5DD5CJWC/graph.json","fetch_events":"https://pith.science/api/pith-number/ZUMCUVBKM2FCJFLKOR5DD5CJWC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZUMCUVBKM2FCJFLKOR5DD5CJWC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZUMCUVBKM2FCJFLKOR5DD5CJWC/action/storage_attestation","attest_author":"https://pith.science/pith/ZUMCUVBKM2FCJFLKOR5DD5CJWC/action/author_attestation","sign_citation":"https://pith.science/pith/ZUMCUVBKM2FCJFLKOR5DD5CJWC/action/citation_signature","submit_replication":"https://pith.science/pith/ZUMCUVBKM2FCJFLKOR5DD5CJWC/action/replication_record"}},"created_at":"2026-07-05T08:20:24.678015+00:00","updated_at":"2026-07-05T08:20:24.678015+00:00"}