Pith. sign in

Paper Citation Record · LEDGER

MNL-Bandit with Knapsacks: a near-optimal algorithm

As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2106.01135.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2106.01135 v5

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-08T14:33:57.102173Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-05-11T12:56:18.329353Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 33325e3d-dd29-4788-9f21-061e5f47faa8 · inbound

Learning an Optimal Assortment Policy under Observational Data cites this paper.

Learning an Optimal Assortment Policy under Observational Data MNL-Bandit with Knapsacks: a near-optimal algorithm

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-08T14:33:57.102173Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-08T14:33:57.102173Z digest=sha256:5527913e72cf86a2c610d3987e749956a8c99ca7b928dbae562cae1a6c7fd41c

Observation 717f54b9-3be2-46de-b29a-d093a333df35 · inbound

Optimal Online and Offline Algorithms for Contextual MNL with Applications to Assortment and Pricing cites this paper.

Optimal Online and Offline Algorithms for Contextual MNL with Applications to Assortment and Pricing MNL-Bandit with Knapsacks: a near-optimal algorithm

Reference 92

Resolution
verified exact
arxiv_id, observed 2026-05-11T12:56:18.380356Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=arxiv_source observed=2026-05-10T02:33:24.470297Z digest=sha256:da7956adf4a52f4c381c091d9427fad460ff9737fe35d1f690924412be32f077