{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RHRGU43YIW2QCMG2X6MBDLECPX","short_pith_number":"pith:RHRGU43Y","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"},"canonical_sha256":"89e26a737845b50130dabf9811ac827dc1d7888a6eff956ca9cf40b4f715a78e","source":{"kind":"arxiv","id":"1409.4299","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4299","created_at":"2026-05-18T02:42:45Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4299v1","created_at":"2026-05-18T02:42:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4299","created_at":"2026-05-18T02:42:45Z"},{"alias_kind":"pith_short_12","alias_value":"RHRGU43YIW2Q","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RHRGU43YIW2QCMG2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RHRGU43Y","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RHRGU43YIW2QCMG2X6MBDLECPX","target":"record","payload":{"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"},"canonical_sha256":"89e26a737845b50130dabf9811ac827dc1d7888a6eff956ca9cf40b4f715a78e","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"},"source_kind":"arxiv","source_id":"1409.4299","source_version":1,"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-18T02:42:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MXNFcRnFw9fpyA1ZPe5hSQ44EFTLBqNDatVH9dOkS7AyRzWPEmGlG/4upeeuSBlFVBllqyi0+lW1bHlUHBoUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:06:19.304764Z"},"content_sha256":"98b63a3d5a52edddc9a9e78c008c78c3f4d955c37a266c64cd950d6d91515b76","schema_version":"1.0","event_id":"sha256:98b63a3d5a52edddc9a9e78c008c78c3f4d955c37a266c64cd950d6d91515b76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RHRGU43YIW2QCMG2X6MBDLECPX","target":"graph","payload":{"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"},"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-18T02:42:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HRFn+YcPfSaGy6eVfgyPs1cuyF/+ZlSo5N2t/owB8j8zxaWdKWh+3Nqk/I0vqzRT7wlIO3On4RXOXcVkOvM9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:06:19.305103Z"},"content_sha256":"d2542a44900e61829cc5dc3dcc9fa2e076fef2234a9c330b836338fd9cb5c1ec","schema_version":"1.0","event_id":"sha256:d2542a44900e61829cc5dc3dcc9fa2e076fef2234a9c330b836338fd9cb5c1ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RHRGU43YIW2QCMG2X6MBDLECPX/bundle.json","state_url":"https://pith.science/pith/RHRGU43YIW2QCMG2X6MBDLECPX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RHRGU43YIW2QCMG2X6MBDLECPX/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-06-20T06:06:19Z","links":{"resolver":"https://pith.science/pith/RHRGU43YIW2QCMG2X6MBDLECPX","bundle":"https://pith.science/pith/RHRGU43YIW2QCMG2X6MBDLECPX/bundle.json","state":"https://pith.science/pith/RHRGU43YIW2QCMG2X6MBDLECPX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RHRGU43YIW2QCMG2X6MBDLECPX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RHRGU43YIW2QCMG2X6MBDLECPX","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":"f838ab056e9fcde74aa0cdc6deb0cce956f6671203c260a717921e7e1110f6b0","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-15T15:42:07Z","title_canon_sha256":"e4da035287181455963d443f12c7f49bdc14aef2528cd40f710adbbea7ece680"},"schema_version":"1.0","source":{"id":"1409.4299","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4299","created_at":"2026-05-18T02:42:45Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4299v1","created_at":"2026-05-18T02:42:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4299","created_at":"2026-05-18T02:42:45Z"},{"alias_kind":"pith_short_12","alias_value":"RHRGU43YIW2Q","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RHRGU43YIW2QCMG2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RHRGU43Y","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:d2542a44900e61829cc5dc3dcc9fa2e076fef2234a9c330b836338fd9cb5c1ec","target":"graph","created_at":"2026-05-18T02:42:45Z","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":"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","authors_text":"Giordano Da Lozzo, Ignaz Rutter, Jan Kratochv\\'il, V\\'it Jel\\'inek","cross_cats":["cs.CC","cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-15T15:42:07Z","title":"Planar Embeddings with Small and Uniform Faces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4299","kind":"arxiv","version":1},"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:98b63a3d5a52edddc9a9e78c008c78c3f4d955c37a266c64cd950d6d91515b76","target":"record","created_at":"2026-05-18T02:42:45Z","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":"f838ab056e9fcde74aa0cdc6deb0cce956f6671203c260a717921e7e1110f6b0","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-15T15:42:07Z","title_canon_sha256":"e4da035287181455963d443f12c7f49bdc14aef2528cd40f710adbbea7ece680"},"schema_version":"1.0","source":{"id":"1409.4299","kind":"arxiv","version":1}},"canonical_sha256":"89e26a737845b50130dabf9811ac827dc1d7888a6eff956ca9cf40b4f715a78e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89e26a737845b50130dabf9811ac827dc1d7888a6eff956ca9cf40b4f715a78e","first_computed_at":"2026-05-18T02:42:45.635858Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:45.635858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fQRIczxPNNdKh8lKzFA++tAXZrIWj5mnAPM5GGgKZo0pfzeSDd0+GE7e+qoJVxPL3a1JK8KRLGDFPbyC4RDoDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:45.636412Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.4299","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98b63a3d5a52edddc9a9e78c008c78c3f4d955c37a266c64cd950d6d91515b76","sha256:d2542a44900e61829cc5dc3dcc9fa2e076fef2234a9c330b836338fd9cb5c1ec"],"state_sha256":"1664f44bf2a4c7949700f731f40b397e965fa041c36254691ea6d32ac7cec2c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h9Z6nTRLFDDfaGFIOumLueTh4SzywPinxp+4ODacyzWEKm4zcbdQgeT0L8m+BQ7sQRxE7qpYU7T6TtQ9g1syDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T06:06:19.306996Z","bundle_sha256":"798865eb263c2dc7e4b4e38b1bc8dbabc061635f5dbb17ae4e4d0ae6ad488755"}}