{"as_of":"2026-08-08T02:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d215c10d39426cea6f1ffb0dc095d4b216c184f86608f7a935ad917f1ab283b0","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T17:53:59.721855Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2603.21532/citation-record","integrity":"/paper/2603.21532/integrity","json":"/paper/2603.21532/citation-record.json","paper":"/paper/2603.21532"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:59.148962Z","title":"Hence, forℓ= 0,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:59.148962Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:36990ef9b1a0abae65fba20e21034e500177ad3d5fb1fbfa87587cf0ed7e97b6","observation_id":"8c6c0a6e-14fa-4810-ae16-46ed4323aad3","resolution":{"observed_at":"2026-08-02T17:53:59.148962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:59.571816Z","title":"Thus, once the constants{ρ e}and an initial sample bS∼µ ∗ are available, each arrival can be processed in polynomial time","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:59.571816Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:5441314a4447c573b0414c933c506c516939a5e70bb65f4abe6f2a86624e2c4f","observation_id":"5a1702c7-28ac-4067-a833-02131a9f0de5","resolution":{"observed_at":"2026-08-02T17:53:59.571816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:59.073230Z","title":"Proof of Theorem 4 (S-OCRS without solving concave program) Proof.Note thatP S∼µ[e∈S|S −e =T]is equal to eitherρ e or0","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:59.073230Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:8086dc14bfee01f50a4b9de43b567fd9f06785130a14f579ac58771a47eeff24","observation_id":"8c4273fd-c04f-487a-b826-ad2cd4c3f080","resolution":{"observed_at":"2026-08-02T17:53:59.073230Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.06893","last_updated":"2025-06-07T18:46:51Z","snapshot_observed_at":"2026-08-07T05:44:34.375300Z","submitted_at":"2025-06-07T18:46:51Z","title":"Online Job Assignment","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.06893","snapshot_observed_at":"2026-08-02T17:53:58.019212Z","title":"Online job assignment.arXiv preprint arXiv:2506.06893,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:58.019212Z"},"links":{"cited_paper":"/paper/2506.06893","citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:4f19b8e7b1084b0dcbe29b0ca0bb501fc6dd4fcff2afa140d102f06d8a8b81d9","observation_id":"f8774732-7b61-4885-9b77-7be8f73ef009","resolution":{"observed_at":"2026-08-02T17:53:58.019212Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:58.301379Z","title":"Robustness of online inventory balancing to inventory shocks.arXiv preprint arXiv:2511.16044,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:58.301379Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:ed844bc4745feff0ba7ef16bc3e5a8b25309325f45ec0a56768344632fdb38dc","observation_id":"997e8472-f478-49a4-a481-af22f84f7702","resolution":{"observed_at":"2026-08-02T17:53:58.301379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:59.385934Z","title":"Therefore,S 8 is not weakly Rayleigh","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:59.385934Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:30545c0137a6316beabf7c172dc7caeadfe04b967232636ef83ceb1446194093","observation_id":"c8283ae7-411e-4261-a4b9-28090cbb5e3e","resolution":{"observed_at":"2026-08-02T17:53:59.385934Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:58.663019Z","title":"Online contention resolution schemes for network revenue management and combi- natorial auctions","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:58.663019Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:4c058b91ecdd660eccfb5fa2739803cb47e7631164153342935ddf227316e0b1","observation_id":"51d9672e-88d7-4da7-bfb5-38988732bbbd","resolution":{"observed_at":"2026-08-02T17:53:58.663019Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:58.724374Z","title":"Concentration inequalities for log-concave sequences.International Mathematics Re- search Notices, 2026(4):rnag023,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:58.724374Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:a76e4fdb84ea0b353df2f40f44b6d7e9695a0ec517249457a8d63db8ceaaad78","observation_id":"2e50f86b-c589-45ec-a85f-944688236d13","resolution":{"observed_at":"2026-08-02T17:53:58.724374Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:59.004861Z","title":"Thereforelim sup ε→0 α≤( √ 3−1)/2, as claimed.□ EC.1.6","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:59.004861Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:ee9d554d29305452d2904210fbd9c66263dcc70f44ed04f4240768d784fbf93e","observation_id":"a99cb967-96f9-47a5-b899-084f5e7b3307","resolution":{"observed_at":"2026-08-02T17:53:59.004861Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:59.222698Z","title":"Similarly, from∆ iℓh≥0, divide byw k >0and letw k →0to obtain µ(B1)µ(B3)−µ(B 2)µ(B4)≥0","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:59.222698Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:ec2ae9cb0bf7eb3f922c1ccc26afd99a6f04a347b7338af0ac94e79c3e119ff6","observation_id":"017aff4b-6d8c-46d5-ae97-050d8337be9d","resolution":{"observed_at":"2026-08-02T17:53:59.222698Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:59.307102Z","title":"LetW M ⊆V M be the subspace of functions of the form ν(B) = X e∈B ve (B∈ B) for some vector(v e)e∈E ∈R E","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:59.307102Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:cda5e91b505c3c4f05cc5c42b2602a413f231cc98923d57216ff8cc2e5154c53","observation_id":"ebfd7abb-e547-49dd-815d-4b4fc529b001","resolution":{"observed_at":"2026-08-02T17:53:59.307102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:59.632667Z","title":"13 In our applications we takep=αxwith a fixedα <1, which placespin the relative interior ofPand ensures that an optimal dual solution exists with finite coordinates","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:59.632667Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:025d6f11e5826091de133f99064a991cfe9b1f09997b23f2674483ebf955da96","observation_id":"312cd88f-c887-4821-b04b-036efc9f097f","resolution":{"observed_at":"2026-08-02T17:53:59.632667Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:59.675674Z","title":"Letµ ∗ denote an optimal solution","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:59.675674Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:b91f6e66c2c0c5bfd68b8773bbead79355c21b2353a70d046ece0894bf23297e","observation_id":"40f9da2a-155f-4364-b2a9-1d785c0db32c","resolution":{"observed_at":"2026-08-02T17:53:59.675674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:59.721855Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:59.721855Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:6b9961e818de7cf3103837d5da63c088948cb86cd30ea03b57149c4ba2649a7d","observation_id":"15edd210-8f78-4e01-aa85-17be0994395e","resolution":{"observed_at":"2026-08-02T17:53:59.721855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:58.589772Z","title":"Optimal online contention resolution schemes via ex-ante prophet inequalities","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":1978,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:58.589772Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:5b6447b91e6f14cc9d7d5b12debad5b038e685f75ea431cd1623c785008944cb","observation_id":"d348ceae-eb35-40c2-badf-1322e2b81e26","resolution":{"observed_at":"2026-08-02T17:53:58.589772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:58.523271Z","title":"Jiashuo Jiang, Will Ma, and Jiawei Zhang","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":1986,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:58.523271Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:127327a4ab3dddd4142e8b9ee292ad22af37a820bac596ee0edc518011b0ff2b","observation_id":"64cbbbf8-8ade-480d-b410-7237337cc65f","resolution":{"observed_at":"2026-08-02T17:53:58.523271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:58.790575Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:58.790575Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:c6db4c65109a3b1b6dc004c18aa1b6c4580d0ea670f30a46178a26ccc8ecfcf2","observation_id":"5c6d1c93-ded3-45fb-b13f-a3d6744bfd65","resolution":{"observed_at":"2026-08-02T17:53:58.790575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:57.640358Z","title":"Posted price mechanisms for a random stream of customers","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:57.640358Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:54939ff3e010fe5d2f75d4972d567a7cb8d5313c2647e1df5ea87a0f12db890b","observation_id":"27557a34-668e-44f5-bd67-fea87b4de5dc","resolution":{"observed_at":"2026-08-02T17:53:57.640358Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.10412","last_updated":"2018-05-26T02:11:27Z","snapshot_observed_at":"2026-07-06T06:41:20.547019Z","submitted_at":"2018-05-26T02:11:27Z","title":"Online Advance Admission Scheduling for Services with Customer Preferences","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.10412","snapshot_observed_at":"2026-08-02T17:53:58.861680Z","title":"Online advance admission scheduling for services with customer preferences","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:58.861680Z"},"links":{"cited_paper":"/paper/1805.10412","citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:6a33014e179e4b25cd99f4d6055dc765f927e7652a879a3e61d3636175a5ff05","observation_id":"8ef005ed-c8bd-4f52-8080-0ec836bc201a","resolution":{"observed_at":"2026-08-02T17:53:58.861680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:57.551351Z","title":"New philosopher inequalities for online bayesian matching, via pivotal sampling","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:57.551351Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:4028aaa46d965587e4edd0bafc9ee8d2c71abe87bd4fe84f6b6b27e789c5dbc9","observation_id":"779d6e83-708b-43f1-90ae-1d3a26b67b40","resolution":{"observed_at":"2026-08-02T17:53:57.551351Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:58.936717Z","title":"The e-companion (EC) starts next page","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:58.936717Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:c225841cbefea8f78fb9f36b1a8f51491c571654ec4855924f49a594afe73013","observation_id":"9a674374-eb55-4c71-9766-38792f0b431c","resolution":{"observed_at":"2026-08-02T17:53:58.936717Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:58.156177Z","title":"Nearly tight sample complexity for matroid online contention resolution","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:58.156177Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:f7dfab0d95d2b16abaef7172d9dd60b35ab024f8bd3aa0696f186ca584c031c0","observation_id":"a6fed7f4-c3fe-4809-a389-37c0fb564377","resolution":{"observed_at":"2026-08-02T17:53:58.156177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:58.441392Z","title":"Asymptotically optimal competitive ratio for online allocation of reusable resources","venue":null,"work_id":null,"year":1915},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:58.441392Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:dcb1ddb1e8c356218241617b56277ff4d9e21829f7f5fecc1c8de4ade77eeef2","observation_id":"3b3390cc-a6cc-4d19-b233-57810c5fa6d3","resolution":{"observed_at":"2026-08-02T17:53:58.441392Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:57.859133Z","title":"Simple and optimal online contention resolution schemes for k-uniform matroids","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:57.859133Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:f5fede140c8fcd3355f4e9493cccc536ac6e23a0ed16f8719c8c48b7674cebe9","observation_id":"e5e09252-b326-4b7c-8527-30017a5e2c30","resolution":{"observed_at":"2026-08-02T17:53:57.859133Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:58.373928Z","title":"Random order vertex arrival contention resolution schemes for matching, with applications","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:58.373928Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:38b6549b1c6ebc713e81866e342df0cd2f85cf65df4a7902b99c2f4b567abace","observation_id":"ca144844-5b8d-4fa6-9db5-c7653288e94c","resolution":{"observed_at":"2026-08-02T17:53:58.373928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:53:57.472588Z","title":"Nearly optimal pricing algorithms for production constrained and laminar bayesian selection","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes","version":2},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-02T17:53:57.472588Z"},"links":{"citing_paper":"/paper/2603.21532"},"observation_digest":"sha256:d2c1b9dee71ed63facbd4c117d4c5d8735d09ed18af61018b46da6374aec18f8","observation_id":"dd00c9a7-362d-480c-8bb2-f118761fcede","resolution":{"observed_at":"2026-08-02T17:53:57.472588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2603.21532","last_updated":"2026-07-15T18:46:05Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-07T06:49:59.629992Z","submitted_at":"2026-03-23T03:43:31Z","title":"Stationary Online Contention Resolution Schemes"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":26,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":26},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2603.21532."}