{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RHRGU43YIW2QCMG2X6MBDLECPX","short_pith_number":"pith:RHRGU43Y","schema_version":"1.0","canonical_sha256":"89e26a737845b50130dabf9811ac827dc1d7888a6eff956ca9cf40b4f715a78e","source":{"kind":"arxiv","id":"1409.4299","version":1},"attestation_state":"computed","paper":{"title":"Planar Embeddings with Small and Uniform Faces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS"],"primary_cat":"cs.CG","authors_text":"Giordano Da Lozzo, Ignaz Rutter, Jan Kratochv\\'il, V\\'it Jel\\'inek","submitted_at":"2014-09-15T15:42:07Z","abstract_excerpt":"Motivated by finding planar embeddings that lead to drawings with favorable aesthetics, we study the problems MINMAXFACE and UNIFORMFACES of embedding a given biconnected multi-graph such that the largest face is as small as possible and such that all faces have the same size, respectively.\n  We prove a complexity dichotomy for MINMAXFACE and show that deciding whether the maximum is at most $k$ is polynomial-time solvable for $k \\leq 4$ and NP-complete for $k \\geq 5$. Further, we give a 6-approximation for minimizing the maximum face in a planar embedding. For UNIFORMFACES, we show that the p"},"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":"1409.4299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-15T15:42:07Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"title_canon_sha256":"e4da035287181455963d443f12c7f49bdc14aef2528cd40f710adbbea7ece680","abstract_canon_sha256":"f838ab056e9fcde74aa0cdc6deb0cce956f6671203c260a717921e7e1110f6b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:45.636412Z","signature_b64":"fQRIczxPNNdKh8lKzFA++tAXZrIWj5mnAPM5GGgKZo0pfzeSDd0+GE7e+qoJVxPL3a1JK8KRLGDFPbyC4RDoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89e26a737845b50130dabf9811ac827dc1d7888a6eff956ca9cf40b4f715a78e","last_reissued_at":"2026-05-18T02:42:45.635858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:45.635858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planar Embeddings with Small and Uniform Faces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS"],"primary_cat":"cs.CG","authors_text":"Giordano Da Lozzo, Ignaz Rutter, Jan Kratochv\\'il, V\\'it Jel\\'inek","submitted_at":"2014-09-15T15:42:07Z","abstract_excerpt":"Motivated by finding planar embeddings that lead to drawings with favorable aesthetics, we study the problems MINMAXFACE and UNIFORMFACES of embedding a given biconnected multi-graph such that the largest face is as small as possible and such that all faces have the same size, respectively.\n  We prove a complexity dichotomy for MINMAXFACE and show that deciding whether the maximum is at most $k$ is polynomial-time solvable for $k \\leq 4$ and NP-complete for $k \\geq 5$. Further, we give a 6-approximation for minimizing the maximum face in a planar embedding. For UNIFORMFACES, we show that the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4299","kind":"arxiv","version":1},"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":"1409.4299","created_at":"2026-05-18T02:42:45.635947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.4299v1","created_at":"2026-05-18T02:42:45.635947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4299","created_at":"2026-05-18T02:42:45.635947+00:00"},{"alias_kind":"pith_short_12","alias_value":"RHRGU43YIW2Q","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RHRGU43YIW2QCMG2","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RHRGU43Y","created_at":"2026-05-18T12:28:46.137349+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/RHRGU43YIW2QCMG2X6MBDLECPX","json":"https://pith.science/pith/RHRGU43YIW2QCMG2X6MBDLECPX.json","graph_json":"https://pith.science/api/pith-number/RHRGU43YIW2QCMG2X6MBDLECPX/graph.json","events_json":"https://pith.science/api/pith-number/RHRGU43YIW2QCMG2X6MBDLECPX/events.json","paper":"https://pith.science/paper/RHRGU43Y"},"agent_actions":{"view_html":"https://pith.science/pith/RHRGU43YIW2QCMG2X6MBDLECPX","download_json":"https://pith.science/pith/RHRGU43YIW2QCMG2X6MBDLECPX.json","view_paper":"https://pith.science/paper/RHRGU43Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.4299&json=true","fetch_graph":"https://pith.science/api/pith-number/RHRGU43YIW2QCMG2X6MBDLECPX/graph.json","fetch_events":"https://pith.science/api/pith-number/RHRGU43YIW2QCMG2X6MBDLECPX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RHRGU43YIW2QCMG2X6MBDLECPX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RHRGU43YIW2QCMG2X6MBDLECPX/action/storage_attestation","attest_author":"https://pith.science/pith/RHRGU43YIW2QCMG2X6MBDLECPX/action/author_attestation","sign_citation":"https://pith.science/pith/RHRGU43YIW2QCMG2X6MBDLECPX/action/citation_signature","submit_replication":"https://pith.science/pith/RHRGU43YIW2QCMG2X6MBDLECPX/action/replication_record"}},"created_at":"2026-05-18T02:42:45.635947+00:00","updated_at":"2026-05-18T02:42:45.635947+00:00"}