{"as_of":"2026-08-08T12:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8d0e700cab43a09ea6fb836eb8169b4adee23a429d9773e075edc16382f02eee","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-08T06:32:00.761636+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-31T17:01:09.320791Z","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":"2003.09642","last_updated":"2023-03-17T16:46:59Z","snapshot_observed_at":"2026-08-07T11:59:11.135530Z","submitted_at":"2020-03-21T12:17:25Z","title":"An Online Framework to Interact and Efficiently Compute Linear Layouts of Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.09642","snapshot_observed_at":"2026-07-31T17:01:09.320791Z","title":"Bekos, Mirco Haug, Michael Kaufmann, and Julia M \\\" a nnecke","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.24375","last_updated":"2026-07-27T12:51:47Z","snapshot_observed_at":"2026-08-06T03:35:39.044652Z","submitted_at":"2026-07-27T12:51:47Z","title":"Weighted Book Thickness","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-31T17:01:09.320791Z"},"links":{"cited_paper":"/paper/2003.09642","citing_paper":"/paper/2607.24375"},"observation_digest":"sha256:e7d756883c50da17bfff23cf1217729901db41b16c50150a35ecf839ccd5dc58","observation_id":"a8d078a2-0287-4f81-bb65-d4bed1877491","resolution":{"observed_at":"2026-07-31T17:01:09.320791Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2003.09642/citation-record","integrity":"/paper/2003.09642/integrity","json":"/paper/2003.09642/citation-record.json","paper":"/paper/2003.09642"},"outbound":[],"paper":{"arxiv_id":"2003.09642","last_updated":"2023-03-17T16:46:59Z","latest_version":2,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-07T11:59:11.135530Z","submitted_at":"2020-03-21T12:17:25Z","title":"An Online Framework to Interact and Efficiently Compute Linear Layouts of Graphs"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2003.09642."}