{"as_of":"2026-08-08T08:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8c56f2831f585ebd9010b583ce336550e2ffc73d50505760a2d305aff87930a0","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T19:46:12.352279Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2508.11925/citation-record","integrity":"/paper/2508.11925/integrity","json":"/paper/2508.11925/citation-record.json","paper":"/paper/2508.11925"},"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-05T19:46:12.233978Z","title":"GPT-4 technical report","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.233978Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:065b605ced1630e85fe35165b7b2e94b8a0675b2826bafd728296af96b6a0e52","observation_id":"bcd112e2-8c46-4071-9066-b032630730c0","resolution":{"observed_at":"2026-08-05T19:46:12.233978Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-05T19:46:12.238824Z","title":"Program synthesis with large language models","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.238824Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:07bffc76c30a4a8435a6c5292de6c9c9589b9b81b7762d49e77dc73185d3df3a","observation_id":"0bf75437-1660-427a-8f81-9d84576350ab","resolution":{"observed_at":"2026-08-05T19:46:12.238824Z","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-05T19:46:12.833780Z","title":"Evaluating L arge L anguage M odels trained on code","venue":null,"work_id":"5284d6a4-def5-4ac0-a43c-8bc88ffaf05c","year":2021},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.243792Z"},"links":{"citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:94ce58f688836957308adc8da7393a6cc345de220f0efab24e49c00b70d6aea4","observation_id":"d1a3d605-f68d-412c-aeef-a30a2469eb30","resolution":{"observed_at":"2026-08-05T19:46:12.838106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T19:46:12.818894Z","title":"Scalable watermarking for identifying large language model outputs","venue":null,"work_id":"1bbf9369-a378-49b8-a35c-f13a3db47256","year":2024},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.248498Z"},"links":{"citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:aaac38861bedeeb30aa1c794a5acd2960b28989fc733065318feb69ccacaa3d1","observation_id":"f665ee2f-6e63-41bb-95fe-658182279196","resolution":{"observed_at":"2026-08-05T19:46:12.823436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T19:46:12.803674Z","title":"GLTR : Statistical detection and visualization of generated text","venue":null,"work_id":"e640d8e1-ac88-4008-af36-30689c09bdf6","year":2019},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.252955Z"},"links":{"citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:d1636f5cada59fccf5dfd7c66fbc541a71e0d3c28cd2ff4b6149ef216a4cc907","observation_id":"09d8da1d-bd3c-4af0-87e9-2147fbaaf54c","resolution":{"observed_at":"2026-08-05T19:46:12.808109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15639","last_updated":"2024-12-30T15:59:18Z","snapshot_observed_at":"2026-08-01T16:45:41.359764Z","submitted_at":"2024-04-24T04:25:04Z","title":"CodeIP: A Grammar-Guided Multi-Bit Watermark for Large Language Models of Code","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.15639","snapshot_observed_at":"2026-08-05T19:46:12.257202Z","title":"Codeip : A grammar-guided multi-bit watermark for large language models of code","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.257202Z"},"links":{"cited_paper":"/paper/2404.15639","citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:b810e9c6cd28bee686dcbc1fa4a1a2df73306fa8da29dc66e5756589afb3a91f","observation_id":"735b8595-ef19-4e83-a55e-98cd7702b150","resolution":{"observed_at":"2026-08-05T19:46:12.257202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-05T19:46:12.262192Z","title":"Deepseek-r1 : Incentivizing reasoning capability in LLMs via reinforcement learning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.262192Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:2193a31b0217b88b3385a4dacb8cd397332543e87ef23c67c5ff10e7b4cd0ee1","observation_id":"eb75da16-f2b2-47be-a2e9-5bbed6bf2334","resolution":{"observed_at":"2026-08-05T19:46:12.262192Z","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-05T19:46:12.789197Z","title":"A survey of static software watermarking","venue":null,"work_id":"27f8fced-62ab-4599-b4de-3ebf0a082bdb","year":2011},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.267107Z"},"links":{"citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:6d6f92dfeb2fa66b73a40cf270013d5e2323fcd67e78c6adce79e3fcc2d613c9","observation_id":"d520ba5e-77eb-4a1a-8a6d-42edb7f65d42","resolution":{"observed_at":"2026-08-05T19:46:12.793610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T19:46:12.772827Z","title":"A watermark for large language models","venue":null,"work_id":"296cd603-608e-4250-b88a-70bcf0cd792d","year":2023},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.271319Z"},"links":{"citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:11252565520279e17e437292b8c8e5ea084e1d14f577543ddc5f3cfed260dc28","observation_id":"4de69560-80f4-48d4-acc1-fa3fb05dac70","resolution":{"observed_at":"2026-08-05T19:46:12.778179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T19:46:12.756456Z","title":"Paraphrasing evades detectors of AI -generated text, but retrieval is an effective defense","venue":null,"work_id":"5f54eea6-0198-4e6b-a500-c3c32209ce44","year":2024},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.275823Z"},"links":{"citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:bbb501e0f59bf0b197a271a8f37f1bd6498225c88a7ef5cea6a008855daeed5f","observation_id":"146c12d7-0a35-4af1-826f-b26e0455cf2b","resolution":{"observed_at":"2026-08-05T19:46:12.761214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.15593","last_updated":"2024-06-06T04:53:25Z","snapshot_observed_at":"2026-07-06T15:59:52.247013Z","submitted_at":"2023-07-28T14:52:08Z","title":"Robust Distortion-free Watermarks for Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.15593","snapshot_observed_at":"2026-08-05T19:46:12.279986Z","title":"Robust distortion-free watermarks for language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.279986Z"},"links":{"cited_paper":"/paper/2307.15593","citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:5837a4a531858c7fbbdbffd02d01c731d419f5c3a00a2ed48424e693f1cf6bcd","observation_id":"55dd15ed-7a7e-4986-a198-4fff23c89ea4","resolution":{"observed_at":"2026-08-05T19:46:12.279986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.15124","last_updated":"2025-04-14T22:39:09Z","snapshot_observed_at":"2026-07-06T19:55:37.400185Z","submitted_at":"2024-11-22T18:44:04Z","title":"Tulu 3: Pushing Frontiers in Open Language Model Post-Training","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.15124","snapshot_observed_at":"2026-08-05T19:46:12.284413Z","title":"Tulu 3 : Pushing frontiers in open language model post-training","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.284413Z"},"links":{"cited_paper":"/paper/2411.15124","citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:2a2db56860b765589cb4b511cbc0d81a07c0ade641913220043d09f92f2e0319","observation_id":"b1f10506-9bde-4298-8483-82b5d85aa166","resolution":{"observed_at":"2026-08-05T19:46:12.284413Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.15060","last_updated":"2024-07-03T15:09:52Z","snapshot_observed_at":"2026-08-01T15:14:35.069049Z","submitted_at":"2023-05-24T11:49:52Z","title":"Who Wrote this Code? Watermarking for Code Generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.15060","snapshot_observed_at":"2026-08-05T19:46:12.289688Z","title":"Who wrote this code? watermarking for code generation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.289688Z"},"links":{"cited_paper":"/paper/2305.15060","citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:80b81f37a4622e40e894ddc31900590a8d6af60d9bf64ef9d347acbab5acd3fa","observation_id":"32a6838c-8959-4489-af44-285408d1d073","resolution":{"observed_at":"2026-08-05T19:46:12.289688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.07518","last_updated":"2026-07-10T09:40:44Z","snapshot_observed_at":"2026-08-06T03:25:57.857400Z","submitted_at":"2024-02-12T09:40:18Z","title":"Efficient and Universal Watermarking for LLM-Generated Code Detection","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.07518","snapshot_observed_at":"2026-08-05T19:46:12.293801Z","title":"ACW : Enhancing traceability of AI -generated codes based on watermarking","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.293801Z"},"links":{"cited_paper":"/paper/2402.07518","citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:ca1b65b70bc8692c2f290b132ecf17d0c260230c0031e60d6bfc62fff613b4b6","observation_id":"cbfed843-9b65-486c-8320-b011993c5eb9","resolution":{"observed_at":"2026-08-05T19:46:12.293801Z","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-05T19:46:12.741019Z","title":"Protecting intellectual property of large language model-based code generation APIs via watermarks","venue":null,"work_id":"28aade2d-6d62-49d5-81df-2349e0f344b9","year":2023},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.298409Z"},"links":{"citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:30d3d09aebcc2b2c42951b4725486de0972aa62040be6372ae56ccf7603ae996","observation_id":"356f6fa1-6a4e-4e84-a432-b04375a4b742","resolution":{"observed_at":"2026-08-05T19:46:12.745831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.07913","last_updated":"2024-08-02T14:59:41Z","snapshot_observed_at":"2026-07-06T17:00:53.532910Z","submitted_at":"2023-12-13T06:11:42Z","title":"A Survey of Text Watermarking in the Era of Large Language Models","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.07913","snapshot_observed_at":"2026-08-05T19:46:12.302815Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.302815Z"},"links":{"cited_paper":"/paper/2312.07913","citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:1757e054b6ed3f44b188b9e64a5189546b6a8318571789bc6fccc71cef43cfc2","observation_id":"b778444c-9c88-4a72-b2b9-a6148f60cea5","resolution":{"observed_at":"2026-08-05T19:46:12.302815Z","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-05T19:46:12.725301Z","title":"Xmark : Dynamic software watermarking using collatz conjecture","venue":null,"work_id":"089f8ef3-ad17-4ff9-8f1a-134f1f388773","year":2019},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.307179Z"},"links":{"citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:79f79f3a4c6e0b61b13ccf0df67c3720b33c052fad773a2677f59d8597054182","observation_id":"81287eb7-4456-43e5-85f0-003f078d7d76","resolution":{"observed_at":"2026-08-05T19:46:12.730100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.11305","last_updated":"2023-07-23T04:18:36Z","snapshot_observed_at":"2026-07-06T14:45:00.730733Z","submitted_at":"2023-01-26T18:44:06Z","title":"DetectGPT: Zero-Shot Machine-Generated Text Detection using Probability Curvature","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.11305","snapshot_observed_at":"2026-08-05T19:46:12.311856Z","title":"DetectGPT : Zero-shot machine-generated text detection using probability curvature","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.311856Z"},"links":{"cited_paper":"/paper/2301.11305","citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:3fb7a4d7ea5bc10d28a4ab11af71e23f2a8cd45c439322aedb6a19452330cd6d","observation_id":"2975049e-6065-49c5-84fb-eb6db1d712f3","resolution":{"observed_at":"2026-08-05T19:46:12.311856Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.10036","last_updated":"2023-06-02T06:56:29Z","snapshot_observed_at":"2026-08-04T02:45:32.829332Z","submitted_at":"2023-05-17T08:28:54Z","title":"Are You Copying My Model? Protecting the Copyright of Large Language Models for EaaS via Backdoor Watermark","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.10036","snapshot_observed_at":"2026-08-05T19:46:12.316399Z","title":"Are you copying my model? protecting the copyright of large language models for EaaS via backdoor watermark","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.316399Z"},"links":{"cited_paper":"/paper/2305.10036","citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:86a286835a6a32b972a370cf4573220bd99fed7c6932b90a2e6c7c3b7c13d985","observation_id":"e7a25bfc-197b-4b28-9b9a-f3e31deab79f","resolution":{"observed_at":"2026-08-05T19:46:12.316399Z","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-05T19:46:12.710051Z","title":"Language models are unsupervised multitask learners","venue":null,"work_id":"16e86d06-91f0-4e7a-abea-0cb8cbcda9b9","year":2019},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.321014Z"},"links":{"citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:4a43716c407e4ee737093f6e695aeb073f3f789e6f7b34e281300bf9593fd250","observation_id":"1c345f8b-30ac-4cc9-b959-694e0e10b63f","resolution":{"observed_at":"2026-08-05T19:46:12.714933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08217","last_updated":"2023-09-20T10:56:46Z","snapshot_observed_at":"2026-07-06T15:03:25.644795Z","submitted_at":"2023-03-14T20:20:27Z","title":"An axiomatic approach to default risk and model uncertainty in rating systems","version":3},"cited_work":{"arxiv_id":"2303.08217","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.08217","snapshot_observed_at":"2026-08-05T19:46:12.481316Z","title":"An axiomatic approach to default risk and model uncertainty in rating systems","venue":"q-fin.MF","work_id":"6606cdfe-fcb4-4499-a304-8f71c1fc5767","year":2023},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.325112Z"},"links":{"cited_paper":"/paper/2303.08217","citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:9e97c11afe4bc9a79029f81d5f323fdbacc8cbcc17cb0e98871184a1ebda340c","observation_id":"4a2b3f39-65c2-45f4-89c6-6ec0ee4187c8","resolution":{"observed_at":"2026-08-05T19:46:12.488327Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T19:46:12.692830Z","title":"Reparameterizable subset sampling via continuous relaxations","venue":null,"work_id":"77350cdc-ec69-4088-b5aa-cd8b32bece11","year":2019},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.329814Z"},"links":{"citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:ff64888d290f2b3a5c7f47f0b30404153ddc9224590d3d0155294caebf678b71","observation_id":"b6f3c9c7-ebfd-4d4e-bad3-914030430b4d","resolution":{"observed_at":"2026-08-05T19:46:12.698705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T19:46:12.333988Z","title":"Learning to watermark LLM -generated text via reinforcement learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.333988Z"},"links":{"cited_paper":"/paper/2403.10553","citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:6eb7d513f5833c3792f04a6bb01d3652d992438362f05e4fed927cbc87a3c319","observation_id":"69ddb06c-0b96-428f-9257-46d15bc43762","resolution":{"observed_at":"2026-08-05T19:46:12.333988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.00860","last_updated":"2024-01-02T02:59:52Z","snapshot_observed_at":"2026-07-06T16:13:34.788427Z","submitted_at":"2023-09-02T08:38:21Z","title":"Towards Code Watermarking with Dual-Channel Transformations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.00860","snapshot_observed_at":"2026-08-05T19:46:12.338361Z","title":"Towards code watermarking with dual-channel transformations","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.338361Z"},"links":{"cited_paper":"/paper/2309.00860","citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:880f461b21a8a25ffc7eab48d62ba4143a4aa5728570630de7110f4cb69e6163","observation_id":"acb263b8-7cd9-45d6-8c82-d23818f0928e","resolution":{"observed_at":"2026-08-05T19:46:12.338361Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.18892","last_updated":"2025-08-06T08:42:32Z","snapshot_observed_at":"2026-07-06T20:57:57.039376Z","submitted_at":"2025-03-24T17:06:10Z","title":"SimpleRL-Zoo: Investigating and Taming Zero Reinforcement Learning for Open Base Models in the Wild","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.18892","snapshot_observed_at":"2026-08-05T19:46:12.342641Z","title":"Simplerl-zoo : Investigating and taming zero reinforcement learning for open base models in the wild","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.342641Z"},"links":{"cited_paper":"/paper/2503.18892","citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:f694771ada48d6577a1211831e12924a5f389db4d018560396b66b569e48debd","observation_id":"b6aa7d6f-a85b-493a-965a-352aae1999d8","resolution":{"observed_at":"2026-08-05T19:46:12.342641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.18479","last_updated":"2025-06-12T17:58:20Z","snapshot_observed_at":"2026-08-06T22:39:32.303708Z","submitted_at":"2024-11-27T16:22:33Z","title":"SoK: Watermarking for AI-Generated Content","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.18479","snapshot_observed_at":"2026-08-05T19:46:12.347126Z","title":"SoK : Watermarking for AI -generated content","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.347126Z"},"links":{"cited_paper":"/paper/2411.18479","citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:be73b7713d75392e3f4e5cc6954b4704340425536f3103d94cbd0f388e7a2d9b","observation_id":"85fbae2e-bf6a-4900-8964-d2734082a871","resolution":{"observed_at":"2026-08-05T19:46:12.347126Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.10372","last_updated":"2024-01-08T05:41:51Z","snapshot_observed_at":"2026-07-06T16:48:56.495511Z","submitted_at":"2023-11-17T07:55:16Z","title":"A Survey of Large Language Models for Code: Evolution, Benchmarking, and Future Trends","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.10372","snapshot_observed_at":"2026-08-05T19:46:12.352279Z","title":"A survey of large language models for code: Evolution, benchmarking, and future trends","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-05T19:46:12.352279Z"},"links":{"cited_paper":"/paper/2311.10372","citing_paper":"/paper/2508.11925"},"observation_digest":"sha256:4f665701e6a728ec6406038e3c4cd7f292376402499430b1a5e2f1042bcf6428","observation_id":"dd6835c7-3303-4b0a-859d-e05e37add1d3","resolution":{"observed_at":"2026-08-05T19:46:12.352279Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.11925","last_updated":"2026-05-25T07:42:23Z","latest_version":3,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-05T19:46:01.922764Z","submitted_at":"2025-08-16T06:11:29Z","title":"Optimizing Token Choice for Code Watermarking: An RL Approach"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":16,"verified_exact":0,"verified_fuzzy":10},"total_outbound_references":27},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2508.11925."}