{"as_of":"2026-08-14T19:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:723ea1d65a407be0f2341ea53df596186557bcff8de20cc31130fa6449b9e4bc","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:06:42.795049Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-05T10:20:57.165610Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2208.07341","last_updated":"2025-02-21T02:39:37Z","snapshot_observed_at":"2026-08-14T15:15:18.074910Z","submitted_at":"2022-08-15T17:16:15Z","title":"Fair Assortment Planning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.07341","snapshot_observed_at":"2026-08-06T20:06:42.795049Z","title":"Fair assortment planning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.04156","last_updated":"2025-08-11T21:35:24Z","snapshot_observed_at":"2026-08-08T10:50:29.846060Z","submitted_at":"2025-07-05T20:45:18Z","title":"Adaptive Two-sided Assortment Optimization: Revenue Maximization","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T20:06:42.795049Z"},"links":{"cited_paper":"/paper/2208.07341","citing_paper":"/paper/2507.04156"},"observation_digest":"sha256:1780e36c8ca08b88e49b6adcd155b975e1a88dae9bef031f2508e0a0e8fc5643","observation_id":"f249673a-5fcf-4fce-8660-68b218ca8d7f","resolution":{"observed_at":"2026-08-06T20:06:42.795049Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.07341","last_updated":"2025-02-21T02:39:37Z","snapshot_observed_at":"2026-08-14T15:15:18.074910Z","submitted_at":"2022-08-15T17:16:15Z","title":"Fair Assortment Planning","version":5},"cited_work":{"arxiv_id":"2208.07341","doi":null,"metadata_source":"pith","pith_arxiv_id":"2208.07341","snapshot_observed_at":"2026-07-05T10:20:57.165610Z","title":"Fair assortment planning","venue":"cs.DS","work_id":"9b732053-d803-4380-a930-942d1d1069a9","year":2022},"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":12,"source":"arxiv_source","source_observed_at":"2026-05-10T02:54:16.836240Z"},"links":{"cited_paper":"/paper/2208.07341","citing_paper":"/paper/2604.18800"},"observation_digest":"sha256:b8e7d8c1166932aca1abbb9d752d76485c192224556a330b4974160b69bd3737","observation_id":"ad18b5ab-b35e-4c5f-a8a7-eecf9edaef72","resolution":{"observed_at":"2026-05-11T12:51:02.767101Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.07341","last_updated":"2025-02-21T02:39:37Z","snapshot_observed_at":"2026-08-14T15:15:18.074910Z","submitted_at":"2022-08-15T17:16:15Z","title":"Fair Assortment Planning","version":5},"cited_work":{"arxiv_id":"2208.07341","doi":null,"metadata_source":"pith","pith_arxiv_id":"2208.07341","snapshot_observed_at":"2026-07-05T10:20:57.165610Z","title":"Fair assortment planning","venue":"cs.DS","work_id":"9b732053-d803-4380-a930-942d1d1069a9","year":2022},"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":12,"source":"arxiv_source","source_observed_at":"2026-07-05T10:20:16.326364Z"},"links":{"cited_paper":"/paper/2208.07341","citing_paper":"/paper/2604.18800"},"observation_digest":"sha256:1bb5889b73a680bdfcc2db5f51d4a3507c885406208927a79ed8ff646e3a0252","observation_id":"3212790f-b0fb-407c-965e-0480176b1bf9","resolution":{"observed_at":"2026-07-05T10:20:57.170284Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.07341","last_updated":"2025-02-21T02:39:37Z","snapshot_observed_at":"2026-08-14T15:15:18.074910Z","submitted_at":"2022-08-15T17:16:15Z","title":"Fair Assortment Planning","version":5},"cited_work":{"arxiv_id":"2208.07341","doi":null,"metadata_source":"pith","pith_arxiv_id":"2208.07341","snapshot_observed_at":"2026-07-05T10:20:57.165610Z","title":"Fair assortment planning","venue":"cs.DS","work_id":"9b732053-d803-4380-a930-942d1d1069a9","year":2022},"citing_paper":{"arxiv_id":"2606.06830","last_updated":"2026-06-05T02:12:07Z","snapshot_observed_at":"2026-08-07T05:58:07.256351Z","submitted_at":"2026-06-05T02:12:07Z","title":"Learning Fair Demand Models","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-06-27T20:59:38.970332Z"},"links":{"cited_paper":"/paper/2208.07341","citing_paper":"/paper/2606.06830"},"observation_digest":"sha256:8bcd3f15b8a0da5a76dc3a805b57bf5a5b7c961bd8b71419a8bde263a847bc52","observation_id":"c17944a8-491d-4239-9964-bcff25922eea","resolution":{"observed_at":"2026-07-02T20:07:21.760005Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2208.07341/citation-record","integrity":"/paper/2208.07341/integrity","json":"/paper/2208.07341/citation-record.json","paper":"/paper/2208.07341"},"outbound":[],"paper":{"arxiv_id":"2208.07341","last_updated":"2025-02-21T02:39:37Z","latest_version":5,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T15:15:18.074910Z","submitted_at":"2022-08-15T17:16:15Z","title":"Fair Assortment Planning"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2208.07341."}