Paper Citation Record · LEDGER

Stationary Online Contention Resolution Schemes

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2603.21532 v2

Coverage vector

measured 26 of 26 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-02T17:53:59.721855Z

measured 26 of 26 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

26 of 26 outbound references displayed

verified exact0
verified fuzzy0
unresolved26
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 8c6c0a6e-14fa-4810-ae16-46ed4323aad3 · outbound

This paper cites Hence, forℓ= 0,.

Stationary Online Contention Resolution Schemes Hence, forℓ= 0,

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:59.148962Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5a1702c7-28ac-4067-a833-02131a9f0de5 · outbound

This paper cites Thus, once the constants{ρ e}and an initial sample bS∼µ ∗ are available, each arrival can be processed in polynomial time.

Stationary Online Contention Resolution Schemes Thus, once the constants{ρ e}and an initial sample bS∼µ ∗ are available, each arrival can be processed in polynomial time

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:59.571816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8c4273fd-c04f-487a-b826-ad2cd4c3f080 · outbound

This paper cites 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.

Stationary Online Contention Resolution Schemes 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

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:59.073230Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f8774732-7b61-4885-9b77-7be8f73ef009 · outbound

This paper cites Online Job Assignment.

Stationary Online Contention Resolution Schemes Online Job Assignment

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:58.019212Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 997e8472-f478-49a4-a481-af22f84f7702 · outbound

This paper cites Robustness of online inventory balancing to inventory shocks.arXiv preprint arXiv:2511.16044,.

Stationary Online Contention Resolution Schemes Robustness of online inventory balancing to inventory shocks.arXiv preprint arXiv:2511.16044,

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:58.301379Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c8283ae7-411e-4261-a4b9-28090cbb5e3e · outbound

This paper cites Therefore,S 8 is not weakly Rayleigh.

Stationary Online Contention Resolution Schemes Therefore,S 8 is not weakly Rayleigh

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:59.385934Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 51d9672e-88d7-4da7-bfb5-38988732bbbd · outbound

This paper cites Online contention resolution schemes for network revenue management and combi- natorial auctions.

Stationary Online Contention Resolution Schemes Online contention resolution schemes for network revenue management and combi- natorial auctions

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:58.663019Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2e50f86b-c589-45ec-a85f-944688236d13 · outbound

This paper cites Concentration inequalities for log-concave sequences.International Mathematics Re- search Notices, 2026(4):rnag023,.

Stationary Online Contention Resolution Schemes Concentration inequalities for log-concave sequences.International Mathematics Re- search Notices, 2026(4):rnag023,

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:58.724374Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a99cb967-96f9-47a5-b899-084f5e7b3307 · outbound

This paper cites Thereforelim sup ε→0 α≤( √ 3−1)/2, as claimed.□ EC.1.6.

Stationary Online Contention Resolution Schemes Thereforelim sup ε→0 α≤( √ 3−1)/2, as claimed.□ EC.1.6

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:59.004861Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 017aff4b-6d8c-46d5-ae97-050d8337be9d · outbound

This paper cites Similarly, from∆ iℓh≥0, divide byw k >0and letw k →0to obtain µ(B1)µ(B3)−µ(B 2)µ(B4)≥0.

Stationary Online Contention Resolution Schemes Similarly, from∆ iℓh≥0, divide byw k >0and letw k →0to obtain µ(B1)µ(B3)−µ(B 2)µ(B4)≥0

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:59.222698Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ebfd7abb-e547-49dd-815d-4b4fc529b001 · outbound

This paper cites 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.

Stationary Online Contention Resolution Schemes 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

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:59.307102Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 312cd88f-c887-4821-b04b-036efc9f097f · outbound

This paper cites 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.

Stationary Online Contention Resolution Schemes 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

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:59.632667Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 40f9da2a-155f-4364-b2a9-1d785c0db32c · outbound

This paper cites Letµ ∗ denote an optimal solution.

