{"as_of":"2026-08-10T21:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:52f09277831c53f6dac5d36ee0c1d4c16c7a2ab0c31ab65bc8abae6ea51b8970","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-08-03T10:27:55.452895Z","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":"1712.08859","last_updated":"2022-07-31T21:43:32Z","snapshot_observed_at":"2026-07-06T06:15:55.194069Z","submitted_at":"2017-12-23T23:25:59Z","title":"Let's Make Block Coordinate Descent Converge Faster: Faster Greedy Rules, Message-Passing, Active-Set Complexity, and Superlinear Convergence","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.08859","snapshot_observed_at":"2026-08-03T10:27:55.452895Z","title":"Nutini, I","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.10203","last_updated":"2026-03-25T08:55:37Z","snapshot_observed_at":"2026-08-03T10:27:46.322426Z","submitted_at":"2026-01-15T09:09:36Z","title":"Topology-Aware Block Coordinate Descent for Qubit Frequency Allocation of Superconducting Quantum Processors","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-03T10:27:55.452895Z"},"links":{"cited_paper":"/paper/1712.08859","citing_paper":"/paper/2601.10203"},"observation_digest":"sha256:546eeff2a3342f56bb9231d8735f875c852b70056fb63256101a631ec51a7b4c","observation_id":"9fdfc2c4-b33e-4f3d-8ca0-cbed52b96f68","resolution":{"observed_at":"2026-08-03T10:27:55.452895Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1712.08859/citation-record","integrity":"/paper/1712.08859/integrity","json":"/paper/1712.08859/citation-record.json","paper":"/paper/1712.08859"},"outbound":[],"paper":{"arxiv_id":"1712.08859","last_updated":"2022-07-31T21:43:32Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T06:15:55.194069Z","submitted_at":"2017-12-23T23:25:59Z","title":"Let's Make Block Coordinate Descent Converge Faster: Faster Greedy Rules, Message-Passing, Active-Set Complexity, and Superlinear Convergence"},"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:1712.08859."}