{"as_of":"2026-08-16T09:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9c129a0b7dfe1cbad2d55a8a43a14644d823914e6379413c19dbfb5e3409ea08","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.821365Z","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:42.974516Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1807.09483","last_updated":"2018-07-31T09:42:41Z","snapshot_observed_at":"2026-08-15T22:45:40.169966Z","submitted_at":"2018-07-25T08:43:03Z","title":"A Greedy Heuristic for Crossing-Angle Maximization","version":2},"cited_work":{"arxiv_id":"1807.09483","doi":null,"metadata_source":"pith","pith_arxiv_id":"1807.09483","snapshot_observed_at":"2026-08-14T15:18:42.974516Z","title":"A Greedy Heuristic for Crossing-Angle Maximization","venue":"cs.CG","work_id":"9b79975e-f098-473a-b1f2-03a1aa437d71","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":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:41.821365Z"},"links":{"cited_paper":"/paper/1807.09483","citing_paper":"/paper/1908.01769"},"observation_digest":"sha256:209e61a2f868cb281c36a237389e801b89cee4ba55006c3795e507e7eeb381fe","observation_id":"33fa0fce-8880-4c34-be62-01c824e9a760","resolution":{"observed_at":"2026-08-14T15:18:43.033157Z","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/1807.09483/citation-record","integrity":"/paper/1807.09483/integrity","json":"/paper/1807.09483/citation-record.json","paper":"/paper/1807.09483"},"outbound":[],"paper":{"arxiv_id":"1807.09483","last_updated":"2018-07-31T09:42:41Z","latest_version":2,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-15T22:45:40.169966Z","submitted_at":"2018-07-25T08:43:03Z","title":"A Greedy Heuristic for Crossing-Angle Maximization"},"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:1807.09483."}