{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IWXESLGKIVWZQGA7QXAF4VOFRA","short_pith_number":"pith:IWXESLGK","canonical_record":{"source":{"id":"1104.1482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-04-08T05:10:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"22a29f1b70db3692b0d4a5fcad8c6575574ea0626ab23ce21eec379881b0e1e2","abstract_canon_sha256":"f9dbd94b838dc73b13e3739c901069408c6d61e65bec797743404b9e3020d9c5"},"schema_version":"1.0"},"canonical_sha256":"45ae492cca456d98181f85c05e55c58832d1da8a6d523a8e93f8c985a549e10c","source":{"kind":"arxiv","id":"1104.1482","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1482","created_at":"2026-05-18T02:22:10Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1482v1","created_at":"2026-05-18T02:22:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1482","created_at":"2026-05-18T02:22:10Z"},{"alias_kind":"pith_short_12","alias_value":"IWXESLGKIVWZ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"IWXESLGKIVWZQGA7","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"IWXESLGK","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IWXESLGKIVWZQGA7QXAF4VOFRA","target":"record","payload":{"canonical_record":{"source":{"id":"1104.1482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-04-08T05:10:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"22a29f1b70db3692b0d4a5fcad8c6575574ea0626ab23ce21eec379881b0e1e2","abstract_canon_sha256":"f9dbd94b838dc73b13e3739c901069408c6d61e65bec797743404b9e3020d9c5"},"schema_version":"1.0"},"canonical_sha256":"45ae492cca456d98181f85c05e55c58832d1da8a6d523a8e93f8c985a549e10c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:10.396233Z","signature_b64":"shWjf1B47iZa2EgZmBWW5BsdAdh935FCBXeXxKf2Exa+IisYrk3nqA13u4ex8fyZwkPis0Q3bWdDCd8vXRx2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45ae492cca456d98181f85c05e55c58832d1da8a6d523a8e93f8c985a549e10c","last_reissued_at":"2026-05-18T02:22:10.395744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:10.395744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.1482","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:22:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WojGCNwcwQRku8HKqXvuwSsh5oCNLg3wCA7ybYRu4qdcVIZ8edlLQRr/O2cGyxiUM/N+VaufLQnu5cjEGkTrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:59:18.535741Z"},"content_sha256":"e1c0784ae9caee46dd135f9d76a8a5bb8ef3f1b834c2bbd7a5bbc2e16dbb1c63","schema_version":"1.0","event_id":"sha256:e1c0784ae9caee46dd135f9d76a8a5bb8ef3f1b834c2bbd7a5bbc2e16dbb1c63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IWXESLGKIVWZQGA7QXAF4VOFRA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Polygonal Representation of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Christian A. Duncan, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Yifan Hu","submitted_at":"2011-04-08T05:10:36Z","abstract_excerpt":"In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of planar graphs that cannot be represented by pentagons. We also show that the lower bound of six sides is matched by an upper bound of six sides with a linear-time algorithm for representing any planar graph by touching hexagons. Moreover, our algorithm produces convex polygons with edges having at most three slopes and with all vertices lying on an O(n)xO(n) grid."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1482","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:22:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yEnnD4L81ZAGCJJwBF6HMwvzQWCxtsH5JyYAgLmLdvAXsHBKgApBLhCR3GSaTabVuiSUeWyyiki3A89GKhm9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:59:18.536445Z"},"content_sha256":"a4349ddf898dcfe5e39a8fef9ca377281d96cc104bfbb654b8f934e5c1afb2e8","schema_version":"1.0","event_id":"sha256:a4349ddf898dcfe5e39a8fef9ca377281d96cc104bfbb654b8f934e5c1afb2e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IWXESLGKIVWZQGA7QXAF4VOFRA/bundle.json","state_url":"https://pith.science/pith/IWXESLGKIVWZQGA7QXAF4VOFRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IWXESLGKIVWZQGA7QXAF4VOFRA/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-28T15:59:18Z","links":{"resolver":"https://pith.science/pith/IWXESLGKIVWZQGA7QXAF4VOFRA","bundle":"https://pith.science/pith/IWXESLGKIVWZQGA7QXAF4VOFRA/bundle.json","state":"https://pith.science/pith/IWXESLGKIVWZQGA7QXAF4VOFRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IWXESLGKIVWZQGA7QXAF4VOFRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IWXESLGKIVWZQGA7QXAF4VOFRA","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":"f9dbd94b838dc73b13e3739c901069408c6d61e65bec797743404b9e3020d9c5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-04-08T05:10:36Z","title_canon_sha256":"22a29f1b70db3692b0d4a5fcad8c6575574ea0626ab23ce21eec379881b0e1e2"},"schema_version":"1.0","source":{"id":"1104.1482","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1482","created_at":"2026-05-18T02:22:10Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1482v1","created_at":"2026-05-18T02:22:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1482","created_at":"2026-05-18T02:22:10Z"},{"alias_kind":"pith_short_12","alias_value":"IWXESLGKIVWZ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"IWXESLGKIVWZQGA7","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"IWXESLGK","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:a4349ddf898dcfe5e39a8fef9ca377281d96cc104bfbb654b8f934e5c1afb2e8","target":"graph","created_at":"2026-05-18T02:22:10Z","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":"In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of planar graphs that cannot be represented by pentagons. We also show that the lower bound of six sides is matched by an upper bound of six sides with a linear-time algorithm for representing any planar graph by touching hexagons. Moreover, our algorithm produces convex polygons with edges having at most three slopes and with all vertices lying on an O(n)xO(n) grid.","authors_text":"Christian A. Duncan, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Yifan Hu","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-04-08T05:10:36Z","title":"Optimal Polygonal Representation of Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1482","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:e1c0784ae9caee46dd135f9d76a8a5bb8ef3f1b834c2bbd7a5bbc2e16dbb1c63","target":"record","created_at":"2026-05-18T02:22:10Z","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":"f9dbd94b838dc73b13e3739c901069408c6d61e65bec797743404b9e3020d9c5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-04-08T05:10:36Z","title_canon_sha256":"22a29f1b70db3692b0d4a5fcad8c6575574ea0626ab23ce21eec379881b0e1e2"},"schema_version":"1.0","source":{"id":"1104.1482","kind":"arxiv","version":1}},"canonical_sha256":"45ae492cca456d98181f85c05e55c58832d1da8a6d523a8e93f8c985a549e10c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45ae492cca456d98181f85c05e55c58832d1da8a6d523a8e93f8c985a549e10c","first_computed_at":"2026-05-18T02:22:10.395744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:10.395744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"shWjf1B47iZa2EgZmBWW5BsdAdh935FCBXeXxKf2Exa+IisYrk3nqA13u4ex8fyZwkPis0Q3bWdDCd8vXRx2CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:10.396233Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.1482","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1c0784ae9caee46dd135f9d76a8a5bb8ef3f1b834c2bbd7a5bbc2e16dbb1c63","sha256:a4349ddf898dcfe5e39a8fef9ca377281d96cc104bfbb654b8f934e5c1afb2e8"],"state_sha256":"56903bf065d7955a076a2ea760008a4c1950573592400e6557db36a941789561"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PHnzVrWdVgwvZBlLeqSiQHcZ4ZUBOashd9jZa7zLECHWkKqBw0VM+quZJ4cal1XN7nGrYEzRHt8WUpHvE7MMBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:59:18.540206Z","bundle_sha256":"0c96471d4428854ba897eca016a772a04d2cbb7dfec518bc7399526d919e1394"}}