{"as_of":"2026-08-12T20:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1cb520b844b648e7bb33459dc3f9bb679854b3500b03d14cfa00782ae4c16cc0","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T22:49:58.698783Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T13:13:37.853192Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-29T21:53:59.607481Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"cited_work":{"arxiv_id":"2412.03123","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.03123","snapshot_observed_at":"2026-06-29T21:53:59.607481Z","title":"Robust multi-bit text watermark with llm-based paraphrasers.arXiv preprint arXiv:2412.03123","venue":null,"work_id":"d2d9d32a-badb-4217-8da6-a572ec5fd453","year":2024},"citing_paper":{"arxiv_id":"2508.11548","last_updated":"2026-04-07T07:06:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-08-15T15:50:20Z","title":"Copyright Protection for Large Language Models: A Survey of Methods, Challenges, and Trends","version":2},"reference_index":158,"source":"pdf_text","source_observed_at":"2026-05-18T22:45:31.935618Z"},"links":{"cited_paper":"/paper/2412.03123","citing_paper":"/paper/2508.11548"},"observation_digest":"sha256:a9818c34d5e0150753d5269f17d57391f9b28e9c22e13898f1f68e9fc5c752f9","observation_id":"ce9b2707-e054-4dcf-a6b6-c5916a484802","resolution":{"observed_at":"2026-05-18T22:46:53.062491Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"cited_work":{"arxiv_id":"2412.03123","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.03123","snapshot_observed_at":"2026-06-29T21:53:59.607481Z","title":"Robust multi-bit text watermark with llm-based paraphrasers.arXiv preprint arXiv:2412.03123","venue":null,"work_id":"d2d9d32a-badb-4217-8da6-a572ec5fd453","year":2024},"citing_paper":{"arxiv_id":"2605.08826","last_updated":"2026-05-09T09:26:57Z","snapshot_observed_at":"2026-08-11T06:26:19.123413Z","submitted_at":"2026-05-09T09:26:57Z","title":"Fundamental Trade-Offs in Multi-Bit Watermarking of Stochastic Processes","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-12T01:32:57.175350Z"},"links":{"cited_paper":"/paper/2412.03123","citing_paper":"/paper/2605.08826"},"observation_digest":"sha256:d89cdc14d589cd3d7af7624d7d398108ae62b7866d32b853bc338890b4d8cae8","observation_id":"75baa02e-129e-4519-a5b5-399f020e9794","resolution":{"observed_at":"2026-05-12T07:51:48.842752Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"cited_work":{"arxiv_id":"2412.03123","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.03123","snapshot_observed_at":"2026-06-29T21:53:59.607481Z","title":"Robust multi-bit text watermark with llm-based paraphrasers.arXiv preprint arXiv:2412.03123","venue":null,"work_id":"d2d9d32a-badb-4217-8da6-a572ec5fd453","year":2024},"citing_paper":{"arxiv_id":"2605.12456","last_updated":"2026-05-21T17:19:23Z","snapshot_observed_at":"2026-08-03T13:17:40.609426Z","submitted_at":"2026-05-12T17:44:41Z","title":"TextSeal: A Localized LLM Watermark for Provenance & Distillation Protection","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-13T03:45:47.751525Z"},"links":{"cited_paper":"/paper/2412.03123","citing_paper":"/paper/2605.12456"},"observation_digest":"sha256:29206287d5471c2e5f5d6d0f86a31697e2ad777ae7678215d7f06fd7bb5c6953","observation_id":"bee16832-4117-41a8-b1d4-f2d6e650b0b7","resolution":{"observed_at":"2026-05-13T03:47:12.013380Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"cited_work":{"arxiv_id":"2412.03123","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.03123","snapshot_observed_at":"2026-06-29T21:53:59.607481Z","title":"Robust multi-bit text watermark with llm-based paraphrasers.arXiv preprint arXiv:2412.03123","venue":null,"work_id":"d2d9d32a-badb-4217-8da6-a572ec5fd453","year":2024},"citing_paper":{"arxiv_id":"2605.12456","last_updated":"2026-05-21T17:19:23Z","snapshot_observed_at":"2026-08-03T13:17:40.609426Z","submitted_at":"2026-05-12T17:44:41Z","title":"TextSeal: A Localized LLM Watermark for Provenance & Distillation Protection","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-22T09:56:23.855385Z"},"links":{"cited_paper":"/paper/2412.03123","citing_paper":"/paper/2605.12456"},"observation_digest":"sha256:913e922287e79df1b932d24ab81ca55066f22c7db20765df39c748e06eddb73b","observation_id":"52409daf-0e7a-4fb9-858c-f7cb39f14e74","resolution":{"observed_at":"2026-05-22T10:01:23.696332Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"cited_work":{"arxiv_id":"2412.03123","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.03123","snapshot_observed_at":"2026-06-29T21:53:59.607481Z","title":"Robust multi-bit text watermark with llm-based paraphrasers.arXiv preprint arXiv:2412.03123","venue":null,"work_id":"d2d9d32a-badb-4217-8da6-a572ec5fd453","year":2024},"citing_paper":{"arxiv_id":"2605.25796","last_updated":"2026-07-16T10:18:19Z","snapshot_observed_at":"2026-08-02T13:13:33.225101Z","submitted_at":"2026-05-25T12:46:15Z","title":"SAMark: A Self-Anchored Text Watermarking with Paragraph-Level Paraphrase Robustness","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-29T21:46:56.921674Z"},"links":{"cited_paper":"/paper/2412.03123","citing_paper":"/paper/2605.25796"},"observation_digest":"sha256:1c070eea821034f00a6700bc4c2b8aa32f2ecb04fe0c639d27d27316afd3d215","observation_id":"8d52f229-6bed-4eeb-92b8-3bbd0dd5fdd1","resolution":{"observed_at":"2026-06-29T21:53:59.609097Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.03123","snapshot_observed_at":"2026-08-02T13:13:37.853192Z","title":"Robust multi-bit text water- mark with llm-based paraphrasers,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.25796","last_updated":"2026-07-16T10:18:19Z","snapshot_observed_at":"2026-08-02T13:13:33.225101Z","submitted_at":"2026-05-25T12:46:15Z","title":"SAMark: A Self-Anchored Text Watermarking with Paragraph-Level Paraphrase Robustness","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T13:13:37.853192Z"},"links":{"cited_paper":"/paper/2412.03123","citing_paper":"/paper/2605.25796"},"observation_digest":"sha256:12f56408eaf99476d7188e063c83fac8994ba4f73d3eea5b0dda933bd8555b8a","observation_id":"10a71602-847d-4f89-abe9-a0a5425255fe","resolution":{"observed_at":"2026-08-02T13:13:37.853192Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.03123/citation-record","integrity":"/paper/2412.03123/integrity","json":"/paper/2412.03123/citation-record.json","paper":"/paper/2412.03123"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:50:00.147537Z","title":"and Fritz, M","venue":null,"work_id":"90e6b939-a726-4318-b1f2-d035e295156b","year":2021},"citing_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T22:49:58.394766Z"},"links":{"citing_paper":"/paper/2412.03123"},"observation_digest":"sha256:fb17ed1793d18f5f5f2b6b0dabe7745b2f2dacdf92e680c808aafc6a5cc5d8ba","observation_id":"ae8278c1-d420-4062-961e-fc13c015240f","resolution":{"observed_at":"2026-08-11T22:50:00.160553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.00456","last_updated":"2019-07-08T17:21:46Z","snapshot_observed_at":"2026-07-06T08:03:53.351060Z","submitted_at":"2019-06-30T20:53:19Z","title":"Way Off-Policy Batch Deep Reinforcement Learning of Implicit Human Preferences in Dialog","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.00456","snapshot_observed_at":"2026-08-11T22:49:58.484902Z","title":"H., Ferguson, C., Lapedriza, A., Jones, N., Gu, S., and Picard, R","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T22:49:58.484902Z"},"links":{"cited_paper":"/paper/1907.00456","citing_paper":"/paper/2412.03123"},"observation_digest":"sha256:6a26495ba8c7067e9ec654d5626b283e2107a7e5dc37ca7dee32875d8432cd47","observation_id":"2c36febd-9f1d-4d95-bedd-f55d32c519c7","resolution":{"observed_at":"2026-08-11T22:49:58.484902Z","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-11T22:50:00.053262Z","title":"When it comes to fantasy sports and betting on NASCAR races, there’s nothing wrong with it,","venue":null,"work_id":"be5e83b5-f0bd-4003-ba00-fdcf30fe34a5","year":2020},"citing_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T22:49:58.698783Z"},"links":{"citing_paper":"/paper/2412.03123"},"observation_digest":"sha256:72f4bda99ad744f136c9c0bb73cac7ba504ebb5de3173e6c962863231e203085","observation_id":"af5e5610-e7fa-460c-8c22-dd26c8fb313c","resolution":{"observed_at":"2026-08-11T22:50:00.067990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.15593","last_updated":"2024-06-06T04:53:25Z","snapshot_observed_at":"2026-07-06T15:59:52.247013Z","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-11T22:49:58.547068Z","title":"Robust distortion-free watermarks for language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T22:49:58.547068Z"},"links":{"cited_paper":"/paper/2307.15593","citing_paper":"/paper/2412.03123"},"observation_digest":"sha256:2646c8a759d04e81c33086ba8d40b7bf454c87cf8bc40cd0ddd33d3787b8ba40","observation_id":"d02a5c19-3405-4208-998b-3e6aa198cf57","resolution":{"observed_at":"2026-08-11T22:49:58.547068Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.04411","last_updated":"2024-10-29T07:02:51Z","snapshot_observed_at":"2026-08-12T08:21:06.018811Z","submitted_at":"2024-07-05T10:51:33Z","title":"Waterfall: Framework for Robust and Scalable Text Watermarking and Provenance for LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.04411","snapshot_observed_at":"2026-08-11T22:49:58.584755Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T22:49:58.584755Z"},"links":{"cited_paper":"/paper/2407.04411","citing_paper":"/paper/2412.03123"},"observation_digest":"sha256:b00eae65bf95d9dfc1f11ee1680e94832ab208e07d791bbdb926be04fc4f162d","observation_id":"1dae55d9-880f-4e53-9a28-23b9c51a5205","resolution":{"observed_at":"2026-08-11T22:49:58.584755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06356","last_updated":"2024-05-19T12:24:40Z","snapshot_observed_at":"2026-08-10T22:33:45.063331Z","submitted_at":"2023-10-10T06:49:43Z","title":"A Semantic Invariant Robust Watermark for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06356","snapshot_observed_at":"2026-08-11T22:49:58.596127Z","title":"A semantic invariant robust watermark for large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T22:49:58.596127Z"},"links":{"cited_paper":"/paper/2310.06356","citing_paper":"/paper/2412.03123"},"observation_digest":"sha256:cb07b67cb5960c9ca43f3e128e0b980a5183cd96b0335b0f9cc13dd077827df0","observation_id":"db3b9b8d-12db-4643-a93d-cea1680c2e12","resolution":{"observed_at":"2026-08-11T22:49:58.596127Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1301.3781","last_updated":"2013-09-07T00:30:40Z","snapshot_observed_at":"2026-07-06T03:04:11.148340Z","submitted_at":"2013-01-16T18:24:43Z","title":"Efficient Estimation of Word Representations in Vector Space","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1301.3781","snapshot_observed_at":"2026-08-11T22:49:58.617418Z","title":"Efficient estimation of word representations in vector space","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T22:49:58.617418Z"},"links":{"cited_paper":"/paper/1301.3781","citing_paper":"/paper/2412.03123"},"observation_digest":"sha256:6ef317de16ee22d9078eae0276a23605ced31f0b4b86b907f467a3f60e34c2ce","observation_id":"ba113c13-9d02-448d-891b-c2f0fb450191","resolution":{"observed_at":"2026-08-11T22:49:58.617418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.17557","last_updated":"2024-10-31T11:37:49Z","snapshot_observed_at":"2026-08-02T15:25:02.551919Z","submitted_at":"2024-06-25T13:50:56Z","title":"The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scale","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.17557","snapshot_observed_at":"2026-08-11T22:49:58.623476Z","title":"Qiang, J., Zhu, S., Li, Y ., Zhu, Y ., Yuan, Y ., and Wu, X","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T22:49:58.623476Z"},"links":{"cited_paper":"/paper/2406.17557","citing_paper":"/paper/2412.03123"},"observation_digest":"sha256:12318550ccdec875730d5ecd3c5120ad694abeebcb3822022de01b01f5433c08","observation_id":"31141577-d807-4d49-b190-469dcb81e9e8","resolution":{"observed_at":"2026-08-11T22:49:58.623476Z","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-11T22:50:00.089592Z","title":"Robust multi- bit natural language watermarking through invariant fea- tures","venue":null,"work_id":"9bef0d58-25cd-4a9b-a628-71193ba649c4","year":null},"citing_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T22:49:58.669946Z"},"links":{"citing_paper":"/paper/2412.03123"},"observation_digest":"sha256:31407a02b10fd7e9b211812e1b0309325ccfcbbb1dc96245b4a8369ff4c259ef","observation_id":"12f4aabd-eaa8-47d2-9b02-b4b5b0b8c8e5","resolution":{"observed_at":"2026-08-11T22:50:00.099612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.17439","last_updated":"2023-10-13T04:50:04Z","snapshot_observed_at":"2026-08-07T18:16:43.461993Z","submitted_at":"2023-06-30T07:24:32Z","title":"Provable Robust Watermarking for AI-Generated Text","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.17439","snapshot_observed_at":"2026-08-11T22:49:58.677860Z","title":"Tinyllama: An open-source small language model, 2024a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T22:49:58.677860Z"},"links":{"cited_paper":"/paper/2306.17439","citing_paper":"/paper/2412.03123"},"observation_digest":"sha256:8c3a0dbb0cc573d11d07f12ba2ed9acada2f9841fca70ef80e9b920bf2d8fea6","observation_id":"10bac430-fcbe-4908-95cb-b6882b5e05b9","resolution":{"observed_at":"2026-08-11T22:49:58.677860Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.04964","last_updated":"2023-07-18T08:44:47Z","snapshot_observed_at":"2026-08-07T18:08:01.409989Z","submitted_at":"2023-07-11T01:55:24Z","title":"Secrets of RLHF in Large Language Models Part I: PPO","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.04964","snapshot_observed_at":"2026-08-11T22:49:58.689410Z","title":"Secrets of rlhf in large language models part i: Ppo","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T22:49:58.689410Z"},"links":{"cited_paper":"/paper/2307.04964","citing_paper":"/paper/2412.03123"},"observation_digest":"sha256:9aedcef473991a52d063815613261dd7e1500ced7a5d271e0236bbc488c936b7","observation_id":"b1fc436f-45a3-4326-9d96-112843a293b9","resolution":{"observed_at":"2026-08-11T22:49:58.689410Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.10553","last_updated":"2024-03-13T03:43:39Z","snapshot_observed_at":"2026-07-06T17:45:27.526239Z","submitted_at":"2024-03-13T03:43:39Z","title":"Learning to Watermark LLM-generated Text via Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.10553","snapshot_observed_at":"2026-08-11T22:49:58.654759Z","title":"Learning to watermark llm- generated text via reinforcement learning.arXiv preprint arXiv:2403.10553,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-11T22:49:58.654759Z"},"links":{"cited_paper":"/paper/2403.10553","citing_paper":"/paper/2412.03123"},"observation_digest":"sha256:e118e5392d1fd763deaac9c6765da44f8fbde9c5da9f346b28984cac9702d51c","observation_id":"49eac86d-bb0f-4bfd-a026-dcc8eae0ce07","resolution":{"observed_at":"2026-08-11T22:49:58.654759Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15513","last_updated":"2025-06-14T16:04:31Z","snapshot_observed_at":"2026-08-11T01:11:30.234504Z","submitted_at":"2024-06-20T18:37:36Z","title":"PKU-SafeRLHF: Towards Multi-Level Safety Alignment for LLMs with Human Preference","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.15513","snapshot_observed_at":"2026-08-11T22:49:58.514761Z","title":"Pku-saferlhf: Towards multi-level safety alignment for llms with human pref- erence","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-11T22:49:58.514761Z"},"links":{"cited_paper":"/paper/2406.15513","citing_paper":"/paper/2412.03123"},"observation_digest":"sha256:abcb971fb4b29d7eec4cd60408b414ea38b83417981b2ede2708f14559756907","observation_id":"59280202-38f0-494f-b3db-ed4b0f5e2bdb","resolution":{"observed_at":"2026-08-11T22:49:58.514761Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-11T22:49:58.637303Z","title":"Proximal policy optimization algorithms","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-11T22:49:58.637303Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2412.03123"},"observation_digest":"sha256:0e75c98ca0048231cfbb00c30409143750d92bbd1701fe62f6cfcd37dbdd56c0","observation_id":"f6d9f1ea-bbd2-4db7-ac11-9841551e1a24","resolution":{"observed_at":"2026-08-11T22:49:58.637303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.05862","last_updated":"2022-04-12T15:02:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-04-12T15:02:38Z","title":"Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.05862","snapshot_observed_at":"2026-08-11T22:49:58.402891Z","title":"Training a helpful and harmless assistant with reinforcement learning from human feedback","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-11T22:49:58.402891Z"},"links":{"cited_paper":"/paper/2204.05862","citing_paper":"/paper/2412.03123"},"observation_digest":"sha256:f730be50b72be1aa43a86935244eac476316103e64409d4f6661fcdab70563ef","observation_id":"2495e802-099b-4b7e-a5a9-677a6298f694","resolution":{"observed_at":"2026-08-11T22:49:58.402891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03991","last_updated":"2024-04-22T04:29:38Z","snapshot_observed_at":"2026-08-08T23:12:01.765942Z","submitted_at":"2023-10-06T03:33:42Z","title":"SemStamp: A Semantic Watermark with Paraphrastic Robustness for Text Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03991","snapshot_observed_at":"2026-08-11T22:49:58.475949Z","title":"B., Zhang, J., He, T., Wang, Y ., Chuang, Y .- S., Wang, H., Shen, L., Van Durme, B., Khashabi, D., and Tsvetkov, Y","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-11T22:49:58.475949Z"},"links":{"cited_paper":"/paper/2310.03991","citing_paper":"/paper/2412.03123"},"observation_digest":"sha256:bf424cb311142dadeaa57270acd10baddd53d11c53bad8d3fa994001686850a4","observation_id":"c3874119-0cb9-47d2-8b0d-1ea517f98853","resolution":{"observed_at":"2026-08-11T22:49:58.475949Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.04469","last_updated":"2024-05-02T07:05:56Z","snapshot_observed_at":"2026-08-10T22:34:11.407815Z","submitted_at":"2023-12-07T17:41:44Z","title":"On the Learnability of Watermarks for Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.04469","snapshot_observed_at":"2026-08-11T22:49:58.426740Z","title":"L., Liang, P., and Hashimoto, T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-11T22:49:58.426740Z"},"links":{"cited_paper":"/paper/2312.04469","citing_paper":"/paper/2412.03123"},"observation_digest":"sha256:f23ae39e60cc3c2a000c02e09cd2d00c71c88ee8c2d6961f4599af88049f96aa","observation_id":"7ef818bd-c654-4d9d-ad78-377b720e1d76","resolution":{"observed_at":"2026-08-11T22:49:58.426740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.03123","last_updated":"2025-06-16T21:12:38Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-11T22:42:44.214750Z","submitted_at":"2024-12-04T08:43:12Z","title":"Robust Multi-bit Text Watermark with LLM-based Paraphrasers"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":17},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 6 inbound Pith citation observations for arXiv:2412.03123."}