{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CVX3XH64CGWDSKMAL53Z24WHZC","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":"ecbf66385820dbb365cc1d3f84a8c058b3b9b03041fb0d5ec4615bf573771f95","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-05T11:23:46Z","title_canon_sha256":"656c25d3c065519b7e47c7fa1cf6ad141dfa9718e1ff5e0bf0b2c9b574e2a6dc"},"schema_version":"1.0","source":{"id":"1607.01196","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01196","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01196v2","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01196","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"pith_short_12","alias_value":"CVX3XH64CGWD","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CVX3XH64CGWDSKMA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CVX3XH64","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:cf5b657127dcf85abc12458e135f4bb3bac8d28982d1577c625791558a5cb938","target":"graph","created_at":"2026-05-18T01:06:28Z","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"},"paper":{"abstract_excerpt":"We investigate the problem of drawing graphs in 2D and 3D such that their edges (or only their vertices) can be covered by few lines or planes. We insist on straight-line edges and crossing-free drawings. This problem has many connections to other challenging graph-drawing problems such as small-area or small-volume drawings, layered or track drawings, and drawing graphs with low visual complexity. While some facts about our problem are implicit in previous work, this is the first treatment of the problem in its full generality. Our contribution is as follows.\n  We show lower and upper bounds ","authors_text":"Alexander Ravsky, Alexander Wolff, Fabian Lipp, Krzysztof Fleszar, Oleg Verbitsky, Steven Chaplick","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-05T11:23:46Z","title":"Drawing Graphs on Few Lines and Few Planes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01196","kind":"arxiv","version":2},"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:c630d973800eee58b7b5d2994b1640f05fb78204969b97a080d5415a746e02a5","target":"record","created_at":"2026-05-18T01:06:28Z","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":"ecbf66385820dbb365cc1d3f84a8c058b3b9b03041fb0d5ec4615bf573771f95","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-05T11:23:46Z","title_canon_sha256":"656c25d3c065519b7e47c7fa1cf6ad141dfa9718e1ff5e0bf0b2c9b574e2a6dc"},"schema_version":"1.0","source":{"id":"1607.01196","kind":"arxiv","version":2}},"canonical_sha256":"156fbb9fdc11ac3929805f779d72c7c8a40e0c18e46ee9a3b672055ee75712b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"156fbb9fdc11ac3929805f779d72c7c8a40e0c18e46ee9a3b672055ee75712b7","first_computed_at":"2026-05-18T01:06:28.502596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:28.502596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mNkGztI3qDfzHpCXrFcKER4dLzzyDCoWmaM5MhOjXW8JbEUZVwdIjMyPpB9t93ka+JE7lwITOKn3cCCyUZrlDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:28.503068Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.01196","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c630d973800eee58b7b5d2994b1640f05fb78204969b97a080d5415a746e02a5","sha256:cf5b657127dcf85abc12458e135f4bb3bac8d28982d1577c625791558a5cb938"],"state_sha256":"61cbc10ebd387b4b962672c6d21a8412d8eaad1ca42ffd1c9f35e4401b814d1f"}