Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Improved Sample Complexity Bounds for Branch-and-Cut
As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2111.11207.
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-16T06:30:59.297886+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-15T20:58:02.803315Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-11T03:50:58.041264Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation 65ba58d5-05b2-43bf-88cd-59378ad92bb3 · inbound
Learning complexity of gradient descent and conjugate gradient algorithms cites this paper.
Learning complexity of gradient descent and conjugate gradient algorithms Improved Sample Complexity Bounds for Branch-and-Cut
Reference 11
- Resolution
- unresolved
- no resolver link, observed 2026-08-11T13:12:21.499741Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 61fd2a81-ecaa-456b-b3cf-27e50285b257 · inbound
Generalization Guarantees for Learning Branch-and-Cut Policies in Integer Programming cites this paper.
Generalization Guarantees for Learning Branch-and-Cut Policies in Integer Programming Improved Sample Complexity Bounds for Branch-and-Cut
Reference 9
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T20:58:02.803315Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d2b03926-d241-4c85-a1cc-b7a4f959d0b8 · inbound
Sample Complexity of Stochastic Optimization with Integer Variables cites this paper.
Sample Complexity of Stochastic Optimization with Integer Variables Improved Sample Complexity Bounds for Branch-and-Cut
Reference 18
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T03:50:58.051027Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.