{"as_of":"2026-08-18T20:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:35f8f0d8bee55eec4e9c212e15b41176b352d88669aa67cecd3ae10dbd3b2087","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-18T06:34:40.430872+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-08T14:33:57.102173Z","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-11T12:56:18.329353Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.01135","last_updated":"2024-01-24T14:56:44Z","snapshot_observed_at":"2026-08-16T18:20:16.853939Z","submitted_at":"2021-06-02T13:05:34Z","title":"MNL-Bandit with Knapsacks: a near-optimal algorithm","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.01135","snapshot_observed_at":"2026-08-08T14:33:57.102173Z","title":", Goyal, V","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.06777","last_updated":"2025-08-24T20:17:19Z","snapshot_observed_at":"2026-08-16T18:56:36.556639Z","submitted_at":"2025-02-10T18:54:41Z","title":"Learning an Optimal Assortment Policy under Observational Data","version":4},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.102173Z"},"links":{"cited_paper":"/paper/2106.01135","citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:5527913e72cf86a2c610d3987e749956a8c99ca7b928dbae562cae1a6c7fd41c","observation_id":"33325e3d-dd29-4788-9f21-061e5f47faa8","resolution":{"observed_at":"2026-08-08T14:33:57.102173Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.01135","last_updated":"2024-01-24T14:56:44Z","snapshot_observed_at":"2026-08-16T18:20:16.853939Z","submitted_at":"2021-06-02T13:05:34Z","title":"MNL-Bandit with Knapsacks: a near-optimal algorithm","version":5},"cited_work":{"arxiv_id":"2106.01135","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.01135","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2106.01135 , year=","venue":null,"work_id":"e2d75923-9526-49ba-b125-711999e2cb84","year":null},"citing_paper":{"arxiv_id":"2604.19008","last_updated":"2026-04-21T02:53:38Z","snapshot_observed_at":"2026-08-15T18:52:37.121678Z","submitted_at":"2026-04-21T02:53:38Z","title":"Optimal Online and Offline Algorithms for Contextual MNL with Applications to Assortment and Pricing","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-05-10T02:33:24.470297Z"},"links":{"cited_paper":"/paper/2106.01135","citing_paper":"/paper/2604.19008"},"observation_digest":"sha256:142c09fc0434241b0a6d27f3e2acdfafef2de7b0e435cee10bc6a5bf1fa89a05","observation_id":"717f54b9-3be2-46de-b29a-d093a333df35","resolution":{"observed_at":"2026-05-11T12:56:18.380356Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2106.01135/citation-record","integrity":"/paper/2106.01135/integrity","json":"/paper/2106.01135/citation-record.json","paper":"/paper/2106.01135"},"outbound":[],"paper":{"arxiv_id":"2106.01135","last_updated":"2024-01-24T14:56:44Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T18:20:16.853939Z","submitted_at":"2021-06-02T13:05:34Z","title":"MNL-Bandit with Knapsacks: a near-optimal algorithm"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2106.01135."}