{"as_of":"2026-08-08T11:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9c7474b8e28f84635df23b19f54854fa8ee16a81abf062fc4532ee7b27bfb970","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:45:39.717771Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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-06-26T16:44:20.076739Z","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.431141Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"cited_work":{"arxiv_id":"2506.20926","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.20926","snapshot_observed_at":"2026-07-04T04:49:35.431141Z","title":"arXiv preprint arXiv:2506.20926 , year=","venue":null,"work_id":"6be6d918-f147-43da-9924-a2a62c89a50f","year":null},"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":49,"source":"arxiv_source","source_observed_at":"2026-06-26T16:44:20.076739Z"},"links":{"cited_paper":"/paper/2506.20926","citing_paper":"/paper/2606.20835"},"observation_digest":"sha256:b78f7411cb33689dedc79036e688df308a4aa9045cde63cfb4138c936eea1f83","observation_id":"9058afb4-2b94-4494-b8a8-bf218cae2385","resolution":{"observed_at":"2026-07-04T04:49:35.433123Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2506.20926/citation-record","integrity":"/paper/2506.20926/integrity","json":"/paper/2506.20926/citation-record.json","paper":"/paper/2506.20926"},"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-06T22:45:42.547178Z","title":"Esale: Enhancing code-summary alignment learning for source code summarization,","venue":null,"work_id":"3361e961-a4b8-46cf-89ee-9c80edba32da","year":2024},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:35.021716Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:7004482f1c75b413c09e39d8c2f441118547bc626fa4c5d7c5031324ab9cb0fe","observation_id":"1f8c7300-4fa7-48cd-b0fe-fd9391f9429a","resolution":{"observed_at":"2026-08-06T22:45:42.609656Z","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-06T22:45:42.451171Z","title":"An extractive-and-abstractive framework for source code summarization,","venue":null,"work_id":"3c002637-e099-4ca3-af78-1f2bb8346181","year":2024},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:35.118393Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:0d59b4be6f0a0a17f60cb2d33e39cc69bb9737aa46710a66644784039df47f70","observation_id":"6929d4f3-dd24-4401-8eb4-c2df4572e5df","resolution":{"observed_at":"2026-08-06T22:45:42.482007Z","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-06T22:45:42.358281Z","title":"On the evaluation of neural code summarization,","venue":null,"work_id":"06acf1bd-543d-4af7-be32-625d87298739","year":2022},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:35.255601Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:6d31c7938d07ad830a149af2cb19a6579314f81e6e10a4270353cc4e5f5447e1","observation_id":"56403d34-2989-4be9-869d-92a03eb1ef49","resolution":{"observed_at":"2026-08-06T22:45:42.377769Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:45:35.393371Z","title":"Self-collaboration code generation via chatgpt,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:35.393371Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:89dde14c3dd47a37ada76f4e262b08c1c661545ae681de702ef366879c05ebf5","observation_id":"ce73fa64-1e4a-4d06-b795-11bf3f56e1e9","resolution":{"observed_at":"2026-08-06T22:45:35.393371Z","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-06T22:45:42.239534Z","title":"In-ide code generation from natural language: Promise and challenges,","venue":null,"work_id":"b4b35d22-8dbe-4f5d-beaa-f30b076154a9","year":2022},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:35.480023Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:1f8d7fd9f83988e91a31e7d0911be1ecb2584147da971645677bc6662b79ee3d","observation_id":"8bdf6088-1d4b-4bb4-93de-76a20f4cf48f","resolution":{"observed_at":"2026-08-06T22:45:42.294598Z","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-06T22:45:42.172954Z","title":"Practical black-box attacks against machine learning,","venue":null,"work_id":"73fc1d67-b5e7-4a9c-ace8-17c8a162e8de","year":2017},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:35.592705Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:3a1b5db021e75841df93c5cb5610ec18f7ca30d3ed80f1985940a1ffb183aabb","observation_id":"2ccf1701-d119-4e6a-ba4f-24cbea17f151","resolution":{"observed_at":"2026-08-06T22:45:42.210598Z","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-06T22:45:42.061658Z","title":"Data-free model extraction,","venue":null,"work_id":"3f55522e-f002-4542-b783-c0986bb18ceb","year":2021},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:35.734051Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:eba6651546ec76e2da029534d0ece3b625c03b56ffa9422d202c99448d9f975d","observation_id":"a308efc0-05d0-4695-9d9d-3a01e394527c","resolution":{"observed_at":"2026-08-06T22:45:42.109470Z","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-06T22:45:41.929850Z","title":"Codemark: Imperceptible wa- termarking for code datasets against neural code completion models,","venue":null,"work_id":"a7eae1d0-fdaa-4869-aa49-cb69607bbe5f","year":2023},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:35.852430Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:d2dadcf7422b9bcbab2145dafb5d932a20b75dcd5137361dc9fb7327c0519f08","observation_id":"26b72045-06ea-4ff4-ba3f-e77073faae26","resolution":{"observed_at":"2026-08-06T22:45:42.006491Z","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-06T22:45:41.820223Z","title":"Coprotector: Protect open- source code against unauthorized training usage with data poisoning,","venue":null,"work_id":"86cfcdf5-86c7-4a29-a102-c910121ca65a","year":2022},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:35.980147Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:b2154ba0ac5fc483f22efac1b5408dd986907164e1e4f09254b6ecbfa8fe5108","observation_id":"45ffa894-ddc4-411b-8fa3-2755537e9baf","resolution":{"observed_at":"2026-08-06T22:45:41.888712Z","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-06T22:45:41.724527Z","title":"Beyond dataset watermarking: Model-level copyright protection for code summarization models,","venue":null,"work_id":"2226ef10-7472-4110-abd6-1282bac7ec71","year":2025},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:36.091803Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:25f9b5293ad8d886578548a8ddde53df906933f2684d8068811e6ef8816b1bbc","observation_id":"e61688b3-125c-4862-80db-065438ca790e","resolution":{"observed_at":"2026-08-06T22:45:41.752761Z","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":"1909.09436","last_updated":"2020-06-08T09:09:28Z","snapshot_observed_at":"2026-08-06T10:54:14.530969Z","submitted_at":"2019-09-20T11:52:45Z","title":"CodeSearchNet Challenge: Evaluating the State of Semantic Code Search","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.09436","snapshot_observed_at":"2026-08-06T22:45:36.181770Z","title":"Codesearchnet challenge: Evaluating the state of semantic code search,","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:36.181770Z"},"links":{"cited_paper":"/paper/1909.09436","citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:89c428994f56cb04061eda462bf7b5d1c465d8a5d313fd255f15d03df73f1716","observation_id":"fa6140d2-40a0-4d56-8d62-912e8b48fcf2","resolution":{"observed_at":"2026-08-06T22:45:36.181770Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.04664","last_updated":"2021-03-16T08:28:37Z","snapshot_observed_at":"2026-07-06T10:39:42.676631Z","submitted_at":"2021-02-09T06:16:25Z","title":"CodeXGLUE: A Machine Learning Benchmark Dataset for Code Understanding and Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.04664","snapshot_observed_at":"2026-08-06T22:45:36.292211Z","title":"Codexglue: A machine learning benchmark dataset for code understanding and generation,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:36.292211Z"},"links":{"cited_paper":"/paper/2102.04664","citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:891e4205114e90841825fc877e8862ea5e1bc3d438e521548410ecf00e59ddbd","observation_id":"3f457cfb-9ce4-45f5-b128-69bc3fbc4f5f","resolution":{"observed_at":"2026-08-06T22:45:36.292211Z","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-06T22:45:36.408806Z","title":"Competition- level code generation with alphacode,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:36.408806Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:8911c484b58384d3c1877b781e8ee43358af38e9481661bfd055023c856d2c05","observation_id":"2ae8fac7-7fb3-48a2-9bb5-915ffac47f6c","resolution":{"observed_at":"2026-08-06T22:45:36.408806Z","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-06T22:45:36.559458Z","title":"Expectation vs. experi- ence: Evaluating the usability of code generation tools powered by large language models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:36.559458Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:68a75b5dcd84f8d5d1994004bd1d8303ea3296fe68958e941a1b5e261430d2b8","observation_id":"c2972a0e-b50c-4fbf-afb7-3c24b554a77c","resolution":{"observed_at":"2026-08-06T22:45:36.559458Z","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-06T22:45:41.593787Z","title":"A transformer- based approach for source code summarization,","venue":null,"work_id":"53e780c8-2f9d-4877-bb74-fda4858d03d4","year":2020},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:36.676607Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:2e17dd97075ee86eaabb4f507e394e38df8ab0c359adb9cd4bcd839d4a2aa111","observation_id":"e1813ba4-e246-4c44-8baf-a69c04728cd1","resolution":{"observed_at":"2026-08-06T22:45:41.652614Z","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-06T22:45:41.487560Z","title":"On the effectiveness of large language models in statement-level code summarization,","venue":null,"work_id":"bf6f7ef1-1f18-456f-944d-4de4393a3c76","year":2024},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:36.781320Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:08fcd8ff1e12af49def43044bc7f1f2e4a43cc695c15c4760581c5c1da3d2a99","observation_id":"5ddf12b5-d443-43f5-889e-ecf9319a657f","resolution":{"observed_at":"2026-08-06T22:45:41.552331Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:45:36.915727Z","title":"Deep code comment generation with hybrid lexical and syntactical information,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:36.915727Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:bbe31e23bcd929aa711ff3e47173547e4a40806035916374ba4a2b78e3dec35f","observation_id":"61060620-cdfe-4626-acce-3b8ad6ae689a","resolution":{"observed_at":"2026-08-06T22:45:36.915727Z","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-06T22:45:41.379332Z","title":"Code to comment “translation","venue":null,"work_id":"4e421daf-3568-4b4f-9204-b4bc044bea76","year":2020},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:37.033904Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:59c3b7d04aee04e92286f095addc63fbb539326e636e710197df622b131c2d41","observation_id":"a2e1f1ae-cf25-4921-a3a9-2348c127d7da","resolution":{"observed_at":"2026-08-06T22:45:41.413475Z","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":"2002.08155","last_updated":"2020-09-18T15:38:12Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-02-19T13:09:07Z","title":"CodeBERT: A Pre-Trained Model for Programming and Natural Languages","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.08155","snapshot_observed_at":"2026-08-06T22:45:37.172154Z","title":"Codebert: A pre-trained model for programming and natural languages,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:37.172154Z"},"links":{"cited_paper":"/paper/2002.08155","citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:1dc3c35692b823aa1027449c26aa36816c54902ef58110127e47a1451e3f9aeb","observation_id":"2e9e8773-7aa2-4fa4-a69e-53f71fb37451","resolution":{"observed_at":"2026-08-06T22:45:37.172154Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.08366","last_updated":"2021-09-13T05:48:51Z","snapshot_observed_at":"2026-07-06T09:56:32.308108Z","submitted_at":"2020-09-17T15:25:56Z","title":"GraphCodeBERT: Pre-training Code Representations with Data Flow","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.08366","snapshot_observed_at":"2026-08-06T22:45:37.277893Z","title":"Graphcodebert: Pre-training code repre- sentations with data flow,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:37.277893Z"},"links":{"cited_paper":"/paper/2009.08366","citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:b37c86dba2cc0852545a8a439e61eb76fb94a6af9836c4ed1bbcaa690c266e2a","observation_id":"dd2d27a0-9dc0-4b72-82f9-7ee7c9936ab6","resolution":{"observed_at":"2026-08-06T22:45:37.277893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.00859","last_updated":"2021-09-02T12:21:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-09-02T12:21:06Z","title":"CodeT5: Identifier-aware Unified Pre-trained Encoder-Decoder Models for Code Understanding and Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.00859","snapshot_observed_at":"2026-08-06T22:45:37.435530Z","title":"Codet5: Identifier-aware unified pre-trained encoder-decoder models for code understanding and generation,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:37.435530Z"},"links":{"cited_paper":"/paper/2109.00859","citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:a796e4545bf9a5173c8451c1c08a84f930e3de3d7c8c025e6f17684644f4a224","observation_id":"692cb672-daf1-4c58-a50a-891ee29d7274","resolution":{"observed_at":"2026-08-06T22:45:37.435530Z","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-06T22:45:41.306528Z","title":"Big code != big vocabulary: Open-vocabulary models for source code,","venue":null,"work_id":"c03e95c5-a377-42c0-b1e0-2140f74e7ce5","year":2020},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:37.582868Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:923189d3a0059e617e5a3b7fbbc75831de91a476748fab3c924c2d0cfdb2d532","observation_id":"3c254f15-bf1a-4699-a0fb-0e1168033d9e","resolution":{"observed_at":"2026-08-06T22:45:41.347520Z","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-06T22:45:41.186069Z","title":"Untargeted backdoor watermark: Towards harmless and stealthy dataset copy- right protection,","venue":null,"work_id":"b9bf436d-83be-43db-85a9-d57d341f11ee","year":2022},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:37.763265Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:4fde054e0b8ff08b41e1379ddd5a61d2f097f04315d23bd397996779d3a0b6c2","observation_id":"9a19e913-4f23-4435-995d-b3b3fb139122","resolution":{"observed_at":"2026-08-06T22:45:41.233789Z","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-06T22:45:41.045616Z","title":"Black- box dataset ownership verification via backdoor watermarking,","venue":null,"work_id":"4c7bcfe0-21bb-4bf6-a117-c019bdd2a216","year":2023},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:37.864347Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:a6ef54706af5b36ddec7cfbe3a92deeea65ca2fce287b2c40d26b47974491873","observation_id":"365ed968-ba35-4fb3-9c02-7b721e6869e9","resolution":{"observed_at":"2026-08-06T22:45:41.105762Z","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-06T22:45:40.887594Z","title":"Unambiguous and high-fidelity backdoor watermarking for deep neural networks,","venue":null,"work_id":"84208659-bcd8-4e1b-93f4-2f5496636cf5","year":2023},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:38.009871Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:a98dc18328e67dbc7e7b50acbcd3afb5266cd04984b29625ef97dbebbf8d1483","observation_id":"c6ffe9a3-19ee-4e05-8119-7d56dd8ca2c7","resolution":{"observed_at":"2026-08-06T22:45:40.964058Z","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-06T22:45:40.784681Z","title":"Neural network laundering: Removing black-box backdoor watermarks from deep neural networks,","venue":null,"work_id":"f6720705-7c77-4a8a-9af1-eaca981135f1","year":2021},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:38.153324Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:c16635e93897851d952d2538b4dcf0c1e30d0b11c489fc5c8580af36d58c066f","observation_id":"edf54663-ea1f-4455-b05f-a1ebdd782625","resolution":{"observed_at":"2026-08-06T22:45:40.842298Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:45:38.263146Z","title":"Bleu: a method for automatic evaluation of machine translation,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:38.263146Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:e8179d10b7fb18c86b967508ea085ba2e1391a38410501934f147ca6eaa2ccf9","observation_id":"82beb93f-da18-4c92-88a5-a40126107343","resolution":{"observed_at":"2026-08-06T22:45:38.263146Z","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-06T22:45:40.651358Z","title":"Squad: 100,000+ questions for machine comprehension of text,","venue":null,"work_id":"2c47d1b0-e2c2-4700-bf78-51fc1f0e3aa7","year":2016},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:38.376521Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:564c019ee25e99baa274dd1f4751638ff020a2aeef3b0d92548cdb889b723179","observation_id":"1b2175ab-a425-405c-b3a2-7f75fdae1037","resolution":{"observed_at":"2026-08-06T22:45:40.691291Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:45:38.512153Z","title":"Codegeex: A pre-trained model for code generation with multilingual benchmarking on humaneval-x,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:38.512153Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:4994750bfd379c44b3ca41fa640546d30a87ff5c3da5df69d4603a359673c23c","observation_id":"10fa4d6f-59d5-4564-ba92-61505e61e7bf","resolution":{"observed_at":"2026-08-06T22:45:38.512153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.10297","last_updated":"2020-09-27T04:07:11Z","snapshot_observed_at":"2026-08-01T07:33:26.380394Z","submitted_at":"2020-09-22T03:10:49Z","title":"CodeBLEU: a Method for Automatic Evaluation of Code Synthesis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.10297","snapshot_observed_at":"2026-08-06T22:45:38.655544Z","title":"Codebleu: a method for automatic evaluation of code synthesis,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:38.655544Z"},"links":{"cited_paper":"/paper/2009.10297","citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:fbe0c2e5a9c9fc4bf9f5f7e57cb928b09a1f5de6e477431c0def670ebb3dedd4","observation_id":"1e163aa7-6086-4c11-8984-e6b69b069773","resolution":{"observed_at":"2026-08-06T22:45:38.655544Z","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-06T22:45:38.800407Z","title":"Stealthy backdoor attack for code models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:38.800407Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:6a28d5ae143d889cda8eea85a514b4b848797863899f3bd439b3936dc7766d52","observation_id":"512c0835-367e-4324-a4e7-800cffd8ab0b","resolution":{"observed_at":"2026-08-06T22:45:38.800407Z","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-06T22:45:40.522865Z","title":"Onion: A simple and effective defense against textual backdoor attacks,","venue":null,"work_id":"d0c0d06e-6c24-4ab5-8b19-0bd613111230","year":2021},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:38.932663Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:1d5899c0991b92706d1ad5d20b9b116ac53b724c4caf8f6c54cdbb2926abf5da","observation_id":"e8ab4955-210c-4098-b9db-7e143c0e146c","resolution":{"observed_at":"2026-08-06T22:45:40.585029Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:45:39.078573Z","title":"Spectral signatures in backdoor attacks,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:39.078573Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:c4f288ec2275085e4d7092be0b292daefddfea0a89c3e575ddeba82d6b329d56","observation_id":"9a242bf1-bf0b-49c4-9917-de57757c7136","resolution":{"observed_at":"2026-08-06T22:45:39.078573Z","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-06T22:45:40.382137Z","title":"Bppattack: Stealthy and efficient tro- jan attacks against deep neural networks via image quantization and contrastive adversarial learning,","venue":null,"work_id":"6cbccf93-06a6-40f9-84aa-be2f63905716","year":2022},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:39.217214Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:2db7c0a50ecbd6059a6e690d143cc317a675ba061d37ed8ace1c4cd7ea756315","observation_id":"3903475e-f948-47bb-8d2e-10d985125c79","resolution":{"observed_at":"2026-08-06T22:45:40.413064Z","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-06T22:45:40.222998Z","title":"Invisible backdoor attack with sample-specific triggers,","venue":null,"work_id":"650a5c66-3ad2-4507-998c-319d255be228","year":2021},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:39.343981Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:a00878af72f112caad92a2ea000bb96cdf57f6c95040c37c36def9be9a05ca60","observation_id":"b4b0b5bc-9079-45c8-bb19-2c978d248a99","resolution":{"observed_at":"2026-08-06T22:45:40.311434Z","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-06T22:45:40.135217Z","title":"Advdoor: adversarial backdoor attack of deep learning system,","venue":null,"work_id":"e32872c6-c871-449f-bb66-65704a39653c","year":2021},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:39.448009Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:ceed3b3096d17e72b49350c4bd4b4c48667df0f2bb69379e142ab21acd9bbfbc","observation_id":"9a740cc2-7894-4817-85a5-c079089b2096","resolution":{"observed_at":"2026-08-06T22:45:40.174598Z","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-06T22:45:40.035084Z","title":"Blind backdoors in deep learning models,","venue":null,"work_id":"fb0a83c3-4716-4112-a906-fffde51c5190","year":2021},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:39.528314Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:5796950e27ee17d03b02e56f01ad50ea10350d57d2fcbc2ccaa2ee17fb4a63e9","observation_id":"13d5c3b1-6a9b-4750-b302-7282bd9970f9","resolution":{"observed_at":"2026-08-06T22:45:40.089002Z","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-06T22:45:39.930636Z","title":"You autocom- plete me: Poisoning vulnerabilities in neural code completion,","venue":null,"work_id":"186565fd-e236-44ed-b581-f2a3edae1cc6","year":2021},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:39.614776Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:47d4c4b50beeab5ef242affed6f821a1f235d59d81955a16b10a488fa4b44e1c","observation_id":"8e135aa9-5592-469a-8199-eec2f32098f3","resolution":{"observed_at":"2026-08-06T22:45:39.983536Z","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-06T22:45:39.852467Z","title":"Backdoors in neural models of source code,","venue":null,"work_id":"8835f761-f88c-4def-b083-3876bff9ab51","year":2022},"citing_paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T22:45:39.717771Z"},"links":{"citing_paper":"/paper/2506.20926"},"observation_digest":"sha256:5adf44af7eb352f10ad1f9735ce906d641a85c9cb3627e9ebad9f7bda58dcc9b","observation_id":"c109bbd6-b1a6-492e-a75d-d45beec280c8","resolution":{"observed_at":"2026-08-06T22:45:39.891149Z","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"}}],"paper":{"arxiv_id":"2506.20926","last_updated":"2025-06-29T13:42:05Z","latest_version":2,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-06T22:35:49.741794Z","submitted_at":"2025-06-26T01:14:35Z","title":"Towards Generalized and Stealthy Watermarking for Generative Code Models"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":0,"verified_fuzzy":25},"total_outbound_references":39},"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 39 of 39 outbound references and 1 inbound Pith citation observation for arXiv:2506.20926."}