{"as_of":"2026-08-08T12:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c726b7d3388cf43c852db0075c73f4e7948c3abaa613c64628b564772f52bbe4","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:51:13.270361Z","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-07T05:51:13.392724Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2108.08554","last_updated":"2021-08-19T08:36:07Z","snapshot_observed_at":"2026-07-06T11:39:34.310174Z","submitted_at":"2021-08-19T08:36:07Z","title":"Balanced Augmented Lagrangian Method for Convex Programming","version":1},"cited_work":{"arxiv_id":"2108.08554","doi":null,"metadata_source":"pith","pith_arxiv_id":"2108.08554","snapshot_observed_at":"2026-08-07T05:51:13.392724Z","title":"Balanced Augmented Lagrangian Method for Convex Programming","venue":"math.OC","work_id":"2572c707-2848-4969-8503-8c2f92ae6a07","year":2021},"citing_paper":{"arxiv_id":"2506.07117","last_updated":"2025-06-08T12:59:06Z","snapshot_observed_at":"2026-08-07T05:39:29.473778Z","submitted_at":"2025-06-08T12:59:06Z","title":"A Triple-Bregman Balanced Primal-Dual Algorithm for Saddle Point Problems","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:13.270361Z"},"links":{"cited_paper":"/paper/2108.08554","citing_paper":"/paper/2506.07117"},"observation_digest":"sha256:37691f0e0d73d8c1a6a1c98d18c1fb442cbb2e264540ab73a7a6a19296fc440c","observation_id":"13f19ae2-9a4b-4e42-8f48-3a7343f02691","resolution":{"observed_at":"2026-08-07T05:51:13.396946Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2108.08554/citation-record","integrity":"/paper/2108.08554/integrity","json":"/paper/2108.08554/citation-record.json","paper":"/paper/2108.08554"},"outbound":[],"paper":{"arxiv_id":"2108.08554","last_updated":"2021-08-19T08:36:07Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T11:39:34.310174Z","submitted_at":"2021-08-19T08:36:07Z","title":"Balanced Augmented Lagrangian Method for Convex Programming"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2108.08554."}