{"as_of":"2026-08-09T05:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0f5644552955b30b670432fedb842b82e9f0da0a0719b6b72a391c77124183ec","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-08T06:32:00.761636+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-06T20:26:38.342871Z","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-19T07:02:07.850250Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.09765","last_updated":"2025-05-14T19:53:07Z","snapshot_observed_at":"2026-08-09T04:20:43.778923Z","submitted_at":"2025-05-14T19:53:07Z","title":"Connections between convex optimization algorithms and subspace correction methods","version":1},"cited_work":{"arxiv_id":"2505.09765","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.09765","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Jiang, J","venue":null,"work_id":"0d94d72a-d2c2-45d9-86f4-b0e485480a56","year":2025},"citing_paper":{"arxiv_id":"2507.01415","last_updated":"2026-04-25T06:01:38Z","snapshot_observed_at":"2026-08-02T08:06:50.003503Z","submitted_at":"2025-07-02T07:14:25Z","title":"Randomized subspace correction methods for convex optimization","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-19T06:57:36.636260Z"},"links":{"cited_paper":"/paper/2505.09765","citing_paper":"/paper/2507.01415"},"observation_digest":"sha256:150e933e6f9ef384cd05e2375051929d9aa7d0b72828c447f0fcc12d2feae5f2","observation_id":"067a706a-be17-4fc5-87cf-d1a16b144f2e","resolution":{"observed_at":"2026-05-19T07:02:07.851637Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09765","last_updated":"2025-05-14T19:53:07Z","snapshot_observed_at":"2026-08-09T04:20:43.778923Z","submitted_at":"2025-05-14T19:53:07Z","title":"Connections between convex optimization algorithms and subspace correction methods","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09765","snapshot_observed_at":"2026-08-06T20:26:38.342871Z","title":"Jiang, J","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.03192","last_updated":"2026-06-04T22:59:48Z","snapshot_observed_at":"2026-08-07T02:34:33.827645Z","submitted_at":"2025-07-03T21:53:23Z","title":"Parallel multilevel methods for solving the Darcy--Forchheimer model based on a nearly semicoercive formulation","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:38.342871Z"},"links":{"cited_paper":"/paper/2505.09765","citing_paper":"/paper/2507.03192"},"observation_digest":"sha256:dba527aa8e2a35424afa9918521e7decfb199d54bed458892b111d681c09980e","observation_id":"742d6635-d622-4a74-a38b-ac572358fcf6","resolution":{"observed_at":"2026-08-06T20:26:38.342871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.09765/citation-record","integrity":"/paper/2505.09765/integrity","json":"/paper/2505.09765/citation-record.json","paper":"/paper/2505.09765"},"outbound":[],"paper":{"arxiv_id":"2505.09765","last_updated":"2025-05-14T19:53:07Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T04:20:43.778923Z","submitted_at":"2025-05-14T19:53:07Z","title":"Connections between convex optimization algorithms and subspace correction methods"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2505.09765."}