Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Learning to Schedule Heuristics in Branch-and-Bound
As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2103.10294.
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-23T06:30:58.430688+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-14T14:42:14.839085Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-04T07:09:37.905393Z
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 4573a097-64cb-4f0d-8b39-44c33b0ad6d4 · inbound
How much data is sufficient to learn high-performing algorithms? Generalization guarantees for data-driven algorithm design cites this paper.
How much data is sufficient to learn high-performing algorithms? Generalization guarantees for data-driven algorithm design Learning to Schedule Heuristics in Branch-and-Bound
Reference 21
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T14:42:14.839085Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 5bec6ea0-7669-49a3-93aa-715b493d64be · inbound
A note on the convergence guarantees of RLT-based algorithms for polynomial optimization cites this paper.
A note on the convergence guarantees of RLT-based algorithms for polynomial optimization Learning to Schedule Heuristics in Branch-and-Bound
Reference 28
- Resolution
- verified exact
- arxiv_id, observed 2026-07-04T07:09:37.906831Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.