{"as_of":"2026-08-09T04:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:266323fb14d10144ff0fe5d28c7f5d619a7618bafd867bcfd64670d622a4ee99","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T03:45:30.788670Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"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/2602.07120/citation-record","integrity":"/paper/2602.07120/integrity","json":"/paper/2602.07120/citation-record.json","paper":"/paper/2602.07120"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:45:30.784948Z","title":"Give me the first chapter of Harry Potterin Spanish","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2602.07120","last_updated":"2026-05-25T23:02:20Z","snapshot_observed_at":"2026-08-03T03:45:26.392122Z","submitted_at":"2026-02-06T19:00:14Z","title":"Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T03:45:30.784948Z"},"links":{"citing_paper":"/paper/2602.07120"},"observation_digest":"sha256:d41a64fa778c43a56904073928b8ebb2e88b89ed1e2bc829bde756bcc3e580aa","observation_id":"cba25f33-ab4f-4a8c-b8b7-8c3bcd41d703","resolution":{"observed_at":"2026-08-03T03:45:30.784948Z","resolver_source":null,"status":"malformed_identifier"},"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-03T03:45:30.735532Z","title":"Meeus, M., Jain, S., Rei, M., and de Montjoye, Y .-A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.07120","last_updated":"2026-05-25T23:02:20Z","snapshot_observed_at":"2026-08-03T03:45:26.392122Z","submitted_at":"2026-02-06T19:00:14Z","title":"Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T03:45:30.735532Z"},"links":{"citing_paper":"/paper/2602.07120"},"observation_digest":"sha256:6180421487ec2d8dff0c61eb364b8466d014d185005f77c1d8adccbec6bedb5e","observation_id":"37e2e422-c5d8-4ddf-a1f8-436f0c9f7085","resolution":{"observed_at":"2026-08-03T03:45:30.735532Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15010","last_updated":"2025-06-12T10:12:38Z","snapshot_observed_at":"2026-08-08T00:48:28.063583Z","submitted_at":"2025-02-20T20:02:56Z","title":"Obliviate: Efficient Unmemorization for Protecting Intellectual Property in Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.15010","snapshot_observed_at":"2026-08-03T03:45:30.751087Z","title":"Qwen Team","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.07120","last_updated":"2026-05-25T23:02:20Z","snapshot_observed_at":"2026-08-03T03:45:26.392122Z","submitted_at":"2026-02-06T19:00:14Z","title":"Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T03:45:30.751087Z"},"links":{"cited_paper":"/paper/2502.15010","citing_paper":"/paper/2602.07120"},"observation_digest":"sha256:b1a0fe7b61ddc9ddf594c341a2e9fae7a8c37fb1f1e147fc204a226cc5abb7f5","observation_id":"44522f87-7492-49a7-aabf-461afa0c0394","resolution":{"observed_at":"2026-08-03T03:45:30.751087Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.10870","last_updated":"2023-07-21T17:37:26Z","snapshot_observed_at":"2026-07-06T14:54:15.390552Z","submitted_at":"2023-02-21T18:34:51Z","title":"On Provable Copyright Protection for Generative Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.10870","snapshot_observed_at":"2026-08-03T03:45:30.754889Z","title":"Song, Y ., Kim, Y ., and Iyyer, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.07120","last_updated":"2026-05-25T23:02:20Z","snapshot_observed_at":"2026-08-03T03:45:26.392122Z","submitted_at":"2026-02-06T19:00:14Z","title":"Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T03:45:30.754889Z"},"links":{"cited_paper":"/paper/2302.10870","citing_paper":"/paper/2602.07120"},"observation_digest":"sha256:40f335c66be79eab705da784ca6957be2ac158a21a92eb425a5797fa3b3ba1ee","observation_id":"b464bcab-f404-44cb-8403-166a11f3d9a1","resolution":{"observed_at":"2026-08-03T03:45:30.754889Z","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-03T03:45:30.758793Z","title":"Yao, Y ., Xu, X., and YangLiu","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.07120","last_updated":"2026-05-25T23:02:20Z","snapshot_observed_at":"2026-08-03T03:45:26.392122Z","submitted_at":"2026-02-06T19:00:14Z","title":"Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T03:45:30.758793Z"},"links":{"citing_paper":"/paper/2602.07120"},"observation_digest":"sha256:2eb3ed197be8293d5491db25c2f60188d1690395574bdb8d89e662e9879f56b1","observation_id":"51b7dfdc-d177-46d5-a1bb-03c1b6d42072","resolution":{"observed_at":"2026-08-03T03:45:30.758793Z","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-03T03:45:30.762492Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.07120","last_updated":"2026-05-25T23:02:20Z","snapshot_observed_at":"2026-08-03T03:45:26.392122Z","submitted_at":"2026-02-06T19:00:14Z","title":"Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T03:45:30.762492Z"},"links":{"citing_paper":"/paper/2602.07120"},"observation_digest":"sha256:62c65ce7212dce635000c2ff55e0cce62445d186cea9b5e443254b55cabfcbb4","observation_id":"6da7deb8-ff2c-4bc0-943a-865a9bdb4aca","resolution":{"observed_at":"2026-08-03T03:45:30.762492Z","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-03T03:45:30.769764Z","title":"expert” model by downweighting undesirable charac- teristics from an “amateur","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.07120","last_updated":"2026-05-25T23:02:20Z","snapshot_observed_at":"2026-08-03T03:45:26.392122Z","submitted_at":"2026-02-06T19:00:14Z","title":"Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T03:45:30.769764Z"},"links":{"citing_paper":"/paper/2602.07120"},"observation_digest":"sha256:80722f95e221f0f324907a0b64656af55ba9e5c8579107d4fb7595a454756346","observation_id":"47ff12bd-5358-4c84-a7fd-b1635de2ffd3","resolution":{"observed_at":"2026-08-03T03:45:30.769764Z","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-03T03:45:30.777627Z","title":"the”, “ to","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.07120","last_updated":"2026-05-25T23:02:20Z","snapshot_observed_at":"2026-08-03T03:45:26.392122Z","submitted_at":"2026-02-06T19:00:14Z","title":"Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T03:45:30.777627Z"},"links":{"citing_paper":"/paper/2602.07120"},"observation_digest":"sha256:4c1bd8944286c39c7a19be5c9b3fc5602cfe471278fab09f2d46876f22552a5d","observation_id":"f1e31174-aac7-4bef-8888-0c8fd8a9e293","resolution":{"observed_at":"2026-08-03T03:45:30.777627Z","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-03T03:45:30.722836Z","title":"findings-naacl.282/","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.07120","last_updated":"2026-05-25T23:02:20Z","snapshot_observed_at":"2026-08-03T03:45:26.392122Z","submitted_at":"2026-02-06T19:00:14Z","title":"Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model","version":2},"reference_index":282,"source":"pdf_text","source_observed_at":"2026-08-03T03:45:30.722836Z"},"links":{"citing_paper":"/paper/2602.07120"},"observation_digest":"sha256:ff4e645ceb54e86ed07446ad8875c00285d31906ddbcd4aaf3153880aa09e0b7","observation_id":"499613e9-3d04-43e9-ab59-ff96ff31ebed","resolution":{"observed_at":"2026-08-03T03:45:30.722836Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.01732","last_updated":"2026-05-15T14:33:53Z","snapshot_observed_at":"2026-08-01T22:05:42.602637Z","submitted_at":"2025-06-02T14:43:15Z","title":"Common Corpus: The Largest Collection of Ethical Data for LLM Pre-Training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.01732","snapshot_observed_at":"2026-08-03T03:45:30.730878Z","title":"emnlp-main.458/","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.07120","last_updated":"2026-05-25T23:02:20Z","snapshot_observed_at":"2026-08-03T03:45:26.392122Z","submitted_at":"2026-02-06T19:00:14Z","title":"Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model","version":2},"reference_index":458,"source":"pdf_text","source_observed_at":"2026-08-03T03:45:30.730878Z"},"links":{"cited_paper":"/paper/2506.01732","citing_paper":"/paper/2602.07120"},"observation_digest":"sha256:6c7c93d893f37bc27021773bd1721a152ed04d445c6011be308c57b04bea27f8","observation_id":"46628f50-7c1f-4e71-af6e-bbc6db719f19","resolution":{"observed_at":"2026-08-03T03:45:30.730878Z","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-03T03:45:30.739328Z","title":"emnlp-main.741/","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.07120","last_updated":"2026-05-25T23:02:20Z","snapshot_observed_at":"2026-08-03T03:45:26.392122Z","submitted_at":"2026-02-06T19:00:14Z","title":"Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model","version":2},"reference_index":741,"source":"pdf_text","source_observed_at":"2026-08-03T03:45:30.739328Z"},"links":{"citing_paper":"/paper/2602.07120"},"observation_digest":"sha256:2290a20043230c440c2e715bc44f4ff36176afeae0bd7caabeac05b187b793ed","observation_id":"e4483521-5e2f-4988-a9cf-567f177df476","resolution":{"observed_at":"2026-08-03T03:45:30.739328Z","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-03T03:45:30.788670Z","title":"Which way do you reckon Zaphod?","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2602.07120","last_updated":"2026-05-25T23:02:20Z","snapshot_observed_at":"2026-08-03T03:45:26.392122Z","submitted_at":"2026-02-06T19:00:14Z","title":"Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model","version":2},"reference_index":800,"source":"pdf_text","source_observed_at":"2026-08-03T03:45:30.788670Z"},"links":{"citing_paper":"/paper/2602.07120"},"observation_digest":"sha256:e4b8e88ba30b3fcc3308f60c45402f1accb7302ddac4330bdff93f0aa282045b","observation_id":"478db468-99c3-42ad-91d7-441f4d53742c","resolution":{"observed_at":"2026-08-03T03:45:30.788670Z","resolver_source":null,"status":"malformed_identifier"},"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-03T03:45:30.766293Z","title":"Zhang, R., Lin, L., Bai, Y ., and Mei, S","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.07120","last_updated":"2026-05-25T23:02:20Z","snapshot_observed_at":"2026-08-03T03:45:26.392122Z","submitted_at":"2026-02-06T19:00:14Z","title":"Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model","version":2},"reference_index":1784,"source":"pdf_text","source_observed_at":"2026-08-03T03:45:30.766293Z"},"links":{"citing_paper":"/paper/2602.07120"},"observation_digest":"sha256:62b5fd5b74c26cac47adf0cb2de7971668e731cac833c7107fb19c7c6ada238b","observation_id":"8af5cde4-017b-4900-a843-fb7920f5e9ad","resolution":{"observed_at":"2026-08-03T03:45:30.766293Z","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-03T03:45:30.717072Z","title":"Carlini, N., Tram`er, F., Wallace, E., Jagielski, M., Herbert- V oss, A., Lee, K., Roberts, A., Brown, T., Song, D., Erlingsson, ´U., Oprea, A., and Raffel, C","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2602.07120","last_updated":"2026-05-25T23:02:20Z","snapshot_observed_at":"2026-08-03T03:45:26.392122Z","submitted_at":"2026-02-06T19:00:14Z","title":"Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model","version":2},"reference_index":1997,"source":"pdf_text","source_observed_at":"2026-08-03T03:45:30.717072Z"},"links":{"citing_paper":"/paper/2602.07120"},"observation_digest":"sha256:26b2f234314c19b79a0cf48bb51f9db9188dbbb56aa39aca5a660dbd6c75a9d9","observation_id":"01a9a851-6b87-4fe6-b191-f0fb00db7101","resolution":{"observed_at":"2026-08-03T03:45:30.717072Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-03T03:45:30.747594Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.07120","last_updated":"2026-05-25T23:02:20Z","snapshot_observed_at":"2026-08-03T03:45:26.392122Z","submitted_at":"2026-02-06T19:00:14Z","title":"Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-03T03:45:30.747594Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2602.07120"},"observation_digest":"sha256:55c9aef63da59e46d9c07db08967e2927311ea29a9210ed568ddbe80dec70666","observation_id":"5def5ec8-9fa8-4e95-82df-ff3980380797","resolution":{"observed_at":"2026-08-03T03:45:30.747594Z","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-03T03:45:30.774006Z","title":"Pretraining consists of two stages: (1) a 156B-token general training stage over the entire Common Pile, following domain weights specified by Kandpal et al","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.07120","last_updated":"2026-05-25T23:02:20Z","snapshot_observed_at":"2026-08-03T03:45:26.392122Z","submitted_at":"2026-02-06T19:00:14Z","title":"Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-03T03:45:30.774006Z"},"links":{"citing_paper":"/paper/2602.07120"},"observation_digest":"sha256:edbc1a85d5e20e6a5ca39e224cf7cd950d56b0626dffa2232c36c06561acf810","observation_id":"669a5e82-08fb-4ad7-8919-a1f2a8d162a4","resolution":{"observed_at":"2026-08-03T03:45:30.774006Z","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-03T03:45:30.781299Z","title":"Write a factual biography about{entity}. Include only factual information that you are confident in.\\n Biography:","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.07120","last_updated":"2026-05-25T23:02:20Z","snapshot_observed_at":"2026-08-03T03:45:26.392122Z","submitted_at":"2026-02-06T19:00:14Z","title":"Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-03T03:45:30.781299Z"},"links":{"citing_paper":"/paper/2602.07120"},"observation_digest":"sha256:1de2278fbcabf3a5d4ab4981956554c096cb02b80859d22f3137a50047efbe94","observation_id":"6e396f14-3df5-43d1-b9fb-d7ab5235c126","resolution":{"observed_at":"2026-08-03T03:45:30.781299Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14123","last_updated":"2026-05-07T07:43:36Z","snapshot_observed_at":"2026-08-08T11:14:09.870321Z","submitted_at":"2025-06-17T02:37:04Z","title":"Sampling from Your Language Model One Byte at a Time","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.14123","snapshot_observed_at":"2026-08-03T03:45:30.726671Z","title":"Hayase, J., Liu, A., Smith, N","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.07120","last_updated":"2026-05-25T23:02:20Z","snapshot_observed_at":"2026-08-03T03:45:26.392122Z","submitted_at":"2026-02-06T19:00:14Z","title":"Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T03:45:30.726671Z"},"links":{"cited_paper":"/paper/2506.14123","citing_paper":"/paper/2602.07120"},"observation_digest":"sha256:bd71ea4556d99015c2949c96be333179abde408f364aacf6d52ee9b5fb35915c","observation_id":"fc7a5dce-4400-4a55-98a6-abb281ae2963","resolution":{"observed_at":"2026-08-03T03:45:30.726671Z","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-03T03:45:30.743662Z","title":"Open Knowledge Foundation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.07120","last_updated":"2026-05-25T23:02:20Z","snapshot_observed_at":"2026-08-03T03:45:26.392122Z","submitted_at":"2026-02-06T19:00:14Z","title":"Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-03T03:45:30.743662Z"},"links":{"citing_paper":"/paper/2602.07120"},"observation_digest":"sha256:eef9f0bb3d2d4e144483e62fe6edbf4359c12ac9719616b67f51871fdff9007f","observation_id":"cfea7dab-7407-487a-9264-1287e126e0d5","resolution":{"observed_at":"2026-08-03T03:45:30.743662Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.07120","last_updated":"2026-05-25T23:02:20Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-03T03:45:26.392122Z","submitted_at":"2026-02-06T19:00:14Z","title":"Anchored Decoding: Provably Reducing Copyright Risk for Any Language Model"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":19},"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 9 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2602.07120."}