{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SMF2V2RQZ5SJA6EMVAYFYBMWID","short_pith_number":"pith:SMF2V2RQ","canonical_record":{"source":{"id":"1606.02220","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T17:09:56Z","cross_cats_sorted":[],"title_canon_sha256":"9e9ab2968084611bbad7d9a814bf8e9a0f1788ae63a35e0bde965059efd29b70","abstract_canon_sha256":"00cbd759cb5292b618196592f4b19c1265afacff727a52f15c3713fc4db0c6b4"},"schema_version":"1.0"},"canonical_sha256":"930baaea30cf6490788ca8305c059640db58abf41b700ba4c5cae50574df4dbf","source":{"kind":"arxiv","id":"1606.02220","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02220","created_at":"2026-05-18T00:56:30Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02220v4","created_at":"2026-05-18T00:56:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02220","created_at":"2026-05-18T00:56:30Z"},{"alias_kind":"pith_short_12","alias_value":"SMF2V2RQZ5SJ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SMF2V2RQZ5SJA6EM","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SMF2V2RQ","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SMF2V2RQZ5SJA6EMVAYFYBMWID","target":"record","payload":{"canonical_record":{"source":{"id":"1606.02220","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T17:09:56Z","cross_cats_sorted":[],"title_canon_sha256":"9e9ab2968084611bbad7d9a814bf8e9a0f1788ae63a35e0bde965059efd29b70","abstract_canon_sha256":"00cbd759cb5292b618196592f4b19c1265afacff727a52f15c3713fc4db0c6b4"},"schema_version":"1.0"},"canonical_sha256":"930baaea30cf6490788ca8305c059640db58abf41b700ba4c5cae50574df4dbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:30.952350Z","signature_b64":"IMWECNhwXlgynEhyt5IPqpX1cgPCTt7wW/EoUH7ISNhJxAj5b+F+31MK8kitI5vOr8OYeSGte/7A5QNQy/4sCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"930baaea30cf6490788ca8305c059640db58abf41b700ba4c5cae50574df4dbf","last_reissued_at":"2026-05-18T00:56:30.951522Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:30.951522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.02220","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SHIrBJ6oZ6eKeAXo7fXY3pUPpXQ0hoQYauYkX7aSfbIF6dWpj0mDLG6tQsZNs5nxO8MtkuegTR/kneJy7H9WCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:44:42.467075Z"},"content_sha256":"158c0f1d50e8589fd97a667da280a1f072371a83f4736e5fe3352df3f08c8edc","schema_version":"1.0","event_id":"sha256:158c0f1d50e8589fd97a667da280a1f072371a83f4736e5fe3352df3f08c8edc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SMF2V2RQZ5SJA6EMVAYFYBMWID","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-aligned drawings of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Claire Pennarun, Therese Biedl","submitted_at":"2016-06-07T17:09:56Z","abstract_excerpt":"A non-aligned drawing of a graph is a drawing where no two vertices are in the same row or column. Auber et al. showed that not all planar graphs have non-aligned drawings that are straight-line, planar, and in the minimal-possible $n\\times n$-grid. They also showed that such drawings exist if up to $n-3$ edges may have a bend. In this paper, we give algorithms for non-aligned planar drawings that improve on the results by Auber et al. In particular, we give such drawings in an $n\\times n$-grid with significantly fewer bends, and we study what grid-size can be achieved if we insist on having s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02220","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7NgBk+zSzyuWLQMCxPf1sNRiG64wMOkQ5ICwNGMdNYQ/jIvbpE8OgIp8z26Bt7s+UHseyorPXMx/7tV0KFv0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:44:42.467431Z"},"content_sha256":"fcdfa53cf5174118cb6f67e6758277823491f0bd4f84cd2cd550535008d0a12d","schema_version":"1.0","event_id":"sha256:fcdfa53cf5174118cb6f67e6758277823491f0bd4f84cd2cd550535008d0a12d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SMF2V2RQZ5SJA6EMVAYFYBMWID/bundle.json","state_url":"https://pith.science/pith/SMF2V2RQZ5SJA6EMVAYFYBMWID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SMF2V2RQZ5SJA6EMVAYFYBMWID/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T08:44:42Z","links":{"resolver":"https://pith.science/pith/SMF2V2RQZ5SJA6EMVAYFYBMWID","bundle":"https://pith.science/pith/SMF2V2RQZ5SJA6EMVAYFYBMWID/bundle.json","state":"https://pith.science/pith/SMF2V2RQZ5SJA6EMVAYFYBMWID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SMF2V2RQZ5SJA6EMVAYFYBMWID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SMF2V2RQZ5SJA6EMVAYFYBMWID","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":"00cbd759cb5292b618196592f4b19c1265afacff727a52f15c3713fc4db0c6b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T17:09:56Z","title_canon_sha256":"9e9ab2968084611bbad7d9a814bf8e9a0f1788ae63a35e0bde965059efd29b70"},"schema_version":"1.0","source":{"id":"1606.02220","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02220","created_at":"2026-05-18T00:56:30Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02220v4","created_at":"2026-05-18T00:56:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02220","created_at":"2026-05-18T00:56:30Z"},{"alias_kind":"pith_short_12","alias_value":"SMF2V2RQZ5SJ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SMF2V2RQZ5SJA6EM","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SMF2V2RQ","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:fcdfa53cf5174118cb6f67e6758277823491f0bd4f84cd2cd550535008d0a12d","target":"graph","created_at":"2026-05-18T00:56:30Z","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":"A non-aligned drawing of a graph is a drawing where no two vertices are in the same row or column. Auber et al. showed that not all planar graphs have non-aligned drawings that are straight-line, planar, and in the minimal-possible $n\\times n$-grid. They also showed that such drawings exist if up to $n-3$ edges may have a bend. In this paper, we give algorithms for non-aligned planar drawings that improve on the results by Auber et al. In particular, we give such drawings in an $n\\times n$-grid with significantly fewer bends, and we study what grid-size can be achieved if we insist on having s","authors_text":"Claire Pennarun, Therese Biedl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T17:09:56Z","title":"Non-aligned drawings of planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02220","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:158c0f1d50e8589fd97a667da280a1f072371a83f4736e5fe3352df3f08c8edc","target":"record","created_at":"2026-05-18T00:56:30Z","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":"00cbd759cb5292b618196592f4b19c1265afacff727a52f15c3713fc4db0c6b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T17:09:56Z","title_canon_sha256":"9e9ab2968084611bbad7d9a814bf8e9a0f1788ae63a35e0bde965059efd29b70"},"schema_version":"1.0","source":{"id":"1606.02220","kind":"arxiv","version":4}},"canonical_sha256":"930baaea30cf6490788ca8305c059640db58abf41b700ba4c5cae50574df4dbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"930baaea30cf6490788ca8305c059640db58abf41b700ba4c5cae50574df4dbf","first_computed_at":"2026-05-18T00:56:30.951522Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:30.951522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IMWECNhwXlgynEhyt5IPqpX1cgPCTt7wW/EoUH7ISNhJxAj5b+F+31MK8kitI5vOr8OYeSGte/7A5QNQy/4sCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:30.952350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.02220","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:158c0f1d50e8589fd97a667da280a1f072371a83f4736e5fe3352df3f08c8edc","sha256:fcdfa53cf5174118cb6f67e6758277823491f0bd4f84cd2cd550535008d0a12d"],"state_sha256":"8aabf2d658d457017fbd1b88cdc0384bf7c1019656e701fa5990ea9e81e0fdb8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Khjmug+4TjwGh+6LpP5OXRWbK8fRHAi4N7o2g3EKTom52bsfkk8dI8pVrU8qS0kCn5tdvInWdebxryenM3KgCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:44:42.469594Z","bundle_sha256":"fd6d2712bbd05d1b4596067cb8db52cfb7c4fc7446ab5a1aa2123477ca608c54"}}