{"as_of":"2026-08-19T06:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a3e588fc4622462d1644f2f4b89ef0dc6e791daba89c602703482799ad75110f","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-19T06:32:44.657259+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-14T13:17:18.512550Z","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":"1609.07220","last_updated":"2017-02-20T08:00:30Z","snapshot_observed_at":"2026-08-14T21:38:32.550004Z","submitted_at":"2016-09-23T03:32:50Z","title":"Tight bounds on the maximum number of shortest unique substrings","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07220","snapshot_observed_at":"2026-07-14T13:17:18.512550Z","title":"Learning model predictive control for iterative tasks: A data-driven control framework,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.10243","last_updated":"2026-07-11T10:17:45Z","snapshot_observed_at":"2026-08-15T04:56:09.406557Z","submitted_at":"2026-07-11T10:17:45Z","title":"Diffusion-Residual Model Predictive Steering Control for Vehicle Stabilization at the Limit of Handling under Model Uncertainty","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-14T13:17:18.512550Z"},"links":{"cited_paper":"/paper/1609.07220","citing_paper":"/paper/2607.10243"},"observation_digest":"sha256:085af28713ab561c38ded7ff69713aad31d937a8fe259487edc22e830ddf5435","observation_id":"183c5456-d885-49b4-8a25-28009eed03a0","resolution":{"observed_at":"2026-07-14T13:17:18.512550Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1609.07220/citation-record","integrity":"/paper/1609.07220/integrity","json":"/paper/1609.07220/citation-record.json","paper":"/paper/1609.07220"},"outbound":[],"paper":{"arxiv_id":"1609.07220","last_updated":"2017-02-20T08:00:30Z","latest_version":2,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-14T21:38:32.550004Z","submitted_at":"2016-09-23T03:32:50Z","title":"Tight bounds on the maximum number of shortest unique substrings"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1609.07220."}