{"as_of":"2026-08-17T22:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bff593c250904778fc2bdaa11009cae36ad0f2a84f2fd00392d4c2cf30b0c09f","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T14:33:57.261195Z","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-20T14:38:21.562874Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.18917","last_updated":"2024-02-29T07:17:04Z","snapshot_observed_at":"2026-08-17T13:50:03.352188Z","submitted_at":"2024-02-29T07:17:04Z","title":"Stop Relying on No-Choice and Do not Repeat the Moves: Optimal, Efficient and Practical Algorithms for Assortment Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.18917","snapshot_observed_at":"2026-08-08T14:33:57.261195Z","title":"and Gaillard, P","venue":null,"work_id":null,"year":2024},"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":39,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.261195Z"},"links":{"cited_paper":"/paper/2402.18917","citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:da7ed00d9d07d9f16a7e8488bc72b5a877b71488c12876d6d9d3cd59acbd91eb","observation_id":"859cf0ee-203b-4589-b635-d386e70b9815","resolution":{"observed_at":"2026-08-08T14:33:57.261195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.18917","last_updated":"2024-02-29T07:17:04Z","snapshot_observed_at":"2026-08-17T13:50:03.352188Z","submitted_at":"2024-02-29T07:17:04Z","title":"Stop Relying on No-Choice and Do not Repeat the Moves: Optimal, Efficient and Practical Algorithms for Assortment Optimization","version":1},"cited_work":{"arxiv_id":"2402.18917","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.18917","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2402.18917","venue":null,"work_id":"7c57780f-ddb8-4613-b3f2-b3484987ee71","year":2024},"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":101,"source":"arxiv_source","source_observed_at":"2026-05-10T02:33:24.470297Z"},"links":{"cited_paper":"/paper/2402.18917","citing_paper":"/paper/2604.19008"},"observation_digest":"sha256:7417b05f867ef82b8c3b5ab592d06daf6050e748f3cfec3bfd607bf7200f3253","observation_id":"1632efb6-950e-4938-acd2-a086896d5fdc","resolution":{"observed_at":"2026-05-11T12:56:19.978869Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.18917","last_updated":"2024-02-29T07:17:04Z","snapshot_observed_at":"2026-08-17T13:50:03.352188Z","submitted_at":"2024-02-29T07:17:04Z","title":"Stop Relying on No-Choice and Do not Repeat the Moves: Optimal, Efficient and Practical Algorithms for Assortment Optimization","version":1},"cited_work":{"arxiv_id":"2402.18917","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.18917","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2402.18917","venue":null,"work_id":"7c57780f-ddb8-4613-b3f2-b3484987ee71","year":2024},"citing_paper":{"arxiv_id":"2605.17238","last_updated":"2026-05-17T03:28:22Z","snapshot_observed_at":"2026-08-17T11:26:25.266019Z","submitted_at":"2026-05-17T03:28:22Z","title":"Learning in Position-Aware Multinomial Logit Bandits: From Multiplicative to General Position Effects","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-20T14:36:39.830565Z"},"links":{"cited_paper":"/paper/2402.18917","citing_paper":"/paper/2605.17238"},"observation_digest":"sha256:6198baa7aa09739e3a2dfba16527e580948ed38693c82a43d391b84d837cf75f","observation_id":"0523c8f4-ccaa-423d-99a1-86c4dc95f10b","resolution":{"observed_at":"2026-05-20T14:38:21.564364Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.18917/citation-record","integrity":"/paper/2402.18917/integrity","json":"/paper/2402.18917/citation-record.json","paper":"/paper/2402.18917"},"outbound":[],"paper":{"arxiv_id":"2402.18917","last_updated":"2024-02-29T07:17:04Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T13:50:03.352188Z","submitted_at":"2024-02-29T07:17:04Z","title":"Stop Relying on No-Choice and Do not Repeat the Moves: Optimal, Efficient and Practical Algorithms for Assortment Optimization"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"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."}