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:7e732f7cd0a4e0cdf73836d69fdfcf178d49b1fcce50991f1d719124a6d179ad

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:48f9e58b8565251a24cf4d57fcd1f5f6ee274cb69cd9cd3e4a9b0aa36f902082

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:bea750990f64ce2a3792cd52931d56a75a1ff017604e9a62160423321d81da15

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:ff4ae54e72e6c948b02d01583bcce70aed3554ba2803342d3304fd6c79422e06

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:6b80558c134435aa99591a702763f83e0bfc8767e395c41dfa3cf1bea179f99d

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:58c1ef5474f5aa0d29d901ebfad4450135eee1ca2181f024316a18488e46d6eb

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:48fec35bedfb334cdd620b4f45b95515d3848d216b238bd564361ca7ee5dfcad

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:b75ee2649a55540769919913336c06547ed1438f3872d58dad546710117e8e1a

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:0b333cf2f901ea5a2fcc164f8174f4177876a0ddbfed7911be326684700e3ffb

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:8ccd068fbc256ead9580745b1ab76651cb68984b309c22a9b753a770d12d3e46

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:45a350f2a988eac823f74b65ea7ef002b93335bd2728d281c9935fa58bebf2e9

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:7dfc04dfd0983f1e00a6d9a829b429df3c90bd42ed4a33882bcb0d7e839ec5d5

Pith citing papers

No inbound Pith citation observations are available.