{"as_of":"2026-08-21T13:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c984e80351320a14ed06d67418d7ce7b3b6e20422989e3d2e0da3d1887206105","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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-05-15T06:14:53.685486Z","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-15T06:15:06.357979Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.03968","last_updated":"2025-05-17T00:23:08Z","snapshot_observed_at":"2026-08-19T08:33:28.654849Z","submitted_at":"2024-10-04T23:18:27Z","title":"Decoding Game: On Minimax Optimality of Heuristic Text Generation Strategies","version":3},"cited_work":{"arxiv_id":"2410.03968","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.03968","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2410.03968 , year=","venue":null,"work_id":"f5bb5476-1100-4c07-803c-906fc4be738c","year":null},"citing_paper":{"arxiv_id":"2605.13875","last_updated":"2026-05-08T06:56:35Z","snapshot_observed_at":"2026-08-02T22:27:33.584660Z","submitted_at":"2026-05-08T06:56:35Z","title":"Common-agency Games for Multi-Objective Test-Time Alignment","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-15T06:14:53.685486Z"},"links":{"cited_paper":"/paper/2410.03968","citing_paper":"/paper/2605.13875"},"observation_digest":"sha256:18b25a250e2bb9ef829d5bb29290edc624599ed8a84911a4dd8a532ff8a44744","observation_id":"764967e0-d087-41f0-afb2-2cbcc2acba35","resolution":{"observed_at":"2026-05-15T06:15:06.362448Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.03968/citation-record","integrity":"/paper/2410.03968/integrity","json":"/paper/2410.03968/citation-record.json","paper":"/paper/2410.03968"},"outbound":[],"paper":{"arxiv_id":"2410.03968","last_updated":"2025-05-17T00:23:08Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T08:33:28.654849Z","submitted_at":"2024-10-04T23:18:27Z","title":"Decoding Game: On Minimax Optimality of Heuristic Text Generation Strategies"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2410.03968."}