{"as_of":"2026-08-10T14:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8dd30508232c9de328b006f899411cce2c2039c621af80ca597efffaf20bcdd3","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-10T06:31:04.303077+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-07-30T15:28:01.811077Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2405.15010","last_updated":"2024-10-31T15:03:06Z","snapshot_observed_at":"2026-08-07T05:31:10.881567Z","submitted_at":"2024-05-23T19:29:38Z","title":"Parameter-free Clipped Gradient Descent Meets Polyak","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15010","snapshot_observed_at":"2026-07-30T15:28:01.811077Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26969","last_updated":"2026-08-04T19:16:45Z","snapshot_observed_at":"2026-08-10T03:40:34.297184Z","submitted_at":"2026-07-29T14:31:24Z","title":"Normalized First-Order Methods for Convex (L0, L1)-Smooth Optimization with Inexact Gradients","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-30T15:28:01.811077Z"},"links":{"cited_paper":"/paper/2405.15010","citing_paper":"/paper/2607.26969"},"observation_digest":"sha256:febd7b4f60ad69dc2b16e822bfa9fb5f3277169a0e0ae67de3bd485bf25e56fe","observation_id":"9c850e5b-2542-4ae9-b681-6d92d770bff3","resolution":{"observed_at":"2026-07-30T15:28:01.811077Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.15010/citation-record","integrity":"/paper/2405.15010/integrity","json":"/paper/2405.15010/citation-record.json","paper":"/paper/2405.15010"},"outbound":[],"paper":{"arxiv_id":"2405.15010","last_updated":"2024-10-31T15:03:06Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T05:31:10.881567Z","submitted_at":"2024-05-23T19:29:38Z","title":"Parameter-free Clipped Gradient Descent Meets Polyak"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2405.15010."}