{"as_of":"2026-08-15T22:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3f02cc05fc749a19cea38591b8d5fa89bee57e64362b67488d64e798502dce99","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-15T06:32:42.880941+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-14T11:22:45.253998Z","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-14T11:22:45.912253Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1302.7127","last_updated":"2015-05-07T15:14:07Z","snapshot_observed_at":"2026-08-15T00:27:06.674331Z","submitted_at":"2013-02-28T09:55:20Z","title":"The Complexity of Simultaneous Geometric Graph Embedding","version":3},"cited_work":{"arxiv_id":"1302.7127","doi":null,"metadata_source":"pith","pith_arxiv_id":"1302.7127","snapshot_observed_at":"2026-08-14T11:22:45.912253Z","title":"The Complexity of Simultaneous Geometric Graph Embedding","venue":"cs.CG","work_id":"d1f05d10-ea71-40f2-928e-519d1ccaf37c","year":2013},"citing_paper":{"arxiv_id":"1908.09400","last_updated":"2019-08-27T10:21:20Z","snapshot_observed_at":"2026-08-15T05:17:25.400616Z","submitted_at":"2019-08-25T22:06:22Z","title":"Optimal Curve Straightening is $\\exists\\mathbb{R}$-Complete","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:45.253998Z"},"links":{"cited_paper":"/paper/1302.7127","citing_paper":"/paper/1908.09400"},"observation_digest":"sha256:539ffdc79bd45cdb808c7910e721420baf6ce4de8651021fa4fb919f1149aeb9","observation_id":"711c809b-690a-42af-8eeb-a79772571675","resolution":{"observed_at":"2026-08-14T11:22:45.917595Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1302.7127/citation-record","integrity":"/paper/1302.7127/integrity","json":"/paper/1302.7127/citation-record.json","paper":"/paper/1302.7127"},"outbound":[],"paper":{"arxiv_id":"1302.7127","last_updated":"2015-05-07T15:14:07Z","latest_version":3,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-15T00:27:06.674331Z","submitted_at":"2013-02-28T09:55:20Z","title":"The Complexity of Simultaneous Geometric Graph Embedding"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1302.7127."}