{"as_of":"2026-08-11T15:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0aea4f7c13c3e2199bdb67d697d0c39e65264d6b68637d25fc468943ba42fb37","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T21:05:04.845527Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-09T21:05:04.992635Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.00874","last_updated":"2023-11-01T22:00:44Z","snapshot_observed_at":"2026-08-11T08:58:20.056999Z","submitted_at":"2023-11-01T22:00:44Z","title":"Huber Loss-Based Penalty Approach to Problems with Linear Constraints","version":1},"cited_work":{"arxiv_id":"2311.00874","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.00874","snapshot_observed_at":"2026-08-09T21:05:04.992635Z","title":"Huber Loss-Based Penalty Approach to Problems with Linear Constraints","venue":"math.OC","work_id":"13c767f1-4755-42d3-bef7-35d3a3a63583","year":2023},"citing_paper":{"arxiv_id":"2501.19214","last_updated":"2025-09-10T02:48:51Z","snapshot_observed_at":"2026-08-11T15:15:20.076144Z","submitted_at":"2025-01-31T15:18:52Z","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-09T21:05:04.845527Z"},"links":{"cited_paper":"/paper/2311.00874","citing_paper":"/paper/2501.19214"},"observation_digest":"sha256:b11902f7e2ed4d65bcf706ffaf8546e444c3732ba09febb3f4e1f2e468600575","observation_id":"2afc5e96-421a-4736-8f4e-431d143840b4","resolution":{"observed_at":"2026-08-09T21:05:04.998526Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.00874","last_updated":"2023-11-01T22:00:44Z","snapshot_observed_at":"2026-08-11T08:58:20.056999Z","submitted_at":"2023-11-01T22:00:44Z","title":"Huber Loss-Based Penalty Approach to Problems with Linear Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.00874","snapshot_observed_at":"2026-08-03T07:44:28.903794Z","title":"and Tatarenko, T","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.20076","last_updated":"2026-05-29T02:49:05Z","snapshot_observed_at":"2026-08-08T02:51:57.466558Z","submitted_at":"2026-01-27T21:40:10Z","title":"Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-03T07:44:28.903794Z"},"links":{"cited_paper":"/paper/2311.00874","citing_paper":"/paper/2601.20076"},"observation_digest":"sha256:57dbcdc794dffac0cec40df73b8e440863f929044259a3a928e588d94764391f","observation_id":"2446e0df-dcef-4d59-b246-bfdb8dd8af72","resolution":{"observed_at":"2026-08-03T07:44:28.903794Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2311.00874/citation-record","integrity":"/paper/2311.00874/integrity","json":"/paper/2311.00874/citation-record.json","paper":"/paper/2311.00874"},"outbound":[],"paper":{"arxiv_id":"2311.00874","last_updated":"2023-11-01T22:00:44Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-11T08:58:20.056999Z","submitted_at":"2023-11-01T22:00:44Z","title":"Huber Loss-Based Penalty Approach to Problems with Linear Constraints"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"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."}