{"as_of":"2026-08-10T05:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:221f4ca64e66400edc6c79ea9884e9b3b924a74b99bf003fd21b94da9b1c79f4","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:43:40.626663Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T04:31:47.487586Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T04:31:47.972671Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"cited_work":{"arxiv_id":"2505.14112","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.14112","snapshot_observed_at":"2026-08-10T04:31:47.972671Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","venue":"cs.CL","work_id":"bf0b517b-4a2c-4f96-b82f-b5c2d555b4f1","year":2025},"citing_paper":{"arxiv_id":"2608.06416","last_updated":"2026-08-05T16:34:32Z","snapshot_observed_at":"2026-08-10T05:10:04.957975Z","submitted_at":"2026-08-05T16:34:32Z","title":"WorldMark: A Plug-and-Play World Knowledge Interface for Cross-Host Language Model Watermarking","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T04:31:47.487586Z"},"links":{"cited_paper":"/paper/2505.14112","citing_paper":"/paper/2608.06416"},"observation_digest":"sha256:39cc502c3ec82944d30de10b9770cc6262366120e0c68b1f021e4a28f9539822","observation_id":"083df88a-15c3-4ec2-b04e-3f8429e70f7b","resolution":{"observed_at":"2026-08-10T04:31:47.978398Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.14112/citation-record","integrity":"/paper/2505.14112/integrity","json":"/paper/2505.14112/citation-record.json","paper":"/paper/2505.14112"},"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-07T15:43:47.014745Z","title":"Atallah, Victor Raskin, Michael Crogan, Christian Hempelmann, Florian Kerschbaum, Dina Mohamed, and Sanket Naik","venue":null,"work_id":"8c0e723a-9140-4aaa-92ad-e9913943576c","year":2001},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:36.174452Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:ca1d9f58742ed4e6923582c63c9f299f000e3047bd05f6f604fbea6bbb1d3b28","observation_id":"f996d6ca-26bd-4bee-bdbc-0b9af492d405","resolution":{"observed_at":"2026-08-07T15:43:47.142145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-02T19:23:53.535075Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-08-07T15:43:36.255110Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:36.255110Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:4202b7f2d7c95c77214aa1b4685eb08ac437b13be0bcc5500e1006f9690898ac","observation_id":"48bdb335-2e7f-459f-b8c6-a929442bdb5e","resolution":{"observed_at":"2026-08-07T15:43:36.255110Z","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.1109/49.464718","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Brassil, S","venue":"IEEE Journal on Selected Areas in Communications","work_id":"1f1b2401-35bc-4027-8c40-d4a5a93f9f19","year":1995},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:36.371045Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:48c431b58fff2fdf61a88936ea8d4662ac03a7ab9ef1fa1dae5ef0d2686c68e7","observation_id":"395aa45e-41d0-4969-b431-5906db98485f","resolution":{"observed_at":"2026-08-07T15:43:41.326438Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:43:36.457312Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:36.457312Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:9228eec67a257d17c779b495038675da578eb6506d916e3114da8f8e8ab18b8a","observation_id":"f7178238-b104-4c19-bb72-bd9f26dc73f7","resolution":{"observed_at":"2026-08-07T15:43:36.457312Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-08T11:58:24.516369Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-07T15:43:36.554879Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:36.554879Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:090a29aa4a65dc443409437eca5963b352e083073002178aaf7939038e07d71a","observation_id":"dd1d194b-7802-457a-a668-20f81bc9abc1","resolution":{"observed_at":"2026-08-07T15:43:36.554879Z","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-07T15:43:46.744170Z","title":null,"venue":null,"work_id":"ae244971-7a7d-4552-8e0f-75235d56b221","year":2024},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:36.636825Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:bfd8fff8c6c2a115f6fd9dea2a40ca7f054e1eb16965d90958124b667aff793c","observation_id":"f600ab54-a836-4b98-adc8-3daef3f71262","resolution":{"observed_at":"2026-08-07T15:43:46.854596Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:43:46.521727Z","title":null,"venue":null,"work_id":"dd921417-bcc0-459c-94af-c5912379dd62","year":2014},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:36.745980Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:f840c3338e211684df15acbdb7749ba9eb168be2da5c55d551b3ac751b3713f5","observation_id":"22bec240-239a-4a92-9ad8-9bfc228b45bc","resolution":{"observed_at":"2026-08-07T15:43:46.606557Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:43:46.227509Z","title":null,"venue":null,"work_id":"71789316-2052-4b2c-a967-71fe51026ac6","year":2023},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:36.814217Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:2acdc0733180dd218705edf0c064c40626a693a7a83b259fbbf8dec109f54a75","observation_id":"0b557579-ae6b-4ac7-ad20-fcad2b90327a","resolution":{"observed_at":"2026-08-07T15:43:46.372898Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:43:45.922835Z","title":null,"venue":null,"work_id":"423f1fc1-51d9-49d6-96d4-01985529ee36","year":2024},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:36.905812Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:36e8252221446abc06bebf29f7ba610c3a545d4e0fc7dab6d6bae2935f114fb9","observation_id":"0b7cab0b-f6d3-47dd-b1f9-d555fcc3ceba","resolution":{"observed_at":"2026-08-07T15:43:46.032946Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:43:45.553373Z","title":null,"venue":null,"work_id":"059a0a99-9d85-439e-b64d-842c4c122dcc","year":2025},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:36.985642Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:d453446e310c4f6b7ffaa30947a01f0f22870aa0cb5422016fd4c721d9054b9a","observation_id":"8c2370e8-724c-47bd-88c0-31c3ddf33ef3","resolution":{"observed_at":"2026-08-07T15:43:45.724825Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:43:37.086045Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:37.086045Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:9d0bcce4095c885c55a9169a654b56416c011710cce9772bff218bfdcc758521","observation_id":"106141cd-283b-49be-a79a-4af0401a2aee","resolution":{"observed_at":"2026-08-07T15:43:37.086045Z","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-07T15:43:37.194365Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:37.194365Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:2b255c70892c56eb17c87a454f216f527b670bf679acfe32e32746dbdf48b2e8","observation_id":"fc17b537-5410-4d0f-bb9e-d8b330a5a128","resolution":{"observed_at":"2026-08-07T15:43:37.194365Z","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-07T15:43:45.164839Z","title":null,"venue":null,"work_id":"7a54f572-9f47-4f8e-97b7-916fda93cabc","year":2024},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:37.325607Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:bd08c22121d4348b70c9790c6ecc86fc9b8004e1d890ef7560a758054525556d","observation_id":"48e076a3-5c37-445a-96d2-9e36f676936e","resolution":{"observed_at":"2026-08-07T15:43:45.294822Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:43:37.448055Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:37.448055Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:0e5489410a8f44c005b3d24c5d9e206bf350083ddb41334e00c972a41bb04a91","observation_id":"544a87a5-0194-4aa4-bcc7-df7c27fabb57","resolution":{"observed_at":"2026-08-07T15:43:37.448055Z","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-07T15:43:37.593768Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:37.593768Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:7e0eae6c979a4ab41fc3de8ef6b3ff569c4ef83173e502b6264a89f62aa0d6cb","observation_id":"b53beb74-5983-4b05-9261-786759a5fab1","resolution":{"observed_at":"2026-08-07T15:43:37.593768Z","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-07T15:43:37.746260Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:37.746260Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:023616302f8facca2203327d23523dea32776bb9210b5362dbf61d7ac3047892","observation_id":"3bd06043-1aa6-4e3b-ab82-a8993679a3e1","resolution":{"observed_at":"2026-08-07T15:43:37.746260Z","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-07T15:43:44.828739Z","title":null,"venue":null,"work_id":"d386f957-4068-4d63-afd8-a844ade7392d","year":2024},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:37.850173Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:066acd9f4957c64f5e334f80e01976474bc4a9a8952f31b1c35602f495e3afc3","observation_id":"89dccd96-8f6f-4242-9fc1-016fa0642ba2","resolution":{"observed_at":"2026-08-07T15:43:44.954749Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:43:37.928861Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:37.928861Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:a26847602425fef4638dd3e79ab92cfb04b34f0d8029ba33bff5c59e04fde684","observation_id":"a8f247ec-aa4e-4638-8516-f5ed88d4c625","resolution":{"observed_at":"2026-08-07T15:43:37.928861Z","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-07T15:43:38.016402Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:38.016402Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:2ea527540da6490b6124330ff98bfd6e82ef228e2825afaced4c555910ca1cf0","observation_id":"aa7d30a3-e791-4ca7-adf4-2d3bf26416b9","resolution":{"observed_at":"2026-08-07T15:43:38.016402Z","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-07T15:43:44.426763Z","title":null,"venue":null,"work_id":"71a3612a-64e5-4f7e-8e20-e68b0716d099","year":2023},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:38.162491Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:125aa7de07d97618bc93840bfdec876158e78bf1cd3b12440ba7cf4cad8d747a","observation_id":"2f95440d-6158-4762-8839-d5a35f45724f","resolution":{"observed_at":"2026-08-07T15:43:44.574822Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:43:38.276213Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:38.276213Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:b4bac70693677bdfdd6a18eb16cab327af25f2b0a8d4016e79092a765f19aaed","observation_id":"c0db9c7b-3b85-4fe2-8724-6896e2f9a34c","resolution":{"observed_at":"2026-08-07T15:43:38.276213Z","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-07T15:43:38.414360Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:38.414360Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:c346f5e8318a3baefc795de0b0f2979180afa84fb1b1ded35220065d4213ec05","observation_id":"eaa5f81a-a6bc-4ae5-9b77-4ebc61fc592a","resolution":{"observed_at":"2026-08-07T15:43:38.414360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.06161","last_updated":"2023-12-13T14:44:10Z","snapshot_observed_at":"2026-07-06T15:25:35.930688Z","submitted_at":"2023-05-09T08:16:42Z","title":"StarCoder: may the source be with you!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.06161","snapshot_observed_at":"2026-08-07T15:43:38.493490Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:38.493490Z"},"links":{"cited_paper":"/paper/2305.06161","citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:e462a7afe31592157c6e84126f7f54e85e50615ef6bb40876d22c7ea8c3f86ac","observation_id":"2c61b075-56e3-4d4a-a75d-d4d62a1dd803","resolution":{"observed_at":"2026-08-07T15:43:38.493490Z","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-07T15:43:44.137388Z","title":null,"venue":null,"work_id":"c0d45da4-7d88-44ac-9f21-5ed001d1a1e9","year":2024},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:38.619184Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:64a12893e7307e3b27d364e3eaa35d039ba29a34deb084c9355c0a9b0ade364c","observation_id":"f1d16bd6-f408-49d9-b99d-f58db21adeb3","resolution":{"observed_at":"2026-08-07T15:43:44.265634Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:43:43.801788Z","title":null,"venue":null,"work_id":"a26b26e7-6d5d-4b66-9982-13c2891a2158","year":2024},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:38.775758Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:b0628e39d38f6cc360dd1bd8ef0147c858014399d30e01a5bcb4e1d9d3d79593","observation_id":"4a2e2588-6ba0-4963-b70f-a974cc66c681","resolution":{"observed_at":"2026-08-07T15:43:44.038575Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05101","last_updated":"2019-01-04T21:01:49Z","snapshot_observed_at":"2026-08-09T20:34:52.923500Z","submitted_at":"2017-11-14T14:24:06Z","title":"Decoupled Weight Decay Regularization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05101","snapshot_observed_at":"2026-08-07T15:43:38.900584Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:38.900584Z"},"links":{"cited_paper":"/paper/1711.05101","citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:c1073779f338f4d63a1aebbb5af66e0cde841b5f55b54384c4b1d569eac8e517","observation_id":"a76b9d36-3d67-41b8-876f-6ffac43ee9df","resolution":{"observed_at":"2026-08-07T15:43:38.900584Z","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.acl-long.630","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":null,"work_id":"0f2fd7f7-2cd8-4ac5-988c-026ddf11f056","year":2024},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:39.054905Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:34e95bdd6bc1baac28e4740e92a9780daa44aea35c45a72279792fe3aa9b72fb","observation_id":"48bd94ce-75ab-4862-bba4-7b2235de92ca","resolution":{"observed_at":"2026-08-07T15:43:41.023098Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:43:39.145152Z","title":"Sumru Özsoy , Tunga Güngör, and Emre Sevinç","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:39.145152Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:12e10b2ec2d40e037320b49119e0b7412de47a84b6f1c08dd3ce63cce9960fa4","observation_id":"1606013f-410c-40f8-8293-6d0430d134bd","resolution":{"observed_at":"2026-08-07T15:43:39.145152Z","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-07T15:43:39.184565Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:39.184565Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:83a3b0db717f816ae2b64a3a9dcf08666f9a89d64500ed3194b91457a4851677","observation_id":"e902b937-cb92-40b4-9d4a-7da8a706e057","resolution":{"observed_at":"2026-08-07T15:43:39.184565Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.05773","last_updated":"2024-03-11T06:27:26Z","snapshot_observed_at":"2026-07-06T15:25:16.703799Z","submitted_at":"2023-05-09T21:31:07Z","title":"DeepTextMark: A Deep Learning-Driven Text Watermarking Approach for Identifying Large Language Model Generated Text","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.05773","snapshot_observed_at":"2026-08-07T15:43:39.272750Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:39.272750Z"},"links":{"cited_paper":"/paper/2305.05773","citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:14a9c75d32490acdf35a82c362948ab7cc09ed936181846245dbe4337463cb7c","observation_id":"3ef5afb1-9dd0-461d-bfd1-6373981e269e","resolution":{"observed_at":"2026-08-07T15:43:39.272750Z","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-07T15:43:43.492120Z","title":null,"venue":null,"work_id":"04e26a9a-aaaf-4590-aed1-6623f6638253","year":2023},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:39.346557Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:50648fca23370b5f2a327a1266e8f07fb920aa4f6eb70b096b8e36cbd0df3b4a","observation_id":"f7a62223-533a-4e54-abdf-e49eac2d6830","resolution":{"observed_at":"2026-08-07T15:43:43.664653Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:43:39.407268Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:39.407268Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:36852086f829661668723d722c77ab1cfebd0e08031db1b60b2cb6cec588259b","observation_id":"b88f02e5-f718-4735-98c7-6dd8039f7fae","resolution":{"observed_at":"2026-08-07T15:43:39.407268Z","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":"8503.29385","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:43:42.116184Z","title":null,"venue":null,"work_id":"f00a13ac-8112-4579-a6dc-1b53035732e3","year":2016},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:39.469672Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:fa3cdb4c504858c2e913e719edb6a61b74db118602df8fe7cfab09c56069e1fc","observation_id":"a4b3b017-14f7-4916-80d0-cd24031b8d43","resolution":{"observed_at":"2026-08-07T15:43:42.219721Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.08920","last_updated":"2023-10-13T07:44:05Z","snapshot_observed_at":"2026-07-06T16:32:23.448967Z","submitted_at":"2023-10-13T07:44:05Z","title":"Embarrassingly Simple Text Watermarks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.08920","snapshot_observed_at":"2026-08-07T15:43:39.557274Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:39.557274Z"},"links":{"cited_paper":"/paper/2310.08920","citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:da8609440b51fc22980ce858a245d18cc8011ba699f8e21e8de04a0615afef70","observation_id":"a9b7e2da-99f1-47c5-be57-511882d84f1e","resolution":{"observed_at":"2026-08-07T15:43:39.557274Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.09203","last_updated":"2019-11-13T03:54:12Z","snapshot_observed_at":"2026-08-03T18:37:05.537362Z","submitted_at":"2019-08-24T20:41:40Z","title":"Release Strategies and the Social Impacts of Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.09203","snapshot_observed_at":"2026-08-07T15:43:39.627259Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:39.627259Z"},"links":{"cited_paper":"/paper/1908.09203","citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:00e5567353101cf8c8ff4bde948c55cb90154f9289fddbe027ee8347dc4a485a","observation_id":"524002b6-74c7-470d-91ef-11b65634e4b8","resolution":{"observed_at":"2026-08-07T15:43:39.627259Z","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-07T15:43:43.275219Z","title":null,"venue":null,"work_id":"b7f3c66f-7e94-42cc-9066-c943f6674005","year":2020},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:39.748604Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:dabed596458aa7a52af5e5c2eefb308419b3775f2ad1f0c631cb7d8a2a31141f","observation_id":"a1ea49d0-7d42-4572-b41a-ec954e4732f8","resolution":{"observed_at":"2026-08-07T15:43:43.370095Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:43:43.082900Z","title":null,"venue":null,"work_id":"f7a9b045-52b0-4e76-9713-2090c601bcca","year":2023},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:39.809536Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:bd35b9100588ca81801e8cf3366f4af73aadd65a90f760187ac0cd8ee87ac69f","observation_id":"cdab4f2f-7f1d-498a-9ff8-bd36750c785c","resolution":{"observed_at":"2026-08-07T15:43:43.172544Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:43:42.897520Z","title":null,"venue":null,"work_id":"d0f7b983-57a5-42bf-bd98-1f86c16e218b","year":2022},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:39.849898Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:20844a93d0550156ef9efeb67d86da57a6bd93b60d30994f0ede3f433783182a","observation_id":"9b541b34-c0cd-4dca-901e-8b4a9c9a7319","resolution":{"observed_at":"2026-08-07T15:43:42.948939Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8766.11787","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:43:41.755346Z","title":null,"venue":null,"work_id":"247009d3-e7e0-4084-83bb-cff8a227dc97","year":2006},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:39.907825Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:48c45507a8ce871aed224026957a1c056ad961aa804c1d5653e084cb7a5abef6","observation_id":"41b8ac86-ebb8-4ef4-973d-c9d134cf37c3","resolution":{"observed_at":"2026-08-07T15:43:41.868067Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:43:39.987459Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:39.987459Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:ccac2ee09f3b6d3932b2eaa34dd1756df9ab22c6ed586d5a2c50fb3d0e9bd7e7","observation_id":"6a05ec33-b1cc-43f2-a10f-c284a87586d4","resolution":{"observed_at":"2026-08-07T15:43:39.987459Z","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-07T15:43:42.713120Z","title":null,"venue":null,"work_id":"dbd6db39-e222-4dec-8009-8c006ece5a53","year":2024},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:40.063506Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:f7963bb7952032b37d2bf325a77dc9cd0969a67106ec092b6994ce0eec2032b6","observation_id":"cdb70473-7f9a-4c88-9baa-0ff0f4dbbaea","resolution":{"observed_at":"2026-08-07T15:43:42.784814Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11541","last_updated":"2025-05-20T00:24:09Z","snapshot_observed_at":"2026-08-07T15:45:26.462939Z","submitted_at":"2025-05-14T13:11:16Z","title":"MorphMark: Flexible Adaptive Watermarking for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.11541","snapshot_observed_at":"2026-08-07T15:43:40.125113Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:40.125113Z"},"links":{"cited_paper":"/paper/2505.11541","citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:86a7eda64ebe00fc67e62e1415081b2d592e2251d1d50d4b4f3dbe5687f6f73d","observation_id":"300cccf6-6e34-4dd0-a01b-1ddb5f0b0d7a","resolution":{"observed_at":"2026-08-07T15:43:40.125113Z","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-07T15:43:42.439776Z","title":null,"venue":null,"work_id":"527f2de9-5553-43c4-aad6-cb0cea1e6e29","year":2024},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:40.181381Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:debe99dbc82109e3318c6de02fcade5d3f3722d62a153f1589f0407169c7d657","observation_id":"65cec78a-f7cf-435a-8a06-a908515b3adc","resolution":{"observed_at":"2026-08-07T15:43:42.563018Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.07710","last_updated":"2024-06-25T07:08:17Z","snapshot_observed_at":"2026-08-10T02:47:11.126978Z","submitted_at":"2023-10-11T17:57:35Z","title":"A Resilient and Accessible Distribution-Preserving Watermark for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.07710","snapshot_observed_at":"2026-08-07T15:43:40.255927Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:40.255927Z"},"links":{"cited_paper":"/paper/2310.07710","citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:7a3d134fb2129c827cc04297978b54041e56b1fee57b0bebb0a4f1fe2199886a","observation_id":"f38a7e57-37fd-4e3c-aa8c-1bbcceaeaa53","resolution":{"observed_at":"2026-08-07T15:43:40.255927Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.05842","last_updated":"2025-04-26T08:10:01Z","snapshot_observed_at":"2026-07-06T17:41:59.818493Z","submitted_at":"2024-03-09T08:54:52Z","title":"TokenMark: A Modality-Agnostic Watermark for Pre-trained Transformers","version":3},"cited_work":{"arxiv_id":"2403.05842","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.05842","snapshot_observed_at":"2026-08-07T15:43:41.451601Z","title":"TokenMark: A Modality-Agnostic Watermark for Pre-trained Transformers","venue":"cs.CR","work_id":"bddb7d87-dfb7-4f7a-af2f-3030f7f2fd11","year":2024},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:40.279340Z"},"links":{"cited_paper":"/paper/2403.05842","citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:3a49b7b2b5e2a0992b1922b18089901e3bda11e8098c5fba862de2b684686cd8","observation_id":"75fe7e1d-1061-48ad-82d3-6f52ee188daa","resolution":{"observed_at":"2026-08-07T15:43:41.511392Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.10553","last_updated":"2024-03-13T03:43:39Z","snapshot_observed_at":"2026-07-06T17:45:27.526239Z","submitted_at":"2024-03-13T03:43:39Z","title":"Learning to Watermark LLM-generated Text via Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.10553","snapshot_observed_at":"2026-08-07T15:43:40.335605Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:40.335605Z"},"links":{"cited_paper":"/paper/2403.10553","citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:895fc36932fcf744523c648535df7e6d328bf074fb43e394482863574c367e48","observation_id":"8f2e745a-78e4-4f08-b6a8-b611580af594","resolution":{"observed_at":"2026-08-07T15:43:40.335605Z","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-07T15:43:40.374499Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:40.374499Z"},"links":{"cited_paper":"/paper/2305.08883","citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:f524ca5fb44163731bb2fc6ba584fd1766c46f148f4466e9cb568624e0e64d36","observation_id":"b7431f3e-ff32-4930-ab5f-47e5cfa8e8ad","resolution":{"observed_at":"2026-08-07T15:43:40.374499Z","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.v36i10.21415","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":"39762025-cc4d-43ce-b936-985d44cea9af","year":2022},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:40.410648Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:03b906038f2c414523531c01ab562dfc9ad032a6ffa9eaf67b78253198d1eb7e","observation_id":"df579f72-ee63-4437-ad0a-9a1b3701b093","resolution":{"observed_at":"2026-08-07T15:43:40.785681Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:43:40.489226Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:40.489226Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:a592ce2cb733c9870aadeb1be3f1596cb790a46841b34821522ea4b9a3816dd4","observation_id":"d21ba30d-c765-4ae1-8968-ae21296d53ea","resolution":{"observed_at":"2026-08-07T15:43:40.489226Z","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-07T15:43:40.563064Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:40.563064Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:50cd6627843db6b880ce022f986a7d0b4e26e1549c63239e037343743f6c988d","observation_id":"a0baf386-6797-4794-b658-2f8f67565fdc","resolution":{"observed_at":"2026-08-07T15:43:40.563064Z","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-07T15:43:40.626663Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T15:43:40.626663Z"},"links":{"citing_paper":"/paper/2505.14112"},"observation_digest":"sha256:1a49ee9ff69c0d2e86321421aab142de8ba4e65b583f43591ce6f43c78ac9b38","observation_id":"9d4dde8b-8d18-420b-899e-f6bc9ebf08b7","resolution":{"observed_at":"2026-08-07T15:43:40.626663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.14112","last_updated":"2025-05-20T09:19:06Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-10T02:47:20.009552Z","submitted_at":"2025-05-20T09:19:06Z","title":"Invisible Entropy: Towards Safe and Efficient Low-Entropy LLM Watermarking"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":44,"verified_exact":4,"verified_fuzzy":1},"total_outbound_references":51},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 1 inbound Pith citation observation for arXiv:2505.14112."}