{"as_of":"2026-08-16T10:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:70a61196323bb5686e9b54f4b431a5ea905d19934a6d26053e406100d8a2e2c7","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-16T06:30:59.297886+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-14T15:18:41.789908Z","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-14T15:18:43.056960Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1808.10519","last_updated":"2018-08-30T21:01:53Z","snapshot_observed_at":"2026-08-14T18:34:52.132853Z","submitted_at":"2018-08-30T21:01:53Z","title":"A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution","version":1},"cited_work":{"arxiv_id":"1808.10519","doi":null,"metadata_source":"pith","pith_arxiv_id":"1808.10519","snapshot_observed_at":"2026-08-14T15:18:43.056960Z","title":"A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution","venue":"cs.DS","work_id":"a90c5414-fe72-4321-b671-d9f3ab508a9e","year":2018},"citing_paper":{"arxiv_id":"1908.01769","last_updated":"2019-08-23T17:13:17Z","snapshot_observed_at":"2026-08-14T15:11:26.462423Z","submitted_at":"2019-08-04T22:31:02Z","title":"Stress-Plus-X (SPX) Graph Layout","version":5},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:41.789908Z"},"links":{"cited_paper":"/paper/1808.10519","citing_paper":"/paper/1908.01769"},"observation_digest":"sha256:c3172b80c603cbf262304326ec9bfcb8ef539325fd3bdf6a74a566eede48ca79","observation_id":"819d9b47-d8b1-42b5-be9e-9b5293186a71","resolution":{"observed_at":"2026-08-14T15:18:43.063965Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1808.10519/citation-record","integrity":"/paper/1808.10519/integrity","json":"/paper/1808.10519/citation-record.json","paper":"/paper/1808.10519"},"outbound":[],"paper":{"arxiv_id":"1808.10519","last_updated":"2018-08-30T21:01:53Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T18:34:52.132853Z","submitted_at":"2018-08-30T21:01:53Z","title":"A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1808.10519."}