{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UAXRNH3NNLSD5EK5AR5P4HSYKM","short_pith_number":"pith:UAXRNH3N","canonical_record":{"source":{"id":"1509.07214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-24T02:47:42Z","cross_cats_sorted":[],"title_canon_sha256":"9fcaf928a154a3e0ca1e0f0023fec72f63d32cd2034197e9dd83f30f915ab3b0","abstract_canon_sha256":"1dd3359d1c13f299ece4a181c9e379c5fdc024410e183c89251f6cbf5427c5ca"},"schema_version":"1.0"},"canonical_sha256":"a02f169f6d6ae43e915d047afe1e58531f76e69c9611ff9845e6fc9a63bdda5e","source":{"kind":"arxiv","id":"1509.07214","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07214","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07214v1","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07214","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"pith_short_12","alias_value":"UAXRNH3NNLSD","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UAXRNH3NNLSD5EK5","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UAXRNH3N","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UAXRNH3NNLSD5EK5AR5P4HSYKM","target":"record","payload":{"canonical_record":{"source":{"id":"1509.07214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-24T02:47:42Z","cross_cats_sorted":[],"title_canon_sha256":"9fcaf928a154a3e0ca1e0f0023fec72f63d32cd2034197e9dd83f30f915ab3b0","abstract_canon_sha256":"1dd3359d1c13f299ece4a181c9e379c5fdc024410e183c89251f6cbf5427c5ca"},"schema_version":"1.0"},"canonical_sha256":"a02f169f6d6ae43e915d047afe1e58531f76e69c9611ff9845e6fc9a63bdda5e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:09.547522Z","signature_b64":"4IAPRj0Z1lo83mQPKel+yl6NdG55VXV6spqvFbuf2ZFDPoPUQSC5Yye01svjPkNKGGz75bYP8hkfcybpXu6gDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a02f169f6d6ae43e915d047afe1e58531f76e69c9611ff9845e6fc9a63bdda5e","last_reissued_at":"2026-05-18T01:32:09.546816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:09.546816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.07214","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-18T01:32:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hWr+8Aox2FRibNzt7LsuCy6DEVTJKKUGPh/GkOfbhV/nwbgCVOaTeddAB3h4ikI6VhY3RuGBSYoDOAOIWqeqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T23:24:59.732131Z"},"content_sha256":"f9d0df7cccdb8c09282431fc23c497e357ffd767723694829dd00408b8ca8241","schema_version":"1.0","event_id":"sha256:f9d0df7cccdb8c09282431fc23c497e357ffd767723694829dd00408b8ca8241"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UAXRNH3NNLSD5EK5AR5P4HSYKM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing the Geodesic Centers of a Polygonal Domain","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Matias Korman, Sang Won Bae, Yoshio Okamoto","submitted_at":"2015-09-24T02:47:42Z","abstract_excerpt":"We present an algorithm that computes the geodesic center of a given polygonal domain. The running time of our algorithm is $O(n^{12+\\epsilon})$ for any $\\epsilon>0$, where $n$ is the number of corners of the input polygonal domain. Prior to our work, only the very special case where a simple polygon is given as input has been intensively studied in the 1980s, and an $O(n \\log n)$-time algorithm is known by Pollack et al. Our algorithm is the first one that can handle general polygonal domains having one or more polygonal holes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07214","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-18T01:32:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qEk6kSxsF1VVY65s1XHPPLj9f3Vztp66ZoiqFwR8w3jQTRgONDYkKhePspXoMsL6Xm06M6vPjevtjMcIYoKCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T23:24:59.732900Z"},"content_sha256":"b03095cd1b80bce0c283ffb43f8689f9348a59931319b34bb0f3e2b267d419a1","schema_version":"1.0","event_id":"sha256:b03095cd1b80bce0c283ffb43f8689f9348a59931319b34bb0f3e2b267d419a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UAXRNH3NNLSD5EK5AR5P4HSYKM/bundle.json","state_url":"https://pith.science/pith/UAXRNH3NNLSD5EK5AR5P4HSYKM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UAXRNH3NNLSD5EK5AR5P4HSYKM/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-19T23:24:59Z","links":{"resolver":"https://pith.science/pith/UAXRNH3NNLSD5EK5AR5P4HSYKM","bundle":"https://pith.science/pith/UAXRNH3NNLSD5EK5AR5P4HSYKM/bundle.json","state":"https://pith.science/pith/UAXRNH3NNLSD5EK5AR5P4HSYKM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UAXRNH3NNLSD5EK5AR5P4HSYKM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UAXRNH3NNLSD5EK5AR5P4HSYKM","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":"1dd3359d1c13f299ece4a181c9e379c5fdc024410e183c89251f6cbf5427c5ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-24T02:47:42Z","title_canon_sha256":"9fcaf928a154a3e0ca1e0f0023fec72f63d32cd2034197e9dd83f30f915ab3b0"},"schema_version":"1.0","source":{"id":"1509.07214","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07214","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07214v1","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07214","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"pith_short_12","alias_value":"UAXRNH3NNLSD","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UAXRNH3NNLSD5EK5","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UAXRNH3N","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:b03095cd1b80bce0c283ffb43f8689f9348a59931319b34bb0f3e2b267d419a1","target":"graph","created_at":"2026-05-18T01:32:09Z","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 an algorithm that computes the geodesic center of a given polygonal domain. The running time of our algorithm is $O(n^{12+\\epsilon})$ for any $\\epsilon>0$, where $n$ is the number of corners of the input polygonal domain. Prior to our work, only the very special case where a simple polygon is given as input has been intensively studied in the 1980s, and an $O(n \\log n)$-time algorithm is known by Pollack et al. Our algorithm is the first one that can handle general polygonal domains having one or more polygonal holes.","authors_text":"Matias Korman, Sang Won Bae, Yoshio Okamoto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-24T02:47:42Z","title":"Computing the Geodesic Centers of a Polygonal Domain"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07214","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:f9d0df7cccdb8c09282431fc23c497e357ffd767723694829dd00408b8ca8241","target":"record","created_at":"2026-05-18T01:32:09Z","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":"1dd3359d1c13f299ece4a181c9e379c5fdc024410e183c89251f6cbf5427c5ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-24T02:47:42Z","title_canon_sha256":"9fcaf928a154a3e0ca1e0f0023fec72f63d32cd2034197e9dd83f30f915ab3b0"},"schema_version":"1.0","source":{"id":"1509.07214","kind":"arxiv","version":1}},"canonical_sha256":"a02f169f6d6ae43e915d047afe1e58531f76e69c9611ff9845e6fc9a63bdda5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a02f169f6d6ae43e915d047afe1e58531f76e69c9611ff9845e6fc9a63bdda5e","first_computed_at":"2026-05-18T01:32:09.546816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:09.546816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4IAPRj0Z1lo83mQPKel+yl6NdG55VXV6spqvFbuf2ZFDPoPUQSC5Yye01svjPkNKGGz75bYP8hkfcybpXu6gDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:09.547522Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07214","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9d0df7cccdb8c09282431fc23c497e357ffd767723694829dd00408b8ca8241","sha256:b03095cd1b80bce0c283ffb43f8689f9348a59931319b34bb0f3e2b267d419a1"],"state_sha256":"7f64556f0ec905d5561875abaf32f5b16d7313d0263665e5b99b5b9e212a6793"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aVQR536bqdxhQhFPu4kE2dIYhnhwQKPZrpgupJRGqOX37Swbc2qCAh/I3Mq60WPIZsVuIw3SWEVAgz0BVLDTBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T23:24:59.737106Z","bundle_sha256":"c653b2e4453251cdc0fabbfd7eff0fe7badae509dc9d609b9c2800327463c200"}}