{"as_of":"2026-08-21T21:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:db2e754935814c08588e1e5f1167d720d63cd94e8580bb118faa8a35b9b193da","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-21T06:32:19.484+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-05T15:34:14.631467Z","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-05T15:34:16.456488Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1709.01055","last_updated":"2017-09-04T17:45:10Z","snapshot_observed_at":"2026-08-14T20:36:17.871823Z","submitted_at":"2017-09-04T17:45:10Z","title":"Computing Storyline Visualizations with Few Block Crossings","version":1},"cited_work":{"arxiv_id":"1709.01055","doi":null,"metadata_source":"pith","pith_arxiv_id":"1709.01055","snapshot_observed_at":"2026-08-05T15:34:16.456488Z","title":"Computing Storyline Visualizations with Few Block Crossings","venue":"cs.CG","work_id":"b3cc6cf4-f424-4507-a2bb-c6f19d1668b5","year":2017},"citing_paper":{"arxiv_id":"2508.19802","last_updated":"2025-08-27T11:43:21Z","snapshot_observed_at":"2026-08-20T08:17:56.627007Z","submitted_at":"2025-08-27T11:43:21Z","title":"Optimizing Wiggle in Storylines","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T15:34:14.631467Z"},"links":{"cited_paper":"/paper/1709.01055","citing_paper":"/paper/2508.19802"},"observation_digest":"sha256:f23e255530b8ae900df0365cb1d1b266c04f0900719eb4d4b86601d1acc085d1","observation_id":"8563a199-a54f-46ab-9962-08283fcf6691","resolution":{"observed_at":"2026-08-05T15:34:16.555164Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1709.01055/citation-record","integrity":"/paper/1709.01055/integrity","json":"/paper/1709.01055/citation-record.json","paper":"/paper/1709.01055"},"outbound":[],"paper":{"arxiv_id":"1709.01055","last_updated":"2017-09-04T17:45:10Z","latest_version":1,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-14T20:36:17.871823Z","submitted_at":"2017-09-04T17:45:10Z","title":"Computing Storyline Visualizations with Few Block Crossings"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1709.01055."}