{"as_of":"2026-08-08T19:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1c1aeaae377e016d15a3d158511965c5eec32216aeb5dc630067febfd6e8e3f5","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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-05T21:34:29.314573Z","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-11T23:41:17.156568Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.17324","last_updated":"2025-09-02T02:16:56Z","snapshot_observed_at":"2026-07-06T18:20:39.922334Z","submitted_at":"2024-05-27T16:23:34Z","title":"Leveraging Offline Data in Linear Latent Contextual Bandits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17324","snapshot_observed_at":"2026-08-05T21:34:29.314573Z","title":"Leveraging offline data in linear latent bandits.arXiv preprint arXiv:2405.17324,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-07T12:16:45.804784Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:29.314573Z"},"links":{"cited_paper":"/paper/2405.17324","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:750495b9217c55a82dd6b3721273e9a8ff56c1a501a828ee47f538c1bf8d20c7","observation_id":"2cdf827e-46dd-4e3d-abe5-0fefb13351d1","resolution":{"observed_at":"2026-08-05T21:34:29.314573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17324","last_updated":"2025-09-02T02:16:56Z","snapshot_observed_at":"2026-07-06T18:20:39.922334Z","submitted_at":"2024-05-27T16:23:34Z","title":"Leveraging Offline Data in Linear Latent Contextual Bandits","version":2},"cited_work":{"arxiv_id":"2405.17324","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.17324","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Leveraging offline data in linear latent bandits","venue":null,"work_id":"43375f32-a324-45b4-9f77-518f38db52de","year":2024},"citing_paper":{"arxiv_id":"2604.26169","last_updated":"2026-04-28T23:24:26Z","snapshot_observed_at":"2026-07-06T23:11:52.954360Z","submitted_at":"2026-04-28T23:24:26Z","title":"Budget-Constrained Causal Bandits: Bridging Uplift Modeling and Sequential Decision-Making","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-07T16:29:11.182014Z"},"links":{"cited_paper":"/paper/2405.17324","citing_paper":"/paper/2604.26169"},"observation_digest":"sha256:93ed82375bf8587c8c0bf3fdf05a62fdc556db8fa64ac3d441d297777e92a0cf","observation_id":"c825263a-7d28-4606-9e02-00431866e8e9","resolution":{"observed_at":"2026-05-11T23:41:17.160660Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2405.17324/citation-record","integrity":"/paper/2405.17324/integrity","json":"/paper/2405.17324/citation-record.json","paper":"/paper/2405.17324"},"outbound":[],"paper":{"arxiv_id":"2405.17324","last_updated":"2025-09-02T02:16:56Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T18:20:39.922334Z","submitted_at":"2024-05-27T16:23:34Z","title":"Leveraging Offline Data in Linear Latent Contextual Bandits"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2405.17324."}