{"as_of":"2026-08-07T19:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:17927469adcb8729dbeb636424233b6d06f4491902d93182b398973adbb0b322","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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-06T09:04:07.942898Z","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-06T21:57:44.851803Z","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:21e70ac6c3f087468f56b3796491c952ef12418f089a32486cbea7ab70720bb4","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-06T09:04:07.942898Z","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:355d758e7e63405987b2f419edf9e79c29628f47918eef47e4dd25dacbd636c1","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T09:04:07.942898Z","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:d9ed9aa68b660d4c3a66e436030629644f8bc56966c51e6fed27fc57ae36bf84","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T09:04:07.942898Z","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:92ab646ad18e3d466e734379c8120032a138416ea27435fccae958fb05238c70","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-06T09:04:07.942898Z","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:08f142388e24312e36e5fe365fe6c2815eca9014f4a6bf9510293bc50f560f03","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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":[],"paper":{"arxiv_id":"2502.02787","last_updated":"2025-09-11T04:36:56Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-06T09:04:07.942898Z","submitted_at":"2025-02-05T00:21:01Z","title":"SimMark: A Robust Sentence-Level Similarity-Based Watermarking Algorithm for Large Language Models"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2502.02787."}