{"as_of":"2026-08-19T11:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b68e8edd31dca1091e193f1283d6f506c910988f71fe741bd3e647f2fa8d84e0","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:15:49.307775Z","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-07-01T17:35:51.298023Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.10999","last_updated":"2025-04-15T09:15:58Z","snapshot_observed_at":"2026-08-16T12:40:59.452935Z","submitted_at":"2025-04-15T09:15:58Z","title":"Splitting the Forward-Backward Algorithm: A Full Characterization","version":1},"cited_work":{"arxiv_id":"2504.10999","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.10999","snapshot_observed_at":"2026-07-01T17:35:51.298023Z","title":"Åkerman, E","venue":null,"work_id":"980b1a5f-8c97-405d-9b6e-ad1b01451f5f","year":2025},"citing_paper":{"arxiv_id":"2504.14987","last_updated":"2026-04-17T06:59:46Z","snapshot_observed_at":"2026-08-06T15:35:43.837434Z","submitted_at":"2025-04-21T09:30:21Z","title":"A general approach to distributed operator splitting","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-22T18:32:38.105440Z"},"links":{"cited_paper":"/paper/2504.10999","citing_paper":"/paper/2504.14987"},"observation_digest":"sha256:1dd9a1e76dec9c2b25e7a6538334018e6270ee2ea874b7593aa819d186dcc469","observation_id":"a6e0dc94-4687-490f-9008-7c0ac5a9c2e1","resolution":{"observed_at":"2026-05-22T18:35:02.466423Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.10999","last_updated":"2025-04-15T09:15:58Z","snapshot_observed_at":"2026-08-16T12:40:59.452935Z","submitted_at":"2025-04-15T09:15:58Z","title":"Splitting the Forward-Backward Algorithm: A Full Characterization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.10999","snapshot_observed_at":"2026-08-15T20:15:49.307775Z","title":"arXiv, URL https://doi.org/10","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.13927","last_updated":"2025-07-25T22:46:21Z","snapshot_observed_at":"2026-08-18T15:41:26.963225Z","submitted_at":"2025-05-20T04:44:06Z","title":"Coupled Adaptable Backward-Forward-Backward Resolvent Splitting Algorithm (CABRA): A Matrix-Parametrized Resolvent Splitting Method for the Sum of Maximal Monotone and Cocoercive Operators Composed with Linear Coupling Operators","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:49.307775Z"},"links":{"cited_paper":"/paper/2504.10999","citing_paper":"/paper/2505.13927"},"observation_digest":"sha256:12e7f8f95d52dabf7d370a07ac130b574926c854975225734f66c74d207aa7e7","observation_id":"6c151036-0511-46f7-a2c5-3ea42d2e8e18","resolution":{"observed_at":"2026-08-15T20:15:49.307775Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.10999","last_updated":"2025-04-15T09:15:58Z","snapshot_observed_at":"2026-08-16T12:40:59.452935Z","submitted_at":"2025-04-15T09:15:58Z","title":"Splitting the Forward-Backward Algorithm: A Full Characterization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.10999","snapshot_observed_at":"2026-08-06T18:59:58.625389Z","title":"Splitting the Forward-Backward Algorithm: A Full Characterization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.07428","last_updated":"2026-06-10T03:37:25Z","snapshot_observed_at":"2026-08-13T14:24:43.309010Z","submitted_at":"2025-07-10T04:44:05Z","title":"Relocated Fixed-Point Iterations with Applications to Variable Stepsize Resolvent Splitting","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T18:59:58.625389Z"},"links":{"cited_paper":"/paper/2504.10999","citing_paper":"/paper/2507.07428"},"observation_digest":"sha256:77150a4f468802ac04cad3fbb3cacbe5ab2eaf0a9b243f5d29304d601160b6f5","observation_id":"84bd9b61-4bfe-4121-a99b-2b11ed45fd7e","resolution":{"observed_at":"2026-08-06T18:59:58.625389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.10999","last_updated":"2025-04-15T09:15:58Z","snapshot_observed_at":"2026-08-16T12:40:59.452935Z","submitted_at":"2025-04-15T09:15:58Z","title":"Splitting the Forward-Backward Algorithm: A Full Characterization","version":1},"cited_work":{"arxiv_id":"2504.10999","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.10999","snapshot_observed_at":"2026-07-01T17:35:51.298023Z","title":"Åkerman, E","venue":null,"work_id":"980b1a5f-8c97-405d-9b6e-ad1b01451f5f","year":2025},"citing_paper":{"arxiv_id":"2512.10366","last_updated":"2026-05-13T08:05:12Z","snapshot_observed_at":"2026-07-06T22:38:40.044448Z","submitted_at":"2025-12-11T07:31:09Z","title":"Primal-dual splitting for structured composite monotone inclusions with or without cocoercivity","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-16T23:47:14.719199Z"},"links":{"cited_paper":"/paper/2504.10999","citing_paper":"/paper/2512.10366"},"observation_digest":"sha256:0d3864955d6061ed1dbd0741f274a815a30a9dace9b30759caa242d76821117b","observation_id":"045ea54d-7dba-4247-9fe2-ac5a98e2889b","resolution":{"observed_at":"2026-05-16T23:48:41.896863Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.10999","last_updated":"2025-04-15T09:15:58Z","snapshot_observed_at":"2026-08-16T12:40:59.452935Z","submitted_at":"2025-04-15T09:15:58Z","title":"Splitting the Forward-Backward Algorithm: A Full Characterization","version":1},"cited_work":{"arxiv_id":"2504.10999","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.10999","snapshot_observed_at":"2026-07-01T17:35:51.298023Z","title":"Åkerman, E","venue":null,"work_id":"980b1a5f-8c97-405d-9b6e-ad1b01451f5f","year":2025},"citing_paper":{"arxiv_id":"2605.11929","last_updated":"2026-05-12T10:44:16Z","snapshot_observed_at":"2026-07-06T23:23:39.723268Z","submitted_at":"2026-05-12T10:44:16Z","title":"Convergence of zeroth-order proximal point algorithms in the high-temperature regime","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-05-13T05:17:57.454692Z"},"links":{"cited_paper":"/paper/2504.10999","citing_paper":"/paper/2605.11929"},"observation_digest":"sha256:d89780b53be9cd81f2a9fbda541c56531b9f14e25d43916a00f1a5c58ae81001","observation_id":"0848dabb-0068-40cd-a884-07bc735b7851","resolution":{"observed_at":"2026-05-13T05:27:19.125026Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.10999","last_updated":"2025-04-15T09:15:58Z","snapshot_observed_at":"2026-08-16T12:40:59.452935Z","submitted_at":"2025-04-15T09:15:58Z","title":"Splitting the Forward-Backward Algorithm: A Full Characterization","version":1},"cited_work":{"arxiv_id":"2504.10999","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.10999","snapshot_observed_at":"2026-07-01T17:35:51.298023Z","title":"Åkerman, E","venue":null,"work_id":"980b1a5f-8c97-405d-9b6e-ad1b01451f5f","year":2025},"citing_paper":{"arxiv_id":"2605.17731","last_updated":"2026-05-18T01:27:51Z","snapshot_observed_at":"2026-08-03T05:58:25.034567Z","submitted_at":"2026-05-18T01:27:51Z","title":"A reflected forward-backward splitting algorithmic framework","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-20T10:04:01.504669Z"},"links":{"cited_paper":"/paper/2504.10999","citing_paper":"/paper/2605.17731"},"observation_digest":"sha256:266f0c7117a7e5efa0ccb0b9c412b78e68130e7c5ab825c53be3ad3b41fec506","observation_id":"caba51e8-fa96-4f55-9ddb-d4e2e51bfe97","resolution":{"observed_at":"2026-05-20T10:08:12.416671Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.10999","last_updated":"2025-04-15T09:15:58Z","snapshot_observed_at":"2026-08-16T12:40:59.452935Z","submitted_at":"2025-04-15T09:15:58Z","title":"Splitting the Forward-Backward Algorithm: A Full Characterization","version":1},"cited_work":{"arxiv_id":"2504.10999","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.10999","snapshot_observed_at":"2026-07-01T17:35:51.298023Z","title":"Åkerman, E","venue":null,"work_id":"980b1a5f-8c97-405d-9b6e-ad1b01451f5f","year":2025},"citing_paper":{"arxiv_id":"2606.28010","last_updated":"2026-07-17T13:35:35Z","snapshot_observed_at":"2026-08-06T18:33:59.899490Z","submitted_at":"2026-06-26T12:08:59Z","title":"A primal-dual splitting algorithm for monotone inclusions with applications","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-29T03:36:19.369782Z"},"links":{"cited_paper":"/paper/2504.10999","citing_paper":"/paper/2606.28010"},"observation_digest":"sha256:089ecdbb07b2087d92c8b4eea5b5e720d935906fe41429dfcca53a63b0da6d20","observation_id":"62ef5344-9e15-44f9-9670-fe93f67de2b2","resolution":{"observed_at":"2026-07-01T17:35:51.299420Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.10999","last_updated":"2025-04-15T09:15:58Z","snapshot_observed_at":"2026-08-16T12:40:59.452935Z","submitted_at":"2025-04-15T09:15:58Z","title":"Splitting the Forward-Backward Algorithm: A Full Characterization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.10999","snapshot_observed_at":"2026-08-02T10:06:15.217390Z","title":"Akerman, E","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.28010","last_updated":"2026-07-17T13:35:35Z","snapshot_observed_at":"2026-08-06T18:33:59.899490Z","submitted_at":"2026-06-26T12:08:59Z","title":"A primal-dual splitting algorithm for monotone inclusions with applications","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T10:06:15.217390Z"},"links":{"cited_paper":"/paper/2504.10999","citing_paper":"/paper/2606.28010"},"observation_digest":"sha256:69fdfdc644eebf21dec77a427cf9bc74e2d29416f41a9d0a4b0767eab6e3a9c7","observation_id":"77570bab-bc5f-4125-abbe-f7f0dfb46260","resolution":{"observed_at":"2026-08-02T10:06:15.217390Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.10999","last_updated":"2025-04-15T09:15:58Z","snapshot_observed_at":"2026-08-16T12:40:59.452935Z","submitted_at":"2025-04-15T09:15:58Z","title":"Splitting the Forward-Backward Algorithm: A Full Characterization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.10999","snapshot_observed_at":"2026-08-01T14:02:23.876488Z","title":"kerman, P","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18932","last_updated":"2026-08-14T07:54:39Z","snapshot_observed_at":"2026-08-19T11:09:38.223032Z","submitted_at":"2026-07-21T10:13:52Z","title":"A frugal primal-dual splitting with minimal lifting over arbitrary rooted trees","version":1},"reference_index":238,"source":"arxiv_source","source_observed_at":"2026-08-01T14:02:23.876488Z"},"links":{"cited_paper":"/paper/2504.10999","citing_paper":"/paper/2607.18932"},"observation_digest":"sha256:5c0da6f69ced65bbbb97eef10cc327757514505eba691853623e3a0ebfc616be","observation_id":"7dbf5700-480b-453e-a5c0-caaefa5ec861","resolution":{"observed_at":"2026-08-01T14:02:23.876488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.10999/citation-record","integrity":"/paper/2504.10999/integrity","json":"/paper/2504.10999/citation-record.json","paper":"/paper/2504.10999"},"outbound":[],"paper":{"arxiv_id":"2504.10999","last_updated":"2025-04-15T09:15:58Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T12:40:59.452935Z","submitted_at":"2025-04-15T09:15:58Z","title":"Splitting the Forward-Backward Algorithm: A Full Characterization"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2504.10999."}