{"as_of":"2026-08-15T07:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e0e61f85579980ec239caeccac2fca0d905c48ea0f261808e3b234ec31de9170","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-15T06:32:42.880941+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-06T17:14:29.755901Z","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-03T12:28:07.375542Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.15793","last_updated":"2024-11-01T07:39:08Z","snapshot_observed_at":"2026-08-12T23:37:03.040230Z","submitted_at":"2024-06-22T09:18:13Z","title":"Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.15793","snapshot_observed_at":"2026-08-06T17:14:29.755901Z","title":"Gratton, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.11513","last_updated":"2025-07-15T17:32:10Z","snapshot_observed_at":"2026-08-13T20:16:17.544748Z","submitted_at":"2025-07-15T17:32:10Z","title":"Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:29.755901Z"},"links":{"cited_paper":"/paper/2406.15793","citing_paper":"/paper/2507.11513"},"observation_digest":"sha256:832796e397ff930e3a2fd17b0ff0d6821f804cf4ada1b8d2de8227bc9c585e86","observation_id":"c1f6c164-b125-413a-a005-de9dfdb6e915","resolution":{"observed_at":"2026-08-06T17:14:29.755901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15793","last_updated":"2024-11-01T07:39:08Z","snapshot_observed_at":"2026-08-12T23:37:03.040230Z","submitted_at":"2024-06-22T09:18:13Z","title":"Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.15793","snapshot_observed_at":"2026-08-03T04:15:01.954866Z","title":"Complexity of adagrad and other first- order methods for nonconvex optimization problems with bounds co nstraints","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:01.954866Z"},"links":{"cited_paper":"/paper/2406.15793","citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:2e6555b1611e0922b8e270baa4759b90d0d943aad6e2beb20c9e93a65574ab49","observation_id":"1daa95ff-99c3-42a1-98c9-3f1b0ddb6370","resolution":{"observed_at":"2026-08-03T04:15:01.954866Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15793","last_updated":"2024-11-01T07:39:08Z","snapshot_observed_at":"2026-08-12T23:37:03.040230Z","submitted_at":"2024-06-22T09:18:13Z","title":"Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints","version":3},"cited_work":{"arxiv_id":"2406.15793","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.15793","snapshot_observed_at":"2026-07-03T12:28:07.375542Z","title":"Compl exity of adagrad and other first-order methods for nonconvex optimization problems with bounds constraints","venue":null,"work_id":"b6953306-44dc-4f8a-82a2-d314e0deaf3f","year":2024},"citing_paper":{"arxiv_id":"2606.11791","last_updated":"2026-06-10T08:23:37Z","snapshot_observed_at":"2026-08-09T06:32:13.556505Z","submitted_at":"2026-06-10T08:23:37Z","title":"bAdag: an adaptive block coordinate gradient method for smooth nonconvex functions","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-27T09:00:34.960719Z"},"links":{"cited_paper":"/paper/2406.15793","citing_paper":"/paper/2606.11791"},"observation_digest":"sha256:b9df8f68041d3a2f1acd709bdc69f4756fb83d947567e7173a3ab311dd12ee3f","observation_id":"4bea80a0-51a8-4647-86b7-8aaff6f5d31f","resolution":{"observed_at":"2026-07-03T12:28:07.377213Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.15793/citation-record","integrity":"/paper/2406.15793/integrity","json":"/paper/2406.15793/citation-record.json","paper":"/paper/2406.15793"},"outbound":[],"paper":{"arxiv_id":"2406.15793","last_updated":"2024-11-01T07:39:08Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-12T23:37:03.040230Z","submitted_at":"2024-06-22T09:18:13Z","title":"Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2406.15793."}