{"as_of":"2026-08-09T02:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f3f90dabce41dec8c88252bb1ad8d76a6590469d2f4961c9a3958ccdad0a360b","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T15:43:57.039315Z","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-08-05T15:43:57.140219Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1706.08483","last_updated":"2017-06-26T17:10:10Z","snapshot_observed_at":"2026-07-06T05:48:30.254634Z","submitted_at":"2017-06-26T17:10:10Z","title":"Complexity of the Regularized Newton Method","version":1},"cited_work":{"arxiv_id":"1706.08483","doi":null,"metadata_source":"pith","pith_arxiv_id":"1706.08483","snapshot_observed_at":"2026-08-05T15:43:57.140219Z","title":"Complexity of the Regularized Newton Method","venue":"math.OC","work_id":"d1b5cba3-5127-4869-829c-760ab3a3cad0","year":2017},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-09T01:59:32.194325Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.039315Z"},"links":{"cited_paper":"/paper/1706.08483","citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:36925d4166cc8392aff849fd76d7b0d0c9f7438c6d4ccb543bab1b599507a673","observation_id":"826f2627-e13e-4107-9b04-08b9f712dc3a","resolution":{"observed_at":"2026-08-05T15:43:57.143561Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/1706.08483/citation-record","integrity":"/paper/1706.08483/integrity","json":"/paper/1706.08483/citation-record.json","paper":"/paper/1706.08483"},"outbound":[],"paper":{"arxiv_id":"1706.08483","last_updated":"2017-06-26T17:10:10Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T05:48:30.254634Z","submitted_at":"2017-06-26T17:10:10Z","title":"Complexity of the Regularized Newton Method"},"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 1 inbound Pith citation observation for arXiv:1706.08483."}