{"as_of":"2026-08-18T00:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:43cd2c46909b107b09965859d05672ffc7da17a8dce5ccb17f6f2dcf176e6613","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-17T06:30:58.91139+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-06T18:11:14.902810Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T21:31:14.008705Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2011.06327","last_updated":"2022-07-06T18:38:54Z","snapshot_observed_at":"2026-08-16T19:06:21.479394Z","submitted_at":"2020-11-12T11:50:06Z","title":"Near-Optimal Primal-Dual Algorithms for Quantity-Based Network Revenue Management","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.06327","snapshot_observed_at":"2026-08-06T18:11:14.902810Z","title":"Near-optimal primal-dual algorithms for quantity-based network revenue management","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:14.902810Z"},"links":{"cited_paper":"/paper/2011.06327","citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:a13ea8409386f84df0066f057a62b9f6600d19368e9c9199959716f84a0c653e","observation_id":"5f776c28-2758-4907-988b-888f46f7fe93","resolution":{"observed_at":"2026-08-06T18:11:14.902810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.06327","last_updated":"2022-07-06T18:38:54Z","snapshot_observed_at":"2026-08-16T19:06:21.479394Z","submitted_at":"2020-11-12T11:50:06Z","title":"Near-Optimal Primal-Dual Algorithms for Quantity-Based Network Revenue Management","version":4},"cited_work":{"arxiv_id":"2011.06327","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.06327","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2011.06327 , year=","venue":null,"work_id":"9fef65bb-7be5-4c91-8c87-2a4dce749fdf","year":2011},"citing_paper":{"arxiv_id":"2605.06113","last_updated":"2026-05-08T02:53:17Z","snapshot_observed_at":"2026-07-06T23:18:36.537416Z","submitted_at":"2026-05-07T12:25:38Z","title":"Tackling the Data-Parallel Load Balancing Bottleneck in LLM Serving: Practical Online Routing at Scale","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-08T05:22:14.122156Z"},"links":{"cited_paper":"/paper/2011.06327","citing_paper":"/paper/2605.06113"},"observation_digest":"sha256:e73fc527e8cc092235b4990952d4cd25cc71241809abe0525a01d23231d82ae7","observation_id":"20a90b2b-ea09-4d4f-a819-4799d8a2fc1d","resolution":{"observed_at":"2026-05-11T21:31:14.013011Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.06327","last_updated":"2022-07-06T18:38:54Z","snapshot_observed_at":"2026-08-16T19:06:21.479394Z","submitted_at":"2020-11-12T11:50:06Z","title":"Near-Optimal Primal-Dual Algorithms for Quantity-Based Network Revenue Management","version":4},"cited_work":{"arxiv_id":"2011.06327","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.06327","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2011.06327 , year=","venue":null,"work_id":"9fef65bb-7be5-4c91-8c87-2a4dce749fdf","year":2011},"citing_paper":{"arxiv_id":"2605.06113","last_updated":"2026-05-08T02:53:17Z","snapshot_observed_at":"2026-07-06T23:18:36.537416Z","submitted_at":"2026-05-07T12:25:38Z","title":"Tackling the Data-Parallel Load Balancing Bottleneck in LLM Serving: Practical Online Routing at Scale","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-11T00:59:57.639525Z"},"links":{"cited_paper":"/paper/2011.06327","citing_paper":"/paper/2605.06113"},"observation_digest":"sha256:c1fe9a4b2c27abfcbde28bf848b038d9372a53478c5a0666b759e01e1ee9f169","observation_id":"d97cab97-de54-40b4-a4be-85a35f4abdf6","resolution":{"observed_at":"2026-05-11T04:55:56.846997Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.06327","last_updated":"2022-07-06T18:38:54Z","snapshot_observed_at":"2026-08-16T19:06:21.479394Z","submitted_at":"2020-11-12T11:50:06Z","title":"Near-Optimal Primal-Dual Algorithms for Quantity-Based Network Revenue Management","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.06327","snapshot_observed_at":"2026-07-11T22:49:10.064714Z","title":"arXiv preprint arXiv:2011.06327 , year=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"cited_paper":"/paper/2011.06327","citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:abd848ca6ecb8f3487a50367430eaa22f21997e6056a05a9eee1249970530d94","observation_id":"f064ae84-8182-4e31-8e48-e359e7607cd9","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2011.06327/citation-record","integrity":"/paper/2011.06327/integrity","json":"/paper/2011.06327/citation-record.json","paper":"/paper/2011.06327"},"outbound":[],"paper":{"arxiv_id":"2011.06327","last_updated":"2022-07-06T18:38:54Z","latest_version":4,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T19:06:21.479394Z","submitted_at":"2020-11-12T11:50:06Z","title":"Near-Optimal Primal-Dual Algorithms for Quantity-Based Network Revenue Management"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2011.06327."}