{"as_of":"2026-08-15T13:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4139f912bc65431134277488fea5eecfcaca91b69fb3a0f84831f1051e8ecc7b","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:09:34.308424Z","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-14T10:22:26.058557Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1604.03887","last_updated":"2020-10-02T15:28:50Z","snapshot_observed_at":"2026-08-15T03:43:38.169495Z","submitted_at":"2016-04-13T17:49:30Z","title":"Algorithms for stochastic optimization with functional or expectation constraints","version":8},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.03887","snapshot_observed_at":"2026-08-14T15:09:34.308424Z","title":"Lan and Z","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.01871","last_updated":"2023-03-23T04:05:54Z","snapshot_observed_at":"2026-08-15T01:15:27.282812Z","submitted_at":"2019-08-05T21:39:24Z","title":"Quadratically Regularized Subgradient Methods for Weakly Convex Optimization with Weakly Convex Constraints","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T15:09:34.308424Z"},"links":{"cited_paper":"/paper/1604.03887","citing_paper":"/paper/1908.01871"},"observation_digest":"sha256:d1c37dc398d331fb11b63abde8d6ed4f0a87edfb676ef86b195b45b2c2b4412b","observation_id":"5e2ddd92-6dec-49a0-9c3e-5e453f480cd7","resolution":{"observed_at":"2026-08-14T15:09:34.308424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1604.03887","last_updated":"2020-10-02T15:28:50Z","snapshot_observed_at":"2026-08-15T03:43:38.169495Z","submitted_at":"2016-04-13T17:49:30Z","title":"Algorithms for stochastic optimization with functional or expectation constraints","version":8},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.03887","snapshot_observed_at":"2026-08-14T14:45:51.746698Z","title":"Algorithms for stochastic optimization with expectation con- straints","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.02734","last_updated":"2022-01-27T00:38:36Z","snapshot_observed_at":"2026-08-15T12:41:49.791569Z","submitted_at":"2019-08-07T17:10:52Z","title":"Stochastic First-order Methods for Convex and Nonconvex Functional Constrained Optimization","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:45:51.746698Z"},"links":{"cited_paper":"/paper/1604.03887","citing_paper":"/paper/1908.02734"},"observation_digest":"sha256:91202e0d29ddc64aa0063284e221da2bfdd4af053e90b79a8cb890de3176ad05","observation_id":"fc6667b8-2678-4b2f-b590-883213c0ea59","resolution":{"observed_at":"2026-08-14T14:45:51.746698Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1604.03887","last_updated":"2020-10-02T15:28:50Z","snapshot_observed_at":"2026-08-15T03:43:38.169495Z","submitted_at":"2016-04-13T17:49:30Z","title":"Algorithms for stochastic optimization with functional or expectation constraints","version":8},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.03887","snapshot_observed_at":"2026-08-14T14:45:38.553813Z","title":"arXiv preprint arXiv:1604.03887","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.03077","last_updated":"2020-01-02T01:03:49Z","snapshot_observed_at":"2026-08-15T06:35:49.035478Z","submitted_at":"2019-08-07T12:59:19Z","title":"A Data Efficient and Feasible Level Set Method for Stochastic Convex Optimization with Expectation Constraints","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-14T14:45:38.553813Z"},"links":{"cited_paper":"/paper/1604.03887","citing_paper":"/paper/1908.03077"},"observation_digest":"sha256:659eab06a3bf83b9ec37a365bbdb60c1857f1b86ce5ba747ffbcad367171c8da","observation_id":"053f16c8-0e84-41ce-82bb-b63587e54bb8","resolution":{"observed_at":"2026-08-14T14:45:38.553813Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1604.03887","last_updated":"2020-10-02T15:28:50Z","snapshot_observed_at":"2026-08-15T03:43:38.169495Z","submitted_at":"2016-04-13T17:49:30Z","title":"Algorithms for stochastic optimization with functional or expectation constraints","version":8},"cited_work":{"arxiv_id":"1604.03887","doi":null,"metadata_source":"pith","pith_arxiv_id":"1604.03887","snapshot_observed_at":"2026-08-14T10:22:26.058557Z","title":"Algorithms for stochastic optimization with functional or expectation constraints","venue":"math.OC","work_id":"81ca5c81-f377-480c-b9d6-c43b6269ae9a","year":2016},"citing_paper":{"arxiv_id":"1908.11518","last_updated":"2020-12-01T14:23:29Z","snapshot_observed_at":"2026-08-15T01:15:42.120675Z","submitted_at":"2019-08-30T03:33:53Z","title":"Inexact Proximal-Point Penalty Methods for Constrained Non-Convex Optimization","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T10:22:25.595619Z"},"links":{"cited_paper":"/paper/1604.03887","citing_paper":"/paper/1908.11518"},"observation_digest":"sha256:a25b9b121c09a585e9e95adcd67d7d46eb0ed7657f9a3975406027a7ca0873f0","observation_id":"6415fb3e-a376-40be-969e-adbeba5fb970","resolution":{"observed_at":"2026-08-14T10:22:26.062444Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1604.03887","last_updated":"2020-10-02T15:28:50Z","snapshot_observed_at":"2026-08-15T03:43:38.169495Z","submitted_at":"2016-04-13T17:49:30Z","title":"Algorithms for stochastic optimization with functional or expectation constraints","version":8},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.03887","snapshot_observed_at":"2026-07-15T14:17:22.211737Z","title":"Wenke Huang, Mang Ye, Zekun Shi, Guancheng Wan, He Li, Bo Du, and Qiang Yang","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.05774","last_updated":"2026-07-13T15:28:06Z","snapshot_observed_at":"2026-08-14T21:35:26.388138Z","submitted_at":"2026-03-06T00:14:46Z","title":"First-Order Softmax Weighted Switching Gradient Method for Distributed Stochastic Minimax Optimization with Stochastic Constraints","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-15T14:17:22.211737Z"},"links":{"cited_paper":"/paper/1604.03887","citing_paper":"/paper/2603.05774"},"observation_digest":"sha256:64afb770c10b222c2ec3b2ec745281b06e314bba3c2e42da16a732f5cc2ce898","observation_id":"24b67f16-0e0d-4807-a48f-67e7e0ea21f4","resolution":{"observed_at":"2026-07-15T14:17:22.211737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1604.03887/citation-record","integrity":"/paper/1604.03887/integrity","json":"/paper/1604.03887/citation-record.json","paper":"/paper/1604.03887"},"outbound":[],"paper":{"arxiv_id":"1604.03887","last_updated":"2020-10-02T15:28:50Z","latest_version":8,"primary_category":"math.OC","snapshot_observed_at":"2026-08-15T03:43:38.169495Z","submitted_at":"2016-04-13T17:49:30Z","title":"Algorithms for stochastic optimization with functional or expectation 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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1604.03887."}