{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5V23FZZJFGLYAEHUXGBYG3PYRB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"78df397b0c94c292fe456bb7f617f3568fa69242a323c9503acb0d9c3ff2b828","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-21T19:50:36Z","title_canon_sha256":"7e13685e7a4850bdc62ca906480f7ffdaa17dd5cf16bef5a1a12c542684f47c3"},"schema_version":"1.0","source":{"id":"1607.06444","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06444","created_at":"2026-07-05T07:50:46Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06444v4","created_at":"2026-07-05T07:50:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06444","created_at":"2026-07-05T07:50:46Z"},{"alias_kind":"pith_short_12","alias_value":"5V23FZZJFGLY","created_at":"2026-07-05T07:50:46Z"},{"alias_kind":"pith_short_16","alias_value":"5V23FZZJFGLYAEHU","created_at":"2026-07-05T07:50:46Z"},{"alias_kind":"pith_short_8","alias_value":"5V23FZZJ","created_at":"2026-07-05T07:50:46Z"}],"graph_snapshots":[{"event_id":"sha256:40753ffa6dd798be0a67e54cb9a2079c0df35596ec1c137ded3461006cc4bb48","target":"graph","created_at":"2026-07-05T07:50:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1607.06444/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"It is well known that any graph admits a crossing-free straight-line drawing in $\\mathbb{R}^3$ and that any planar graph admits the same even in $\\mathbb{R}^2$. For a graph $G$ and $d \\in \\{2,3\\}$, let $\\rho^1_d(G)$ denote the smallest number of lines in $\\mathbb{R}^d$ whose union contains a crossing-free straight-line drawing of $G$. For $d=2$, $G$ must be planar. Similarly, let $\\rho^2_3(G)$ denote the smallest number of planes in $\\mathbb{R}^3$ whose union contains a crossing-free straight-line drawing of $G$.\n  We investigate the complexity of computing these three parameters and obtain th","authors_text":"Alexander Ravsky, Alexander Wolff, Fabian Lipp, Krzysztof Fleszar, Oleg Verbitsky, Steven Chaplick","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-21T19:50:36Z","title":"The Complexity of Drawing Graphs on Few Lines and Few Planes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06444","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cab0f03d913945de725177cdefd8bed22f6872c7cb0bdc32222dab7b742fe328","target":"record","created_at":"2026-07-05T07:50:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"78df397b0c94c292fe456bb7f617f3568fa69242a323c9503acb0d9c3ff2b828","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-21T19:50:36Z","title_canon_sha256":"7e13685e7a4850bdc62ca906480f7ffdaa17dd5cf16bef5a1a12c542684f47c3"},"schema_version":"1.0","source":{"id":"1607.06444","kind":"arxiv","version":4}},"canonical_sha256":"ed75b2e72929978010f4b983836df88876ea1a76495e0bd5fb6c49576e042ceb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed75b2e72929978010f4b983836df88876ea1a76495e0bd5fb6c49576e042ceb","first_computed_at":"2026-07-05T07:50:46.751299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:50:46.751299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h7bxAJbEHAzvgCQ4FSvsQOEiKhTp4sOFeGKg8v3ObomLmYmihZcg3kRuICr2G6Z2vOcTWfMSOTa12zkIZoLhDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:50:46.751773Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06444","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cab0f03d913945de725177cdefd8bed22f6872c7cb0bdc32222dab7b742fe328","sha256:40753ffa6dd798be0a67e54cb9a2079c0df35596ec1c137ded3461006cc4bb48"],"state_sha256":"a4599a4d012e1b6be6b2b27b86965273434a7e44cf36596ff982158052ae4652"}