{"as_of":"2026-08-15T04:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3da6c4a9d22077ed9499237a10b640484620d31325ca5f3f18c686e65e8fb63f","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-14T06:32:32.682623+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-03T04:14:59.500120Z","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-07-03T12:28:07.380866Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.06374","last_updated":"2026-06-11T14:50:14Z","snapshot_observed_at":"2026-08-07T15:48:21.054775Z","submitted_at":"2025-05-09T18:38:46Z","title":"Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.06374","snapshot_observed_at":"2026-08-03T04:14:59.500120Z","title":"Fast stochas- tic second-order adagrad for nonconvex bound-constrained op timization","venue":null,"work_id":null,"year":2025},"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":1,"source":"pdf_text","source_observed_at":"2026-08-03T04:14:59.500120Z"},"links":{"cited_paper":"/paper/2505.06374","citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:4c21213a92bf2f82baa66e41b0fdbcbdb7bb980f30663835cb4020481c447647","observation_id":"43d4711a-abdd-4acc-b5b5-bc3176e3cadb","resolution":{"observed_at":"2026-08-03T04:14:59.500120Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.06374","last_updated":"2026-06-11T14:50:14Z","snapshot_observed_at":"2026-08-07T15:48:21.054775Z","submitted_at":"2025-05-09T18:38:46Z","title":"Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization","version":2},"cited_work":{"arxiv_id":"2505.06374","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.06374","snapshot_observed_at":"2026-07-03T12:28:07.380866Z","title":"Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization","venue":"math.OC","work_id":"62ea6f44-19b1-4ce9-9861-d85163cd89da","year":2025},"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":11,"source":"pdf_text","source_observed_at":"2026-06-27T09:00:34.960719Z"},"links":{"cited_paper":"/paper/2505.06374","citing_paper":"/paper/2606.11791"},"observation_digest":"sha256:9193083c5892c76693fbe6efdc033968f7696c2aa770ca8085f20aee112c64ff","observation_id":"6b53479d-1c70-4db7-ac2c-f1cb462ab325","resolution":{"observed_at":"2026-07-03T12:28:07.382212Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.06374/citation-record","integrity":"/paper/2505.06374/integrity","json":"/paper/2505.06374/citation-record.json","paper":"/paper/2505.06374"},"outbound":[],"paper":{"arxiv_id":"2505.06374","last_updated":"2026-06-11T14:50:14Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T15:48:21.054775Z","submitted_at":"2025-05-09T18:38:46Z","title":"Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2505.06374."}