{"as_of":"2026-08-11T09:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f91902a4003131bb50586137b608f7c6847ecb79ac3ea4158cf44399b7fb3404","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-11T06:34:44.6726+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-11T04:22:57.325754Z","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-06T11:09:52.268388Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.08073","last_updated":"2026-05-25T08:13:38Z","snapshot_observed_at":"2026-07-06T17:59:04.250437Z","submitted_at":"2024-04-11T18:28:01Z","title":"Spurious Stationarity and Hardness Results for Bregman Proximal-Type Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.08073","snapshot_observed_at":"2026-08-06T15:48:24.645384Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.15264","last_updated":"2025-07-25T05:02:24Z","snapshot_observed_at":"2026-08-09T13:13:51.158159Z","submitted_at":"2025-07-21T05:58:52Z","title":"On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T15:48:24.645384Z"},"links":{"cited_paper":"/paper/2404.08073","citing_paper":"/paper/2507.15264"},"observation_digest":"sha256:de450e2660dfb46a38bfecdfb49546c3525aafbb571dfaa047b48763ef002175","observation_id":"5817cfce-c09d-403d-8ba4-8692401ac167","resolution":{"observed_at":"2026-08-06T15:48:24.645384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.08073","last_updated":"2026-05-25T08:13:38Z","snapshot_observed_at":"2026-07-06T17:59:04.250437Z","submitted_at":"2024-04-11T18:28:01Z","title":"Spurious Stationarity and Hardness Results for Bregman Proximal-Type Algorithms","version":3},"cited_work":{"arxiv_id":"2404.08073","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.08073","snapshot_observed_at":"2026-08-06T11:09:52.268388Z","title":"Spurious Stationarity and Hardness Results for Bregman Proximal-Type Algorithms","venue":"math.OC","work_id":"d737541d-65e1-4c39-b4de-4804890d6946","year":2024},"citing_paper":{"arxiv_id":"2608.05035","last_updated":"2026-08-05T16:41:18Z","snapshot_observed_at":"2026-08-08T23:13:49.258606Z","submitted_at":"2026-08-05T16:41:18Z","title":"On the Iterate Convergence of Bregman Projected Gradient Method","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T11:09:52.099467Z"},"links":{"cited_paper":"/paper/2404.08073","citing_paper":"/paper/2608.05035"},"observation_digest":"sha256:a7a6b31a9b0e631a7315b2dc3fc132e233663a2201bc5268d50a7556f3be4025","observation_id":"93662a4d-e565-48d8-9048-500ead2dc3c4","resolution":{"observed_at":"2026-08-06T11:09:52.275456Z","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":"2404.08073","last_updated":"2026-05-25T08:13:38Z","snapshot_observed_at":"2026-07-06T17:59:04.250437Z","submitted_at":"2024-04-11T18:28:01Z","title":"Spurious Stationarity and Hardness Results for Bregman Proximal-Type Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.08073","snapshot_observed_at":"2026-08-08T11:35:12.644372Z","title":"Spurious stationarity and hardness results for Bregman proximal-type algorithms.arXiv preprint arXiv:2404.08073, version 3, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.05536","last_updated":"2026-08-06T02:30:16Z","snapshot_observed_at":"2026-08-09T23:11:01.537425Z","submitted_at":"2026-08-06T02:30:16Z","title":"A Unified Framework for Iterate Convergence of Bregman Proximal Methods","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:12.644372Z"},"links":{"cited_paper":"/paper/2404.08073","citing_paper":"/paper/2608.05536"},"observation_digest":"sha256:722516d5c250ee901caf2c27159eb66cb1d7a8507e97b65d2dd97baabb570fd7","observation_id":"9ad8222a-0854-4bd9-aa22-dc8ecc2f5350","resolution":{"observed_at":"2026-08-08T11:35:12.644372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.08073","last_updated":"2026-05-25T08:13:38Z","snapshot_observed_at":"2026-07-06T17:59:04.250437Z","submitted_at":"2024-04-11T18:28:01Z","title":"Spurious Stationarity and Hardness Results for Bregman Proximal-Type Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.08073","snapshot_observed_at":"2026-08-10T12:00:38.154467Z","title":"Spurious stationarity and hardness results for Bregman proximal- type algorithms.arXiv preprint arXiv:2404.08073, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.07248","last_updated":"2026-08-10T15:53:10Z","snapshot_observed_at":"2026-08-11T08:17:52.466913Z","submitted_at":"2026-08-07T14:06:54Z","title":"Establishing Boundary KKT Convergence of Mirror Descent through Reparameterization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T12:00:38.154467Z"},"links":{"cited_paper":"/paper/2404.08073","citing_paper":"/paper/2608.07248"},"observation_digest":"sha256:571ae28c862061a315d12fc0acd38caf6c02fd9bf63f1cc83c06ecdbd31419fc","observation_id":"6e28424d-f28a-4d9d-a5ee-3af5a621518f","resolution":{"observed_at":"2026-08-10T12:00:38.154467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.08073","last_updated":"2026-05-25T08:13:38Z","snapshot_observed_at":"2026-07-06T17:59:04.250437Z","submitted_at":"2024-04-11T18:28:01Z","title":"Spurious Stationarity and Hardness Results for Bregman Proximal-Type Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.08073","snapshot_observed_at":"2026-08-11T04:22:57.325754Z","title":"Spurious stationarity and hardness results for Bregman proximal- type algorithms.arXiv preprint arXiv:2404.08073, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.07248","last_updated":"2026-08-10T15:53:10Z","snapshot_observed_at":"2026-08-11T08:17:52.466913Z","submitted_at":"2026-08-07T14:06:54Z","title":"Establishing Boundary KKT Convergence of Mirror Descent through Reparameterization","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T04:22:57.325754Z"},"links":{"cited_paper":"/paper/2404.08073","citing_paper":"/paper/2608.07248"},"observation_digest":"sha256:9d9737f77ff623a0be0c76cbb7711b4ae6124d799e3390291279c2e1a6650fec","observation_id":"7ca5f276-4467-42b7-9ad8-b1ed25994159","resolution":{"observed_at":"2026-08-11T04:22:57.325754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2404.08073/citation-record","integrity":"/paper/2404.08073/integrity","json":"/paper/2404.08073/citation-record.json","paper":"/paper/2404.08073"},"outbound":[],"paper":{"arxiv_id":"2404.08073","last_updated":"2026-05-25T08:13:38Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T17:59:04.250437Z","submitted_at":"2024-04-11T18:28:01Z","title":"Spurious Stationarity and Hardness Results for Bregman Proximal-Type Algorithms"},"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 5 inbound Pith citation observations for arXiv:2404.08073."}