Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-02T21:28:26.785507Z
Paper Citation Record · LEDGER
Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets
As of 11 August 2026, this Paper Citation Record lists 9 of 9 outbound references and 0 inbound Pith citation observations for arXiv:2602.20578.
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
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
9 of 9 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved9
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 3b02b64c-bb66-4f40-afeb-fe18252c3563 · outbound
This paper cites 17 As a special case, whenK=O(1), then we have RA′ α,Advo i (F,B)(KT ⋆ )[a,b] =O ( BT 1 2−η ).
Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets 17 As a special case, whenK=O(1), then we have RA′ α,Advo i (F,B)(KT ⋆ )[a,b] =O ( BT 1 2−η )
Reference 1
- Resolution
- unresolved
- no resolver link, observed 2026-08-02T21:28:26.785507Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 963c22b7-1ade-447d-b392-5c97140fb022 · outbound
This paper cites As noted by Garber & Kretzu (2022), for the nuclear norm ball, the LOO is efficient while the SO is expensive.
Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets As noted by Garber & Kretzu (2022), for the nuclear norm ball, the LOO is efficient while the SO is expensive
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-08-02T21:28:26.315569Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 26adfbd5-c3b4-4b16-aaf1-301044b1155b · outbound
This paper cites 6:ify i /∈Kthen 7:Setg i to be the hyperplane returned by SOK (i.e.,∀x∈K,⟨y i−x,g i⟩>0).
Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets 6:ify i /∈Kthen 7:Setg i to be the hyperplane returned by SOK (i.e.,∀x∈K,⟨y i−x,g i⟩>0)
Reference 5
- Resolution
- unresolved
- no resolver link, observed 2026-08-02T21:28:26.368349Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d7c2e190-c3b9-4545-9254-09306e0c3365 · outbound
This paper cites LetU⊆K T be a compact set and let ˆU = (1− δ r )U + δ r c.
Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets LetU⊆K T be a compact set and let ˆU = (1− δ r )U + δ r c
Reference 6
- Resolution
- unresolved
- no resolver link, observed 2026-08-02T21:28:26.475530Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4e43c517-bfd0-4b6c-8f6b-8419088b21be · outbound
This paper cites an unresolved cited work.
Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets Unresolved cited work
Reference 7
- Resolution
- unresolved
- no resolver link, observed 2026-08-02T21:28:26.610870Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation cccf26ae-92c9-48bd-9899-2257ebb7a6c8 · outbound
This paper cites D.4 Stochastic Full-information To Trivial query (SFTT) Algorithm 8Stochastic Full-information To Trivial query - SFTT(A) 1:Input:base algorithmA, horizonT, block sizeL>K.
Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets D.4 Stochastic Full-information To Trivial query (SFTT) Algorithm 8Stochastic Full-information To Trivial query - SFTT(A) 1:Input:base algorithmA, horizonT, block sizeL>K
Reference 8
- Resolution
- unresolved
- no resolver link, observed 2026-08-02T21:28:26.672206Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 953c6668-c2b7-404b-a219-daf46f9f4f8d · outbound
This paper cites Lemma 3(Lemma 2.1, Buchbinder & Feldman (2024)).Letf be a non-negative continuous DR-submodular function over[0,1] d.
Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets Lemma 3(Lemma 2.1, Buchbinder & Feldman (2024)).Letf be a non-negative continuous DR-submodular function over[0,1] d
Reference 2003
- Resolution
- unresolved
- no resolver link, observed 2026-08-02T21:28:26.249989Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation df46b960-6def-4d4d-9815-7c29081efcb0 · outbound
This paper cites Boosting Gradient Ascent for Continuous DR-submodular Maximization.
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.
Observation 0b6596fd-207d-4683-a02d-d94b95a830fc · outbound
This paper cites Online continuous submodular maximization.
Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets Online continuous submodular maximization
Reference 2024
- Resolution
- unresolved
- no resolver link, observed 2026-08-02T21:28:26.044941Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
No inbound Pith citation observations are available.