Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-01T10:30:55.659967Z
Paper Citation Record · LEDGER
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs
As of 15 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2607.20258.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
28 of 28 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved28
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation a80c2f38-1682-48d4-a9e3-65dd98663569 · outbound
This paper cites The Thirteenth International Conference on Learning Representations , year=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs The Thirteenth International Conference on Learning Representations , year=
Reference 1
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:52.212900Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 0135edc9-878d-4577-9201-d0686a7984a7 · outbound
This paper cites Advances in Neural Information Processing Systems , volume=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs Advances in Neural Information Processing Systems , volume=
Reference 2
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:52.329073Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 9d64ca9d-8924-4346-8e85-a38b5e685eb1 · outbound
This paper cites 2026 , booktitle=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs 2026 , booktitle=
Reference 3
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:52.511447Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation ae58ae43-6ede-4e08-b64f-5ee2b5d2f1c7 · outbound
This paper cites arXiv preprint arXiv:2602.12903 , year=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs arXiv preprint arXiv:2602.12903 , year=
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:52.707584Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 6131ed5e-63d7-4564-a6fc-b03355641f92 · outbound
This paper cites Tight Regret Bounds for Fixed-Price Bilateral Trade.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs Tight Regret Bounds for Fixed-Price Bilateral Trade
Reference 5
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:52.925442Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation aa9150ac-7231-4b3a-980d-245c563f18d7 · outbound
This paper cites Journal of economic theory , volume=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs Journal of economic theory , volume=
Reference 6
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:53.119495Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation cb84e391-438b-4688-8b6a-2a6904100d07 · outbound
This paper cites Profit Maximization in Bilateral Trade against a Smooth Adversary.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs Profit Maximization in Bilateral Trade against a Smooth Adversary
Reference 7
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:53.345766Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 091094dd-8da7-4b03-b272-5b050aff5787 · outbound
This paper cites The Sample Complexity of Uniform Approximation for Multi-Dimensional CDFs and Fixed-Price Mechanisms.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs The Sample Complexity of Uniform Approximation for Multi-Dimensional CDFs and Fixed-Price Mechanisms
Reference 8
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:53.509389Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 87eb8652-4da0-4381-bfba-d147c13d47c8 · outbound
This paper cites 44th Annual IEEE Symposium on Foundations of Computer Science, 2003.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs 44th Annual IEEE Symposium on Foundations of Computer Science, 2003
Reference 9
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:53.622724Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 14fb63bd-9f67-4f8c-8357-4ac91b14d9e5 · outbound
This paper cites Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=
Reference 10
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:53.792164Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation a8e4ab46-fb86-465f-99bb-8e6a245d37eb · outbound
This paper cites Advances in Neural Information Processing Systems , volume=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs Advances in Neural Information Processing Systems , volume=
Reference 11
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:53.969903Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 7345a293-c2a5-4339-b54c-ad91ce9aec83 · outbound
This paper cites Advances in Neural Information Processing Systems , volume=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs Advances in Neural Information Processing Systems , volume=
Reference 12
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:54.057777Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b41755bc-711a-4383-8277-6f570f8b480c · outbound
This paper cites Better Regret Rates in Bilateral Trade via Sublinear Budget Violation.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs Better Regret Rates in Bilateral Trade via Sublinear Budget Violation
Reference 13
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:54.150569Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 5ccd1f6a-9f61-4116-b6bc-39ef95db664e · outbound
This paper cites Statistics & Probability Letters , volume=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs Statistics & Probability Letters , volume=
Reference 14
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:54.159539Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 0f29eacf-0761-4907-93b9-ed0cc973ac6e · outbound
This paper cites The Annals of Mathematical Statistics , pages=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs The Annals of Mathematical Statistics , pages=
Reference 15
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:54.289724Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f6e893e3-781b-4f37-bc5c-1bcc6db5e891 · outbound
This paper cites The annals of Probability , pages=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs The annals of Probability , pages=
Reference 16
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:54.335013Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b3009aab-4a96-4b88-8fe1-97c1a84e2c87 · outbound
This paper cites Journal of the ACM (JACM) , volume=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs Journal of the ACM (JACM) , volume=
Reference 17
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:54.397100Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation a5d161ac-68ca-4137-9829-e86ccd6817f9 · outbound
This paper cites 2019 , publisher=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs 2019 , publisher=
Reference 18
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:54.506991Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e73831be-f8f8-45dc-9fe2-58141e5fd2df · outbound
This paper cites The Thirty Sixth Annual Conference on Learning Theory , pages=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs The Thirty Sixth Annual Conference on Learning Theory , pages=
Reference 19
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:54.574934Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e38c36fe-8aa4-4e29-ace8-7477e24ebfc1 · outbound
This paper cites Proceedings of the 56th Annual ACM Symposium on Theory of Computing , pages=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs Proceedings of the 56th Annual ACM Symposium on Theory of Computing , pages=
Reference 20
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:54.705698Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f774e7c8-c9e6-4640-b38f-3654394bd3e9 · outbound
This paper cites Artificial Intelligence , volume=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs Artificial Intelligence , volume=
Reference 21
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:54.764103Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 9e584707-48fd-482f-adca-e953314401f4 · outbound
This paper cites Proceedings of the 22nd ACM Conference on Economics and Computation , pages=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs Proceedings of the 22nd ACM Conference on Economics and Computation , pages=
Reference 22
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:54.837765Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c931acd0-65c8-45cc-9cfa-446b917b5cde · outbound
This paper cites Online Two-Sided Markets: Many Buyers Enhance Learning.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs Online Two-Sided Markets: Many Buyers Enhance Learning
Reference 23
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:55.052878Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 916525f4-0ee0-449a-9d25-5f1f918fd426 · outbound
This paper cites Proceedings of the 25th ACM Conference on Economics and Computation , pages=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs Proceedings of the 25th ACM Conference on Economics and Computation , pages=
Reference 24
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:55.139181Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f3af06a1-4844-46a6-9422-c8996a3c4766 · outbound
This paper cites Proceedings of the 25th ACM Conference on Economics and Computation , pages=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs Proceedings of the 25th ACM Conference on Economics and Computation , pages=
Reference 25
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:55.256846Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 974f0ea7-289f-4767-bb26-605c7d8c8fe5 · outbound
This paper cites Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade
Reference 26
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:55.393364Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 8cfd250b-997a-4f29-91de-722035229f78 · outbound
This paper cites Algorithmic Learning Theory , pages=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs Algorithmic Learning Theory , pages=
Reference 27
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:55.555890Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 8b706117-3ce3-4362-99fd-53caa3f11bb8 · outbound
This paper cites Mathematics of Operations Research , volume=.
Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs Mathematics of Operations Research , volume=
Reference 28
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T10:30:55.659967Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
No inbound Pith citation observations are available.