{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NWN7JCRRBVBK6D4QOB7HVHHCOE","short_pith_number":"pith:NWN7JCRR","canonical_record":{"source":{"id":"1405.4691","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-19T12:14:43Z","cross_cats_sorted":[],"title_canon_sha256":"6b85103d63f88d44f2cf781ce54391692ec452154df2e4b22628e71f48dddbbb","abstract_canon_sha256":"9dee57ae19a3898c599e3f37e32b6c40a544aefeb33a06ca3f3ba2d84bdbd746"},"schema_version":"1.0"},"canonical_sha256":"6d9bf48a310d42af0f90707e7a9ce27129fdde82b228ad239fbbbd6dab06c4c7","source":{"kind":"arxiv","id":"1405.4691","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4691","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4691v2","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4691","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"NWN7JCRRBVBK","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NWN7JCRRBVBK6D4Q","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NWN7JCRR","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NWN7JCRRBVBK6D4QOB7HVHHCOE","target":"record","payload":{"canonical_record":{"source":{"id":"1405.4691","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-19T12:14:43Z","cross_cats_sorted":[],"title_canon_sha256":"6b85103d63f88d44f2cf781ce54391692ec452154df2e4b22628e71f48dddbbb","abstract_canon_sha256":"9dee57ae19a3898c599e3f37e32b6c40a544aefeb33a06ca3f3ba2d84bdbd746"},"schema_version":"1.0"},"canonical_sha256":"6d9bf48a310d42af0f90707e7a9ce27129fdde82b228ad239fbbbd6dab06c4c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:43.798152Z","signature_b64":"POMArZoO0Zo3ekZqT11XOqdLT3LcuQF7+CV6a5qnRFUA17mY2Nvs+aCaz8LOs2lHFkQrryHDQ6KEZG29CqG0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d9bf48a310d42af0f90707e7a9ce27129fdde82b228ad239fbbbd6dab06c4c7","last_reissued_at":"2026-05-18T02:47:43.797344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:43.797344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.4691","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-18T02:47:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qnDWUPJLj7PvqEpdaUMk92LA31Ny53nn1XF+l/blC/PgwyzFjlUkVbKsQtJ0Wz9v8wmxB1wI0UQLKRuz7Q6FDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T07:31:31.379565Z"},"content_sha256":"e1597fa4d9056ed50cb9a6b56059a81ecdb2d6c3793a591d1bf707e258ce4840","schema_version":"1.0","event_id":"sha256:e1597fa4d9056ed50cb9a6b56059a81ecdb2d6c3793a591d1bf707e258ce4840"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NWN7JCRRBVBK6D4QOB7HVHHCOE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Faster Algorithm for Computing Straight Skeletons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Antoine Vigneron, Liam Mencel, Siu-Wing Cheng","submitted_at":"2014-05-19T12:14:43Z","abstract_excerpt":"We present a new algorithm for computing the straight skeleton of a polygon. For a polygon with $n$ vertices, among which $r$ are reflex vertices, we give a deterministic algorithm that reduces the straight skeleton computation to a motorcycle graph computation in $O(n (\\log n)\\log r)$ time. It improves on the previously best known algorithm for this reduction, which is randomized, and runs in expected $O(n \\sqrt{h+1}\\log^2 n)$ time for a polygon with $h$ holes. Using known motorcycle graph algorithms, our result yields improved time bounds for computing straight skeletons. In particular, we c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4691","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-18T02:47:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"StgHAvvV1AbJYfOBcug942UWikSRiy8ZOLZf1I5VWD3HPqpuL0uHBxEEJCc+oLHBPh/uvFoIdnwr2oz91xMEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T07:31:31.380128Z"},"content_sha256":"75c2c019dc713d3cb493116b1f49e9c7e6e84d6bc842fa6ed61e28417edc12f8","schema_version":"1.0","event_id":"sha256:75c2c019dc713d3cb493116b1f49e9c7e6e84d6bc842fa6ed61e28417edc12f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NWN7JCRRBVBK6D4QOB7HVHHCOE/bundle.json","state_url":"https://pith.science/pith/NWN7JCRRBVBK6D4QOB7HVHHCOE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NWN7JCRRBVBK6D4QOB7HVHHCOE/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-07-01T07:31:31Z","links":{"resolver":"https://pith.science/pith/NWN7JCRRBVBK6D4QOB7HVHHCOE","bundle":"https://pith.science/pith/NWN7JCRRBVBK6D4QOB7HVHHCOE/bundle.json","state":"https://pith.science/pith/NWN7JCRRBVBK6D4QOB7HVHHCOE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NWN7JCRRBVBK6D4QOB7HVHHCOE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NWN7JCRRBVBK6D4QOB7HVHHCOE","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":"9dee57ae19a3898c599e3f37e32b6c40a544aefeb33a06ca3f3ba2d84bdbd746","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-19T12:14:43Z","title_canon_sha256":"6b85103d63f88d44f2cf781ce54391692ec452154df2e4b22628e71f48dddbbb"},"schema_version":"1.0","source":{"id":"1405.4691","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4691","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4691v2","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4691","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"NWN7JCRRBVBK","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NWN7JCRRBVBK6D4Q","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NWN7JCRR","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:75c2c019dc713d3cb493116b1f49e9c7e6e84d6bc842fa6ed61e28417edc12f8","target":"graph","created_at":"2026-05-18T02:47:43Z","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":"We present a new algorithm for computing the straight skeleton of a polygon. For a polygon with $n$ vertices, among which $r$ are reflex vertices, we give a deterministic algorithm that reduces the straight skeleton computation to a motorcycle graph computation in $O(n (\\log n)\\log r)$ time. It improves on the previously best known algorithm for this reduction, which is randomized, and runs in expected $O(n \\sqrt{h+1}\\log^2 n)$ time for a polygon with $h$ holes. Using known motorcycle graph algorithms, our result yields improved time bounds for computing straight skeletons. In particular, we c","authors_text":"Antoine Vigneron, Liam Mencel, Siu-Wing Cheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-19T12:14:43Z","title":"A Faster Algorithm for Computing Straight Skeletons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4691","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:e1597fa4d9056ed50cb9a6b56059a81ecdb2d6c3793a591d1bf707e258ce4840","target":"record","created_at":"2026-05-18T02:47:43Z","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":"9dee57ae19a3898c599e3f37e32b6c40a544aefeb33a06ca3f3ba2d84bdbd746","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-19T12:14:43Z","title_canon_sha256":"6b85103d63f88d44f2cf781ce54391692ec452154df2e4b22628e71f48dddbbb"},"schema_version":"1.0","source":{"id":"1405.4691","kind":"arxiv","version":2}},"canonical_sha256":"6d9bf48a310d42af0f90707e7a9ce27129fdde82b228ad239fbbbd6dab06c4c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d9bf48a310d42af0f90707e7a9ce27129fdde82b228ad239fbbbd6dab06c4c7","first_computed_at":"2026-05-18T02:47:43.797344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:43.797344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"POMArZoO0Zo3ekZqT11XOqdLT3LcuQF7+CV6a5qnRFUA17mY2Nvs+aCaz8LOs2lHFkQrryHDQ6KEZG29CqG0Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:43.798152Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.4691","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1597fa4d9056ed50cb9a6b56059a81ecdb2d6c3793a591d1bf707e258ce4840","sha256:75c2c019dc713d3cb493116b1f49e9c7e6e84d6bc842fa6ed61e28417edc12f8"],"state_sha256":"761f2aab392fa0f923a279ecc8a70bf3f8f578840c864f0130e6c54ee5f4b985"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KVPhxSc7XFf7QneUrPEG3IDPLBaLCqxeTGe7R9aNHYgG8BxEfQqw8rSfCP9p8+FOrRnTiKXMs1VESBLAocGHBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T07:31:31.382954Z","bundle_sha256":"181b0ded24e3f9d7a20e7b0335ed8c33652f8b4fd67a8b0841cc8f8b45243881"}}