{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SMF2V2RQZ5SJA6EMVAYFYBMWID","short_pith_number":"pith:SMF2V2RQ","schema_version":"1.0","canonical_sha256":"930baaea30cf6490788ca8305c059640db58abf41b700ba4c5cae50574df4dbf","source":{"kind":"arxiv","id":"1606.02220","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.02220","created_at":"2026-05-18T00:56:30.951675+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.02220v4","created_at":"2026-05-18T00:56:30.951675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02220","created_at":"2026-05-18T00:56:30.951675+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMF2V2RQZ5SJ","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMF2V2RQZ5SJA6EM","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMF2V2RQ","created_at":"2026-05-18T12:30:44.179134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SMF2V2RQZ5SJA6EMVAYFYBMWID","json":"https://pith.science/pith/SMF2V2RQZ5SJA6EMVAYFYBMWID.json","graph_json":"https://pith.science/api/pith-number/SMF2V2RQZ5SJA6EMVAYFYBMWID/graph.json","events_json":"https://pith.science/api/pith-number/SMF2V2RQZ5SJA6EMVAYFYBMWID/events.json","paper":"https://pith.science/paper/SMF2V2RQ"},"agent_actions":{"view_html":"https://pith.science/pith/SMF2V2RQZ5SJA6EMVAYFYBMWID","download_json":"https://pith.science/pith/SMF2V2RQZ5SJA6EMVAYFYBMWID.json","view_paper":"https://pith.science/paper/SMF2V2RQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.02220&json=true","fetch_graph":"https://pith.science/api/pith-number/SMF2V2RQZ5SJA6EMVAYFYBMWID/graph.json","fetch_events":"https://pith.science/api/pith-number/SMF2V2RQZ5SJA6EMVAYFYBMWID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMF2V2RQZ5SJA6EMVAYFYBMWID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMF2V2RQZ5SJA6EMVAYFYBMWID/action/storage_attestation","attest_author":"https://pith.science/pith/SMF2V2RQZ5SJA6EMVAYFYBMWID/action/author_attestation","sign_citation":"https://pith.science/pith/SMF2V2RQZ5SJA6EMVAYFYBMWID/action/citation_signature","submit_replication":"https://pith.science/pith/SMF2V2RQZ5SJA6EMVAYFYBMWID/action/replication_record"}},"created_at":"2026-05-18T00:56:30.951675+00:00","updated_at":"2026-05-18T00:56:30.951675+00:00"}