{"as_of":"2026-08-09T18:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:708ac30fd47ec24b4f1513cd83b140e7d1c9a3d3768da9a68c1d2ec0b677369e","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T02:30:44.757300Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T01:52:09.658975Z","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-05-22T14:01:38.041828Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"cited_work":{"arxiv_id":"2603.24917","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2603.24917","snapshot_observed_at":"2026-07-22T03:22:24.255757Z","title":"Feder Cooper, Mark A","venue":null,"work_id":"231d690a-45e0-4358-b6aa-f63a8e148f02","year":2026},"citing_paper":{"arxiv_id":"2505.12546","last_updated":"2026-07-20T01:54:07Z","snapshot_observed_at":"2026-08-07T15:43:36.801836Z","submitted_at":"2025-05-18T21:06:32Z","title":"Extracting memorized pieces of (copyrighted) books from open-weight language models","version":5},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-22T13:59:05.460455Z"},"links":{"cited_paper":"/paper/2603.24917","citing_paper":"/paper/2505.12546"},"observation_digest":"sha256:ed56f4df7913e275abaf83741e260b3b001f6e9366d04d88efb9d6fd871f5c8d","observation_id":"fbaff7eb-e6f1-4d7c-840e-da82b54cdbd6","resolution":{"observed_at":"2026-07-22T03:22:24.255757Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2603.24917","snapshot_observed_at":"2026-08-02T01:52:09.658975Z","title":"Feder Cooper, Mark A","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.14532","last_updated":"2026-07-16T03:39:09Z","snapshot_observed_at":"2026-08-08T04:21:02.832095Z","submitted_at":"2026-07-16T03:39:09Z","title":"Probabilistic \"Copies\" in Generative AI Models","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T01:52:09.658975Z"},"links":{"cited_paper":"/paper/2603.24917","citing_paper":"/paper/2607.14532"},"observation_digest":"sha256:9e9f210960d785989c11e7c07f36c03737c751f6a1a68acf7febc0c2518d1149","observation_id":"dc3fdf8a-09e0-4afd-b711-65a5e1fc4f1f","resolution":{"observed_at":"2026-08-02T01:52:09.658975Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2603.24917/citation-record","integrity":"/paper/2603.24917/integrity","json":"/paper/2603.24917/citation-record.json","paper":"/paper/2603.24917"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T02:30:41.962395Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:41.962395Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:7b83ff5811d75a597a24b5dc687249f4914d67782505bc370fc7591c2a9e3056","observation_id":"0b35f267-826b-49c7-a22f-6468f7d8092c","resolution":{"observed_at":"2026-08-03T02:30:41.962395Z","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-03T02:30:42.039527Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:42.039527Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:7b34912a7eeed3f748b4b6d75738f2dc589184ea373152793c832f61d8c9f128","observation_id":"baf2f07d-1c76-40e9-bd98-7ff5ad1a1368","resolution":{"observed_at":"2026-08-03T02:30:42.039527Z","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-03T02:30:42.118448Z","title":"Computing pz without sampling (teacher-forced scoring).To evaluate pz for verbatim extraction, we do not need to generate any tokens","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:42.118448Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:a1690db8781cbcd4b401e8cdbc825906318f924527d4df699ea2d7783cb0cd7c","observation_id":"ce89ac67-a64b-4c90-bf7d-c9c837f00304","resolution":{"observed_at":"2026-08-03T02:30:42.118448Z","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-03T02:30:42.208761Z","title":", T− 1}; existence)If T≥ 3and |V| ≥T, then there exists b∈V T such that for everyεwith2≤ε<T, BHam ε (b)⊊B Lev ε (b)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:42.208761Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:e10b6334753ea17b2f7318d006fd563b0fbcf242e242bd0ee49dc58e37f4996a","observation_id":"3d8b3f0e-92c1-4337-8b2d-dd07a3fd1374","resolution":{"observed_at":"2026-08-03T02:30:42.208761Z","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-03T02:30:42.290518Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:42.290518Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:ebffa7eb0306f446c5b7c78404d6370169921cd2a80c419a40beda77c6a461da","observation_id":"d5f0365a-ceb8-4065-a2bd-b9abd70c0cb2","resolution":{"observed_at":"2026-08-03T02:30:42.290518Z","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-03T02:30:42.382994Z","title":"And so c∈B Lev ε (b)—i.e., every member of BHam ε (b) must also be a member of BLev ε (b)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:42.382994Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:a5d057c13897cb9e7bbd81ce14c7d34c0b62be81c280322e25325d9b84ca82ce","observation_id":"6aa36cb5-8817-472d-af18-465cb5a3240d","resolution":{"observed_at":"2026-08-03T02:30:42.382994Z","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-03T02:30:42.439012Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:42.439012Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:422f7e284b97fc1eb939693ce296bc6e5e99f2954bc84e8b5d303de623f9799b","observation_id":"fb37b07f-8ae7-43b8-a2d0-986229e18af9","resolution":{"observed_at":"2026-08-03T02:30:42.439012Z","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-03T02:30:42.509065Z","title":"And so, by Equation 22, Levenshtein(b, c)≤Hamming(b , c)≤T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:42.509065Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:bfe00cfb882faad96d2bc9f02a65c0958e09113663a35d8d3248f80e3ae8c031","observation_id":"76c89146-1c27-4b07-abfc-78757f52c737","resolution":{"observed_at":"2026-08-03T02:30:42.509065Z","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-03T02:30:42.594868Z","title":"samples independently either hits or misses the ε-ball","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:42.594868Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:20f90e665d73a12c4b55ed3a31bf3933d9f6ab81338069793fc4f4d24fa504e8","observation_id":"bf79a23a-ab79-40d9-b86f-363755c75a79","resolution":{"observed_at":"2026-08-03T02:30:42.594868Z","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-03T02:30:42.694603Z","title":"no extraction","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:42.694603Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:b355bf9831ed3179f3dd0964e64d7cfa52d79dcb2e0a17ce4bf485630eb8e5c0","observation_id":"29437d09-02f7-4d1e-ba96-484dfb4e384e","resolution":{"observed_at":"2026-08-03T02:30:42.694603Z","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-03T02:30:42.748208Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:42.748208Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:cd99ed5d9165e86aef2adee88297b5b7e51b7da404af2002bd44f433b4505487","observation_id":"cc3585ff-2005-4efc-a05a-a543e630262b","resolution":{"observed_at":"2026-08-03T02:30:42.748208Z","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-03T02:30:42.829128Z","title":"25 Preprint","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:42.829128Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:12de41d5a59d22c2bf4decbab1ca71d85c1e60971a8b8ceefa726974c869aa70","observation_id":"11ba697b-8cc9-4548-9dd7-d39125474b30","resolution":{"observed_at":"2026-08-03T02:30:42.829128Z","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-03T02:30:42.897140Z","title":"This is done for efficiency, i.e., to prevent explosive blow-up of the number of sequences under consideration","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:42.897140Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:2354897d15a84f2d162a2b64f6b101d108b262717356a4d576288fd74dc4317d","observation_id":"22f46c13-8a73-442e-8e10-354a09690042","resolution":{"observed_at":"2026-08-03T02:30:42.897140Z","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-03T02:30:42.998557Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:42.998557Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:2fc97a50ebb013176d94d84b32091cc2d5e1ba55fad2622459f1cc5185eb68e7","observation_id":"b8ec3949-da43-4d99-a9e3-1d80a78d3013","resolution":{"observed_at":"2026-08-03T02:30:42.998557Z","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-03T02:30:43.083539Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:43.083539Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:5a765c29d469ec2f82beb9734ee50ae0038cc7d2cdd873c87b4a39e9a2d9b564","observation_id":"acd5510d-b59e-4f61-bd39-ae1d2124c274","resolution":{"observed_at":"2026-08-03T02:30:43.083539Z","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-03T02:30:43.180994Z","title":"After T steps, the algorithm returns all B·k complete continuations (i.e., without performing a final across-beam prune)","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:43.180994Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:e5b8c051c0f4523ae3180592594bf223c0712e0289b1216317f50e0df0e89c65","observation_id":"e97607d2-7d23-4e6b-a9d1-a41b4b37c419","resolution":{"observed_at":"2026-08-03T02:30:43.180994Z","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-03T02:30:43.266484Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:43.266484Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:d4eb9b494431691757ca8bd83f3041216dd68ff2f67536721ace7a9edf36daa1","observation_id":"c8c7dca5-7107-455a-a675-8847494e4846","resolution":{"observed_at":"2026-08-03T02:30:43.266484Z","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-03T02:30:43.339286Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:43.339286Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:c23856b039616adb63412159b76f0e38ac300a3d7bf94dbaee2e3d826752afe6","observation_id":"02ff42f2-aef0-4479-8e21-b0b4569b5dd5","resolution":{"observed_at":"2026-08-03T02:30:43.339286Z","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-03T02:30:43.421752Z","title":"Select the top-B candidates from the top-k tokens →L 1 (no additional forward pass needed)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:43.421752Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:5ca72a0f7065b776fc69a28b9267746068320be762e0f6d46faaffce4e660dde","observation_id":"cc1dd9db-582f-4d52-8638-3a2ce60ee1a0","resolution":{"observed_at":"2026-08-03T02:30:43.421752Z","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-03T02:30:43.512649Z","title":"up to B·k","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:43.512649Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:52e52cf412246317944acf63172380f038519a986e4377d5597ff1f25d1ae9e5","observation_id":"01c04cb2-b862-4759-ba6d-d35bb6953c6a","resolution":{"observed_at":"2026-08-03T02:30:43.512649Z","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-03T02:30:43.603766Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:43.603766Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:34dd8848cd4a3c1fc06f5c0228f6f45e2df9b5ce1e25488ee70c55b8ac93dd71","observation_id":"2d6e1e9a-4a22-4b52-8ad7-76302cb7251c","resolution":{"observed_at":"2026-08-03T02:30:43.603766Z","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-03T02:30:43.669812Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:43.669812Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:18cd3b36ae12f74d349929eca03424eab2020c55b2e07260113dbe441ddf1206","observation_id":"44172af5-bce0-418a-a28e-bade66dec173","resolution":{"observed_at":"2026-08-03T02:30:43.669812Z","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-03T02:30:43.724699Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:43.724699Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:135484e5a71f17d3769fdca299a3158215fd4f29b340943306bd54ce78a5c44e","observation_id":"4b1cff9e-68fe-4fc7-bb81-d688d816f7d2","resolution":{"observed_at":"2026-08-03T02:30:43.724699Z","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-03T02:30:43.795283Z","title":"looks bad","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:43.795283Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:e01c84068f1ae99e596a565465b54ef7bf4df772aaa5bd959046b2aade959fcc","observation_id":"94b24322-352a-4d0e-a1e0-523fcb369feb","resolution":{"observed_at":"2026-08-03T02:30:43.795283Z","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-03T02:30:43.919142Z","title":", jmax(t+1) (left to right) using Equation 48, treating any out-of-band predecessor as +∞","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:43.919142Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:fec4497421d17fccd14f12d54559bd83fced87aae00f8cafc98b5eaf4852de91","observation_id":"6155a84e-5da1-4a68-bdc8-25833e1245a5","resolution":{"observed_at":"2026-08-03T02:30:43.919142Z","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-03T02:30:43.995570Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:43.995570Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:4221e9a6588b3d23292e3129169893f98094ad26c4d7fd877322b82310f8a197","observation_id":"1d4b6fe0-3531-4362-955a-66bac3fd8d53","resolution":{"observed_at":"2026-08-03T02:30:43.995570Z","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-03T02:30:44.175666Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:44.175666Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:f046d128c94fe2d07df3afac1063d52289002e0d1115875af03d9c0ac728a2c4","observation_id":"a2a0f789-c835-4331-b480-d607204b8ef5","resolution":{"observed_at":"2026-08-03T02:30:44.175666Z","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-03T02:30:44.234362Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:44.234362Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:66ad42cfefbb270f771a16087819ed3c5adbe095a508276029f6d6fde514c956","observation_id":"eba9014b-6c81-4f55-a567-660ff6f71cd7","resolution":{"observed_at":"2026-08-03T02:30:44.234362Z","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-03T02:30:44.331971Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:44.331971Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:24c2cc4a76d2ba2c73c472c38b0c88b38ba4a122295acb3c632eaaf6b787a5c9","observation_id":"d9a3aed9-4ebd-4ab6-ae8d-47e7e99c3379","resolution":{"observed_at":"2026-08-03T02:30:44.331971Z","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-03T02:30:44.385148Z","title":"List of submissions to the Nth Academy Awards","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:44.385148Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:14f1b5d47f21d13ed2cbd1554bf29ce38a144a0f0769e63da1f5394e11670fcf","observation_id":"89f8b195-2134-43bb-82dc-30610fd70aa5","resolution":{"observed_at":"2026-08-03T02:30:44.385148Z","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-03T02:30:44.495360Z","title":"The template structure and stock phrases (track descriptions, race numbering) are widely duplicated","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:44.495360Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:800443b660d610a0143c37209ca3f9cac81a4ccbd29df18551f56fecb0109460","observation_id":"8c92d928-5cc0-4acb-a077-d315ad1603c9","resolution":{"observed_at":"2026-08-03T02:30:44.495360Z","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-03T02:30:44.590552Z","title":"b z(suf):rought the Batman to the forefront of public consciousness","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:44.590552Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:656b7f6c1c997a3a2f04e692733cf72f0d103e951989dc5d9a2ae5cfbd8c2822","observation_id":"69faf6fa-0a11-4669-96ee-3c4a28c74a68","resolution":{"observed_at":"2026-08-03T02:30:44.590552Z","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-03T02:30:44.650848Z","title":"unlocked","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:44.650848Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:29dba810b5dffea1582054891ea540a64e602fed124ba741d42e83f7447589cf","observation_id":"bd445c13-0ca5-4e48-8760-f444b35ba4fc","resolution":{"observed_at":"2026-08-03T02:30:44.650848Z","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-03T02:30:44.757300Z","title":"For the baseline runs, we also manually examine outputs that surpassτmin but are not within Levε= 5 of the target suffix","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":749,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:44.757300Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:7caa08bf27d95ee398da049c4691598ef2b85e688972370ccd787fd5382ef625","observation_id":"a8c0d47e-0338-4187-b1fb-2e63a72d2743","resolution":{"observed_at":"2026-08-03T02:30:44.757300Z","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-03T02:30:44.054720Z","title":"running mismatch counter ≤ε","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":1974,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:44.054720Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:f72f74473d944570c7147d64ad58d750a44ddf3262c862d48d7a78ac5ff70ea9","observation_id":"79961fc0-ef43-4a3b-9ce7-8009e312a37b","resolution":{"observed_at":"2026-08-03T02:30:44.054720Z","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-03T02:30:44.116122Z","title":"We thenreservoir sampled11 100,000 pages that fit these conditions from the whole range of Wikipedia pages in this time frame, de-duplicating by page ID","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T02:30:44.116122Z"},"links":{"citing_paper":"/paper/2603.24917"},"observation_digest":"sha256:eee48aa62a7b1966726dd3d634fdd4cdad1c93a0fac3090d86a327fcfcf7016a","observation_id":"7fd05494-9716-459d-8b11-a7c4e64407bb","resolution":{"observed_at":"2026-08-03T02:30:44.116122Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2603.24917","last_updated":"2026-07-31T07:49:42Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-05T23:10:25.911766Z","submitted_at":"2026-03-26T01:15:16Z","title":"Estimating near-verbatim extraction risk in language models with decoding-constrained beam search"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":34,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":36},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 2 inbound Pith citation observations for arXiv:2603.24917."}