{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XOG56JYGUYMMD2V3RXVDVBK37J","short_pith_number":"pith:XOG56JYG","canonical_record":{"source":{"id":"1503.08518","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-03-30T01:36:22Z","cross_cats_sorted":[],"title_canon_sha256":"384ce04a2de22d3c9f438b06b283370334f840b53e3ca06e9a1f3b5fa0a21b7d","abstract_canon_sha256":"c485e85871e05514a217a85a3baafce59c0511f0ec725036339cdf554d524847"},"schema_version":"1.0"},"canonical_sha256":"bb8ddf2706a618c1eabb8dea3a855bfa5d6e45e63ebadaca3045a23b17b1cf5b","source":{"kind":"arxiv","id":"1503.08518","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08518","created_at":"2026-05-18T00:31:52Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08518v2","created_at":"2026-05-18T00:31:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08518","created_at":"2026-05-18T00:31:52Z"},{"alias_kind":"pith_short_12","alias_value":"XOG56JYGUYMM","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XOG56JYGUYMMD2V3","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XOG56JYG","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XOG56JYGUYMMD2V3RXVDVBK37J","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08518","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-03-30T01:36:22Z","cross_cats_sorted":[],"title_canon_sha256":"384ce04a2de22d3c9f438b06b283370334f840b53e3ca06e9a1f3b5fa0a21b7d","abstract_canon_sha256":"c485e85871e05514a217a85a3baafce59c0511f0ec725036339cdf554d524847"},"schema_version":"1.0"},"canonical_sha256":"bb8ddf2706a618c1eabb8dea3a855bfa5d6e45e63ebadaca3045a23b17b1cf5b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:52.421793Z","signature_b64":"7oZm3WsHIc/bS71/omo5ZY3MYjy5/ECvdwSDj8382EZeTyxrmH3lv17AJmzedQ4yyehbaDrNaJ7HwUa7gk7mDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb8ddf2706a618c1eabb8dea3a855bfa5d6e45e63ebadaca3045a23b17b1cf5b","last_reissued_at":"2026-05-18T00:31:52.421081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:52.421081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08518","source_version":2,"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:31:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SnYz5W9Pp3AtpXsOKk/mg5Eq+MUKp74pqPgELxPZJe9STQfzxY5iEZg01BNmIqpVJZ4foBRno6H24WDZGe/oDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:40:55.590485Z"},"content_sha256":"1eced66369b05fdca5da61f555f9d06247b9c43aace13b4f3f1e54e39178eb67","schema_version":"1.0","event_id":"sha256:1eced66369b05fdca5da61f555f9d06247b9c43aace13b4f3f1e54e39178eb67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XOG56JYGUYMMD2V3RXVDVBK37J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Dual Diameter of Triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Pilz, Birgit Vogtenhuber, Maria Saumell, Matias Korman, Stefan Langerman, Wolfgang Mulzer","submitted_at":"2015-03-30T01:36:22Z","abstract_excerpt":"Let $\\Poly$ be a simple polygon with $n$ vertices. The \\emph{dual graph} $\\triang^*$ of a triangulation~$\\triang$ of~$\\Poly$ is the graph whose vertices correspond to the bounded faces of $\\triang$ and whose edges connect those faces of~$\\triang$ that share an edge. We consider triangulations of~$\\Poly$ that minimize or maximize the diameter of their dual graph. We show that both triangulations can be constructed in $O(n^3\\log n)$ time using dynamic programming. If $\\Poly$ is convex, we show that any minimizing triangulation has dual diameter exactly $2\\cdot\\lceil\\log_2(n/3)\\rceil$ or $2\\cdot\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08518","kind":"arxiv","version":2},"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:31:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"caXmks/pOaBG3LWyAjck4CAVBST/sWBDu5nd85pzPbkQbbhm8+Z3XiBRVlsquxF9gmxV0AXCe1M4t8JRRcn+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:40:55.591025Z"},"content_sha256":"da90e1182dd7e4f4c1900263b60c9326f5656a2545212ad155a81801ab516945","schema_version":"1.0","event_id":"sha256:da90e1182dd7e4f4c1900263b60c9326f5656a2545212ad155a81801ab516945"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XOG56JYGUYMMD2V3RXVDVBK37J/bundle.json","state_url":"https://pith.science/pith/XOG56JYGUYMMD2V3RXVDVBK37J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XOG56JYGUYMMD2V3RXVDVBK37J/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-27T20:40:55Z","links":{"resolver":"https://pith.science/pith/XOG56JYGUYMMD2V3RXVDVBK37J","bundle":"https://pith.science/pith/XOG56JYGUYMMD2V3RXVDVBK37J/bundle.json","state":"https://pith.science/pith/XOG56JYGUYMMD2V3RXVDVBK37J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XOG56JYGUYMMD2V3RXVDVBK37J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XOG56JYGUYMMD2V3RXVDVBK37J","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":"c485e85871e05514a217a85a3baafce59c0511f0ec725036339cdf554d524847","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-03-30T01:36:22Z","title_canon_sha256":"384ce04a2de22d3c9f438b06b283370334f840b53e3ca06e9a1f3b5fa0a21b7d"},"schema_version":"1.0","source":{"id":"1503.08518","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08518","created_at":"2026-05-18T00:31:52Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08518v2","created_at":"2026-05-18T00:31:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08518","created_at":"2026-05-18T00:31:52Z"},{"alias_kind":"pith_short_12","alias_value":"XOG56JYGUYMM","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XOG56JYGUYMMD2V3","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XOG56JYG","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:da90e1182dd7e4f4c1900263b60c9326f5656a2545212ad155a81801ab516945","target":"graph","created_at":"2026-05-18T00:31:52Z","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":"Let $\\Poly$ be a simple polygon with $n$ vertices. The \\emph{dual graph} $\\triang^*$ of a triangulation~$\\triang$ of~$\\Poly$ is the graph whose vertices correspond to the bounded faces of $\\triang$ and whose edges connect those faces of~$\\triang$ that share an edge. We consider triangulations of~$\\Poly$ that minimize or maximize the diameter of their dual graph. We show that both triangulations can be constructed in $O(n^3\\log n)$ time using dynamic programming. If $\\Poly$ is convex, we show that any minimizing triangulation has dual diameter exactly $2\\cdot\\lceil\\log_2(n/3)\\rceil$ or $2\\cdot\\","authors_text":"Alexander Pilz, Birgit Vogtenhuber, Maria Saumell, Matias Korman, Stefan Langerman, Wolfgang Mulzer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-03-30T01:36:22Z","title":"The Dual Diameter of Triangulations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08518","kind":"arxiv","version":2},"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:1eced66369b05fdca5da61f555f9d06247b9c43aace13b4f3f1e54e39178eb67","target":"record","created_at":"2026-05-18T00:31:52Z","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":"c485e85871e05514a217a85a3baafce59c0511f0ec725036339cdf554d524847","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-03-30T01:36:22Z","title_canon_sha256":"384ce04a2de22d3c9f438b06b283370334f840b53e3ca06e9a1f3b5fa0a21b7d"},"schema_version":"1.0","source":{"id":"1503.08518","kind":"arxiv","version":2}},"canonical_sha256":"bb8ddf2706a618c1eabb8dea3a855bfa5d6e45e63ebadaca3045a23b17b1cf5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb8ddf2706a618c1eabb8dea3a855bfa5d6e45e63ebadaca3045a23b17b1cf5b","first_computed_at":"2026-05-18T00:31:52.421081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:52.421081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7oZm3WsHIc/bS71/omo5ZY3MYjy5/ECvdwSDj8382EZeTyxrmH3lv17AJmzedQ4yyehbaDrNaJ7HwUa7gk7mDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:52.421793Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08518","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1eced66369b05fdca5da61f555f9d06247b9c43aace13b4f3f1e54e39178eb67","sha256:da90e1182dd7e4f4c1900263b60c9326f5656a2545212ad155a81801ab516945"],"state_sha256":"e21a59fbffd57a540eed429bc1a8c124aeb8ff37567df614ad0a45b6bb462aa2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xVKigfLmsMVRKWoLeTJkHXq65QNNB8MkB/qC0xaiAVk1iMTSGpHMtXSgXLHEblKavMVxXSq1iWxx8yHwlzIODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:40:55.593978Z","bundle_sha256":"150ad32433a33d314f4a0e9969b1469cd22992b8536f6c25c994141585642aad"}}