{"as_of":"2026-08-10T16:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9ef9f605c06042f8d4a77c7d42b3ba7da56ebd4bd1675ff89f0fd80e21702f92","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T11:12:56.428904Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T04:16:02.013786Z","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-07-02T08:16:47.314415Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02787","snapshot_observed_at":"2026-08-06T04:16:02.013786Z","title":"Simmark: A robust sentence-level similarity-based water- marking algorithm for large language models.arXiv preprint arXiv:2502.02787, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.03836","last_updated":"2025-08-05T18:34:00Z","snapshot_observed_at":"2026-08-09T15:06:49.621621Z","submitted_at":"2025-08-05T18:34:00Z","title":"DP-NCB: Privacy Preserving Fair Bandits","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T04:16:02.013786Z"},"links":{"cited_paper":"/paper/2502.02787","citing_paper":"/paper/2508.03836"},"observation_digest":"sha256:f378d7aa89837dc914de6a4a2aada22a88ecf69dbe1cecaac4307f6e5af547be","observation_id":"242c6346-bde8-48c0-a156-86170367514e","resolution":{"observed_at":"2026-08-06T04:16:02.013786Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"cited_work":{"arxiv_id":"2502.02787","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.02787","snapshot_observed_at":"2026-07-02T08:16:47.314415Z","title":"Simmark: A robust sentence-level similarity-based watermarking algorithm for large language models.arXiv preprint arXiv:2502.02787","venue":null,"work_id":"0ef88955-bff7-4370-be46-d2d9068cf851","year":2025},"citing_paper":{"arxiv_id":"2604.25247","last_updated":"2026-04-28T05:52:57Z","snapshot_observed_at":"2026-07-06T23:11:07.254460Z","submitted_at":"2026-04-28T05:52:57Z","title":"R-CoT: A Reasoning-Layer Watermark via Redundant Chain-of-Thought in Large Language Models","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-07T15:54:22.189376Z"},"links":{"cited_paper":"/paper/2502.02787","citing_paper":"/paper/2604.25247"},"observation_digest":"sha256:8df71c4341a55ee0eaa978c72089b72b01c0607cc789995675311507f1de4f31","observation_id":"5855b23a-10ff-4652-989d-2ccd2901f744","resolution":{"observed_at":"2026-05-12T00:01:16.635845Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"cited_work":{"arxiv_id":"2502.02787","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.02787","snapshot_observed_at":"2026-07-02T08:16:47.314415Z","title":"Simmark: A robust sentence-level similarity-based watermarking algorithm for large language models.arXiv preprint arXiv:2502.02787","venue":null,"work_id":"0ef88955-bff7-4370-be46-d2d9068cf851","year":2025},"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":8,"source":"pdf_text","source_observed_at":"2026-06-29T21:46:56.921674Z"},"links":{"cited_paper":"/paper/2502.02787","citing_paper":"/paper/2605.25796"},"observation_digest":"sha256:5aa601d5222367ef0a8c05fe36e5e57316db45b9256a08825c16f5f255ed43c4","observation_id":"45ad9b13-77af-4bb6-8d57-2cc7b61117e7","resolution":{"observed_at":"2026-06-29T21:53:59.605827Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02787","snapshot_observed_at":"2026-08-02T13:13:34.781530Z","title":"Simmark: A robust sentence-level similarity-based watermarking algorithm for large language models,","venue":null,"work_id":null,"year":2025},"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":8,"source":"pdf_text","source_observed_at":"2026-08-02T13:13:34.781530Z"},"links":{"cited_paper":"/paper/2502.02787","citing_paper":"/paper/2605.25796"},"observation_digest":"sha256:aa5e5c16aa1e848a4c2261f5b85ecdd5c9a03664dfbacc61f30c5d7759b0e98b","observation_id":"017c4b8f-16d4-4dbd-a5b0-9822f02e7073","resolution":{"observed_at":"2026-08-02T13:13:34.781530Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"cited_work":{"arxiv_id":"2502.02787","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.02787","snapshot_observed_at":"2026-07-02T08:16:47.314415Z","title":"Simmark: A robust sentence-level similarity-based watermarking algorithm for large language models.arXiv preprint arXiv:2502.02787","venue":null,"work_id":"0ef88955-bff7-4370-be46-d2d9068cf851","year":2025},"citing_paper":{"arxiv_id":"2606.04486","last_updated":"2026-06-03T06:08:58Z","snapshot_observed_at":"2026-08-06T16:02:09.838156Z","submitted_at":"2026-06-03T06:08:58Z","title":"Global Sketch-Based Watermarking for Diffusion Language Models","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-06-28T06:20:09.595306Z"},"links":{"cited_paper":"/paper/2502.02787","citing_paper":"/paper/2606.04486"},"observation_digest":"sha256:83ffdfc2f826f6012c69d6e987ee03387b9f7184d88a655a9d8645e030070907","observation_id":"d74c1df0-814a-4a18-97b4-0b8096cba459","resolution":{"observed_at":"2026-07-02T08:16:47.316089Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.02787/citation-record","integrity":"/paper/2502.02787/integrity","json":"/paper/2502.02787/citation-record.json","paper":"/paper/2502.02787"},"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-09T11:12:57.281180Z","title":null,"venue":null,"work_id":"031e9ac3-b3ec-4b03-8ce9-f32fc3b0583e","year":2022},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.043592Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:64a880952fef465bf9c3b67b02d6faaa39aa07cc6c3519b921f1447eb6a71021","observation_id":"e3ebf9f7-46b1-4fc6-8478-c508238de0ad","resolution":{"observed_at":"2026-08-09T11:12:57.285072Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T11:12:57.268299Z","title":null,"venue":null,"work_id":"3328a734-79ba-4fc9-be8f-705fab3245ac","year":2001},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.049203Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:1d365ba327e993c8ebba1703de540d39749288a03830b5bd094f48fece3e7e85","observation_id":"f6ef9bda-52dd-4076-99db-7adbe716a126","resolution":{"observed_at":"2026-08-09T11:12:57.272333Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T11:12:56.054274Z","title":"O'Reilly Media, Inc","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.054274Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:4b00a0dda38683cf3655fa92c5d602ad684c3e002a917de45221253841c5861b","observation_id":"77e9a8bb-8041-45f6-876c-c9f2bac88f05","resolution":{"observed_at":"2026-08-09T11:12:56.054274Z","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-09T11:12:56.062462Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.062462Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:393691e381fa4baf33cfb7061d60b5a0cb82ad60d2d5d47976f55210f7b9d55e","observation_id":"28c23165-fad0-4d97-90da-78d9e80a529e","resolution":{"observed_at":"2026-08-09T11:12:56.062462Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.11467","last_updated":"2024-03-20T07:08:22Z","snapshot_observed_at":"2026-07-06T17:18:24.209069Z","submitted_at":"2024-01-21T11:42:18Z","title":"Over-Reasoning and Redundant Calculation of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.11467","snapshot_observed_at":"2026-08-09T11:12:56.067051Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.067051Z"},"links":{"cited_paper":"/paper/2401.11467","citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:2d42724047cbdfed6a212f46ebd6936a9d065d10488f0f2c687d6cbbdce49a82","observation_id":"57096745-192e-4f26-b912-43080a973943","resolution":{"observed_at":"2026-08-09T11:12:56.067051Z","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-09T11:12:57.245364Z","title":null,"venue":null,"work_id":"68b7700c-b3bd-4ab8-bb1b-2d70c9a4b937","year":2021},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.072199Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:df9757a8e98f57dd1c8010783cb69bcae1ce458ffdf490b57be3da2fdc1c3d55","observation_id":"f29ab388-fe9f-4a34-ae8f-56bbeecd2911","resolution":{"observed_at":"2026-08-09T11:12:57.249839Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T11:12:57.231592Z","title":null,"venue":null,"work_id":"a7504058-639d-4554-9b08-c9fb2949e5f5","year":2023},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.077084Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:437c8346fe5f92c8db4118e0d1b18279dc787726a45dbff45c4658f247ff00e3","observation_id":"e902753e-93af-426c-b4d3-a8fdd422f672","resolution":{"observed_at":"2026-08-09T11:12:57.235918Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.09539","last_updated":"2024-11-08T18:56:41Z","snapshot_observed_at":"2026-08-04T15:28:10.880179Z","submitted_at":"2024-03-14T16:27:49Z","title":"Logits of API-Protected LLMs Leak Proprietary Information","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.09539","snapshot_observed_at":"2026-08-09T11:12:56.081218Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.081218Z"},"links":{"cited_paper":"/paper/2403.09539","citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:76d5f5699dd4ea5e949d1831bcd2c9302bdcbdb8df42dc82991f4369a140633e","observation_id":"5326ac77-ad4d-4e7c-adff-d9762dc5e98e","resolution":{"observed_at":"2026-08-09T11:12:56.081218Z","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":"10.1609/aaai.v38i16.29756","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Proceedings of the AAAI Conference on Artificial Intelligence","work_id":"7755af62-43bc-410a-a152-b1d0715b7dd1","year":2024},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.085659Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:81c9b6610ee584a98a3a241e10e324ace7e9e4448e23a4667c6aad35128737da","observation_id":"f0e8f093-1a4c-4c7e-b960-825579d6d35c","resolution":{"observed_at":"2026-08-09T11:12:56.579029Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T11:12:57.217850Z","title":null,"venue":null,"work_id":"38695958-4485-4665-9efa-5f3e54dfd9b2","year":2023},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.089899Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:d6ddfd6036d9c410e31a40a7822cbfe60c676abc03e43f0d5334d076c1546ab2","observation_id":"5ca30518-add2-42a7-9273-8b39a6d53756","resolution":{"observed_at":"2026-08-09T11:12:57.222244Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T11:12:56.094319Z","title":"Hadsell, S","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.094319Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:e31517d01ad12440eb511d4976a63494e5e10df04e008ed443a26209f6063f09","observation_id":"aa3706b6-b9c5-4011-ad35-b08a7a1736ab","resolution":{"observed_at":"2026-08-09T11:12:56.094319Z","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-09T11:12:56.098924Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.098924Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:414bffc2b9c39766a052d9a5a42a0dd3a77b671d9d77ac022c579a87501b03f9","observation_id":"64baf295-9907-425d-b8ce-c14416492827","resolution":{"observed_at":"2026-08-09T11:12:56.098924Z","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-09T11:12:57.204044Z","title":null,"venue":null,"work_id":"aa81a296-4c71-498e-9b55-1bd4c732b3b5","year":2025},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.103375Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:9248399e8a34269851cf5e9a8ead6292868c14cfa33568c90d52dae16ec7ef73","observation_id":"b246fa44-2c12-4ba4-96cc-f97764ab8bfe","resolution":{"observed_at":"2026-08-09T11:12:57.208396Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T11:12:56.107541Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.107541Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:dda7d20d659538826cf37814ab0705b89f0e5070120bc986e93648693260c9b3","observation_id":"9da7d255-2778-485b-812a-462572226ade","resolution":{"observed_at":"2026-08-09T11:12:56.107541Z","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-09T11:12:56.111799Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.111799Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:0376e642cfa571ae3e91a19f2fa3843da8970f812e0974d74a866dddcb53fa26","observation_id":"7d2757b5-0143-4154-970b-a64b8a1606c3","resolution":{"observed_at":"2026-08-09T11:12:56.111799Z","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-09T11:12:56.131712Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.131712Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:5311fe96ba73b0ae281ba4cae01c6ffe85d370dc967cb792667a5a4be38845b6","observation_id":"031cb63d-28ae-4215-8df6-3427c66534d2","resolution":{"observed_at":"2026-08-09T11:12:56.131712Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21276","last_updated":"2024-10-25T17:43:01Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-10-25T17:43:01Z","title":"GPT-4o System Card","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.21276","snapshot_observed_at":"2026-08-09T11:12:56.151309Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.151309Z"},"links":{"cited_paper":"/paper/2410.21276","citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:a5383731440b4382992b0ee6c4056a42b20fd54f9e2438d583f85d273b9e6fcc","observation_id":"97f71217-dcc1-4a13-a5e7-c831b9cf6460","resolution":{"observed_at":"2026-08-09T11:12:56.151309Z","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-09T11:12:56.184523Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.184523Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:e1023f36fc11bda16409fcfa7de25f59901f1bf5368663746bce2a694877fad9","observation_id":"7a4d77ff-ee08-4811-9019-479c3d317f88","resolution":{"observed_at":"2026-08-09T11:12:56.184523Z","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-09T11:12:56.206076Z","title":null,"venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.206076Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:407baa71aa21c47b9e922d40600a1f171cbefbc4dff56985b9a6b94f4d0cdba8","observation_id":"a8e23418-edbf-4d44-a8dc-7cc35a84093c","resolution":{"observed_at":"2026-08-09T11:12:56.206076Z","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-09T11:12:57.163348Z","title":null,"venue":null,"work_id":"46310096-249d-42a0-9f7f-e6abd40c3706","year":2002},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.240383Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:1b1ed48115e4f48a6a2bff9c70b3e47a25a12cfd2666ac746725676650e703dd","observation_id":"7db0af73-fa73-456f-aa43-8a0844a11214","resolution":{"observed_at":"2026-08-09T11:12:57.167778Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/n19-1260","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":null,"work_id":"42eab58e-aac7-45f8-bd73-465fdb6f1cfa","year":2019},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.275821Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:311c92f8895039690dd310214f8d54b7b3a1fd8d3274b76dcec46e241072d48d","observation_id":"ed034b11-6c7b-440a-818b-c316b810814b","resolution":{"observed_at":"2026-08-09T11:12:56.527140Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T11:12:56.294923Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.294923Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:74f18105bb1bd52ec71aa3cc35999e8f6996e97ef7f1182d3d2d3d23241a1f1b","observation_id":"48bd547b-ca6f-4628-a0c0-ec44757339ba","resolution":{"observed_at":"2026-08-09T11:12:56.294923Z","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-09T11:12:56.299340Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.299340Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:90599bce106b4cf04f966ecd4796ed90d9fa67795ecea60e7fe718ee7d2c4e68","observation_id":"801fe9a3-553e-4896-b37e-33de47c16ee4","resolution":{"observed_at":"2026-08-09T11:12:56.299340Z","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-09T11:12:57.131259Z","title":null,"venue":null,"work_id":"d58173b8-1603-46c5-a694-4b6d96714684","year":2024},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.303721Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:98f376c9c8d618ad91b7dddab284f5adcc10f14f27924793642211cc8a3cf6d4","observation_id":"a94c5ebb-701e-4580-9a24-0f669c3dae11","resolution":{"observed_at":"2026-08-09T11:12:57.135830Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T11:12:56.308156Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.308156Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:6473c75bee2c5bbdd0b7eceeafb807b927cc5278a4e510741734c83b17986597","observation_id":"18f2a5e6-7540-456a-ba33-79df27f19d32","resolution":{"observed_at":"2026-08-09T11:12:56.308156Z","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-09T11:12:56.312487Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.312487Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:62141a56d66df38ce75e91440ed2812922d46cfdf231af0476667ae55389a34b","observation_id":"afdfc02c-fd8e-4edf-a44d-3edf5a3245be","resolution":{"observed_at":"2026-08-09T11:12:56.312487Z","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-09T11:12:56.316819Z","title":"Gonzalez, Hao Zhang, and Ion Stoica","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.316819Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:43e230212d6a760427708d241c799f3a5b18215d82789dd70993520c440e68cc","observation_id":"ea3de4ec-24d6-4e78-96ee-28bde71ab48f","resolution":{"observed_at":"2026-08-09T11:12:56.316819Z","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-06T23:01:08.996774Z","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-09T11:12:56.321427Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.321427Z"},"links":{"cited_paper":"/paper/2310.06356","citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:8aeb4de008b3ae37c96626c726ba722f9e39d319774b21747db04a84b19cb4dd","observation_id":"d3f2def3-a8ba-449d-8a9d-5b887c772477","resolution":{"observed_at":"2026-08-09T11:12:56.321427Z","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-09T11:12:57.109406Z","title":null,"venue":null,"work_id":"e2e6db9d-9999-4e36-86b6-94d888c48439","year":1982},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.326186Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:96e2c0133d9fad4dea7c11acf178f294cf96ff109cc330789340fb009f7b80a3","observation_id":"65832e15-0b90-496a-8286-2f532e8dcb90","resolution":{"observed_at":"2026-08-09T11:12:57.113153Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T11:12:57.096381Z","title":null,"venue":null,"work_id":"2d90351b-2f10-4597-a032-cc1350a1a1f9","year":2022},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.330469Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:591fcb771e9ac2ee44805f1642c088ec5cf7f20b4b8ec99613a219f121916ee9","observation_id":"d81b31e9-0806-4deb-bc2e-9ff2b11cbb57","resolution":{"observed_at":"2026-08-09T11:12:57.100448Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T11:12:56.334529Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.334529Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:4982ea7e079052f6edaebba35fd2ae23e7a62ee8d5ac2acc555e8509d03f2fe2","observation_id":"d3d4b5f1-8424-426e-b5e3-d1a8ef27b716","resolution":{"observed_at":"2026-08-09T11:12:56.334529Z","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-09T11:12:56.339093Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.339093Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:71106f55404da443ee425a8cec74490706baad4e71253fc4a378d15403932587","observation_id":"0874a977-6354-4bb0-b812-12194d009692","resolution":{"observed_at":"2026-08-09T11:12:56.339093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11156","last_updated":"2025-01-17T04:21:47Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-03-17T17:53:19Z","title":"Can AI-Generated Text be Reliably Detected?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.11156","snapshot_observed_at":"2026-08-09T11:12:56.343130Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.343130Z"},"links":{"cited_paper":"/paper/2303.11156","citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:b7274852c7cf7ac92f932bb5db87dbf1f67e0fc09bef26e96e5e2e3ba4d72459","observation_id":"8f67bc8b-2950-48a3-94bc-5c5f8a0f4f96","resolution":{"observed_at":"2026-08-09T11:12:56.343130Z","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-09T11:12:56.347783Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.347783Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:a02cd4d364e31b489686d93cc1efdebfc6b525bef1ba9ca370438817aaa13cf5","observation_id":"1a1974e3-77bb-4540-9b3f-966400d88671","resolution":{"observed_at":"2026-08-09T11:12:56.347783Z","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-09T11:12:56.352045Z","title":"Smith, Luke Zettlemoyer, and Tao Yu","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.352045Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:d320404546a9157e7819e096fd8952b81183ed319b032c6b474efc53243bf612","observation_id":"2af9a8db-0773-4dab-b393-278b5804224e","resolution":{"observed_at":"2026-08-09T11:12:56.352045Z","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":"10.18653/v1/2024.nllp-1.27","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":null,"work_id":"4e5a8e1d-ad46-46ca-be0a-b2cab4632783","year":2024},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.356487Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:73694d4730690f2e986b45e2261f10efeb09ce34dfc1dd7f3d39b8824a775f20","observation_id":"7391261a-cdf3-4b34-b1df-16502bacf9e5","resolution":{"observed_at":"2026-08-09T11:12:56.476827Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19786","last_updated":"2025-03-25T15:52:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-03-25T15:52:34Z","title":"Gemma 3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.19786","snapshot_observed_at":"2026-08-09T11:12:56.360954Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.360954Z"},"links":{"cited_paper":"/paper/2503.19786","citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:8506eac376a12fb7dd2a5f80be922e72e7e11b721edc8dfa7676aa8cf876ecff","observation_id":"54bd2a2a-7d1f-4074-ad37-6e2f48ae79ad","resolution":{"observed_at":"2026-08-09T11:12:56.360954Z","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":"2505.01406","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T11:12:56.906603Z","title":null,"venue":null,"work_id":"86577578-3984-463b-90ae-825a1d5feb56","year":2025},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.365671Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:859350cfef2867044002418c57006dbae42279f95989cb9e1239dc04d04ff379","observation_id":"4f2fc34d-ad1f-4f8e-b5fc-89d3107d8d29","resolution":{"observed_at":"2026-08-09T11:12:56.913200Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T11:12:57.065395Z","title":null,"venue":null,"work_id":"9ff9f11b-6eda-4ccb-b860-3f4a3f223dd4","year":2006},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.370873Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:dbde04c2b42170d3df243490b01b6daa2d8e077efc87ad3655cb36b5bb894c16","observation_id":"83f818ba-5fe3-4d1b-a924-d6cbaa4f842e","resolution":{"observed_at":"2026-08-09T11:12:57.069576Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05757","last_updated":"2025-02-09T03:27:53Z","snapshot_observed_at":"2026-08-08T18:03:01.040770Z","submitted_at":"2025-02-09T03:27:53Z","title":"Large Language Model-based Nonnegative Matrix Factorization For Cardiorespiratory Sound Separation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05757","snapshot_observed_at":"2026-08-09T11:12:56.375451Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.375451Z"},"links":{"cited_paper":"/paper/2502.05757","citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:c5dc74904810cae99db2e9bc809dc50dc714d7b19b6cb8e4ccc9941a6e0e379e","observation_id":"74eea975-9d2b-438e-8fbf-eb81192f9052","resolution":{"observed_at":"2026-08-09T11:12:56.375451Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.04359","last_updated":"2021-12-08T16:09:48Z","snapshot_observed_at":"2026-08-09T15:17:43.394064Z","submitted_at":"2021-12-08T16:09:48Z","title":"Ethical and social risks of harm from Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.04359","snapshot_observed_at":"2026-08-09T11:12:56.380282Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.380282Z"},"links":{"cited_paper":"/paper/2112.04359","citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:983cf1732a736da0c0ed0dd9ddafa362d6ec23d279d9c9d1897d913b69400e0a","observation_id":"a2f80bac-0220-4fda-b185-b28ed0c917c2","resolution":{"observed_at":"2026-08-09T11:12:56.380282Z","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-09T11:12:56.384527Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.384527Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:cdbcfec144914954ff594ee70c8ebc09accfdd06bb2d75174d3aa16471ee7029","observation_id":"f8cdfb1b-6b5d-4946-bc03-7844f33ea5d1","resolution":{"observed_at":"2026-08-09T11:12:56.384527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.00993","last_updated":"2025-04-04T18:29:18Z","snapshot_observed_at":"2026-08-07T16:16:51.008728Z","submitted_at":"2025-04-01T17:31:44Z","title":"MedReason: Eliciting Factual Medical Reasoning Steps in LLMs via Knowledge Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.00993","snapshot_observed_at":"2026-08-09T11:12:56.390334Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.390334Z"},"links":{"cited_paper":"/paper/2504.00993","citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:c789db88b3405c07b22032e33bcca7fb438bb1eeea85cce0755d191fda9363ee","observation_id":"6d6ca9df-09f7-4671-80e2-9ac40fd099c0","resolution":{"observed_at":"2026-08-09T11:12:56.390334Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.08883","last_updated":"2023-05-14T07:37:33Z","snapshot_observed_at":"2026-08-10T01:45:38.712384Z","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-09T11:12:56.395211Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.395211Z"},"links":{"cited_paper":"/paper/2305.08883","citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:3347acc98c06f74f6d606677ba746ea37457a6169f08c708c33f70a715b8b859","observation_id":"55a5117d-fd66-4ec9-9007-e9cf9b90f307","resolution":{"observed_at":"2026-08-09T11:12:56.395211Z","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-09T11:12:56.399372Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.399372Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:48fd1f9670950bf7ab08f0fa838890da4acde3238f9961b4e2d874a429046dc3","observation_id":"0769ebc1-97c6-405f-abba-9ab6b48fba2e","resolution":{"observed_at":"2026-08-09T11:12:56.399372Z","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-09T11:12:57.042662Z","title":null,"venue":null,"work_id":"06f26844-c75d-4652-8ef6-a37bd93a967d","year":2020},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.403446Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:8c4526d46a6cf4c9de06d4d1c3306157043db0c8cb1592bf6c33eec505bfdf5e","observation_id":"aad61c55-5614-4974-a920-7da615dbf604","resolution":{"observed_at":"2026-08-09T11:12:57.047047Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.01068","last_updated":"2022-06-21T17:04:40Z","snapshot_observed_at":"2026-08-06T03:13:37.403059Z","submitted_at":"2022-05-02T17:49:50Z","title":"OPT: Open Pre-trained Transformer Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.01068","snapshot_observed_at":"2026-08-09T11:12:56.407293Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.407293Z"},"links":{"cited_paper":"/paper/2205.01068","citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:4db09a275efb9255192db16af713d50e92dc5b1c318cd86fc8370928c52e55bb","observation_id":"742ef8e2-c6ff-471d-8aa6-e3075a2234d7","resolution":{"observed_at":"2026-08-09T11:12:56.407293Z","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-09T11:12:56.411305Z","title":"Weinberger, and Yoav Artzi","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.411305Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:e7bfcd15d4203f07c7c2e49951f3a7d3b0d1fc8ed76a9d5f9a925bf2c0395ee7","observation_id":"3736bc76-c110-46e5-b183-df209ad4574f","resolution":{"observed_at":"2026-08-09T11:12:56.411305Z","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-09T11:12:56.415488Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.415488Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:1fd4c11bf0b0683b47b8de3ecc3dcf076a19bf3352140d180064524dc3d40bcf","observation_id":"7f1a8088-0556-42bf-961d-75ae038d4703","resolution":{"observed_at":"2026-08-09T11:12:56.415488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-09T11:12:56.419735Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.419735Z"},"links":{"cited_paper":"/paper/2306.17439","citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:e5adda8c7e768c13a56fdc48dc49a9b8c84347e4d633626216466243b52789c9","observation_id":"649b01d6-d9b5-4d09-9e7d-9a986cae8368","resolution":{"observed_at":"2026-08-09T11:12:56.419735Z","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-09T11:12:56.423884Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.423884Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:940e28d221f4146240c78626d5b034b5ba0509c9e66931ebc5e3512fb6bd0bc3","observation_id":"3df02926-704b-4ef7-b6dc-7235eb252c70","resolution":{"observed_at":"2026-08-09T11:12:56.423884Z","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-09T11:12:56.428904Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-09T11:12:56.428904Z"},"links":{"citing_paper":"/paper/2502.02787"},"observation_digest":"sha256:3d02ae796feb195bd8111d887ae63e2cb89808b8108fb0b0845d20c5cc4b6863","observation_id":"f2833b8a-120e-4d5d-83a4-402abebec41a","resolution":{"observed_at":"2026-08-09T11:12:56.428904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-09T11:05:14.345943Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":48,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":52},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 5 inbound Pith citation observations for arXiv:2502.02787."}