{"as_of":"2026-08-11T07:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0946f8499a91e3dd7184bd11e0a5d3fc463174e059bc397635e0c60689171713","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T16:58:02.400792Z","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-23T06:57:40.454203Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.00396","last_updated":"2024-06-04T18:35:09Z","snapshot_observed_at":"2026-08-10T06:44:57.475366Z","submitted_at":"2024-02-01T07:32:24Z","title":"Efficient Exploration for LLMs","version":2},"cited_work":{"arxiv_id":"2402.00396","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.00396","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient exploration for llms","venue":null,"work_id":"87609982-e049-4ec6-a400-34d6742b6e1b","year":2024},"citing_paper":{"arxiv_id":"2412.08812","last_updated":"2026-04-19T16:29:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-11T23:02:26Z","title":"Test-Time Alignment via Hypothesis Reweighting","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-23T06:55:54.051821Z"},"links":{"cited_paper":"/paper/2402.00396","citing_paper":"/paper/2412.08812"},"observation_digest":"sha256:3a78157cebeaff416f32055842421b7413925dc20188361dcd14dde3ec12402c","observation_id":"a27b5db0-9eda-49ca-9260-2cdb09858e39","resolution":{"observed_at":"2026-05-23T06:57:40.456553Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00396","last_updated":"2024-06-04T18:35:09Z","snapshot_observed_at":"2026-08-10T06:44:57.475366Z","submitted_at":"2024-02-01T07:32:24Z","title":"Efficient Exploration for LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.00396","snapshot_observed_at":"2026-08-10T16:58:02.400792Z","title":"Efficient exploration for llms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.12735","last_updated":"2025-02-07T02:13:27Z","snapshot_observed_at":"2026-08-10T16:48:54.578052Z","submitted_at":"2025-01-22T09:12:09Z","title":"Online Preference Alignment for Language Models via Count-based Exploration","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T16:58:02.400792Z"},"links":{"cited_paper":"/paper/2402.00396","citing_paper":"/paper/2501.12735"},"observation_digest":"sha256:0083a0cfb1e3ba87f55a12e38a0c4c5f8a5c0a9411e6c3b1a4762b672d3f26f1","observation_id":"cf3c38bb-a4c6-4643-9338-a732163ca67a","resolution":{"observed_at":"2026-08-10T16:58:02.400792Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00396","last_updated":"2024-06-04T18:35:09Z","snapshot_observed_at":"2026-08-10T06:44:57.475366Z","submitted_at":"2024-02-01T07:32:24Z","title":"Efficient Exploration for LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.00396","snapshot_observed_at":"2026-08-09T16:35:28.405762Z","title":"M., Hao, B., and Van Roy, B","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.01118","last_updated":"2025-02-03T07:19:05Z","snapshot_observed_at":"2026-08-11T07:17:49.611581Z","submitted_at":"2025-02-03T07:19:05Z","title":"Large Language Model-Enhanced Multi-Armed Bandits","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T16:35:28.405762Z"},"links":{"cited_paper":"/paper/2402.00396","citing_paper":"/paper/2502.01118"},"observation_digest":"sha256:f03458dd227b518e65c5c904e5c317773df0b614148d9732b3ef620c4eb9b35b","observation_id":"9ef088c9-3e97-4d6a-9054-6f8144f7cdf2","resolution":{"observed_at":"2026-08-09T16:35:28.405762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00396","last_updated":"2024-06-04T18:35:09Z","snapshot_observed_at":"2026-08-10T06:44:57.475366Z","submitted_at":"2024-02-01T07:32:24Z","title":"Efficient Exploration for LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.00396","snapshot_observed_at":"2026-08-05T21:16:06.138842Z","title":"arXiv preprint arXiv:2402.00396","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.14911","last_updated":"2025-08-12T19:09:33Z","snapshot_observed_at":"2026-08-05T21:16:04.975526Z","submitted_at":"2025-08-12T19:09:33Z","title":"Personalized Recommendations via Active Utility-based Pairwise Sampling","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-05T21:16:06.138842Z"},"links":{"cited_paper":"/paper/2402.00396","citing_paper":"/paper/2508.14911"},"observation_digest":"sha256:50e5e0304d61c9e362f2b7cc6e50b3f934192d0c593ecd0d0c5521b4e2824bb3","observation_id":"070a0b6c-993d-4ccf-8698-36d6f5f29a8b","resolution":{"observed_at":"2026-08-05T21:16:06.138842Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00396","last_updated":"2024-06-04T18:35:09Z","snapshot_observed_at":"2026-08-10T06:44:57.475366Z","submitted_at":"2024-02-01T07:32:24Z","title":"Efficient Exploration for LLMs","version":2},"cited_work":{"arxiv_id":"2402.00396","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.00396","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient exploration for llms","venue":null,"work_id":"87609982-e049-4ec6-a400-34d6742b6e1b","year":2024},"citing_paper":{"arxiv_id":"2605.09075","last_updated":"2026-07-29T05:15:07Z","snapshot_observed_at":"2026-08-08T14:26:57.936033Z","submitted_at":"2026-05-09T17:37:06Z","title":"Optimality of Sub-network Laplace Approximations: New Results and Methods","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-12T02:25:28.186490Z"},"links":{"cited_paper":"/paper/2402.00396","citing_paper":"/paper/2605.09075"},"observation_digest":"sha256:9b0293a3550c793c99a00016049869b5dbbea31b6f261ffa6ac97bf371d75b55","observation_id":"6baae328-6a3c-4711-9881-4c54bc6b2a38","resolution":{"observed_at":"2026-05-12T07:37:16.404198Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00396","last_updated":"2024-06-04T18:35:09Z","snapshot_observed_at":"2026-08-10T06:44:57.475366Z","submitted_at":"2024-02-01T07:32:24Z","title":"Efficient Exploration for LLMs","version":2},"cited_work":{"arxiv_id":"2402.00396","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.00396","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient exploration for llms","venue":null,"work_id":"87609982-e049-4ec6-a400-34d6742b6e1b","year":2024},"citing_paper":{"arxiv_id":"2605.11328","last_updated":"2026-05-11T23:26:30Z","snapshot_observed_at":"2026-08-02T08:39:07.747479Z","submitted_at":"2026-05-11T23:26:30Z","title":"Epistemic Uncertainty for Test-Time Discovery","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-13T01:52:41.192353Z"},"links":{"cited_paper":"/paper/2402.00396","citing_paper":"/paper/2605.11328"},"observation_digest":"sha256:853a48c94e175dd2a4a18e5a659bfefc9a34cec51201dc7fe150a05f12d31587","observation_id":"89cf7826-caad-4afc-8423-a509ae0d4241","resolution":{"observed_at":"2026-05-13T01:57:06.072731Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00396","last_updated":"2024-06-04T18:35:09Z","snapshot_observed_at":"2026-08-10T06:44:57.475366Z","submitted_at":"2024-02-01T07:32:24Z","title":"Efficient Exploration for LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.00396","snapshot_observed_at":"2026-07-31T23:51:49.190249Z","title":"arXiv preprint arXiv:2402.00396 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23333","last_updated":"2026-07-25T19:11:15Z","snapshot_observed_at":"2026-08-03T00:37:21.399146Z","submitted_at":"2026-07-25T19:11:15Z","title":"Training with (Swap) Regret Loss in a Single-Layer Self-Attention Model: A Case Study on the Probability Simplex","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-31T23:51:49.190249Z"},"links":{"cited_paper":"/paper/2402.00396","citing_paper":"/paper/2607.23333"},"observation_digest":"sha256:9ed045a05e05574766077911c1a87a34caa4754a5598a7ff24d1456cf1ecb53e","observation_id":"c781aeed-e48a-454e-8714-3ada84f304dc","resolution":{"observed_at":"2026-07-31T23:51:49.190249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.00396/citation-record","integrity":"/paper/2402.00396/integrity","json":"/paper/2402.00396/citation-record.json","paper":"/paper/2402.00396"},"outbound":[],"paper":{"arxiv_id":"2402.00396","last_updated":"2024-06-04T18:35:09Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T06:44:57.475366Z","submitted_at":"2024-02-01T07:32:24Z","title":"Efficient Exploration for LLMs"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2402.00396."}