{"as_of":"2026-08-16T15:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3091941ee20cf2dbad555037f77390f1e38d41385ef96dfa2f2252cb26ec35f1","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-14T12:18:18.461272Z","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-14T12:18:18.699780Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1408.1422","last_updated":"2014-08-06T21:10:09Z","snapshot_observed_at":"2026-08-16T14:51:48.967817Z","submitted_at":"2014-08-06T21:10:09Z","title":"The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings","version":1},"cited_work":{"arxiv_id":"1408.1422","doi":null,"metadata_source":"pith","pith_arxiv_id":"1408.1422","snapshot_observed_at":"2026-08-14T12:18:18.699780Z","title":"The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings","venue":"cs.CG","work_id":"1c6d36ea-5c06-4af2-8a8c-2f6e90e766ba","year":2014},"citing_paper":{"arxiv_id":"1908.07668","last_updated":"2019-08-21T01:38:33Z","snapshot_observed_at":"2026-08-16T03:22:24.515506Z","submitted_at":"2019-08-21T01:38:33Z","title":"Existence and hardness of conveyor belts","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:18:18.461272Z"},"links":{"cited_paper":"/paper/1408.1422","citing_paper":"/paper/1908.07668"},"observation_digest":"sha256:e72ab613b5df73246bb128556a63f73cb17408d06b660090425cdf8b9be79b8b","observation_id":"8a318b8b-9667-49ed-b181-07ebbb5f7fa8","resolution":{"observed_at":"2026-08-14T12:18:18.705575Z","resolver_source":"local_arxiv","status":"verified_exact"},"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/1408.1422/citation-record","integrity":"/paper/1408.1422/integrity","json":"/paper/1408.1422/citation-record.json","paper":"/paper/1408.1422"},"outbound":[],"paper":{"arxiv_id":"1408.1422","last_updated":"2014-08-06T21:10:09Z","latest_version":1,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-16T14:51:48.967817Z","submitted_at":"2014-08-06T21:10:09Z","title":"The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings"},"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:1408.1422."}