Paper Citation Record · LEDGER

Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression

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

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

pith.paper-citation-record.v1
1908.04091 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-14T14:04:53.864210Z

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 fuzzy7
unresolved3
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 08254761-14c1-402a-8195-a8ee58129491 · outbound

This paper cites Self-concordant analysis for logistic regression.

Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression Self-concordant analysis for logistic regression

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T14:04:54.061819Z

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.

Observation f94bed91-eb42-4bec-a144-ea493dfa2463 · outbound

This paper cites Lower Bounds for Finding Stationary Points I.

Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression Lower Bounds for Finding Stationary Points I

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-14T14:04:53.713259Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0de4b3de-b151-4cb0-a557-c83482a9e722 · outbound

This paper cites Lower Bounds for Finding Stationary Points II: First-Order Methods.

Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression Lower Bounds for Finding Stationary Points II: First-Order Methods

Reference 3

Resolution: verified exact; local_arxiv, observed 2026-08-14T14:04:53.918211Z

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.

Observation 301519f5-f006-493e-a489-4bdccec33ac5 · outbound

This paper cites Lower Bounds for Parallel and Randomized Convex Optimization.

Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression Lower Bounds for Parallel and Randomized Convex Optimization

Reference 4

Resolution: verified exact; local_arxiv, observed 2026-08-14T14:04:53.900878Z

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.

Observation 465a6d52-12fb-4076-8381-f8467411c197 · outbound

This paper cites The exact information-based complexity of smooth convex minimization.

Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression The exact information-based complexity of smooth convex minimization

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T14:04:54.051140Z

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.

Observation e768d0d8-2e77-4824-84d4-4878903fb942 · outbound

This paper cites On lower complexity bounds for large-scale smooth convex optimization.

Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression On lower complexity bounds for large-scale smooth convex optimization

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T14:04:54.038451Z

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.

Observation 4bae55f0-8f83-4a74-96f8-373a493efb50 · outbound

This paper cites Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization.

Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T14:04:54.019631Z

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.

Observation 9bbce199-24cc-4454-aef1-a4d27e72d260 · outbound

This paper cites Nemirovski and D.

Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression Nemirovski and D

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T14:04:53.997276Z

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.

Observation c7657362-0c76-4675-a4c1-793c5cffe261 · outbound

This paper cites an unresolved cited work.

Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression Unresolved cited work

Reference 9

Resolution: unresolved; raw_fallback, observed 2026-08-14T14:04:53.984799Z

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.

Observation b42b23c2-e168-45fd-9a69-d1873ee76b01 · outbound

This paper cites an unresolved cited work.

Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression Unresolved cited work

Reference 10

Resolution: unresolved; raw_fallback, observed 2026-08-14T14:04:53.971366Z

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.

Observation 28d7c8f7-0cac-445e-b794-5a7769e3df5c · outbound

This paper cites Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems.

Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T14:04:53.958045Z

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.

Observation 2700cec7-73a4-4d2b-8b24-e50cc7cb6171 · outbound

This paper cites Tight complexity bounds for optimizing composite objectives.

Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression Tight complexity bounds for optimizing composite objectives

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T14:04:53.944443Z

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.

Pith citing papers

No inbound Pith citation observations are available.