Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-04T00:28:36.688453Z
Paper Citation Record · LEDGER
Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization
As of 21 August 2026, this Paper Citation Record lists 8 of 8 outbound references and 1 inbound Pith citation observation for arXiv:2511.02082.
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-21T06:32:19.484+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-02T05:51:02.422512Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-05T02:28:24.338817Z
Reference resolution
8 of 8 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved8
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
0
pith, observed 2026-08-05T02:28:24.338817Z
Outbound references
Observation bf5839b2-da98-4e46-9ce1-752923e1b526 · outbound
This paper cites an unresolved cited work.
Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization Unresolved cited work
Reference 1
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T00:28:36.054623Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 3e680a9f-ba71-47a7-a10d-b72efc68211e · outbound
This paper cites Proceedings of the 56th Annual ACM Symposium on Theory of Computing (2024).
Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization Proceedings of the 56th Annual ACM Symposium on Theory of Computing (2024)
Reference 2
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T00:28:36.165566Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 3ceab218-3979-4081-99bc-30d42fcd87b7 · outbound
This paper cites Efficient Convex Optimization Requires Superlinear Memory.
Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization Efficient Convex Optimization Requires Superlinear Memory
Reference 3
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T00:28:36.204967Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 59905b1f-496a-401b-8d3f-f91165695e4b · outbound
This paper cites Ekonomika i matem.
Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization Ekonomika i matem
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T00:28:36.293088Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 88eee298-47a9-40ce-99b1-ed04e938b54b · outbound
This paper cites 1986 25th IEEE Conference on Decision and Control pp.
Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization 1986 25th IEEE Conference on Decision and Control pp
Reference 5
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T00:28:36.388225Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation ada52d6b-492b-4383-9278-f2b219ea4f83 · outbound
This paper cites The Communication Complexity of Optimization.
Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization The Communication Complexity of Optimization
Reference 6
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T00:28:36.469338Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 450ad930-5d7f-4657-86f3-f920d833ced3 · outbound
This paper cites , " * write output.state after.block = add.period write.
Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization , " * write output.state after.block = add.period write
Reference 7
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T00:28:36.580406Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 34a83bd0-e323-4cd5-87f5-32dc3557f6a3 · outbound
This paper cites write newline.
Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization write newline
Reference 8
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T00:28:36.688453Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
Observation 23565f54-ecbc-444e-878a-09fc742b387c · inbound
Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values cites this paper.
Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization
Reference 14
- Resolution
- verified exact
- local_arxiv, observed 2026-08-02T05:54:09.970584Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.