{"as_of":"2026-08-10T14:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:670fdd8be8009a98530af9d7df7a094b797b88546b289370428edeaab5c937e2","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-01T11:14:29.262313Z","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":"1703.03352","last_updated":"2017-03-09T17:17:39Z","snapshot_observed_at":"2026-07-06T05:33:04.440709Z","submitted_at":"2017-03-09T17:17:39Z","title":"A log-linear time algorithm for constrained changepoint detection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.03352","snapshot_observed_at":"2026-08-01T11:14:29.262313Z","title":"arXiv preprint arXiv:1703.03352 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19961","last_updated":"2026-07-22T09:40:17Z","snapshot_observed_at":"2026-08-06T17:08:33.221556Z","submitted_at":"2026-07-22T09:40:17Z","title":"focus and focus-cpt: Fast Online Changepoint Detection in R and Python","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-01T11:14:29.262313Z"},"links":{"cited_paper":"/paper/1703.03352","citing_paper":"/paper/2607.19961"},"observation_digest":"sha256:7648424da970afdba33b1cf788f7c9c170ca44df323f148dc040d35eae3a348f","observation_id":"7282fc11-93a0-4f9b-98f3-d649676bba82","resolution":{"observed_at":"2026-08-01T11:14:29.262313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1703.03352/citation-record","integrity":"/paper/1703.03352/integrity","json":"/paper/1703.03352/citation-record.json","paper":"/paper/1703.03352"},"outbound":[],"paper":{"arxiv_id":"1703.03352","last_updated":"2017-03-09T17:17:39Z","latest_version":1,"primary_category":"stat.CO","snapshot_observed_at":"2026-07-06T05:33:04.440709Z","submitted_at":"2017-03-09T17:17:39Z","title":"A log-linear time algorithm for constrained changepoint detection"},"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:1703.03352."}