Pith. sign in

Paper Citation Record · LEDGER

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization

As of 16 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-16T06:30:59.297886+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-16T06:30:59.297886+00:00.

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

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-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T06:24:14.790317Z digest=sha256:5e6b121a1d8ccc7eeae8047e395b459c376e2ee6a1c10eea251adc1b01c8021d

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-16T06:30:59.297886+00:00.

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

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-16T06:30:59.297886+00:00.

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

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:9074dfaa484c47a1182f35502ebe58dbaa49d5639e8b4ca16545d83fd9a132ff

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-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T06:24:14.775572Z digest=sha256:1d3a224f53f2f0b63d7a4c2d0a6e8a89da318dfc87928629f140079706b8b257

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-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T06:24:14.780490Z digest=sha256:03f3354119fc3218a42d22021ead169d1b5904306ad06041818defde7bc3d0ed

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-16T06:30:59.297886+00:00.

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

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-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T06:24:14.738194Z digest=sha256:59541b0ee12d3a026a1eab9df0af8a7b840eb8aabc577aabceba624c2f216642

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-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T06:24:14.753390Z digest=sha256:06f6b990c748075f80e30b93c7b31e898d69d55153484baed42ceaf4d559b433

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.