Pith. sign in

Paper Citation Record · LEDGER

Huber Loss-Based Penalty Approach to Problems with Linear Constraints

As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2311.00874.

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

pith.paper-citation-record.v1
2311.00874 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-09T21:05:04.845527Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-09T21:05:04.992635Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 2afc5e96-421a-4736-8f4e-431d143840b4 · inbound

A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization cites this paper.

A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization Huber Loss-Based Penalty Approach to Problems with Linear Constraints

Reference 48

Resolution
verified exact
local_arxiv, observed 2026-08-09T21:05:04.998526Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-08-09T21:05:04.845527Z digest=sha256:b11902f7e2ed4d65bcf706ffaf8546e444c3732ba09febb3f4e1f2e468600575

Observation 2446e0df-dcef-4d59-b246-bfdb8dd8af72 · inbound

Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes cites this paper.

Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes Huber Loss-Based Penalty Approach to Problems with Linear Constraints

Reference 52

Resolution
unresolved
no resolver link, observed 2026-08-03T07:44:28.903794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T07:44:28.903794Z digest=sha256:57dbcdc794dffac0cec40df73b8e440863f929044259a3a928e588d94764391f