Pith. sign in

Paper Citation Record · LEDGER

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization

As of 15 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:1909.00171.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
1909.00171 v1

Coverage vector

measured 12 of 12 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-14T06:24:14.790317Z

measured 12 of 12 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

12 of 12 outbound references displayed

  • verified exact2
  • verified fuzzy6
  • unresolved4
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation c511572d-41e0-4942-9cd7-1d560929d394 · outbound

This paper cites The ellipsoid method and its consequences in combinatorial optimization.

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization The ellipsoid method and its consequences in combinatorial optimization

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T06:24:14.980913Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=pdf_text observed=2026-08-14T06:24:14.758382Z digest=sha256:2d4072a4c722608e1befb3edd0c5438e0ee646b139bf9fceea6d4da3bfb6ca37

Observation 8236d04d-14aa-495e-8c28-67fa67d27eee · outbound

This paper cites Primal-dual accelerated gradient methods with small-dimensional relaxation oracle.

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization Primal-dual accelerated gradient methods with small-dimensional relaxation oracle

Reference 12

Resolution
verified exact
local_arxiv, observed 2026-08-14T06:24:14.836151Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=pdf_text observed=2026-08-14T06:24:14.790317Z digest=sha256:2d4328048e30b81ee89baf4d58e05f9d322a820369fadc9d57ad6a4ddb9ba9d8

Observation 4790b4d9-6cc1-49e2-8ce7-913d8cb8bde7 · outbound

This paper cites Provable submodular minimization using wolfe’s algorithm.

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization Provable submodular minimization using wolfe’s algorithm

Reference 1954

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T06:24:15.018711Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=pdf_text observed=2026-08-14T06:24:14.742967Z digest=sha256:7b25d43c1f9f3977d3b6fe66f27a40340ba5ff017f42985f4571203995f7dd3d

Observation 818bfcfc-4652-4bc4-b070-920a83d90bc9 · outbound

This paper cites A faste r cutting plane method and its implications for combinatorial and convex optimization.

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization A faste r cutting plane method and its implications for combinatorial and convex optimization

Reference 1983

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T06:24:14.929394Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=pdf_text observed=2026-08-14T06:24:14.785341Z digest=sha256:78770caed9158a8a8c627a132e55ed943fb19da12f66127054d20171d1622cf4

Observation a67b4540-c1f3-40c3-8401-23948d68c05d · outbound

This paper cites Accelerated Methods for Non-Convex Optimization.

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization Accelerated Methods for Non-Convex Optimization

Reference 1999

Resolution
unresolved
no resolver link, observed 2026-08-14T06:24:14.732455Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T06:24:14.732455Z digest=sha256:d0941ae3fca80fffbeb92f348823c23b89f7256cc41eda917fbb61f99e9263c0

Observation 0fb5db15-0aef-474c-b466-992e9fc7dca8 · outbound

This paper cites Accelerated Methods for $\alpha$-Weakly-Quasi-Convex Problems.

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization Accelerated Methods for $\alpha$-Weakly-Quasi-Convex Problems

Reference 2005

Resolution
unresolved
no resolver link, observed 2026-08-14T06:24:14.747765Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T06:24:14.747765Z digest=sha256:c7143e24c2c966079c2dc910360c2b805644ca41e600d673e1e0c21980a54868

Observation 8f0da4f8-cc1e-416d-b548-6686f7c02dfe · outbound

This paper cites an unresolved cited work.

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization Unresolved cited work

Reference 2009

Resolution
unresolved
raw_fallback, observed 2026-08-14T06:24:14.961708Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=pdf_text observed=2026-08-14T06:24:14.775572Z digest=sha256:7d5667d1c9e1d6f9704a8e9c7231391fb7d1ec5e0cb881de7604bb164d01b9aa

Observation 89485ee0-3df0-4842-8906-b2a909774c7f · outbound

This paper cites On the global linear con vergence of frank-wolfe optimiza- tion variants.

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization On the global linear con vergence of frank-wolfe optimiza- tion variants

Reference 2011

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T06:24:14.946035Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=pdf_text observed=2026-08-14T06:24:14.780490Z digest=sha256:3f1ab4ae58cf54b18469ebd383cc65b74983842c9b684801dea9061caa209c91

Observation 3ca9ef61-b946-4692-9073-912b451251eb · outbound

This paper cites Quantum and Classical Algorithms for Approximate Submodular Function Minimization.

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization Quantum and Classical Algorithms for Approximate Submodular Function Minimization

Reference 2012

Resolution
verified exact
local_arxiv, observed 2026-08-14T06:24:14.878958Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=pdf_text observed=2026-08-14T06:24:14.763678Z digest=sha256:c0be74780590c798424e16970a442e8ff042da2d7a2cd529b0ac163d1e59a548

Observation 770ee349-a3ae-4e45-88e8-e22053fcfc78 · outbound

This paper cites Theory of capacities.

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization Theory of capacities

Reference 2016

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T06:24:15.036481Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=pdf_text observed=2026-08-14T06:24:14.738194Z digest=sha256:25d58cd089cbb89096afe434635f6a2318b704569762cd4859bac47d9174209a

Observation 5dee815d-22fc-46c2-95b2-d14c2f2ce6db · outbound

This paper cites Lee, and Tengyu Ma.

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization Lee, and Tengyu Ma

Reference 2017

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T06:24:14.998663Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=pdf_text observed=2026-08-14T06:24:14.753390Z digest=sha256:9d5cdbc0716d02dde450ba0bb4b6884f05ffc6546bbdd9b686f3d6599dd1632a

Observation c7fea472-db19-4b9c-b8f9-3a09204a6453 · outbound

This paper cites Near-Optimal Methods for Minimizing Star-Convex Functions and Beyond.

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization Near-Optimal Methods for Minimizing Star-Convex Functions and Beyond

Reference 2019

Resolution
unresolved
no resolver link, observed 2026-08-14T06:24:14.769109Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T06:24:14.769109Z digest=sha256:5a956f5930a087a83db5c9b9f9f8cb5635df516b5f795e35e5a3275e4ab8baea

Pith citing papers

No inbound Pith citation observations are available.