Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Boosting Gradient Ascent for Continuous DR-submodular Maximization
As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2401.08330.
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-10T06:31:04.303077+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-08T20:42:39.027006Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-08T20:42:39.084831Z
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 d145699e-4209-4e17-b01a-5e04ddec62cb · inbound
Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency cites this paper.
Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency Boosting Gradient Ascent for Continuous DR-submodular Maximization
Reference 83
- Resolution
- verified exact
- local_arxiv, observed 2026-08-08T20:42:39.090502Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation df46b960-6def-4d4d-9815-7c29081efcb0 · inbound
Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets cites this paper.
Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets Boosting Gradient Ascent for Continuous DR-submodular Maximization
Reference 2023
- Resolution
- unresolved
- no resolver link, observed 2026-08-02T21:28:26.156125Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.