{"as_of":"2026-08-09T22:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:100e8c5e82a830c663a3db97ec3a86fe299923a784b4431cc324924de3a4fe97","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-09T06:31:02.800959+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-08T05:20:08.148404Z","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-01T12:45:44.770320Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.08881","last_updated":"2025-06-12T11:06:40Z","snapshot_observed_at":"2026-08-06T15:56:29.516587Z","submitted_at":"2023-10-13T06:20:48Z","title":"Beyond Worst-Case Online Allocation via Dynamic Max-min Fairness","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.08881","snapshot_observed_at":"2026-08-08T05:20:08.148404Z","title":"Online resource sharing via dynamic max-min fairness: efficiency, robustness and non-stationarity","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.08412","last_updated":"2026-05-26T18:43:45Z","snapshot_observed_at":"2026-08-08T11:05:06.224167Z","submitted_at":"2025-02-12T13:53:21Z","title":"Non-Monetary Mechanism Design without Priors: Achieving Efficiency via Adaptive Costly Audits","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T05:20:08.148404Z"},"links":{"cited_paper":"/paper/2310.08881","citing_paper":"/paper/2502.08412"},"observation_digest":"sha256:a8cf149df99129b83f4f9aaeff4175014ce35ea9fd10acca9e9f09a7bb76623f","observation_id":"fd27d337-be15-40b7-98be-a33a32391e04","resolution":{"observed_at":"2026-08-08T05:20:08.148404Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.08881","last_updated":"2025-06-12T11:06:40Z","snapshot_observed_at":"2026-08-06T15:56:29.516587Z","submitted_at":"2023-10-13T06:20:48Z","title":"Beyond Worst-Case Online Allocation via Dynamic Max-min Fairness","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.08881","snapshot_observed_at":"2026-08-06T18:10:18.976296Z","title":"Online resource sharing via dynamic max-min fairness: efficiency, robustness and non-stationarity","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-07T15:01:01.579296Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:18.976296Z"},"links":{"cited_paper":"/paper/2310.08881","citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:fa5a1bc601fe311ec68c5ce6ba5bcc9e96d4fa12bd39785e6020b39e9065a54b","observation_id":"9b3824d2-33a8-478d-9197-63228184dc04","resolution":{"observed_at":"2026-08-06T18:10:18.976296Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.08881","last_updated":"2025-06-12T11:06:40Z","snapshot_observed_at":"2026-08-06T15:56:29.516587Z","submitted_at":"2023-10-13T06:20:48Z","title":"Beyond Worst-Case Online Allocation via Dynamic Max-min Fairness","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.08881","snapshot_observed_at":"2026-08-03T21:52:32.383398Z","title":"working paper at arXiv:2310.08881","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2511.15727","last_updated":"2026-07-06T13:20:34Z","snapshot_observed_at":"2026-08-08T03:17:22.337573Z","submitted_at":"2025-11-17T20:08:52Z","title":"Prior-free Collusion-proof Dynamic Mechanisms","version":2},"reference_index":241,"source":"pdf_text","source_observed_at":"2026-08-03T21:52:32.383398Z"},"links":{"cited_paper":"/paper/2310.08881","citing_paper":"/paper/2511.15727"},"observation_digest":"sha256:789027cde7c077a5acdba72a81ebc531d0b86f185003db16315a9b4d4b5107e1","observation_id":"29a9c078-9a91-4026-b3a3-1be88753e8a8","resolution":{"observed_at":"2026-08-03T21:52:32.383398Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.08881","last_updated":"2025-06-12T11:06:40Z","snapshot_observed_at":"2026-08-06T15:56:29.516587Z","submitted_at":"2023-10-13T06:20:48Z","title":"Beyond Worst-Case Online Allocation via Dynamic Max-min Fairness","version":4},"cited_work":{"arxiv_id":"2310.08881","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.08881","snapshot_observed_at":"2026-07-01T12:45:44.770320Z","title":"arXiv preprint arXiv:2310.08881 , year=","venue":null,"work_id":"0307177a-6200-4ca8-ac15-eaf14ea68934","year":null},"citing_paper":{"arxiv_id":"2606.30776","last_updated":"2026-07-14T12:45:35Z","snapshot_observed_at":"2026-08-08T00:49:10.012359Z","submitted_at":"2026-06-29T18:07:04Z","title":"Optimal Auction Design for Constrained Buyers","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-01T01:45:15.778548Z"},"links":{"cited_paper":"/paper/2310.08881","citing_paper":"/paper/2606.30776"},"observation_digest":"sha256:841acb9904649577eeb84a9eb6e5c4d770ae0ee270a531071e093fee2cebc4f2","observation_id":"cfcf4387-e73b-4dbc-ba34-dd5c8b9bb677","resolution":{"observed_at":"2026-07-01T12:45:44.771866Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2310.08881/citation-record","integrity":"/paper/2310.08881/integrity","json":"/paper/2310.08881/citation-record.json","paper":"/paper/2310.08881"},"outbound":[],"paper":{"arxiv_id":"2310.08881","last_updated":"2025-06-12T11:06:40Z","latest_version":4,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-06T15:56:29.516587Z","submitted_at":"2023-10-13T06:20:48Z","title":"Beyond Worst-Case Online Allocation via Dynamic Max-min Fairness"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2310.08881."}