{"as_of":"2026-08-17T02:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cdd0eaa21813eda4ff9bea8e504ebe9b5440b5345e230ecae4c0a733413666f1","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:15:21.332633Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.03633/citation-record","integrity":"/paper/1908.03633/integrity","json":"/paper/1908.03633/citation-record.json","paper":"/paper/1908.03633"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:15:21.476839Z","title":null,"venue":null,"work_id":"12969a77-96bd-484e-a40d-a16ab7b572bf","year":2011},"citing_paper":{"arxiv_id":"1908.03633","last_updated":"2019-08-09T21:15:55Z","snapshot_observed_at":"2026-08-16T15:41:09.230469Z","submitted_at":"2019-08-09T21:15:55Z","title":"The Chen-Teboulle algorithm is the proximal point algorithm","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T14:15:21.291196Z"},"links":{"citing_paper":"/paper/1908.03633"},"observation_digest":"sha256:1d4144649ca9067577bb65162efdb1c0813d4055aaae3b5381401262a7b882ac","observation_id":"7d8f0f48-9cdf-4a0f-8e18-001a586035bc","resolution":{"observed_at":"2026-08-14T14:15:21.481934Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:15:21.465839Z","title":"Condat, A primal-dual splitting method for convex optimization involving L ipschitzian, proximable and linear composite terms , J","venue":null,"work_id":"a2bdbb16-19b8-410a-a9f1-9a41f6ec5ea3","year":2013},"citing_paper":{"arxiv_id":"1908.03633","last_updated":"2019-08-09T21:15:55Z","snapshot_observed_at":"2026-08-16T15:41:09.230469Z","submitted_at":"2019-08-09T21:15:55Z","title":"The Chen-Teboulle algorithm is the proximal point algorithm","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T14:15:21.295162Z"},"links":{"citing_paper":"/paper/1908.03633"},"observation_digest":"sha256:41ecc3f4b3fb68a5f402982619850d42d3db4040a5a9691a8fc2f1ef85296db7","observation_id":"022066d4-c3fb-447f-985e-d14c70c4c504","resolution":{"observed_at":"2026-08-14T14:15:21.470023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:15:21.455789Z","title":null,"venue":null,"work_id":"a8ca30d1-860d-4032-9f2b-8fb958d6f3de","year":2007},"citing_paper":{"arxiv_id":"1908.03633","last_updated":"2019-08-09T21:15:55Z","snapshot_observed_at":"2026-08-16T15:41:09.230469Z","submitted_at":"2019-08-09T21:15:55Z","title":"The Chen-Teboulle algorithm is the proximal point algorithm","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T14:15:21.299011Z"},"links":{"citing_paper":"/paper/1908.03633"},"observation_digest":"sha256:14b1814bbf19fd48e7f2fd8238d551ca639c1270d3cfed9820de0dbd61405978","observation_id":"e7ebb416-9349-47ef-b2b6-7d376a1a530f","resolution":{"observed_at":"2026-08-14T14:15:21.459188Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:15:21.444934Z","title":"Chambolle and T","venue":null,"work_id":"c2878189-b5e7-472f-9e28-09062f70c548","year":2010},"citing_paper":{"arxiv_id":"1908.03633","last_updated":"2019-08-09T21:15:55Z","snapshot_observed_at":"2026-08-16T15:41:09.230469Z","submitted_at":"2019-08-09T21:15:55Z","title":"The Chen-Teboulle algorithm is the proximal point algorithm","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T14:15:21.302725Z"},"links":{"citing_paper":"/paper/1908.03633"},"observation_digest":"sha256:db1297f368bf32b0b9fb304024ce496990720721e5deb19b686de72c4f4efba0","observation_id":"fc7dd74b-0559-4fd3-ab9d-1bc707f6b694","resolution":{"observed_at":"2026-08-14T14:15:21.449468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:15:21.436066Z","title":"Chen and M","venue":null,"work_id":"497c1055-dad7-4225-bf64-75ca8a12e096","year":1994},"citing_paper":{"arxiv_id":"1908.03633","last_updated":"2019-08-09T21:15:55Z","snapshot_observed_at":"2026-08-16T15:41:09.230469Z","submitted_at":"2019-08-09T21:15:55Z","title":"The Chen-Teboulle algorithm is the proximal point algorithm","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T14:15:21.307349Z"},"links":{"citing_paper":"/paper/1908.03633"},"observation_digest":"sha256:e0e6f629939f6a68438b84b8f195cc555e4c7ecf8bde9d40b3f6708b0c89ade3","observation_id":"0eb80e97-5af0-40b0-9d6b-8fa3b87054a1","resolution":{"observed_at":"2026-08-14T14:15:21.439216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:15:21.425423Z","title":"Esser, X","venue":null,"work_id":"67782f84-5879-4a41-b4d5-b8553da0cd3d","year":2010},"citing_paper":{"arxiv_id":"1908.03633","last_updated":"2019-08-09T21:15:55Z","snapshot_observed_at":"2026-08-16T15:41:09.230469Z","submitted_at":"2019-08-09T21:15:55Z","title":"The Chen-Teboulle algorithm is the proximal point algorithm","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T14:15:21.311228Z"},"links":{"citing_paper":"/paper/1908.03633"},"observation_digest":"sha256:02a840244fe0b0a2f00c03831ca43d1f35b575108eeeb8cbd2d8324291c8c7bf","observation_id":"eb9fbc1c-e461-458a-8081-2d81c952f447","resolution":{"observed_at":"2026-08-14T14:15:21.429101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:15:21.414415Z","title":"He and X","venue":null,"work_id":"e7e2c977-7445-4d6e-8525-8e7901540715","year":2012},"citing_paper":{"arxiv_id":"1908.03633","last_updated":"2019-08-09T21:15:55Z","snapshot_observed_at":"2026-08-16T15:41:09.230469Z","submitted_at":"2019-08-09T21:15:55Z","title":"The Chen-Teboulle algorithm is the proximal point algorithm","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T14:15:21.315070Z"},"links":{"citing_paper":"/paper/1908.03633"},"observation_digest":"sha256:e3259ccefe2322a33b2703ed43a2352f3af5485dad605feafc2b7515a0df035f","observation_id":"8f063812-422e-4098-8de9-afbb3d319168","resolution":{"observed_at":"2026-08-14T14:15:21.418621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:15:21.403581Z","title":"Moreau, Fonctions convexes duales et points proximaux dans un espace hilbertien, R","venue":null,"work_id":"dcad4c36-c4db-4649-9b82-7ab14b360634","year":1962},"citing_paper":{"arxiv_id":"1908.03633","last_updated":"2019-08-09T21:15:55Z","snapshot_observed_at":"2026-08-16T15:41:09.230469Z","submitted_at":"2019-08-09T21:15:55Z","title":"The Chen-Teboulle algorithm is the proximal point algorithm","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T14:15:21.319150Z"},"links":{"citing_paper":"/paper/1908.03633"},"observation_digest":"sha256:ae9bd77178bd072bbf63e76ad546508fe2cdef27d5dd76607516f6b884cceeb7","observation_id":"1165335c-34be-4f01-a566-b958cfa4b411","resolution":{"observed_at":"2026-08-14T14:15:21.407034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:15:21.392237Z","title":null,"venue":null,"work_id":"92088723-2bf2-414e-95c0-12e2aa879c15","year":1970},"citing_paper":{"arxiv_id":"1908.03633","last_updated":"2019-08-09T21:15:55Z","snapshot_observed_at":"2026-08-16T15:41:09.230469Z","submitted_at":"2019-08-09T21:15:55Z","title":"The Chen-Teboulle algorithm is the proximal point algorithm","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T14:15:21.322594Z"},"links":{"citing_paper":"/paper/1908.03633"},"observation_digest":"sha256:b5bfbe0db4abf60d351025565b5ef60d8f22846e0461bc3962b2ae961e7c2ceb","observation_id":"fe956e0a-9060-48ce-a542-b77ec5b34114","resolution":{"observed_at":"2026-08-14T14:15:21.396440Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:15:21.380701Z","title":"Tseng, On accelerated proximal gradient methods for convex-concave optimization, SIAM J","venue":null,"work_id":"fd8ebde3-2cc2-490f-8fb1-b8cf21d6b9f4","year":2008},"citing_paper":{"arxiv_id":"1908.03633","last_updated":"2019-08-09T21:15:55Z","snapshot_observed_at":"2026-08-16T15:41:09.230469Z","submitted_at":"2019-08-09T21:15:55Z","title":"The Chen-Teboulle algorithm is the proximal point algorithm","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T14:15:21.325868Z"},"links":{"citing_paper":"/paper/1908.03633"},"observation_digest":"sha256:7ac169f400b570ec1c9b083b0bc04c8d7ec513618c57555a0861b3c649d84a2e","observation_id":"bb6eec98-c7ef-4043-bb0a-59ecee6871b1","resolution":{"observed_at":"2026-08-14T14:15:21.385028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:15:21.370209Z","title":null,"venue":null,"work_id":"6941915d-cf96-4fd4-a63e-eb8c53a5c3b5","year":2013},"citing_paper":{"arxiv_id":"1908.03633","last_updated":"2019-08-09T21:15:55Z","snapshot_observed_at":"2026-08-16T15:41:09.230469Z","submitted_at":"2019-08-09T21:15:55Z","title":"The Chen-Teboulle algorithm is the proximal point algorithm","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T14:15:21.329326Z"},"links":{"citing_paper":"/paper/1908.03633"},"observation_digest":"sha256:acdd910c0c987985629b63b2a6386278d01f96e82153092c004bc7854d0cdad5","observation_id":"d5a25ff0-c290-4166-b472-0ba0a299cc0c","resolution":{"observed_at":"2026-08-14T14:15:21.373898Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:15:21.357572Z","title":"Zhu and T","venue":null,"work_id":"b8ea91bb-ba46-47d9-9be8-7673e93e8ed7","year":2008},"citing_paper":{"arxiv_id":"1908.03633","last_updated":"2019-08-09T21:15:55Z","snapshot_observed_at":"2026-08-16T15:41:09.230469Z","submitted_at":"2019-08-09T21:15:55Z","title":"The Chen-Teboulle algorithm is the proximal point algorithm","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T14:15:21.332633Z"},"links":{"citing_paper":"/paper/1908.03633"},"observation_digest":"sha256:60a38d9ccf5bb593ae5bb920c130ff71c29fd769fc5160bdcce8c5c487cb29fc","observation_id":"91143900-7db8-46a6-b0a2-67014c00593f","resolution":{"observed_at":"2026-08-14T14:15:21.362248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.03633","last_updated":"2019-08-09T21:15:55Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T15:41:09.230469Z","submitted_at":"2019-08-09T21:15:55Z","title":"The Chen-Teboulle algorithm is the proximal point algorithm"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":8},"total_outbound_references":12},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:1908.03633."}