Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Stop Relying on No-Choice and Do not Repeat the Moves: Optimal, Efficient and Practical Algorithms for Assortment Optimization
As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2402.18917.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-08T14:33:57.261195Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-20T14:38:21.562874Z
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 859cf0ee-203b-4589-b635-d386e70b9815 · inbound
Learning an Optimal Assortment Policy under Observational Data cites this paper.
Learning an Optimal Assortment Policy under Observational Data Stop Relying on No-Choice and Do not Repeat the Moves: Optimal, Efficient and Practical Algorithms for Assortment Optimization
Reference 39
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T14:33:57.261195Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1632efb6-950e-4938-acd2-a086896d5fdc · 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 Stop Relying on No-Choice and Do not Repeat the Moves: Optimal, Efficient and Practical Algorithms for Assortment Optimization
Reference 101
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T12:56:19.978869Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.
Observation 0523c8f4-ccaa-423d-99a1-86c4dc95f10b · inbound
Learning in Position-Aware Multinomial Logit Bandits: From Multiplicative to General Position Effects cites this paper.
Learning in Position-Aware Multinomial Logit Bandits: From Multiplicative to General Position Effects Stop Relying on No-Choice and Do not Repeat the Moves: Optimal, Efficient and Practical Algorithms for Assortment Optimization
Reference 34
- Resolution
- verified exact
- arxiv_id, observed 2026-05-20T14:38:21.564364Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.