Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-06-29T11:32:07.863880Z
Paper Citation Record · LEDGER
Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints
As of 21 August 2026, this Paper Citation Record lists 4 of 4 outbound references and 0 inbound Pith citation observations for arXiv:2605.27814.
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
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
4 of 4 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved2
- parse uncertain0
- malformed identifier0
- metadata mismatch2
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation c9d22bd1-fcb9-4864-aee2-5d8b4661bd0f · outbound
This paper cites an unresolved cited work.
Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints Unresolved cited work
Reference 1
- Resolution
- metadata mismatch
- arxiv_id, observed 2026-06-29T11:33:22.629870Z
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.
Observation adfe60b7-4454-47e0-94c5-db06d4ad0cd2 · outbound
This paper cites Optim., 17 (2007), pp.
Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints Optim., 17 (2007), pp
Reference 2
- Resolution
- unresolved
- no resolver link, observed 2026-06-29T11:32:07.863880Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f785e332-d02c-444c-b25d-365ca1e6665e · outbound
This paper cites Introduction to Model-Based Derivative-Free Optimization.
Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints Introduction to Model-Based Derivative-Free Optimization
Reference 3
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-06-29T11:33:22.632160Z
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.
Observation 6415deb0-12a3-4a35-aa54-bdbcf161e43b · outbound
This paper cites Op- tim., 35 (2025), pp.
Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints Op- tim., 35 (2025), pp
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-06-29T11:32:07.863880Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
No inbound Pith citation observations are available.