{"as_of":"2026-08-09T22:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:df0fa2f7a13cbd1acc81e2f31ba88def059d4ce338d618e2286ee332146a3002","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-09T06:31:02.800959+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-07T13:10:33.755079Z","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-07T13:10:43.039826Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1712.09379","last_updated":"2019-09-13T18:01:30Z","snapshot_observed_at":"2026-07-06T06:16:08.829992Z","submitted_at":"2017-12-26T19:40:47Z","title":"IHT dies hard: Provable accelerated Iterative Hard Thresholding","version":2},"cited_work":{"arxiv_id":"1712.09379","doi":null,"metadata_source":"pith","pith_arxiv_id":"1712.09379","snapshot_observed_at":"2026-08-07T13:10:43.039826Z","title":"IHT dies hard: Provable accelerated Iterative Hard Thresholding","venue":"math.OC","work_id":"79ca9452-ce45-453d-a8eb-cb0189c5b510","year":2017},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:33.755079Z"},"links":{"cited_paper":"/paper/1712.09379","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:33d37355cc9bfa06c45293e377cebc89043aa99855f7989fe50008ab5aff7e65","observation_id":"9d587d6a-b29c-4c1c-a3b2-054599fdb29c","resolution":{"observed_at":"2026-08-07T13:10:43.177553Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1712.09379/citation-record","integrity":"/paper/1712.09379/integrity","json":"/paper/1712.09379/citation-record.json","paper":"/paper/1712.09379"},"outbound":[],"paper":{"arxiv_id":"1712.09379","last_updated":"2019-09-13T18:01:30Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T06:16:08.829992Z","submitted_at":"2017-12-26T19:40:47Z","title":"IHT dies hard: Provable accelerated Iterative Hard Thresholding"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:1712.09379."}