{"as_of":"2026-08-23T12:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:431efa71ede016ece1418bf3cd2c6a3955ed8b8323f0d78c4d56ecbda1c5d8da","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-02T08:55:12.803601Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.00328/citation-record","integrity":"/paper/2607.00328/integrity","json":"/paper/2607.00328/citation-record.json","paper":"/paper/2607.00328"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T04:21:55.954042Z","title":"Ma and D","venue":null,"work_id":"f770d2eb-6115-4a11-8d5d-2eccb7eb7885","year":null},"citing_paper":{"arxiv_id":"2607.00328","last_updated":"2026-07-01T02:06:53Z","snapshot_observed_at":"2026-07-07T00:05:59.073754Z","submitted_at":"2026-07-01T02:06:53Z","title":"Killing the Case for Randomization in Dynamic Assortment Optimization","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-02T08:55:12.803601Z"},"links":{"citing_paper":"/paper/2607.00328"},"observation_digest":"sha256:947ed42dc5e871808194432bff25b945695027f1025eefc39723ee69e4f3255e","observation_id":"8bc43e3f-8bea-4d09-ac0a-120767e95cb3","resolution":{"observed_at":"2026-07-06T04:21:55.956903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-06T04:21:55.945472Z","title":"Feng and R","venue":null,"work_id":"8da7f2f1-fcbf-4a0b-ac25-0b9e6e464ffa","year":null},"citing_paper":{"arxiv_id":"2607.00328","last_updated":"2026-07-01T02:06:53Z","snapshot_observed_at":"2026-07-07T00:05:59.073754Z","submitted_at":"2026-07-01T02:06:53Z","title":"Killing the Case for Randomization in Dynamic Assortment Optimization","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-02T08:55:12.803601Z"},"links":{"citing_paper":"/paper/2607.00328"},"observation_digest":"sha256:e782916c0ce8bc02f632d51518efa1881a977dbcfdd948cc88105ad3ccc50743","observation_id":"4adec280-b5d1-4a9f-8710-a1e109e92fd6","resolution":{"observed_at":"2026-07-06T04:21:55.947217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-06T04:21:55.942004Z","title":"Hassani and M","venue":null,"work_id":"a312fe0f-743a-43de-bafa-b980d5e24748","year":2017},"citing_paper":{"arxiv_id":"2607.00328","last_updated":"2026-07-01T02:06:53Z","snapshot_observed_at":"2026-07-07T00:05:59.073754Z","submitted_at":"2026-07-01T02:06:53Z","title":"Killing the Case for Randomization in Dynamic Assortment Optimization","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-02T08:55:12.803601Z"},"links":{"citing_paper":"/paper/2607.00328"},"observation_digest":"sha256:f5e10a78bf17bfe8ea3de6b9b3d6ce414b6e80b11b71d2373102e1991a8224c6","observation_id":"0a28fb27-ce90-4979-afe1-1dc701790bd8","resolution":{"observed_at":"2026-07-06T04:21:55.943097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-06T04:21:55.940991Z","title":null,"venue":null,"work_id":"cb4b441a-fac9-4243-af99-bea8dcce000f","year":null},"citing_paper":{"arxiv_id":"2607.00328","last_updated":"2026-07-01T02:06:53Z","snapshot_observed_at":"2026-07-07T00:05:59.073754Z","submitted_at":"2026-07-01T02:06:53Z","title":"Killing the Case for Randomization in Dynamic Assortment Optimization","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-02T08:55:12.803601Z"},"links":{"citing_paper":"/paper/2607.00328"},"observation_digest":"sha256:18b78fd5210192f80a90ca2bb5808938cdd2624702eabc9f3b5f558d696f1d47","observation_id":"0fe47a3d-bc57-4b5b-9aaf-7117d688a6fb","resolution":{"observed_at":"2026-07-06T04:21:55.942955Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-06T04:21:55.936774Z","title":"Sun and R","venue":null,"work_id":"5847571c-271a-4ff1-84b3-156619891b53","year":null},"citing_paper":{"arxiv_id":"2607.00328","last_updated":"2026-07-01T02:06:53Z","snapshot_observed_at":"2026-07-07T00:05:59.073754Z","submitted_at":"2026-07-01T02:06:53Z","title":"Killing the Case for Randomization in Dynamic Assortment Optimization","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-02T08:55:12.803601Z"},"links":{"citing_paper":"/paper/2607.00328"},"observation_digest":"sha256:b5c8d7b5805c0ae5e6bd52cf21f292d67ab2bb9d7324410820c7e1cd3ba55f13","observation_id":"5198a8b1-9382-4e57-8b49-708ee7914381","resolution":{"observed_at":"2026-07-06T04:21:55.938262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-06T04:21:55.943538Z","title":"Golrezaei and H","venue":null,"work_id":"e07e4d09-5c79-489b-8680-09ee84495074","year":2014},"citing_paper":{"arxiv_id":"2607.00328","last_updated":"2026-07-01T02:06:53Z","snapshot_observed_at":"2026-07-07T00:05:59.073754Z","submitted_at":"2026-07-01T02:06:53Z","title":"Killing the Case for Randomization in Dynamic Assortment Optimization","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-02T08:55:12.803601Z"},"links":{"citing_paper":"/paper/2607.00328"},"observation_digest":"sha256:389c48c37054cc300ba88fb7351d83b114e429e334caa75e3a05ee4195a6a948","observation_id":"ffcee42d-99bf-42e5-8b2b-6d42bfca0902","resolution":{"observed_at":"2026-07-06T04:21:55.944905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-06T04:21:55.961418Z","title":"Rusmevichientong and M","venue":null,"work_id":"3bd80f23-f738-4556-b943-f8eea3cbab0a","year":null},"citing_paper":{"arxiv_id":"2607.00328","last_updated":"2026-07-01T02:06:53Z","snapshot_observed_at":"2026-07-07T00:05:59.073754Z","submitted_at":"2026-07-01T02:06:53Z","title":"Killing the Case for Randomization in Dynamic Assortment Optimization","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-02T08:55:12.803601Z"},"links":{"citing_paper":"/paper/2607.00328"},"observation_digest":"sha256:8467c32fea5bdd50ed3f69c4e7929ea46020e4939b7c29c9e77dc0c66a454550","observation_id":"2bd49ef5-5752-4153-9f86-ca3adec3cc9d","resolution":{"observed_at":"2026-07-06T04:21:55.962609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-06T04:21:55.963506Z","title":"Manshadi and S","venue":null,"work_id":"831a47c9-542d-4b3f-99db-ba5a3c3322a8","year":null},"citing_paper":{"arxiv_id":"2607.00328","last_updated":"2026-07-01T02:06:53Z","snapshot_observed_at":"2026-07-07T00:05:59.073754Z","submitted_at":"2026-07-01T02:06:53Z","title":"Killing the Case for Randomization in Dynamic Assortment Optimization","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-02T08:55:12.803601Z"},"links":{"citing_paper":"/paper/2607.00328"},"observation_digest":"sha256:6e23b0b8766e25d31def84c1783515e6092a13960390836a802900ca33f02176","observation_id":"bf1b3d78-3c45-4d5b-b8a4-943259a325cd","resolution":{"observed_at":"2026-07-06T04:21:55.964710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-06T04:21:55.930968Z","title":"Ma and P","venue":null,"work_id":"ccddfb4a-c3e9-4ff6-8d48-e4bea6c69e5f","year":null},"citing_paper":{"arxiv_id":"2607.00328","last_updated":"2026-07-01T02:06:53Z","snapshot_observed_at":"2026-07-07T00:05:59.073754Z","submitted_at":"2026-07-01T02:06:53Z","title":"Killing the Case for Randomization in Dynamic Assortment Optimization","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-02T08:55:12.803601Z"},"links":{"citing_paper":"/paper/2607.00328"},"observation_digest":"sha256:11abe251207c3e50fc2fadb0de3f68695e5cf706d8ee746d7f8c6d962e9abf89","observation_id":"ee164483-bf1d-4c48-b416-0abbe372adc7","resolution":{"observed_at":"2026-07-06T04:21:55.932278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-06T04:21:55.935075Z","title":"Gong and V","venue":null,"work_id":"57803fad-3373-4b50-b5ed-719a859347bb","year":null},"citing_paper":{"arxiv_id":"2607.00328","last_updated":"2026-07-01T02:06:53Z","snapshot_observed_at":"2026-07-07T00:05:59.073754Z","submitted_at":"2026-07-01T02:06:53Z","title":"Killing the Case for Randomization in Dynamic Assortment Optimization","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-02T08:55:12.803601Z"},"links":{"citing_paper":"/paper/2607.00328"},"observation_digest":"sha256:c35363442a55f8e03c72792122239c8a7f05d30cbb7be37ee7c716bdcf4086f7","observation_id":"08d26df0-8556-47d7-bc64-faa4828d468e","resolution":{"observed_at":"2026-07-06T04:21:55.936384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-06T04:21:55.934834Z","title":"Gallego and G","venue":null,"work_id":"cb3f30af-2b6b-4b3f-a7bb-dd3e2d72ebf3","year":2004},"citing_paper":{"arxiv_id":"2607.00328","last_updated":"2026-07-01T02:06:53Z","snapshot_observed_at":"2026-07-07T00:05:59.073754Z","submitted_at":"2026-07-01T02:06:53Z","title":"Killing the Case for Randomization in Dynamic Assortment Optimization","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-02T08:55:12.803601Z"},"links":{"citing_paper":"/paper/2607.00328"},"observation_digest":"sha256:6dfd3d7cf55d6c73e15ddd8b59c5528264ef2072ea70d0b129ee59cb4a77a249","observation_id":"7ec88650-ea4c-408f-a3b5-8c78fd095ad9","resolution":{"observed_at":"2026-07-06T04:21:55.936191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-06T04:21:55.949063Z","title":"Liu and G","venue":null,"work_id":"3cf017c4-6f1c-4a33-8a6f-f5414d6ac7b4","year":2008},"citing_paper":{"arxiv_id":"2607.00328","last_updated":"2026-07-01T02:06:53Z","snapshot_observed_at":"2026-07-07T00:05:59.073754Z","submitted_at":"2026-07-01T02:06:53Z","title":"Killing the Case for Randomization in Dynamic Assortment Optimization","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-02T08:55:12.803601Z"},"links":{"citing_paper":"/paper/2607.00328"},"observation_digest":"sha256:facb9287054cb6ba1d2e5484118c270b9b27bb934b9d713c830a3995ae25b4e8","observation_id":"d955655d-4f5d-4bac-871a-7fc46a13f613","resolution":{"observed_at":"2026-07-06T04:21:55.951073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-06T04:21:55.951749Z","title":"Jasin and S","venue":null,"work_id":"e5da9e5b-192a-4337-8bd2-8846ca21ca82","year":null},"citing_paper":{"arxiv_id":"2607.00328","last_updated":"2026-07-01T02:06:53Z","snapshot_observed_at":"2026-07-07T00:05:59.073754Z","submitted_at":"2026-07-01T02:06:53Z","title":"Killing the Case for Randomization in Dynamic Assortment Optimization","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-02T08:55:12.803601Z"},"links":{"citing_paper":"/paper/2607.00328"},"observation_digest":"sha256:0a0bd9e9b48672b5f7adfcbdcb71983aaa0ca8b33afea4c94a6b4fff3f909340","observation_id":"bb6bf3f6-c5ea-4467-a55a-ac2e3ba50e2a","resolution":{"observed_at":"2026-07-06T04:21:55.953307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-06T04:21:55.928871Z","title":"Topaloglu , title =","venue":null,"work_id":"e881dcc6-4b2c-45a7-ac92-2c0619acee54","year":null},"citing_paper":{"arxiv_id":"2607.00328","last_updated":"2026-07-01T02:06:53Z","snapshot_observed_at":"2026-07-07T00:05:59.073754Z","submitted_at":"2026-07-01T02:06:53Z","title":"Killing the Case for Randomization in Dynamic Assortment Optimization","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-02T08:55:12.803601Z"},"links":{"citing_paper":"/paper/2607.00328"},"observation_digest":"sha256:1f067810d9d7636b09f1e3e43da0d1a9d558428e3ffecb6d7f21aa6809b168d2","observation_id":"2b9b7d01-f307-409b-88c4-d75c4bdefc49","resolution":{"observed_at":"2026-07-06T04:21:55.930382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-06T04:21:55.925257Z","title":null,"venue":null,"work_id":"e0a861df-15d8-4adc-b5b7-70c7e4d48762","year":2015},"citing_paper":{"arxiv_id":"2607.00328","last_updated":"2026-07-01T02:06:53Z","snapshot_observed_at":"2026-07-07T00:05:59.073754Z","submitted_at":"2026-07-01T02:06:53Z","title":"Killing the Case for Randomization in Dynamic Assortment Optimization","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-02T08:55:12.803601Z"},"links":{"citing_paper":"/paper/2607.00328"},"observation_digest":"sha256:ddb9b222468a34cd2998d1d821d0294a4b5d5837e858c7e126b58501038a93e9","observation_id":"51a1c149-82dd-4386-9ffa-c7954ca004b8","resolution":{"observed_at":"2026-07-06T04:21:55.926275Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-06T04:21:55.926902Z","title":"Talluri and G","venue":null,"work_id":"40005302-3d55-4144-8637-94fcc358c801","year":null},"citing_paper":{"arxiv_id":"2607.00328","last_updated":"2026-07-01T02:06:53Z","snapshot_observed_at":"2026-07-07T00:05:59.073754Z","submitted_at":"2026-07-01T02:06:53Z","title":"Killing the Case for Randomization in Dynamic Assortment Optimization","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-02T08:55:12.803601Z"},"links":{"citing_paper":"/paper/2607.00328"},"observation_digest":"sha256:2daf16fb37e59f43a64ad6b4ad3e10a6c3e0c3fe32378112f33a8265bc64e32d","observation_id":"5f7c083a-def6-47d3-9488-cd338839cc4a","resolution":{"observed_at":"2026-07-06T04:21:55.928265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-06T04:21:55.957456Z","title":"Davis and G","venue":null,"work_id":"7fc24384-7453-4f24-ab25-f31e19151cb7","year":2014},"citing_paper":{"arxiv_id":"2607.00328","last_updated":"2026-07-01T02:06:53Z","snapshot_observed_at":"2026-07-07T00:05:59.073754Z","submitted_at":"2026-07-01T02:06:53Z","title":"Killing the Case for Randomization in Dynamic Assortment Optimization","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-02T08:55:12.803601Z"},"links":{"citing_paper":"/paper/2607.00328"},"observation_digest":"sha256:75cbd48415c0b6d0fe136ac34b3d7079bc8377187f60f8f17acecc085f67bcb2","observation_id":"3d5339f4-0592-4131-9691-0fe3bbef427b","resolution":{"observed_at":"2026-07-06T04:21:55.958716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-06T04:21:55.959318Z","title":"Blanchet and G","venue":null,"work_id":"f30d0e55-6bb1-4343-8043-e48c76513abf","year":2016},"citing_paper":{"arxiv_id":"2607.00328","last_updated":"2026-07-01T02:06:53Z","snapshot_observed_at":"2026-07-07T00:05:59.073754Z","submitted_at":"2026-07-01T02:06:53Z","title":"Killing the Case for Randomization in Dynamic Assortment Optimization","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-02T08:55:12.803601Z"},"links":{"citing_paper":"/paper/2607.00328"},"observation_digest":"sha256:4169318edb60236b3fb12efe922d71ef3bf181edbf86b47fbad8e85ba1f1d860","observation_id":"deba3103-eb45-483f-bb9a-d7cae5277d3f","resolution":{"observed_at":"2026-07-06T04:21:55.960691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-06T04:21:55.965242Z","title":"Gallego and R","venue":null,"work_id":"6d519f63-b243-4e18-97a7-2bd104187471","year":2015},"citing_paper":{"arxiv_id":"2607.00328","last_updated":"2026-07-01T02:06:53Z","snapshot_observed_at":"2026-07-07T00:05:59.073754Z","submitted_at":"2026-07-01T02:06:53Z","title":"Killing the Case for Randomization in Dynamic Assortment Optimization","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-02T08:55:12.803601Z"},"links":{"citing_paper":"/paper/2607.00328"},"observation_digest":"sha256:2875a447a1873c6b84b27fe3571c7c769db877ba95216697335a7c969efa6cda","observation_id":"fe8b9bd0-1ec9-49d9-b810-5e0aeb2243a6","resolution":{"observed_at":"2026-07-06T04:21:55.966568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.00328","last_updated":"2026-07-01T02:06:53Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-07T00:05:59.073754Z","submitted_at":"2026-07-01T02:06:53Z","title":"Killing the Case for Randomization in Dynamic Assortment Optimization"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":17},"total_outbound_references":19},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2607.00328."}