{"as_of":"2026-08-15T15:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bb6154ce6320645e5fff92cda01a3fbd18bc11bfc5022400e7c3d6146656ee8a","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:25:27.417594Z","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.889872Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1607.06444","last_updated":"2024-03-01T10:30:02Z","snapshot_observed_at":"2026-08-15T14:01:52.223730Z","submitted_at":"2016-07-21T19:50:36Z","title":"The Complexity of Drawing Graphs on Few Lines and Few Planes","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.06444","snapshot_observed_at":"2026-08-14T12:25:27.417594Z","title":"In: Ellen, F., Kolokolova, A., Sack, J.R","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.07647","last_updated":"2019-08-20T23:52:50Z","snapshot_observed_at":"2026-08-14T11:58:34.045910Z","submitted_at":"2019-08-20T23:52:50Z","title":"Line and Plane Cover Numbers Revisited","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:25:27.417594Z"},"links":{"cited_paper":"/paper/1607.06444","citing_paper":"/paper/1908.07647"},"observation_digest":"sha256:9bd7d06c61716ec2f145a20d6af357e37e29b1c5e99a4d2ae61908ed54c3a130","observation_id":"0d48be51-ef6f-4257-967a-6a0fe772b35f","resolution":{"observed_at":"2026-08-14T12:25:27.417594Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1607.06444","last_updated":"2024-03-01T10:30:02Z","snapshot_observed_at":"2026-08-15T14:01:52.223730Z","submitted_at":"2016-07-21T19:50:36Z","title":"The Complexity of Drawing Graphs on Few Lines and Few Planes","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.06444","snapshot_observed_at":"2026-08-14T11:48:09.104662Z","title":"In: Ellen, F., Kolokolova, A., Sack, J.R","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.08871","last_updated":"2019-09-07T11:31:53Z","snapshot_observed_at":"2026-08-14T17:36:04.327491Z","submitted_at":"2019-08-23T15:37:38Z","title":"Variants of the Segment Number of a Graph","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:09.104662Z"},"links":{"cited_paper":"/paper/1607.06444","citing_paper":"/paper/1908.08871"},"observation_digest":"sha256:c01328c9410320930c6e85c180ab0045f3ee0eb592936f66bcc0446dc6f3929c","observation_id":"730474ba-cdf5-4c52-9637-a91ef5fc1b18","resolution":{"observed_at":"2026-08-14T11:48:09.104662Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1607.06444","last_updated":"2024-03-01T10:30:02Z","snapshot_observed_at":"2026-08-15T14:01:52.223730Z","submitted_at":"2016-07-21T19:50:36Z","title":"The Complexity of Drawing Graphs on Few Lines and Few Planes","version":4},"cited_work":{"arxiv_id":"1607.06444","doi":null,"metadata_source":"pith","pith_arxiv_id":"1607.06444","snapshot_observed_at":"2026-08-14T11:22:45.889872Z","title":"The Complexity of Drawing Graphs on Few Lines and Few Planes","venue":"cs.CC","work_id":"9db9c6b3-b137-42c1-b07a-32dcd15f87d5","year":2016},"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":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:45.264625Z"},"links":{"cited_paper":"/paper/1607.06444","citing_paper":"/paper/1908.09400"},"observation_digest":"sha256:5a46183e3276d1fb02087647c97d07d9b2ecce2026e3014f2c294753b510e776","observation_id":"5f3eb4fb-50ec-456f-b9c3-8e94cdd3faa0","resolution":{"observed_at":"2026-08-14T11:22:45.895143Z","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/1607.06444/citation-record","integrity":"/paper/1607.06444/integrity","json":"/paper/1607.06444/citation-record.json","paper":"/paper/1607.06444"},"outbound":[],"paper":{"arxiv_id":"1607.06444","last_updated":"2024-03-01T10:30:02Z","latest_version":4,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-15T14:01:52.223730Z","submitted_at":"2016-07-21T19:50:36Z","title":"The Complexity of Drawing Graphs on Few Lines and Few Planes"},"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 3 inbound Pith citation observations for arXiv:1607.06444."}