{"as_of":"2026-08-13T11:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d95015e5fd425b6b3f6480723c76b435ce525edaa52e58802332a0582fa64e8a","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T00:11:14.732058Z","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-17T04:21:30.858536Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2010.02650","last_updated":"2021-01-17T09:39:46Z","snapshot_observed_at":"2026-08-13T08:23:21.342485Z","submitted_at":"2020-10-06T11:57:03Z","title":"If beam search is the answer, what was the question?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.02650","snapshot_observed_at":"2026-08-12T00:11:14.732058Z","title":"If beam search is the answer, what was the question? arXiv:2010.02650,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2412.01951","last_updated":"2024-12-04T14:20:21Z","snapshot_observed_at":"2026-08-11T23:57:27.579600Z","submitted_at":"2024-12-02T20:24:17Z","title":"Self-Improvement in Language Models: The Sharpening Mechanism","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T00:11:14.732058Z"},"links":{"cited_paper":"/paper/2010.02650","citing_paper":"/paper/2412.01951"},"observation_digest":"sha256:bf5bb012d51b7b2a639b4b6824fe89232d204d385ff4826de3811f40cf94d5ef","observation_id":"e9d616e4-1187-4a71-9e08-6a2ced45bf4b","resolution":{"observed_at":"2026-08-12T00:11:14.732058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.02650","last_updated":"2021-01-17T09:39:46Z","snapshot_observed_at":"2026-08-13T08:23:21.342485Z","submitted_at":"2020-10-06T11:57:03Z","title":"If beam search is the answer, what was the question?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.02650","snapshot_observed_at":"2026-08-11T20:07:16.905277Z","title":"If beam search is the answer, what was the question?","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2412.06069","last_updated":"2024-12-08T21:14:57Z","snapshot_observed_at":"2026-08-12T09:45:07.569416Z","submitted_at":"2024-12-08T21:14:57Z","title":"Fuzzy Norm-Explicit Product Quantization for Recommender Systems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T20:07:16.905277Z"},"links":{"cited_paper":"/paper/2010.02650","citing_paper":"/paper/2412.06069"},"observation_digest":"sha256:49b513899fec8fc0dff35b92f3df794cbe2727d6bfc32602627b39942c5eff56","observation_id":"30c8cda4-3011-48bb-9d58-acaf493f5c6d","resolution":{"observed_at":"2026-08-11T20:07:16.905277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.02650","last_updated":"2021-01-17T09:39:46Z","snapshot_observed_at":"2026-08-13T08:23:21.342485Z","submitted_at":"2020-10-06T11:57:03Z","title":"If beam search is the answer, what was the question?","version":2},"cited_work":{"arxiv_id":"2010.02650","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2010.02650","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4a160c87-3d3b-4a6c-9f6b-38b915fb61fd","year":2021},"citing_paper":{"arxiv_id":"2511.22277","last_updated":"2026-04-24T08:52:17Z","snapshot_observed_at":"2026-08-11T02:15:49.098646Z","submitted_at":"2025-11-27T09:59:39Z","title":"TreeCoder: Systematic Exploration and Optimisation of Decoding and Constraints for LLM Code Generation","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-17T04:19:18.805697Z"},"links":{"cited_paper":"/paper/2010.02650","citing_paper":"/paper/2511.22277"},"observation_digest":"sha256:479d7e091073e300a7b4d43e3414eea56cc269e5f6aa4e9188df1c4f640cfe7d","observation_id":"27daf19e-f250-480c-ac13-c6225c8a4ba8","resolution":{"observed_at":"2026-05-17T04:21:30.860775Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.02650","last_updated":"2021-01-17T09:39:46Z","snapshot_observed_at":"2026-08-13T08:23:21.342485Z","submitted_at":"2020-10-06T11:57:03Z","title":"If beam search is the answer, what was the question?","version":2},"cited_work":{"arxiv_id":"2010.02650","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2010.02650","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4a160c87-3d3b-4a6c-9f6b-38b915fb61fd","year":2021},"citing_paper":{"arxiv_id":"2604.23327","last_updated":"2026-04-25T14:35:11Z","snapshot_observed_at":"2026-08-11T09:01:30.800314Z","submitted_at":"2026-04-25T14:35:11Z","title":"An Efficient Beam Search Algorithm for Active Perception in Mobile Robotics","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-08T08:07:57.136539Z"},"links":{"cited_paper":"/paper/2010.02650","citing_paper":"/paper/2604.23327"},"observation_digest":"sha256:b392d2982e9539ada9c43669fdde7e88c07d2186c58f1e125fcd5fa22c2c1b7f","observation_id":"afee1bf3-ab1f-45db-acf7-103dab3bc000","resolution":{"observed_at":"2026-05-11T20:46:11.502101Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2010.02650/citation-record","integrity":"/paper/2010.02650/integrity","json":"/paper/2010.02650/citation-record.json","paper":"/paper/2010.02650"},"outbound":[],"paper":{"arxiv_id":"2010.02650","last_updated":"2021-01-17T09:39:46Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-13T08:23:21.342485Z","submitted_at":"2020-10-06T11:57:03Z","title":"If beam search is the answer, what was the question?"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2010.02650."}