{"as_of":"2026-08-19T09:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ce4e8c32113635bf8e47244d7ad13fd090b67c990c48581a9fc54ba6dc6900db","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:53:01.080614Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.08878/citation-record","integrity":"/paper/2505.08878/integrity","json":"/paper/2505.08878/citation-record.json","paper":"/paper/2505.08878"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.05561","last_updated":"2024-09-30T10:17:12Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-01-10T22:07:21Z","title":"TrustLLM: Trustworthiness in Large Language Models","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.05561","snapshot_observed_at":"2026-08-15T21:53:00.676906Z","title":"TrustLLM: Trustworthiness in large language models.arXiv preprint arXiv:2401.05561, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.676906Z"},"links":{"cited_paper":"/paper/2401.05561","citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:a3a69e44ad36909a2dad87c25d9865eededecc6446920ef58c5c545391bf501a","observation_id":"e58fe715-c82c-4751-8e9f-257a20de6b76","resolution":{"observed_at":"2026-08-15T21:53:00.676906Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.08073","last_updated":"2022-12-15T06:19:23Z","snapshot_observed_at":"2026-08-16T03:49:00.703994Z","submitted_at":"2022-12-15T06:19:23Z","title":"Constitutional AI: Harmlessness from AI Feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.08073","snapshot_observed_at":"2026-08-15T21:53:00.683642Z","title":"Constitutional ai: Harmlessness from ai feedback","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.683642Z"},"links":{"cited_paper":"/paper/2212.08073","citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:a96e5ea888a3cc67c4409adf56623dc76690936e5a1e27ae680e01345582579e","observation_id":"d09d0b8e-9af1-43ad-abc4-f118f6f61cb8","resolution":{"observed_at":"2026-08-15T21:53:00.683642Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:00.689106Z","title":"Transformer feed-forward layers are key-value memories","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.689106Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:2f5c64b234738a0625498df1c32e24249d6e8e8d998942224cc036cd76de6a95","observation_id":"1b472c33-b6bd-4b77-b486-df32f2cff822","resolution":{"observed_at":"2026-08-15T21:53:00.689106Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.802312Z","title":"Truthfulqa: Measuring how models mimic human falsehoods","venue":null,"work_id":"76122273-5624-4124-b6b2-bbdbd6709642","year":2022},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.696034Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:33a3b06807f93af6ba6389966411d65fd5d7a5f6b472ca15104162843d9b2d25","observation_id":"1325e01a-314b-42d5-a403-5f534b10fb94","resolution":{"observed_at":"2026-08-15T21:53:02.808487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:00.702128Z","title":"A watermark for large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.702128Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:eb163af253e76c40d8c26f731c90b494161bd4895edff447b46a613414b6def3","observation_id":"d21b50da-bb11-4cd0-a89d-1dd851f61919","resolution":{"observed_at":"2026-08-15T21:53:00.702128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:00.708624Z","title":"Undetectable watermarks for language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.708624Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:119f1dfac48338b42eded35841370e4ef00a54bc42ead6bf3ce1a0f034d112d9","observation_id":"65d948c1-ff1a-4b2f-8982-27811bc71ff9","resolution":{"observed_at":"2026-08-15T21:53:00.708624Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.15593","last_updated":"2024-06-06T04:53:25Z","snapshot_observed_at":"2026-08-18T23:32:12.416200Z","submitted_at":"2023-07-28T14:52:08Z","title":"Robust Distortion-free Watermarks for Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.15593","snapshot_observed_at":"2026-08-15T21:53:00.714246Z","title":"Robust distortion-free watermarks for language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.714246Z"},"links":{"cited_paper":"/paper/2307.15593","citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:f10adb36d72e498f1b39de6e265a518a8f05d650f088faae108d89312001ac69","observation_id":"a19f4026-a00c-49b4-bf1d-fdcb8a2f310b","resolution":{"observed_at":"2026-08-15T21:53:00.714246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.746915Z","title":"Provable robust watermarking for ai-generated text","venue":null,"work_id":"9a0c09b9-d764-4954-84ec-62a9036bc911","year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.721992Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:e78d455b10757d9dd2877d9efe1e16acd4bb22436bdd22594b168defd3819ab7","observation_id":"e5527189-3c0b-4829-805c-3a804d8957fa","resolution":{"observed_at":"2026-08-15T21:53:02.754772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.708476Z","title":"Watermarking of large language models","venue":null,"work_id":"d731825f-9ab4-4b2f-bc0d-f175a1c202a3","year":2023},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.727200Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:2fd781b57c69fc735348c580be77b2e88362dbde93026bf851591a95a23b67a2","observation_id":"3f524367-4d0a-4201-8708-f114093c4893","resolution":{"observed_at":"2026-08-15T21:53:02.718665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:00.732377Z","title":"Universally optimal watermarking schemes for llms: from theory to practice","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.732377Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:8dbc81970b99170aaf1b6ad24434e113a48628ed3ca0ab7a85ad5326ee0c1a67","observation_id":"a94004b5-2a28-4923-8f0e-c6415d149999","resolution":{"observed_at":"2026-08-15T21:53:00.732377Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:00.738313Z","title":"A watermark for black-box language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.738313Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:c382740e0c42ee503d755d51089c3ec43fbe9d446662ddaa1e3f35451bd5344e","observation_id":"0a304860-7364-4186-bbfe-50cca54ae19c","resolution":{"observed_at":"2026-08-15T21:53:00.738313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.675579Z","title":"Scalable watermarking for identifying large language model outputs","venue":null,"work_id":"c99a0555-de07-4380-80b2-21b7e05fd892","year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.744662Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:3e02c476dbe2c3767a885f2218ea278bb8e8eec7ded317b8aa1386cdec13cba3","observation_id":"085017c5-0332-470e-98bf-60183689c00a","resolution":{"observed_at":"2026-08-15T21:53:02.683653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.08883","last_updated":"2023-05-14T07:37:33Z","snapshot_observed_at":"2026-08-18T22:09:55.750281Z","submitted_at":"2023-05-14T07:37:33Z","title":"Watermarking Text Generated by Black-Box Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.08883","snapshot_observed_at":"2026-08-15T21:53:00.750920Z","title":"Water- marking text generated by black-box language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.750920Z"},"links":{"cited_paper":"/paper/2305.08883","citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:2bec5bceb9b793f0167a14e8ce6870c37d0737543d6fcdcfa85be58fa911e504","observation_id":"80bc6ee9-664a-4852-971d-82a6ed23496d","resolution":{"observed_at":"2026-08-15T21:53:00.750920Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.654892Z","title":"Subtle signatures, strong shields: Advancing robust and imper- ceptible watermarking in large language models","venue":null,"work_id":"275ff9b4-02fd-4e41-aa6e-6e220d32f505","year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.757650Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:3ae61dbf140cd0c1e632b347808b068a3a70c8bbcfcd281f44334159a30f6955","observation_id":"e1f02952-3b19-4a0e-ae2b-84f03b64b333","resolution":{"observed_at":"2026-08-15T21:53:02.660901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:00.766407Z","title":"Unbiased watermark for large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.766407Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:1e4d090e40cc7329e8e32fec2415390d669dd90cd18f35d461f014b790da6e81","observation_id":"3f5e4cb1-0699-4280-8555-004358686d06","resolution":{"observed_at":"2026-08-15T21:53:00.766407Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05864","last_updated":"2025-03-15T04:11:55Z","snapshot_observed_at":"2026-08-16T23:38:30.276325Z","submitted_at":"2024-02-08T17:54:23Z","title":"Permute-and-Flip: An optimally stable and watermarkable decoder for LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05864","snapshot_observed_at":"2026-08-15T21:53:00.772465Z","title":"Permute-and-flip: An optimally robust and watermarkable decoder for llms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.772465Z"},"links":{"cited_paper":"/paper/2402.05864","citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:465b7cfee5bb22b6ad486724bc01ee7be1df2214647405c83d016b5e3b2eeaac","observation_id":"c264c024-2643-4cfc-8d80-a48f84fd2e13","resolution":{"observed_at":"2026-08-15T21:53:00.772465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.10281","last_updated":"2026-07-30T21:38:33Z","snapshot_observed_at":"2026-08-16T13:43:54.828383Z","submitted_at":"2024-06-12T05:13:09Z","title":"Watermarking Language Models with Error Correcting Codes","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.10281","snapshot_observed_at":"2026-08-15T21:53:00.777877Z","title":"Watermarking language models with error correcting codes","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.777877Z"},"links":{"cited_paper":"/paper/2406.10281","citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:3bd45e3d74a5d05e987af4a802a3f8dbedbf2fac6f54a767be2001f503421d81","observation_id":"e086c932-c0a0-4936-bbd7-7c5b92a48123","resolution":{"observed_at":"2026-08-15T21:53:00.777877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.16820","last_updated":"2025-01-28T03:21:30Z","snapshot_observed_at":"2026-08-16T14:23:21.067468Z","submitted_at":"2024-01-30T08:46:48Z","title":"Provably Robust Multi-bit Watermarking for AI-generated Text","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.16820","snapshot_observed_at":"2026-08-15T21:53:00.787852Z","title":"Provably robust multi-bit watermarking for AI-generated text via error correction code","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.787852Z"},"links":{"cited_paper":"/paper/2401.16820","citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:b2a74ae875e71206c56ae5c8d865ffdb1c3b1594ceb266ecf8e1e4fdef11476a","observation_id":"f60daae3-1f91-4a74-b6ad-f8678e4fac0d","resolution":{"observed_at":"2026-08-15T21:53:00.787852Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.11203","last_updated":"2025-06-12T16:25:33Z","snapshot_observed_at":"2026-08-17T12:29:43.618755Z","submitted_at":"2024-11-17T23:36:37Z","title":"Debiasing Watermarks for Large Language Models via Maximal Coupling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.11203","snapshot_observed_at":"2026-08-15T21:53:00.794522Z","title":"Debiasing watermarks for large language models via maximal coupling","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.794522Z"},"links":{"cited_paper":"/paper/2411.11203","citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:1a069c6c013ec898466c14d364d5da30192afd20f894f6b90a0dce9304daf844","observation_id":"f29a7fba-deb3-4dc1-95b9-ebf96322fe53","resolution":{"observed_at":"2026-08-15T21:53:00.794522Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.609453Z","title":"Adaptive text watermark for large language models","venue":null,"work_id":"363c070d-999f-40ad-9f88-81dfab6f4e42","year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.803523Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:190b3020aae0ff732d44dd2182936b4b99b6ce8237fae1107ea91af31f75954c","observation_id":"3ba47ed3-5e5c-413e-98f5-b541ce5961d5","resolution":{"observed_at":"2026-08-15T21:53:02.615575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.585640Z","title":"Three bricks to consolidate watermarks for large language models","venue":null,"work_id":"849f5d0d-44cc-476b-a803-08571d839b31","year":2023},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.811757Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:2b1291fc1c41966d90a6405fcaae51a287043cf7f053aa5dae39fd1a5a82e117","observation_id":"7f2fb574-dbeb-4a4d-a60c-8b812e5714ad","resolution":{"observed_at":"2026-08-15T21:53:02.593380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.560867Z","title":"Coding for channels with random parameters","venue":null,"work_id":"32f8d84e-5ba7-409b-9876-d99496068abc","year":1980},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.817811Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:d91e20732e237c3a6449bb8d459078f63b99cf2620348939d4d6c213d04f45fe","observation_id":"86080f9d-a614-4230-be50-9a6e01bc2a05","resolution":{"observed_at":"2026-08-15T21:53:02.569943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.535142Z","title":"An informationtheoretical approach to information embedding","venue":null,"work_id":"b41cbb1f-7642-4252-bd31-2639aeacc63b","year":2000},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.823795Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:42a2f233a73d2d3e83b4a163962b560e5fc77beaec8154b2f2195c5e11ed14e2","observation_id":"b43ab1d9-62cc-4bfd-aaef-f2fd36d9f7ac","resolution":{"observed_at":"2026-08-15T21:53:02.542014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.501917Z","title":"Design and analysis of digital watermarking, information embedding, and data hiding systems","venue":null,"work_id":"7557b254-ba18-4a4f-a374-3c748a292c4a","year":2000},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.832114Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:a6594f38b276bc8dd7f0d3e35095cc591ae14917532db8a36eea9185e0aad045","observation_id":"3b06d491-7164-4d72-b2e0-5d391c10c0e5","resolution":{"observed_at":"2026-08-15T21:53:02.509418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:00.841936Z","title":"Information-theoretic analysis of information hiding","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.841936Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:2c97e53f46897a8d478ddb1ed9f4a822e2fe3a6ef33ee2a2b94007465ebb4e2a","observation_id":"a8e5dab4-f736-44b9-904c-384d9a0cfc71","resolution":{"observed_at":"2026-08-15T21:53:00.841936Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:00.847643Z","title":"Authentication with distortion criteria","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.847643Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:7c79e4bf81e43ae69a7116d59a7e4c4c11530a18fa0847539cadaa8669d2a3dc","observation_id":"d1d3c052-a210-4249-9d4e-07f60440eacd","resolution":{"observed_at":"2026-08-15T21:53:00.847643Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.438811Z","title":"Text data-hiding for digital and printed documents: Theoretical and practical considerations","venue":null,"work_id":"f4df64e4-533c-45f1-8883-57e9ecb4daf2","year":2006},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.853212Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:2fbcb883b1ba719210cc87e1124233a9fd06e2a2ab26a230562dc3fa56f1df4d","observation_id":"560de4cf-f343-4952-bfd7-95912c8863e6","resolution":{"observed_at":"2026-08-15T21:53:02.447532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:00.860053Z","title":"Rethinking lossy compression: The rate-distortion-perception tradeoff","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.860053Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:300b10afc4424ee4c3b28ef85d93330e6783a4203bf42cf218ec0e975c64f876","observation_id":"0d1244ab-71d7-4f4d-bdad-ad2d43ec112b","resolution":{"observed_at":"2026-08-15T21:53:00.860053Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.13662","last_updated":"2021-04-28T09:33:05Z","snapshot_observed_at":"2026-08-16T18:28:33.218847Z","submitted_at":"2021-04-28T09:33:05Z","title":"A coding theorem for the rate-distortion-perception function","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.13662","snapshot_observed_at":"2026-08-15T21:53:00.868130Z","title":"A coding theorem for the rate-distortion-perception function","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.868130Z"},"links":{"cited_paper":"/paper/2104.13662","citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:d1ba1be5e9b088cba9997d93a3af8ff55eceac361859ab273885a259931488af","observation_id":"32642a57-9057-4155-8c55-26bc93858d10","resolution":{"observed_at":"2026-08-15T21:53:00.868130Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.396691Z","title":"On the rate-distortion-perception function","venue":null,"work_id":"42960491-0a70-4943-bd32-4da6613bed95","year":2022},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.875380Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:d95cba7de5d82364aa9848e6007bb18b7e4b25a0da118b5c7017790205c79bea","observation_id":"31f98c93-3190-4e97-b7b6-21cc78105f50","resolution":{"observed_at":"2026-08-15T21:53:02.402787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.374487Z","title":"Information theory: From coding to learning","venue":null,"work_id":"c279491b-9b77-400c-a43a-1d13614851f4","year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.882554Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:5ec3529641845b4c35d29c5fe9f6149d1a3c6fd4e02656c10fbce3b290ebd319","observation_id":"6b1c9ace-88ac-4aca-95ed-65da289e59ab","resolution":{"observed_at":"2026-08-15T21:53:02.382784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.07138","last_updated":"2024-07-01T03:17:42Z","snapshot_observed_at":"2026-08-16T14:43:52.975481Z","submitted_at":"2023-11-13T08:09:01Z","title":"WaterBench: Towards Holistic Evaluation of Watermarks for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.07138","snapshot_observed_at":"2026-08-15T21:53:00.888447Z","title":"Waterbench: Towards holistic evaluation of watermarks for large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.888447Z"},"links":{"cited_paper":"/paper/2311.07138","citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:4f089ac5040baceb3122c32371759b97894d32303d0b995c735f532be155ebd5","observation_id":"0a446152-c19a-4dea-af0c-d4a4b18f8e4b","resolution":{"observed_at":"2026-08-15T21:53:00.888447Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.07930","last_updated":"2024-02-06T21:01:28Z","snapshot_observed_at":"2026-08-16T14:35:13.400553Z","submitted_at":"2023-12-13T06:57:00Z","title":"Towards Optimal Statistical Watermarking","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.07930","snapshot_observed_at":"2026-08-15T21:53:00.895566Z","title":"Towards optimal statistical watermarking","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.895566Z"},"links":{"cited_paper":"/paper/2312.07930","citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:fb0a2254c767809728da922619a80a3fb3c3d6d87c87c186601464e3e99b7530","observation_id":"a3d6164c-074a-49c5-bc75-0b0915443dc2","resolution":{"observed_at":"2026-08-15T21:53:00.895566Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.18479","last_updated":"2025-06-12T17:58:20Z","snapshot_observed_at":"2026-08-14T12:53:50.101382Z","submitted_at":"2024-11-27T16:22:33Z","title":"SoK: Watermarking for AI-Generated Content","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.18479","snapshot_observed_at":"2026-08-15T21:53:00.903122Z","title":"Sok: Watermarking for ai-generated content","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.903122Z"},"links":{"cited_paper":"/paper/2411.18479","citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:49cfaeaf2924d46f2e6ab34189644091e676e2e1ab260bf3b88bcf6468bfff40","observation_id":"5cb51fae-15b6-4ab1-a37c-46317f67da05","resolution":{"observed_at":"2026-08-15T21:53:00.903122Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:00.910111Z","title":"Testing statistical hypotheses, volume 3","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.910111Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:65fd49bee18861450e5bc725095737ac16ec8c1af432d34ea3bb3d9bee1b6c71","observation_id":"dfa80603-cf4f-488f-ba6c-ff6fa52111fe","resolution":{"observed_at":"2026-08-15T21:53:00.910111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.323516Z","title":"Channel coding: Non-asymptotic fundamental limits","venue":null,"work_id":"989b955a-595b-4372-adc0-969119045796","year":2010},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.916305Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:783e36ff13370d39d259df62d25ab74dafb0da51b92c9d1bf75e5fa9a23f8669","observation_id":"111c64b6-15fa-4209-a122-bccbd7460762","resolution":{"observed_at":"2026-08-15T21:53:02.337874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.280031Z","title":"Channel coding rate in the finite blocklength regime.IEEE Transactions on Information Theory, 56(5):2307–2359, 2010","venue":null,"work_id":"1a0290e1-6b60-4e73-8e9e-bffda6b6a0ca","year":2010},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.925398Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:046d0ea76a65eac640feb709d340e14e49c0cb20fda0d0cc7e59780fb126ca83","observation_id":"8793b673-4101-49c8-af29-b70f85be8f9a","resolution":{"observed_at":"2026-08-15T21:53:02.290384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.259434Z","title":"IEEE Transactions on Information Theory, 63(5):2629– 2658, 2016","venue":null,"work_id":"4d6adc05-5555-42a9-8770-ca0c8294a64a","year":2016},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.932363Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:dbdaf5ef014b2c0048f834ecc8dae30d4a0e0c88b0427f6e2ea9708834734757","observation_id":"ed3f2203-96f1-4237-8816-483084164120","resolution":{"observed_at":"2026-08-15T21:53:02.264915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.11035","last_updated":"2023-02-10T06:28:14Z","snapshot_observed_at":"2026-08-16T18:57:09.452566Z","submitted_at":"2020-12-20T22:02:15Z","title":"Contraction of $E_\\gamma$-Divergence and Its Applications to Privacy","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.11035","snapshot_observed_at":"2026-08-15T21:53:00.938381Z","title":"Contraction of eγ-divergence and its applications to privacy","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.938381Z"},"links":{"cited_paper":"/paper/2012.11035","citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:defb6ce082f15fd0beeafee2a35e6809b8dc373ff75c1995014931bf7e568cf0","observation_id":"2d153251-88bd-4445-90df-355b57c1758a","resolution":{"observed_at":"2026-08-15T21:53:00.938381Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.238721Z","title":"Information Theory: From Coding to Learning","venue":null,"work_id":"2768e2a6-82c7-451f-8b38-47644255c1e4","year":2022},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.947033Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:8b9ece62bfce3bf9dc56816a1758fbe689fe9a819bcfdecbc4b16fa55001308c","observation_id":"56116907-ac85-42ec-a169-4dc0c5bdd8f8","resolution":{"observed_at":"2026-08-15T21:53:02.245004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.214880Z","title":"Elements of Information Theory","venue":null,"work_id":"726a3b08-a398-47de-9deb-4a9964cd66e5","year":2006},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.952732Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:79b372575c22b54f24d56a855b4b731b784506e0ebce7696c5d5de273779429d","observation_id":"4bb6e378-0f09-4b0f-ab5d-fa2d10ad9578","resolution":{"observed_at":"2026-08-15T21:53:02.224367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.185881Z","title":"Finite exchangeable sequences","venue":null,"work_id":"e2c3bb44-1d10-4035-8179-f8adad65f1b3","year":1980},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.959555Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:46912667ffc94eb5d62a01e021d02d5e5ccb8c6ce6147c38f1d373bf2352abaf","observation_id":"cb2d6922-5b5c-4692-bce6-533b9da70e35","resolution":{"observed_at":"2026-08-15T21:53:02.196747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-15T21:53:00.967465Z","title":"The llama 3 herd of models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.967465Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:6a8d7133227af08a5bd4f28fd20ea5aa7d36132d33dfa747541dfb32258e4d55","observation_id":"883d1fac-13aa-43cc-8408-0a5169182f51","resolution":{"observed_at":"2026-08-15T21:53:00.967465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:00.976506Z","title":"Gurobi Optimizer Reference Manual, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.976506Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:deea17865d9e7876943c8fb5022b13582960556b3cd1492aee84804bac27fbd1","observation_id":"9e428152-289a-4b7a-ae81-6e2de8aaf650","resolution":{"observed_at":"2026-08-15T21:53:00.976506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.04634","last_updated":"2024-05-01T21:20:36Z","snapshot_observed_at":"2026-08-16T15:25:44.546287Z","submitted_at":"2023-06-07T17:58:48Z","title":"On the Reliability of Watermarks for Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.04634","snapshot_observed_at":"2026-08-15T21:53:00.982740Z","title":"On the reliability of watermarks for large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.982740Z"},"links":{"cited_paper":"/paper/2306.04634","citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:2a885a68d1abd218724e1147836f237775051101415160a074c2322881e60468","observation_id":"e4ee5d98-a729-4697-93f0-2406180b47db","resolution":{"observed_at":"2026-08-15T21:53:00.982740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.01245","last_updated":"2025-08-26T19:09:58Z","snapshot_observed_at":"2026-08-16T14:04:34.997637Z","submitted_at":"2024-04-01T17:03:41Z","title":"A Statistical Framework of Watermarks for Large Language Models: Pivot, Detection Efficiency and Optimal Rules","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.01245","snapshot_observed_at":"2026-08-15T21:53:00.988490Z","title":"A statistical framework of watermarks for large language models: Pivot, detection efficiency and optimal rules","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.988490Z"},"links":{"cited_paper":"/paper/2404.01245","citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:3e8fa0280f6109f680b437c2a61b1a73b8028309378b53167d761e6788fbcd06","observation_id":"5e80dd59-7647-4aa4-98a8-00b47a7c43ec","resolution":{"observed_at":"2026-08-15T21:53:00.988490Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.00273","last_updated":"2024-10-11T19:36:28Z","snapshot_observed_at":"2026-08-16T14:38:37.508615Z","submitted_at":"2023-12-01T01:22:46Z","title":"Mark My Words: Analyzing and Evaluating Language Model Watermarks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.00273","snapshot_observed_at":"2026-08-15T21:53:00.995912Z","title":"Mark my words: Analyzing and evaluating language model watermarks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:00.995912Z"},"links":{"cited_paper":"/paper/2312.00273","citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:a73f58f0f78ce6bc1bfb2969afcafe685cdc44ae0aa8a56417974e8702b89e6e","observation_id":"bdfddf46-f8db-4177-a350-80acbb04cba0","resolution":{"observed_at":"2026-08-15T21:53:00.995912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.10051","last_updated":"2024-10-26T05:11:11Z","snapshot_observed_at":"2026-08-16T13:52:11.349522Z","submitted_at":"2024-05-16T12:40:01Z","title":"MarkLLM: An Open-Source Toolkit for LLM Watermarking","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.10051","snapshot_observed_at":"2026-08-15T21:53:01.003367Z","title":"Markllm: An open-source toolkit for llm watermarking","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:01.003367Z"},"links":{"cited_paper":"/paper/2405.10051","citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:b762dbf7e5ddffd08b8a912dcac3c60d8997363ad60c3916e64a2bcd8cc2d733","observation_id":"a22b0490-917b-4357-b181-286570578728","resolution":{"observed_at":"2026-08-15T21:53:01.003367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.156198Z","title":"Evaluating durability: Benchmark insights into image and text watermarking","venue":null,"work_id":"8931841e-041e-4300-8367-32e23a8f39f3","year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:01.015628Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:e272487ad578059318cc4c8f8dfba8e5eabeed78b59cdbb2fcc60ca09060351b","observation_id":"cc2e3fd3-7606-4206-96e4-aa284447319e","resolution":{"observed_at":"2026-08-15T21:53:02.162178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.137524Z","title":"A survey of text watermarking in the era of large language models","venue":null,"work_id":"6e6a348a-eb13-4d03-b697-04338575ad9f","year":2024},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:01.022517Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:5e4e28f058648fed52173804ed8cbc0f8808c6c46386435f8ef491559b8c7337","observation_id":"81e66a47-2ed8-4445-8a19-828a81513073","resolution":{"observed_at":"2026-08-15T21:53:02.142744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.116741Z","title":"In this case, there is at least one possible value for eachqj that results in a nonnegative value off(qj)","venue":null,"work_id":"ac47c230-e230-4c66-abe5-9ab9b21141f1","year":null},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:01.031034Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:e597aee7819cad45d0dfa3a5d3b426a64f7286acd26e4bf5b63a6b523f74a566","observation_id":"9208eeb3-462e-4f86-a2b9-0e380604412b","resolution":{"observed_at":"2026-08-15T21:53:02.123050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.087098Z","title":null,"venue":null,"work_id":"2893bf92-928c-4ef6-99b5-e1536974c513","year":null},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:01.042216Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:03ddcbad48a88c46537141a634bd6f97719b926662a02f4724dd5fc6457e1845","observation_id":"f995ed72-c76a-4f93-8b67-3d71e8e2eb1b","resolution":{"observed_at":"2026-08-15T21:53:02.093610Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.062592Z","title":null,"venue":null,"work_id":"23a3d708-41c6-486d-abda-3e47d0bf203b","year":null},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:01.048054Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:c2563587bc441a666dbcfe8c71f03bd439c665a77a2fdc5ba497e7041a59cc9d","observation_id":"54a8be71-ab86-4ab3-8795-052f351aa274","resolution":{"observed_at":"2026-08-15T21:53:02.070915Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.037027Z","title":"To show that this is a valid coupling, we verify the marginal distribution is kept the same","venue":null,"work_id":"154569d7-32bb-44d0-a3be-ec2148f8502f","year":null},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:01.054301Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:494d40d212b73c5f75d705a734ffde5db30101f1c8490f9f078472cafab4aaa1","observation_id":"d37736e7-a022-4f86-9db1-26ed0d26d627","resolution":{"observed_at":"2026-08-15T21:53:02.043120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:02.012223Z","title":"Hence,H0 is rejected by CC detection test","venue":null,"work_id":"d9d05c17-c569-4607-a07e-535d6cd270dc","year":null},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:01.061117Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:60a8ff4f975e9930a914af3ee7791c1a22fec10717b1d45697840575ea065f52","observation_id":"2f85ad06-c731-43ec-b5e6-d2a1214e6e99","resolution":{"observed_at":"2026-08-15T21:53:02.023209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:01.990595Z","title":null,"venue":null,"work_id":"d6d2ee33-8e97-4475-983f-126b03c1553a","year":null},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:01.067629Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:0bae5d1fde51a97138a1d0856a5400edf28392804294ec365cdeef168d2b04f2","observation_id":"efef306f-41a2-4e0b-8352-fbc4e3824eda","resolution":{"observed_at":"2026-08-15T21:53:01.996643Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:01.969406Z","title":null,"venue":null,"work_id":"74ec7290-ddd0-4d57-9de6-6c61241cf146","year":null},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:01.074780Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:074d33a47d4385e61ad17f320589ec6413980a4e6fb4cff9c676c8f547c14929","observation_id":"e18c0a73-8b17-4458-b3c4-7ccc11608fb1","resolution":{"observed_at":"2026-08-15T21:53:01.975726Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:53:01.946177Z","title":"1− s PS|Y (s|Y (X,bm)) P (s) # , whereP (S|Y ) is the correlated channel. AssumingS∼ Ber 1 2 , we have H2 PQ,P eQ = 2ES,X","venue":null,"work_id":"2007a7e2-185e-4139-a6fb-eb2abbfc47e9","year":null},"citing_paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T21:53:01.080614Z"},"links":{"citing_paper":"/paper/2505.08878"},"observation_digest":"sha256:ac9f42b65dd42a3047686958c373f634b1a35eb95baa7d24c035d277faefde74","observation_id":"2920c7cf-14a4-4de8-b8f1-f52bf745da44","resolution":{"observed_at":"2026-08-15T21:53:01.954745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.08878","last_updated":"2025-05-13T18:08:12Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-18T22:10:12.543427Z","submitted_at":"2025-05-13T18:08:12Z","title":"Optimized Couplings for Watermarking Large Language Models"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":32,"verified_exact":0,"verified_fuzzy":25},"total_outbound_references":58},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 0 inbound Pith citation observations for arXiv:2505.08878."}