{"as_of":"2026-08-18T15:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8931e168fa8fe92c55849591b6b8529eee2ff9e9bb455f6a6c7ea260941766e7","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T14:07:48.070833Z","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-08-06T18:11:15.214668Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.02403","last_updated":"2024-08-05T11:55:41Z","snapshot_observed_at":"2026-08-16T13:28:30.871111Z","submitted_at":"2024-08-05T11:55:41Z","title":"Online Fair Allocation with Best-of-Many-Worlds Guarantees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.02403","snapshot_observed_at":"2026-08-10T14:07:48.070833Z","title":"Max-min Fair Resource Allocation in SD-RAN","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2501.15782","last_updated":"2025-01-27T05:02:05Z","snapshot_observed_at":"2026-08-10T13:54:44.293139Z","submitted_at":"2025-01-27T05:02:05Z","title":"Online Allocation with Multi-Class Arrivals: Group Fairness vs Individual Welfare","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-10T14:07:48.070833Z"},"links":{"cited_paper":"/paper/2408.02403","citing_paper":"/paper/2501.15782"},"observation_digest":"sha256:fd57e103e0d74870fbcb0ca8eb5ad391c4dbe92b90720c3cce3e491a9ba90dd6","observation_id":"026bf627-09d0-4e08-abea-aeb0bd17c04f","resolution":{"observed_at":"2026-08-10T14:07:48.070833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.02403","last_updated":"2024-08-05T11:55:41Z","snapshot_observed_at":"2026-08-16T13:28:30.871111Z","submitted_at":"2024-08-05T11:55:41Z","title":"Online Fair Allocation with Best-of-Many-Worlds Guarantees","version":1},"cited_work":{"arxiv_id":"2408.02403","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.02403","snapshot_observed_at":"2026-08-06T18:11:15.214668Z","title":"Online Fair Allocation with Best-of-Many-Worlds Guarantees","venue":"cs.GT","work_id":"eb903963-e048-4730-9ec8-7e79970ea1ce","year":2024},"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":60,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:15.031185Z"},"links":{"cited_paper":"/paper/2408.02403","citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:54214954144fac0c84b3a0c7dc8c86079e8e85f299360f882bb63b0077300252","observation_id":"c0376f96-0693-46a1-ad94-1e82253fab62","resolution":{"observed_at":"2026-08-06T18:11:15.259108Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2408.02403/citation-record","integrity":"/paper/2408.02403/integrity","json":"/paper/2408.02403/citation-record.json","paper":"/paper/2408.02403"},"outbound":[],"paper":{"arxiv_id":"2408.02403","last_updated":"2024-08-05T11:55:41Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-16T13:28:30.871111Z","submitted_at":"2024-08-05T11:55:41Z","title":"Online Fair Allocation with Best-of-Many-Worlds Guarantees"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2408.02403."}