{"as_of":"2026-08-08T10:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5fe7e303967a1490ec93bf261c98d0c2652437e1064dfb3c3150223d0757e78e","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T23:54:51.945568Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T04:49:35.407252Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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-06T23:54:51.945568Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17323","last_updated":"2025-06-18T19:49:41Z","snapshot_observed_at":"2026-08-07T03:59:50.891767Z","submitted_at":"2025-06-18T19:49:41Z","title":"I Know Which LLM Wrote Your Code Last Summer: LLM generated Code Stylometry for Authorship Attribution","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T23:54:51.945568Z"},"links":{"cited_paper":"/paper/2402.07518","citing_paper":"/paper/2506.17323"},"observation_digest":"sha256:17c14ba300e2a2c0c8c8c99d4bed01c6574e47e7a8c09accb9a61b2c8d30a30f","observation_id":"bbbd5864-7627-4c9b-84d3-365af37785bb","resolution":{"observed_at":"2026-08-06T23:54:51.945568Z","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":{"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":"2402.07518","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.07518","snapshot_observed_at":"2026-07-13T01:17:36.335950Z","title":"Efficient and universal watermarking for llm-generated code detection","venue":null,"work_id":"a902b35d-ef7a-4241-b21b-cd5a49075726","year":2025},"citing_paper":{"arxiv_id":"2601.02602","last_updated":"2026-05-07T20:38:51Z","snapshot_observed_at":"2026-07-31T23:54:35.750688Z","submitted_at":"2026-01-05T23:35:39Z","title":"SWaRL: Safeguard Code Watermarking via Reinforcement Learning","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-16T17:16:48.934639Z"},"links":{"cited_paper":"/paper/2402.07518","citing_paper":"/paper/2601.02602"},"observation_digest":"sha256:14fa268f418ea681b5ab588420000b5eb907280bc77c7d4aebfda54d3a1ad628","observation_id":"fae8e14d-3b1f-48b3-bfa2-e728e99027ab","resolution":{"observed_at":"2026-07-13T01:17:36.335950Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"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":"2402.07518","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.07518","snapshot_observed_at":"2026-07-13T01:17:36.335950Z","title":"Efficient and universal watermarking for llm-generated code detection","venue":null,"work_id":"a902b35d-ef7a-4241-b21b-cd5a49075726","year":2025},"citing_paper":{"arxiv_id":"2604.10611","last_updated":"2026-04-20T06:32:47Z","snapshot_observed_at":"2026-08-06T08:12:53.416121Z","submitted_at":"2026-04-12T12:32:38Z","title":"DuCodeMark: Dual-Purpose Code Dataset Watermarking via Style-Aware Watermark-Poison Design","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T15:51:05.379075Z"},"links":{"cited_paper":"/paper/2402.07518","citing_paper":"/paper/2604.10611"},"observation_digest":"sha256:24e76f7e4332d4a050f293cf3d946494623caa3c30d9bc4347873c14c41cf3b3","observation_id":"58f335d1-887e-4b7e-bd42-453e72ad7edc","resolution":{"observed_at":"2026-07-13T01:17:36.335950Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"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-07-12T22:29:24.878655Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2604.10615","last_updated":"2026-06-10T13:39:24Z","snapshot_observed_at":"2026-08-06T22:55:51.670960Z","submitted_at":"2026-04-12T12:42:30Z","title":"Unified Communication Compression Beyond Global Error Bounds for Distributed Nonconvex Optimization","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-12T22:29:24.878655Z"},"links":{"cited_paper":"/paper/2402.07518","citing_paper":"/paper/2604.10615"},"observation_digest":"sha256:391365aebff4f5f9d965c6116fb0acffdbb57189a608d64251126d05885c63bc","observation_id":"fc19573e-d937-4cff-a009-41101bb25282","resolution":{"observed_at":"2026-07-12T22:29:24.878655Z","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":"2402.07518","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.07518","snapshot_observed_at":"2026-07-13T01:17:36.335950Z","title":"Efficient and universal watermarking for llm-generated code detection","venue":null,"work_id":"a902b35d-ef7a-4241-b21b-cd5a49075726","year":2025},"citing_paper":{"arxiv_id":"2604.16001","last_updated":"2026-04-17T12:25:41Z","snapshot_observed_at":"2026-07-06T23:03:26.308324Z","submitted_at":"2026-04-17T12:25:41Z","title":"MATRIX: Multi-Layer Code Watermarking via Dual-Channel Constrained Parity-Check Encoding","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-10T08:23:04.201981Z"},"links":{"cited_paper":"/paper/2402.07518","citing_paper":"/paper/2604.16001"},"observation_digest":"sha256:20eef0e46f4f0574313c01d2d1195c20a9f172e30221bcb7ca7b487e5dcd542d","observation_id":"704989dd-3d48-493e-a8d7-cf6ea35fa30a","resolution":{"observed_at":"2026-07-13T01:17:36.335950Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"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":"2402.07518","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.07518","snapshot_observed_at":"2026-07-13T01:17:36.335950Z","title":"Efficient and universal watermarking for llm-generated code detection","venue":null,"work_id":"a902b35d-ef7a-4241-b21b-cd5a49075726","year":2025},"citing_paper":{"arxiv_id":"2606.20835","last_updated":"2026-06-18T18:21:38Z","snapshot_observed_at":"2026-08-06T15:30:59.966996Z","submitted_at":"2026-06-18T18:21:38Z","title":"PromptMark: A Prompt-Guided Iterative-Feedback Framework for Source Code Watermarking","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-26T16:44:20.076739Z"},"links":{"cited_paper":"/paper/2402.07518","citing_paper":"/paper/2606.20835"},"observation_digest":"sha256:8a562cb0a4c72bcee0fae92ff699ab00abe1592032beb7ff80d08435319bc58c","observation_id":"4d5db91e-495b-4f58-a728-afdd6c3eaf51","resolution":{"observed_at":"2026-07-13T01:17:36.335950Z","resolver_source":"arxiv_id","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"}}],"links":{"evidence":"/evidence","html":"/paper/2402.07518/citation-record","integrity":"/paper/2402.07518/integrity","json":"/paper/2402.07518/citation-record.json","paper":"/paper/2402.07518"},"outbound":[],"paper":{"arxiv_id":"2402.07518","last_updated":"2026-07-10T09:40:44Z","latest_version":5,"primary_category":"cs.CR","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-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 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2402.07518."}