{"as_of":"2026-08-10T22:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1e119b743d5b14ad574cd1b476b49626f9bc172867f6682f25a849b0f49f5e41","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T12:55:02.462850Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2502.05213/citation-record","integrity":"/paper/2502.05213/integrity","json":"/paper/2502.05213/citation-record.json","paper":"/paper/2502.05213"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-09T12:55:02.418983Z","title":"Gpt-4 technical report","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05213","last_updated":"2025-08-03T03:58:10Z","snapshot_observed_at":"2026-08-09T12:49:06.723073Z","submitted_at":"2025-02-04T11:23:49Z","title":"DERMARK: A Dynamic, Efficient and Robust Multi-bit Watermark for Large Language Models","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T12:55:02.418983Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2502.05213"},"observation_digest":"sha256:b6d03fabd5af84bd8098c39446557936e6241b5b79c43b4a02a2d98dd2087bca","observation_id":"b7dcdbac-eef4-4b75-8676-ddf6a4d9c0e3","resolution":{"observed_at":"2026-08-09T12:55:02.418983Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.10544","last_updated":"2023-09-19T11:45:29Z","snapshot_observed_at":"2026-08-09T01:33:37.759144Z","submitted_at":"2023-09-19T11:45:29Z","title":"Model Leeching: An Extraction Attack Targeting LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.10544","snapshot_observed_at":"2026-08-09T12:55:02.423410Z","title":"Model leeching: An extraction attack targeting llms","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05213","last_updated":"2025-08-03T03:58:10Z","snapshot_observed_at":"2026-08-09T12:49:06.723073Z","submitted_at":"2025-02-04T11:23:49Z","title":"DERMARK: A Dynamic, Efficient and Robust Multi-bit Watermark for Large Language Models","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T12:55:02.423410Z"},"links":{"cited_paper":"/paper/2309.10544","citing_paper":"/paper/2502.05213"},"observation_digest":"sha256:f6d8e11b3ad06922f3ea7a540b1dc471470e06eb2cc8c11038300bee91dbdeff","observation_id":"3a69a0b3-abf8-4a6c-9e65-ebd0b02b1853","resolution":{"observed_at":"2026-08-09T12:55:02.423410Z","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-09T12:55:02.596794Z","title":"Can llm-generated misinformation be detected? In The Twelfth International Conference on Learning Representations, ICLR 2024, Vienna, Austria, May 7-11, 2024","venue":null,"work_id":"593a108a-5943-48da-9742-2ddf05988bd3","year":2024},"citing_paper":{"arxiv_id":"2502.05213","last_updated":"2025-08-03T03:58:10Z","snapshot_observed_at":"2026-08-09T12:49:06.723073Z","submitted_at":"2025-02-04T11:23:49Z","title":"DERMARK: A Dynamic, Efficient and Robust Multi-bit Watermark for Large Language Models","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T12:55:02.427224Z"},"links":{"citing_paper":"/paper/2502.05213"},"observation_digest":"sha256:c3dbc08fef8a8cb3fc2e0232ead88f2a38643d01cde7b1fff8153ae68b63024a","observation_id":"9176d7bf-3dc3-4142-a816-ea759674e0b7","resolution":{"observed_at":"2026-08-09T12:55:02.599838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-09T12:55:02.430605Z","title":"Llama 2: Open foundation and fine-tuned chat models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05213","last_updated":"2025-08-03T03:58:10Z","snapshot_observed_at":"2026-08-09T12:49:06.723073Z","submitted_at":"2025-02-04T11:23:49Z","title":"DERMARK: A Dynamic, Efficient and Robust Multi-bit Watermark for Large Language Models","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T12:55:02.430605Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2502.05213"},"observation_digest":"sha256:6491fe166867361ee8f8e6a970c47c30d1e2f48a221ad10bf3645c4fe1783712","observation_id":"ccd5852c-69b9-4c7a-9287-acda88700a6b","resolution":{"observed_at":"2026-08-09T12:55:02.430605Z","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-09T12:55:02.588628Z","title":"Unbiased watermark for large language models, 2023","venue":null,"work_id":"66873803-6b79-4cad-901a-fd8b9698d6cd","year":2023},"citing_paper":{"arxiv_id":"2502.05213","last_updated":"2025-08-03T03:58:10Z","snapshot_observed_at":"2026-08-09T12:49:06.723073Z","submitted_at":"2025-02-04T11:23:49Z","title":"DERMARK: A Dynamic, Efficient and Robust Multi-bit Watermark for Large Language Models","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T12:55:02.434541Z"},"links":{"citing_paper":"/paper/2502.05213"},"observation_digest":"sha256:19a465a1d151993c6daa7dc62d6db8a261f2defad41d8aeb0633585961c62148","observation_id":"067ce742-ead2-4e3c-96fb-be4a7705fdcc","resolution":{"observed_at":"2026-08-09T12:55:02.591579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-09T12:55:02.580273Z","title":"A watermark for large language models","venue":null,"work_id":"98e305b3-b12f-4a60-a526-8f644ca698c5","year":2023},"citing_paper":{"arxiv_id":"2502.05213","last_updated":"2025-08-03T03:58:10Z","snapshot_observed_at":"2026-08-09T12:49:06.723073Z","submitted_at":"2025-02-04T11:23:49Z","title":"DERMARK: A Dynamic, Efficient and Robust Multi-bit Watermark for Large Language Models","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T12:55:02.437967Z"},"links":{"citing_paper":"/paper/2502.05213"},"observation_digest":"sha256:a553b38d19fbc1fcadb3b4a2addf3475741c713757e55a06b5b3d3c0387e5554","observation_id":"ef9a2254-89c5-4e0a-a063-96ddb203cb1e","resolution":{"observed_at":"2026-08-09T12:55:02.583112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-09T12:55:02.441403Z","title":"A semantic invariant robust watermark for large language models, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05213","last_updated":"2025-08-03T03:58:10Z","snapshot_observed_at":"2026-08-09T12:49:06.723073Z","submitted_at":"2025-02-04T11:23:49Z","title":"DERMARK: A Dynamic, Efficient and Robust Multi-bit Watermark for Large Language Models","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T12:55:02.441403Z"},"links":{"citing_paper":"/paper/2502.05213"},"observation_digest":"sha256:5b280e1e8e5cc6c214a23002d0ee7314437314b1f2cdf548774e1f1ab6c25b6f","observation_id":"dd6f2b6a-0c45-46d7-8a31-b7491084cd0f","resolution":{"observed_at":"2026-08-09T12:55:02.441403Z","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-09T12:55:02.566292Z","title":"A survey of text watermarking in the era of large language models","venue":null,"work_id":"8827e770-97a0-4328-80cb-022b12f94d7e","year":2024},"citing_paper":{"arxiv_id":"2502.05213","last_updated":"2025-08-03T03:58:10Z","snapshot_observed_at":"2026-08-09T12:49:06.723073Z","submitted_at":"2025-02-04T11:23:49Z","title":"DERMARK: A Dynamic, Efficient and Robust Multi-bit Watermark for Large Language Models","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T12:55:02.444190Z"},"links":{"citing_paper":"/paper/2502.05213"},"observation_digest":"sha256:69719a2897f1c664563084a8664ff5a15494eed7d41511b8fcaac8848f28210c","observation_id":"29758d92-a837-4f54-a478-868eb55f86dc","resolution":{"observed_at":"2026-08-09T12:55:02.569561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-09T12:55:02.557612Z","title":"Academic integrity considerations of ai large language models in the post-pandemic era: Chatgpt and beyond","venue":null,"work_id":"7cde1bb7-c4b3-4cae-9e2f-42810d4b7186","year":2023},"citing_paper":{"arxiv_id":"2502.05213","last_updated":"2025-08-03T03:58:10Z","snapshot_observed_at":"2026-08-09T12:49:06.723073Z","submitted_at":"2025-02-04T11:23:49Z","title":"DERMARK: A Dynamic, Efficient and Robust Multi-bit Watermark for Large Language Models","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T12:55:02.446936Z"},"links":{"citing_paper":"/paper/2502.05213"},"observation_digest":"sha256:9ff608fdb39cf98a3626d2a5717cfdad8cc5a3a90383b7f261aa56c43d9c4041","observation_id":"36d44b3e-0f04-47ab-ae49-49ec26c66f4e","resolution":{"observed_at":"2026-08-09T12:55:02.560792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-09T12:55:02.449532Z","title":"Language models are unsupervised multitask learners","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.05213","last_updated":"2025-08-03T03:58:10Z","snapshot_observed_at":"2026-08-09T12:49:06.723073Z","submitted_at":"2025-02-04T11:23:49Z","title":"DERMARK: A Dynamic, Efficient and Robust Multi-bit Watermark for Large Language Models","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T12:55:02.449532Z"},"links":{"citing_paper":"/paper/2502.05213"},"observation_digest":"sha256:426d33534e46382c8cb3c2a1d3152fbff802972af1f06ebafa74fb443deab901","observation_id":"1a1f1f7a-d64d-4ac9-989a-a00902790a14","resolution":{"observed_at":"2026-08-09T12:55:02.449532Z","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-09T12:55:02.452464Z","title":"Exploring the limits of transfer learning with a unified text-to-text transformer","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.05213","last_updated":"2025-08-03T03:58:10Z","snapshot_observed_at":"2026-08-09T12:49:06.723073Z","submitted_at":"2025-02-04T11:23:49Z","title":"DERMARK: A Dynamic, Efficient and Robust Multi-bit Watermark for Large Language Models","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T12:55:02.452464Z"},"links":{"citing_paper":"/paper/2502.05213"},"observation_digest":"sha256:bbdd4d59217a6f343f71316648b413f89e6e4e1e024035897cb22bc55671c7cb","observation_id":"ab66da2a-267c-4114-808e-c70294fc0ef2","resolution":{"observed_at":"2026-08-09T12:55:02.452464Z","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-09T12:55:02.538435Z","title":"The poisson binomial distribution—old & new","venue":null,"work_id":"80313fb3-0068-4dd9-b092-568766a09a5a","year":2023},"citing_paper":{"arxiv_id":"2502.05213","last_updated":"2025-08-03T03:58:10Z","snapshot_observed_at":"2026-08-09T12:49:06.723073Z","submitted_at":"2025-02-04T11:23:49Z","title":"DERMARK: A Dynamic, Efficient and Robust Multi-bit Watermark for Large Language Models","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T12:55:02.454957Z"},"links":{"citing_paper":"/paper/2502.05213"},"observation_digest":"sha256:aae079f43e7e4585123f2c9addc1bf3dfb9f3399f9f843e8e64c7663eeb8efd6","observation_id":"d76bb388-a231-40ce-aabb-1f81149ef6e8","resolution":{"observed_at":"2026-08-09T12:55:02.541277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-09T12:55:02.530135Z","title":"Towards codable watermarking for injecting multi-bits information to llms","venue":null,"work_id":"c7c181a9-30c2-4241-959d-712f3a9b2822","year":2024},"citing_paper":{"arxiv_id":"2502.05213","last_updated":"2025-08-03T03:58:10Z","snapshot_observed_at":"2026-08-09T12:49:06.723073Z","submitted_at":"2025-02-04T11:23:49Z","title":"DERMARK: A Dynamic, Efficient and Robust Multi-bit Watermark for Large Language Models","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T12:55:02.457592Z"},"links":{"citing_paper":"/paper/2502.05213"},"observation_digest":"sha256:8c377982d6340ec9b2c6a0789366cd6bf44e261bdf27c42cd83cd17796582ad2","observation_id":"a2859610-4fad-4135-baae-f823efabca5c","resolution":{"observed_at":"2026-08-09T12:55:02.533091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-09T12:55:02.460083Z","title":"Opt: Open pre-trained transformer language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05213","last_updated":"2025-08-03T03:58:10Z","snapshot_observed_at":"2026-08-09T12:49:06.723073Z","submitted_at":"2025-02-04T11:23:49Z","title":"DERMARK: A Dynamic, Efficient and Robust Multi-bit Watermark for Large Language Models","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T12:55:02.460083Z"},"links":{"cited_paper":"/paper/2205.01068","citing_paper":"/paper/2502.05213"},"observation_digest":"sha256:6943c0b0772e38b813319855a3d97bb54088ee2f7fbebbbda2e3d5c1b4b1176f","observation_id":"10df06c6-c3f7-4aa5-83f6-6c760ec56508","resolution":{"observed_at":"2026-08-09T12:55:02.460083Z","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-09T12:55:02.518791Z","title":"\\ REMARK-LLM \\ : A robust and efficient watermarking framework for generative large language models","venue":null,"work_id":"e098b3fc-fd7d-402a-a76d-6a8b2b5ac6af","year":2024},"citing_paper":{"arxiv_id":"2502.05213","last_updated":"2025-08-03T03:58:10Z","snapshot_observed_at":"2026-08-09T12:49:06.723073Z","submitted_at":"2025-02-04T11:23:49Z","title":"DERMARK: A Dynamic, Efficient and Robust Multi-bit Watermark for Large Language Models","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T12:55:02.462850Z"},"links":{"citing_paper":"/paper/2502.05213"},"observation_digest":"sha256:c1f6e3b53c16e0276f80f79bfb043f79ba9fbd5bb80fb3bdaa3f1e274072214d","observation_id":"ef69aaad-0a0f-4f1a-b7f7-a966f481d575","resolution":{"observed_at":"2026-08-09T12:55:02.523659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2502.05213","last_updated":"2025-08-03T03:58:10Z","latest_version":2,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-09T12:49:06.723073Z","submitted_at":"2025-02-04T11:23:49Z","title":"DERMARK: A Dynamic, Efficient and Robust Multi-bit Watermark for Large Language Models"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":8},"total_outbound_references":15},"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 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2502.05213."}