{"as_of":"2026-08-17T02:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0badc82728669265379747cc479397d52279d3c98e0633474c744627e9d5c46f","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T14:33:57.325368Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T14:17:32.885034Z","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-07-05T10:20:57.138846Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":"2502.06777","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06777","snapshot_observed_at":"2026-07-05T10:20:57.138846Z","title":"Learning an optimal assortment policy under observational data","venue":null,"work_id":"bd8be9b2-7286-448c-a5ee-7985ec64c7c7","year":2025},"citing_paper":{"arxiv_id":"2604.18800","last_updated":"2026-05-23T23:42:14Z","snapshot_observed_at":"2026-07-06T23:05:35.374092Z","submitted_at":"2026-04-20T20:08:46Z","title":"Optimal Exploration of New Products under Assortment Decisions","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-10T02:54:16.836240Z"},"links":{"cited_paper":"/paper/2502.06777","citing_paper":"/paper/2604.18800"},"observation_digest":"sha256:b0d9be37c2609d169fa36ac0a5c408b4ba799968c38185e86c29933687353bca","observation_id":"2e9e536c-1a78-42d8-b7f9-1d313d9d81a2","resolution":{"observed_at":"2026-05-11T12:51:02.750843Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2502.06777","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06777","snapshot_observed_at":"2026-07-05T10:20:57.138846Z","title":"Learning an optimal assortment policy under observational data","venue":null,"work_id":"bd8be9b2-7286-448c-a5ee-7985ec64c7c7","year":2025},"citing_paper":{"arxiv_id":"2604.18800","last_updated":"2026-05-23T23:42:14Z","snapshot_observed_at":"2026-07-06T23:05:35.374092Z","submitted_at":"2026-04-20T20:08:46Z","title":"Optimal Exploration of New Products under Assortment Decisions","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-05T10:20:16.326364Z"},"links":{"cited_paper":"/paper/2502.06777","citing_paper":"/paper/2604.18800"},"observation_digest":"sha256:220ee0f3d4fcbb666d0921ecb3c0c9860dad511a03a6c6dac7359eb9734e3971","observation_id":"e8e211ba-abca-47e4-9fd9-78eb80d95ca2","resolution":{"observed_at":"2026-07-05T10:20:57.141785Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2502.06777","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06777","snapshot_observed_at":"2026-07-05T10:20:57.138846Z","title":"Learning an optimal assortment policy under observational data","venue":null,"work_id":"bd8be9b2-7286-448c-a5ee-7985ec64c7c7","year":2025},"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":37,"source":"arxiv_source","source_observed_at":"2026-05-10T02:33:24.470297Z"},"links":{"cited_paper":"/paper/2502.06777","citing_paper":"/paper/2604.19008"},"observation_digest":"sha256:90b988f2dcc83de9977817e7027fda3061390941e9d0c9782dd9eaca081be437","observation_id":"2e871077-cf52-4c70-901b-f5749fb0d689","resolution":{"observed_at":"2026-05-11T12:56:18.818589Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2502.06777","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06777","snapshot_observed_at":"2026-07-05T10:20:57.138846Z","title":"Learning an optimal assortment policy under observational data","venue":null,"work_id":"bd8be9b2-7286-448c-a5ee-7985ec64c7c7","year":2025},"citing_paper":{"arxiv_id":"2605.17238","last_updated":"2026-05-17T03:28:22Z","snapshot_observed_at":"2026-08-04T06:37:12.055381Z","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":21,"source":"arxiv_source","source_observed_at":"2026-05-20T14:36:39.830565Z"},"links":{"cited_paper":"/paper/2502.06777","citing_paper":"/paper/2605.17238"},"observation_digest":"sha256:ab6df29bc7c99897d0b7b1e5797cd01f85e9dc2fa743f927f5b61750939f8364","observation_id":"7c303d35-3485-4d7a-b31e-65bca352d9f1","resolution":{"observed_at":"2026-05-20T14:38:21.558948Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06777","snapshot_observed_at":"2026-08-15T14:17:32.885034Z","title":"arXiv preprint arXiv:2502.06777 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.11419","last_updated":"2026-08-11T20:37:44Z","snapshot_observed_at":"2026-08-15T23:10:06.711598Z","submitted_at":"2026-08-11T20:37:44Z","title":"Diffusion-Based Data-Driven Assortment Optimization","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T14:17:32.885034Z"},"links":{"cited_paper":"/paper/2502.06777","citing_paper":"/paper/2608.11419"},"observation_digest":"sha256:e9f380ca73b81352fea66f8164a6b3aaefa5065c27d3055932ce32a26aceb0bf","observation_id":"f72bdae1-5cec-4aa1-af24-0fbefbaa02d7","resolution":{"observed_at":"2026-08-15T14:17:32.885034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.06777/citation-record","integrity":"/paper/2502.06777/integrity","json":"/paper/2502.06777/citation-record.json","paper":"/paper/2502.06777"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.064183Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"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":1,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.064183Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:0f56d111afa85aa5d51f4f65e99adadf4b58d2c0ade2b30849cfe1534727b65d","observation_id":"fdd31612-e330-4d0f-a8e8-1fea5d3e7165","resolution":{"observed_at":"2026-08-08T14:33:57.064183Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.070651Z","title":"write newline","venue":null,"work_id":null,"year":null},"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":2,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.070651Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:5aa16ff5ad3360bfbdd85fe45fd1cd06308c7f4b669133ab05f726539eb0797c","observation_id":"c15892f8-8852-41e6-bff3-dbdcf927489c","resolution":{"observed_at":"2026-08-08T14:33:57.070651Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:58.293294Z","title":", Avadhanula, V","venue":null,"work_id":"236a318b-8c16-4680-b1e2-442c5128ae05","year":2017},"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":3,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.076034Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:3c854ac0dd2b981234139f40c6e9dfe869688d58439c8790f7b55201e23c91e6","observation_id":"ff313092-c524-4a3b-a005-b9dc1c76f1fa","resolution":{"observed_at":"2026-08-08T14:33:58.298032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:58.277746Z","title":", Avadhanula, V","venue":null,"work_id":"b2a68069-4b35-40f0-92ba-ea45d974e610","year":2019},"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":4,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.081823Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:e139375d1816ef8422cdf7e7b05416573a9450f934c77fee0de8d73e62770e24","observation_id":"492eac1c-2af5-4561-b3bb-4c2f5ad81a50","resolution":{"observed_at":"2026-08-08T14:33:58.282808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:58.263071Z","title":"and Semple, J","venue":null,"work_id":"68e03e85-e190-4716-baf5-caf203378f12","year":2016},"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":5,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.086847Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:651cd69df68affde5bbf00be6437f9396cec01d77fa2393dc659a7d91bce6afc","observation_id":"8c44c09f-b389-4505-9c04-90a0b126782d","resolution":{"observed_at":"2026-08-08T14:33:58.267681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:58.248735Z","title":", Newman, D","venue":null,"work_id":"856f11b8-e8fb-45ef-b037-cd008ff8802c","year":2007},"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":6,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.092042Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:a4966a4f5366107bed70c667a064b6cab77e76fb256eeaf04392988d80bf9334","observation_id":"51855ae3-31d3-4571-b8f7-9ab89271858f","resolution":{"observed_at":"2026-08-08T14:33:58.253291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:58.234324Z","title":", Bhandari, J","venue":null,"work_id":"28fa07b6-f9e5-40d9-b14c-d53ed87f383c","year":2016},"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":7,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.096988Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:3d4ac122b809a333be53467330a27fed15f7662efae46ef2a4b973a587c89257","observation_id":"39141229-f8ff-4256-8f34-de818e6a4134","resolution":{"observed_at":"2026-08-08T14:33:58.238812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:58.219559Z","title":", Garassino, A","venue":null,"work_id":"33fdacc8-a923-454e-b5ae-fa920f54183c","year":2022},"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":9,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.108437Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:268b0440e2358eb92a1fed4f29815e407e8e5be1035f079db838018275b432fc","observation_id":"57d789b6-1214-40ad-a87a-5775a1169a55","resolution":{"observed_at":"2026-08-08T14:33:58.224110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:58.203879Z","title":", Gallego, G","venue":null,"work_id":"3115000a-2d01-4bf7-a034-32c9cf36db69","year":2016},"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":10,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.113268Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:4d1812acbc87910dfb47b8c73e6bdaa460f4359dc20128ad25f254854ee98f5c","observation_id":"203b05d7-44a4-4534-aa7b-92b1c8dac386","resolution":{"observed_at":"2026-08-08T14:33:58.208553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:58.188781Z","title":null,"venue":null,"work_id":"433b3b91-d737-4778-806a-59df3e1e55f9","year":2023},"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":11,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.118109Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:d4bd9c0e058b3456269f87ed3e98ffb2b01c12b7edbd4a8af26c8da078aeb74c","observation_id":"84af8ec2-8719-4abe-bfb4-d5c89592271e","resolution":{"observed_at":"2026-08-08T14:33:58.193403Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:58.173956Z","title":"and Gallien, J","venue":null,"work_id":"c6d5c914-166b-4341-91f4-0a19cfde5c2f","year":2007},"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":12,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.123135Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:f287d69eae05d53f9afa74725a66a585d380a7289585da89ca5b5b28865100d9","observation_id":"fde751ee-ff1a-4c00-896b-a61738791e16","resolution":{"observed_at":"2026-08-08T14:33:58.178610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.128134Z","title":", Liu, M","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":13,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.128134Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:8d361d50731783ab4c9b016ad2ebe4712913e5496ecc71569b3d5aa17b63ac86","observation_id":"cbe98361-6ef8-4033-9839-8240453a223c","resolution":{"observed_at":"2026-08-08T14:33:57.128134Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:58.157963Z","title":", Shi, C","venue":null,"work_id":"e698de80-82c6-4e2c-845f-b01b8b4a839d","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":14,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.133305Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:eb3b50a3bb300405a3214f8a95158567221b0bec4d87029a03e64d62606a09ea","observation_id":"1b9839c6-ab82-4828-9cb0-55b89ddbec2b","resolution":{"observed_at":"2026-08-08T14:33:58.163505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:58.141345Z","title":"and Wang, Y","venue":null,"work_id":"e8c176c6-032e-46a3-a717-7abbad305bb1","year":2018},"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":15,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.138163Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:1c7d3c0c9cf22aea3896dd08681cb6d23e60c8491bfbc3ad13a47e7484304d0b","observation_id":"883fbecb-fdd5-43d9-a420-926a74533520","resolution":{"observed_at":"2026-08-08T14:33:58.146086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:58.126227Z","title":", Wang, Y","venue":null,"work_id":"9f829f0b-982b-44ce-9db9-06e756ca91d3","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":16,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.142628Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:57306f8b37016c838f6452e1a9d397cbbe176ddcbc4aa2cbe7608976f8b537f5","observation_id":"2a93df36-35d2-4ed8-b847-8a9e9c8445e3","resolution":{"observed_at":"2026-08-08T14:33:58.130933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1704.00108","last_updated":"2017-04-01T02:37:53Z","snapshot_observed_at":"2026-08-14T21:08:50.178383Z","submitted_at":"2017-04-01T02:37:53Z","title":"Assortment Optimization under Unknown MultiNomial Logit Choice Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.00108","snapshot_observed_at":"2026-08-08T14:33:57.147603Z","title":null,"venue":null,"work_id":null,"year":2017},"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":17,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.147603Z"},"links":{"cited_paper":"/paper/1704.00108","citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:4bc3bb6a9527bbf10afea32b90095012b7d384c212da17b37bd41a6d6bc51536","observation_id":"0aabc9c6-20e9-429e-ae85-2b3f95da7252","resolution":{"observed_at":"2026-08-08T14:33:57.147603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:58.111524Z","title":null,"venue":null,"work_id":"f0ddfda6-8b20-48f9-9b3c-8100cb05ac88","year":2014},"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":18,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.152925Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:760468e4e34749a53720b2ade4bb679d5e4b2befa7dc298bdb57632b661ac04e","observation_id":"6f0ee1e8-03d1-455c-beef-c93e27593f83","resolution":{"observed_at":"2026-08-08T14:33:58.115987Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:58.097144Z","title":", Gallego, G","venue":null,"work_id":"a1873092-5298-4be7-8cf4-22bc769c1bec","year":2013},"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":19,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.158131Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:89a64b2a7bcd97592061e8afd3f8052dcd73f6eb68a8e5001a50c82fee11141b","observation_id":"aaa9adfb-cad0-4d54-8693-9afbccffb069","resolution":{"observed_at":"2026-08-08T14:33:58.101597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:58.081821Z","title":null,"venue":null,"work_id":"15efb51c-3e6e-4f4e-bbd1-cc4cce02baad","year":2014},"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":20,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.163615Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:ca19baf05610fb258c624335a2dc439847e3fee7e6617536a75bdb8727a75ee1","observation_id":"c24487b3-27f5-4967-987f-f301e95c59d0","resolution":{"observed_at":"2026-08-08T14:33:58.086956Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.169028Z","title":null,"venue":null,"work_id":null,"year":2023},"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":21,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.169028Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:87d9d7b1dba986d12eeb5dc1f5f0505b31dd8cdb48f560d06f1355bcf4ecb269","observation_id":"ac5ce316-ffdc-484d-b91d-c63f3a7c220c","resolution":{"observed_at":"2026-08-08T14:33:57.169028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.174144Z","title":", Yang, Z","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":22,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.174144Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:fd600d6196a5255aef7fe1e7487083c87a5348d7a7624dd3eea3dbe3a65fbbf3","observation_id":"9bde2362-762d-469e-97b4-14937a101eb1","resolution":{"observed_at":"2026-08-08T14:33:57.174144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:58.046901Z","title":", Zhou, A","venue":null,"work_id":"8209bb6c-a72a-462f-877e-f526f9bc4bde","year":2020},"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":23,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.179108Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:0485872f42e1e5783cbf6ae8957a9d53c690baeb0d7aa55b89506db7a07e0904","observation_id":"dfffa900-bccf-4e96-8091-ee6df012ada4","resolution":{"observed_at":"2026-08-08T14:33:58.051397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:58.032624Z","title":null,"venue":null,"work_id":"5ac53e8f-b4e4-4f89-8489-15af9196daba","year":2012},"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":24,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.184487Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:c556d5c5637923f73f07c27e7da1217db4722e7cce55e09d98348c44400e3bb9","observation_id":"bf0a2f55-77bc-48fe-b76c-533ab93aabc8","resolution":{"observed_at":"2026-08-08T14:33:58.037163Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.189808Z","title":"and Oh, M.-h","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":25,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.189808Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:edf626c3258cca72db8f6154846eaac5bf96b239e4bd65c3ea85d10923e7b55d","observation_id":"a62c1f44-5014-4ae8-b621-cbb265e72d51","resolution":{"observed_at":"2026-08-08T14:33:57.189808Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:58.017595Z","title":", Luo, Q","venue":null,"work_id":"f9a89866-b0b9-45e6-963d-dbbbee8a083f","year":2022},"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":26,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.194662Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:7562e3d9401ff26513440ff8c8e627c72988a6c99d327f816e5f6aeb73cdbf85","observation_id":"76d88dae-7a55-47f3-a031-761188cdec60","resolution":{"observed_at":"2026-08-08T14:33:58.022480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:58.002215Z","title":null,"venue":null,"work_id":"992c4da8-4e3f-4af6-9dd2-8fdfd2e13b2a","year":2022},"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":27,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.199643Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:28c015e4123ae845a6cbe529a1321872496ff95b69345fd4a77bb829ff92a4fa","observation_id":"e678e725-7724-47ca-80bf-9f5124346c18","resolution":{"observed_at":"2026-08-08T14:33:58.006684Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.988056Z","title":", Min, Y","venue":null,"work_id":"4df48a5f-4ad6-4b26-a4f4-861534cba27a","year":2023},"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":28,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.206172Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:82ade27c1b27c4acae0649085168bc412bb9d40107e1aaaa423c981bf39ba3db","observation_id":"47439444-ac44-4e63-8c9f-7940dc95601d","resolution":{"observed_at":"2026-08-08T14:33:57.992449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.973649Z","title":null,"venue":null,"work_id":"669a0af6-5b19-4698-960a-187aaea9a4db","year":1959},"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":29,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.211238Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:dd71fe0105fb4ee6c477c49780de85c08e3492c86a007dc19dee08449886726f","observation_id":"3e694b60-2a44-4711-a21e-2e26c7dd2f67","resolution":{"observed_at":"2026-08-08T14:33:57.978281Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.959784Z","title":null,"venue":null,"work_id":"1678cde3-668b-4f44-8c5d-5a321e2aa628","year":1977},"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":30,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.216299Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:06ebd27874ca84bc6421fc49ad65b74709a41494f3a8d681f6bb5db1d6653054","observation_id":"49c8622a-4b50-4d64-9f07-2eaf4329ff97","resolution":{"observed_at":"2026-08-08T14:33:57.964245Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.945826Z","title":"and Train, K","venue":null,"work_id":"a0dc1f5e-5ca6-4415-8e0a-bd54f8493109","year":2000},"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":31,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.221205Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:9cd069428c3ba90f8a2f99c0330f03e73f6c043c7fa76a9f50ff8da72a8e5e80","observation_id":"a2d6427d-59db-477d-b17a-ec297020f9a5","resolution":{"observed_at":"2026-08-08T14:33:57.950252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.931254Z","title":"and Iyengar, G","venue":null,"work_id":"07485ea6-7d7a-4637-b775-5730eff0d151","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":32,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.225882Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:bbb45edf24a9c7245e6e434a9cf220ea95844bb847749a3b521738c073aa5d40","observation_id":"5b99facb-a611-4f3f-b869-37bc46122d7b","resolution":{"observed_at":"2026-08-08T14:33:57.935874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.02971","last_updated":"2019-03-04T08:04:16Z","snapshot_observed_at":"2026-08-14T19:17:39.273284Z","submitted_at":"2018-05-08T12:23:54Z","title":"Multinomial Logit Bandit with Linear Utility Functions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.02971","snapshot_observed_at":"2026-08-08T14:33:57.231171Z","title":null,"venue":null,"work_id":null,"year":2018},"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":33,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.231171Z"},"links":{"cited_paper":"/paper/1805.02971","citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:df98bf4c3940c5afce727f3c46005086be043b795c5df05a78076337cf5bc03e","observation_id":"a09f0b4a-69c9-49f4-a90c-497443aea3b9","resolution":{"observed_at":"2026-08-08T14:33:57.231171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.916822Z","title":"and Goyal, V","venue":null,"work_id":"07fd9852-2423-4672-8d78-161d63d348c1","year":2022},"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":34,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.236708Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:6088e03852dcc235a2601f40d154b6f9576c74981a9395d12182ffc095dce27d","observation_id":"b8953fd3-0b7c-478c-8f91-d0874e50c17b","resolution":{"observed_at":"2026-08-08T14:33:57.921335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.902477Z","title":", Shamir, O","venue":null,"work_id":"739e60bd-8828-4cc1-8b0f-16ed20702dff","year":2012},"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":35,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.241605Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:89c43e385cd1096d16a839e44f6edb5bebad0bde1c36f6f9a21e0c31133ed825","observation_id":"d64a610c-8f80-4228-9504-abb550535491","resolution":{"observed_at":"2026-08-08T14:33:57.907052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.887383Z","title":", Zhu, B","venue":null,"work_id":"ad2c0d4e-bf34-4f30-98ba-0eba784831f1","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":36,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.246812Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:d2d095472ed816a3cd7a5fdc5c3f7a1a1d6b4f6b27cad340c79d8b49b7666589","observation_id":"935b49e1-1107-46f7-9de8-ebf7da9dddff","resolution":{"observed_at":"2026-08-08T14:33:57.891904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.873529Z","title":", Zhu, H","venue":null,"work_id":"3aaee288-5528-4431-86c3-042b0b0178ae","year":2023},"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":37,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.251611Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:8e57bf112a9d88e9dcfd1a90d7a6de96259b4ba2695cfc2685f9ae127d810df4","observation_id":"b643b885-72b9-4a39-9e3d-bf09818dadee","resolution":{"observed_at":"2026-08-08T14:33:57.877838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.858860Z","title":", Shen, Z.-J","venue":null,"work_id":"6eb6bee3-5771-4ebc-8d49-5c897504253b","year":2010},"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":38,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.256381Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:61fc281802c45b311f14a78a3ee2e9a0f8668c212593ab130b4e8f8221293928","observation_id":"98dcedcc-93ae-46e4-ab8e-a34cfe69f226","resolution":{"observed_at":"2026-08-08T14:33:57.863808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T14:14:16.007057Z","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:aa010d215701850c4a52a8710c563727f6698300405ab587470f0036bc05a2ad","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.844535Z","title":"and Gopalan, A","venue":null,"work_id":"3e1637bc-7d4e-4f84-8273-c26cb87205cb","year":2019},"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":40,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.266101Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:bc54570eaf17e0306d7c8c861d203eda033e4b64cba1782aca51cc8681a158e1","observation_id":"9868edc2-2456-43a6-a9a0-1f08feeadbfb","resolution":{"observed_at":"2026-08-08T14:33:57.849029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.830077Z","title":"and Zeevi, A","venue":null,"work_id":"b4f5fc80-b1b4-43d2-9f4e-49679e1e14c8","year":2013},"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":41,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.271276Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:9167d21fdc695ff1b02f37b2d5178953609be97796862cb9685caabad71081b3","observation_id":"3fba24db-6c50-4734-9434-d2a736db3856","resolution":{"observed_at":"2026-08-08T14:33:57.834577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.815135Z","title":null,"venue":null,"work_id":"1c6171cf-4a06-4a70-8fc6-4d03edd80355","year":2022},"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":42,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.275857Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:10a50ee947674a08f4b228e32c1d9d5ec1333b33ce9fa4829e0912a444e6a1b3","observation_id":"8f3c7498-b87d-4f91-882a-eecc83599507","resolution":{"observed_at":"2026-08-08T14:33:57.819575Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.800335Z","title":"and Van Ryzin, G","venue":null,"work_id":"92b1d566-9237-402c-9e24-620c8d7bb8fc","year":2004},"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":43,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.280351Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:15291704bc97e83595567f1de7e39654f189399d2c539e86e94ab1d1ffe17d7d","observation_id":"ae5d12d4-49ef-4328-be70-c5834f50a240","resolution":{"observed_at":"2026-08-08T14:33:57.805110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.785862Z","title":null,"venue":null,"work_id":"5ca87622-5c06-42ec-9fc6-98f1b9d9a9ef","year":2009},"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":44,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.285187Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:07764b4ab57cc64d41e95575f58739ae79c2fa1ee3bd472301554accfdb3932e","observation_id":"6e6c77b6-e9e4-4dab-931c-f936d71b0af5","resolution":{"observed_at":"2026-08-08T14:33:57.790327Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.771436Z","title":null,"venue":null,"work_id":"1cbf3930-58f6-45ff-9ec1-f56bc5b9be53","year":2008},"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":45,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.289620Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:0c436ab7405da696ef66235517e846205780901e1dd6b0f172c0dd66a401317d","observation_id":"d2cdafea-373d-4f2d-a5c2-d6c63bd9bb58","resolution":{"observed_at":"2026-08-08T14:33:57.775917Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.756808Z","title":"and Sun, W","venue":null,"work_id":"3efc86d9-f470-46bc-822a-0454ccc01c1c","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":46,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.293931Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:b802800a7313c4e277792fa1d6b2d199867ced3928e0bddc4969a7997f79c732","observation_id":"62b8e153-4a19-452c-ab58-3413217645f8","resolution":{"observed_at":"2026-08-08T14:33:57.761500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.742011Z","title":", Cheng, C.-A","venue":null,"work_id":"6e0c129b-05e4-4391-87c2-df34adf46a7b","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":47,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.298389Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:de14d4e9177f6b2f4ca24bc765b352efdf4d59122be32a98516c505d723c6ea7","observation_id":"46cded18-2dbf-45fa-a71b-86c4a87db674","resolution":{"observed_at":"2026-08-08T14:33:57.746467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.726064Z","title":", Zhong, H","venue":null,"work_id":"50558855-d07b-46ba-83e9-81e2409e8965","year":2023},"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":48,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.302757Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:37045474c22861c768a38ffe14414c01d162450fb2944433ee205c4b64b7aa28","observation_id":"3630b531-6c00-494f-b1d4-8083bcff8ed4","resolution":{"observed_at":"2026-08-08T14:33:57.731232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.710064Z","title":null,"venue":null,"work_id":"e866ceef-f561-42ce-a0b1-3b77f1367dc3","year":1997},"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":49,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.307186Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:3ca7f5c6f96e6a6ef1936e030002c75a190eeab4b99937b3066975daa364a76a","observation_id":"dcdcd0e7-ac85-4b50-85be-bbaa5d12beab","resolution":{"observed_at":"2026-08-08T14:33:57.714969Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.693914Z","title":", Thomas, G","venue":null,"work_id":"5743aa42-e8e2-488f-8147-3fee259be77a","year":2020},"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":50,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.311599Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:a6c343d4d1a63aeec43b2183d9bf5bc3a0aa036bbbe6212ad02b73f2b7121386","observation_id":"0af05c62-3693-427e-b56f-e6aaebd9672b","resolution":{"observed_at":"2026-08-08T14:33:57.699084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.677892Z","title":", Huang, B","venue":null,"work_id":"ed52e9d4-fc64-4898-9f3f-535c0729a899","year":2022},"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":51,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.316036Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:4f651b9e3638a5e5718cc127ba0cc0d6f88a73889e9f17d3b780f7ce2733368f","observation_id":"4022ffe0-8538-4e2d-ab86-80ad5525d402","resolution":{"observed_at":"2026-08-08T14:33:57.682894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.662105Z","title":"and Sugiyama, M","venue":null,"work_id":"b967a844-49b2-4d75-8d7b-b7bcad19424e","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":52,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.320693Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:6dad8029068558afe22266085916b96495d24aad971b149d78459f85a053f357","observation_id":"1852c03d-4a14-4b5d-8ccf-0c9d01ab0fda","resolution":{"observed_at":"2026-08-08T14:33:57.667204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:57.645322Z","title":", Xiong, W","venue":null,"work_id":"e0f8d2e2-d650-4666-b2e4-b901213249d2","year":2022},"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":53,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:57.325368Z"},"links":{"citing_paper":"/paper/2502.06777"},"observation_digest":"sha256:1651d8fb6e9a70ae0c81d398a3f34a753a57349383b25af03b1596302155b649","observation_id":"21794374-91ee-4192-9237-845e54d1f4db","resolution":{"observed_at":"2026-08-08T14:33:57.651188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.06777","last_updated":"2025-08-24T20:17:19Z","latest_version":4,"primary_category":"stat.ML","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"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":0,"verified_fuzzy":32},"total_outbound_references":53},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 5 inbound Pith citation observations for arXiv:2502.06777."}