Stationary Online Contention Resolution Schemes Letµ ∗ denote an optimal solution

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:59.675674Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 15edd210-8f78-4e01-aa85-17be0994395e · outbound

This paper cites an unresolved cited work.

Stationary Online Contention Resolution Schemes Unresolved cited work

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:59.721855Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d348ceae-eb35-40c2-badf-1322e2b81e26 · outbound

This paper cites Optimal online contention resolution schemes via ex-ante prophet inequalities.

Stationary Online Contention Resolution Schemes Optimal online contention resolution schemes via ex-ante prophet inequalities

Reference 1978

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:58.589772Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 64cbbbf8-8ade-480d-b410-7237337cc65f · outbound

This paper cites Jiashuo Jiang, Will Ma, and Jiawei Zhang.

Stationary Online Contention Resolution Schemes Jiashuo Jiang, Will Ma, and Jiawei Zhang

Reference 1986

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:58.523271Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5c6d1c93-ded3-45fb-b13f-a3d6744bfd65 · outbound

This paper cites an unresolved cited work.

Stationary Online Contention Resolution Schemes Unresolved cited work

Reference 1999

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:58.790575Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 27557a34-668e-44f5-bd67-fea87b4de5dc · outbound

This paper cites Posted price mechanisms for a random stream of customers.

Stationary Online Contention Resolution Schemes Posted price mechanisms for a random stream of customers

Reference 2006

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:57.640358Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8ef005ed-c8bd-4f52-8080-0ec836bc201a · outbound

This paper cites Online Advance Admission Scheduling for Services with Customer Preferences.

Stationary Online Contention Resolution Schemes Online Advance Admission Scheduling for Services with Customer Preferences

Reference 2008

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:58.861680Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 779d6e83-708b-43f1-90ae-1d3a26b67b40 · outbound

This paper cites New philosopher inequalities for online bayesian matching, via pivotal sampling.

Stationary Online Contention Resolution Schemes New philosopher inequalities for online bayesian matching, via pivotal sampling

Reference 2010

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:57.551351Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9a674374-eb55-4c71-9766-38792f0b431c · outbound

This paper cites The e-companion (EC) starts next page.

Stationary Online Contention Resolution Schemes The e-companion (EC) starts next page

Reference 2011

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:58.936717Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a6fed7f4-c3fe-4809-a389-37c0fb564377 · outbound

This paper cites Nearly tight sample complexity for matroid online contention resolution.

Stationary Online Contention Resolution Schemes Nearly tight sample complexity for matroid online contention resolution

Reference 2021

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:58.156177Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3b3390cc-a6cc-4d19-b233-57810c5fa6d3 · outbound

This paper cites Asymptotically optimal competitive ratio for online allocation of reusable resources.

Stationary Online Contention Resolution Schemes Asymptotically optimal competitive ratio for online allocation of reusable resources

Reference 2022

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:58.441392Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e5e09252-b326-4b7c-8527-30017a5e2c30 · outbound

This paper cites Simple and optimal online contention resolution schemes for k-uniform matroids.

Stationary Online Contention Resolution Schemes Simple and optimal online contention resolution schemes for k-uniform matroids

Reference 2024

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:57.859133Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ca144844-5b8d-4fa6-9db5-c7653288e94c · outbound

This paper cites Random order vertex arrival contention resolution schemes for matching, with applications.

Stationary Online Contention Resolution Schemes Random order vertex arrival contention resolution schemes for matching, with applications

Reference 2025

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:58.373928Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dd00c9a7-362d-480c-8bb2-f118761fcede · outbound

This paper cites Nearly optimal pricing algorithms for production constrained and laminar bayesian selection.

Stationary Online Contention Resolution Schemes Nearly optimal pricing algorithms for production constrained and laminar bayesian selection

Reference 2026

Resolution: unresolved; no resolver link, observed 2026-08-02T17:53:57.472588Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.