{"as_of":"2026-08-18T11:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c200640dc2212d667664d6793d75fa7f44ef176a6188a6d08d6e2e5299b844d2","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T23:54:37.566527Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-21T10:04:06.547437Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2304.04710","last_updated":"2023-04-10T17:06:35Z","snapshot_observed_at":"2026-08-18T08:17:36.661124Z","submitted_at":"2023-04-10T17:06:35Z","title":"Inexact Online Proximal Mirror Descent for time-varying composite optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.04710","snapshot_observed_at":"2026-08-09T23:54:37.566527Z","title":"Choi, W., Lee, M.-S., and Yun, S.-B","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.18381","last_updated":"2025-01-30T14:31:28Z","snapshot_observed_at":"2026-08-15T23:06:59.843266Z","submitted_at":"2025-01-30T14:31:28Z","title":"Implicit Riemannian Optimism with Applications to Min-Max Problems","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-09T23:54:37.566527Z"},"links":{"cited_paper":"/paper/2304.04710","citing_paper":"/paper/2501.18381"},"observation_digest":"sha256:c825e2acd424447a9a75f7a3994816d83f35583bc5b2795e8da71733b1b8b341","observation_id":"c94e81ad-0526-4b03-be54-99838ab80fff","resolution":{"observed_at":"2026-08-09T23:54:37.566527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04710","last_updated":"2023-04-10T17:06:35Z","snapshot_observed_at":"2026-08-18T08:17:36.661124Z","submitted_at":"2023-04-10T17:06:35Z","title":"Inexact Online Proximal Mirror Descent for time-varying composite optimization","version":1},"cited_work":{"arxiv_id":"2304.04710","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2304.04710","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Survey of hallucination in natural language generation","venue":null,"work_id":"05b91b7c-bcad-4c8e-a6c1-9194df423960","year":2023},"citing_paper":{"arxiv_id":"2604.16359","last_updated":"2026-05-19T20:19:49Z","snapshot_observed_at":"2026-08-13T15:35:30.035047Z","submitted_at":"2026-03-18T20:34:58Z","title":"LLM4Log: A Systematic Review of Large Language Model-based Log Analysis","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-05-15T08:21:04.998443Z"},"links":{"cited_paper":"/paper/2304.04710","citing_paper":"/paper/2604.16359"},"observation_digest":"sha256:65e2bfb3fa19d95a382b04f600944c9a04996b9ec4c94f9cdffcead45ac1f6b2","observation_id":"9bc14545-1c28-4c66-8a11-cf3967e98b6b","resolution":{"observed_at":"2026-05-15T08:25:19.014147Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04710","last_updated":"2023-04-10T17:06:35Z","snapshot_observed_at":"2026-08-18T08:17:36.661124Z","submitted_at":"2023-04-10T17:06:35Z","title":"Inexact Online Proximal Mirror Descent for time-varying composite optimization","version":1},"cited_work":{"arxiv_id":"2304.04710","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2304.04710","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Survey of hallucination in natural language generation","venue":null,"work_id":"05b91b7c-bcad-4c8e-a6c1-9194df423960","year":2023},"citing_paper":{"arxiv_id":"2604.16359","last_updated":"2026-05-19T20:19:49Z","snapshot_observed_at":"2026-08-13T15:35:30.035047Z","submitted_at":"2026-03-18T20:34:58Z","title":"LLM4Log: A Systematic Review of Large Language Model-based Log Analysis","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-05-21T10:00:03.036921Z"},"links":{"cited_paper":"/paper/2304.04710","citing_paper":"/paper/2604.16359"},"observation_digest":"sha256:d5f1b7b6e5a5a546254d2ea5cda222751ded9466528fa54b54414c37691cb7e8","observation_id":"4fa64f15-0061-4af6-a810-87fd0a2f4c2e","resolution":{"observed_at":"2026-05-21T10:04:06.549215Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2304.04710/citation-record","integrity":"/paper/2304.04710/integrity","json":"/paper/2304.04710/citation-record.json","paper":"/paper/2304.04710"},"outbound":[],"paper":{"arxiv_id":"2304.04710","last_updated":"2023-04-10T17:06:35Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-18T08:17:36.661124Z","submitted_at":"2023-04-10T17:06:35Z","title":"Inexact Online Proximal Mirror Descent for time-varying composite optimization"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2304.04710."}