{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:F74MHUS7DUMQKYIPYLGLDH5RVI","short_pith_number":"pith:F74MHUS7","canonical_record":{"source":{"id":"1501.00561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-03T13:08:23Z","cross_cats_sorted":[],"title_canon_sha256":"43fca128f7e9bc70940d5568bc77586415b6afaaefbb698e127257c7799ffb60","abstract_canon_sha256":"b761a6e07a188f49543f9f0088b2bbf1b7ffd9c2e4dd6da1facfeab0060df3b0"},"schema_version":"1.0"},"canonical_sha256":"2ff8c3d25f1d1905610fc2ccb19fb1aa03baf917761aa3dd2c37cf1a79b87229","source":{"kind":"arxiv","id":"1501.00561","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00561","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00561v1","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00561","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"pith_short_12","alias_value":"F74MHUS7DUMQ","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"F74MHUS7DUMQKYIP","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"F74MHUS7","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:F74MHUS7DUMQKYIPYLGLDH5RVI","target":"record","payload":{"canonical_record":{"source":{"id":"1501.00561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-03T13:08:23Z","cross_cats_sorted":[],"title_canon_sha256":"43fca128f7e9bc70940d5568bc77586415b6afaaefbb698e127257c7799ffb60","abstract_canon_sha256":"b761a6e07a188f49543f9f0088b2bbf1b7ffd9c2e4dd6da1facfeab0060df3b0"},"schema_version":"1.0"},"canonical_sha256":"2ff8c3d25f1d1905610fc2ccb19fb1aa03baf917761aa3dd2c37cf1a79b87229","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:07.254333Z","signature_b64":"V6IKLdR0aX58vzSdDKAgJOkke6C3PV1yvy6W7C2SrG0xMcXQevcpgF9BBU8RG+ZHuofF6g8HlSItO6TfKAQeAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ff8c3d25f1d1905610fc2ccb19fb1aa03baf917761aa3dd2c37cf1a79b87229","last_reissued_at":"2026-05-18T02:30:07.253649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:07.253649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.00561","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:30:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"byfmRrKge+APu16c/fnb2F2jG2DLurLkSv/ad7BMNCLsEKrJ4obnubR5iNZ/KxjacHqYNxcmPNviMFPJa1GmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:22:00.169017Z"},"content_sha256":"06ea6dda082402511d168596c0d4f775abce1a9ceaf27c0893f06f678f334ea9","schema_version":"1.0","event_id":"sha256:06ea6dda082402511d168596c0d4f775abce1a9ceaf27c0893f06f678f334ea9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:F74MHUS7DUMQKYIPYLGLDH5RVI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A linear-time algorithm for the geodesic center of a simple polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Eunjin Oh, Hee-Kap Ahn, Jean-Lou De Carufel, Luis Barba, Matias Korman, Prosenjit Bose","submitted_at":"2015-01-03T13:08:23Z","abstract_excerpt":"Given two points in a simple polygon $P$ of $n$ vertices, its geodesic distance is the length of the shortest path that connects them among all paths that stay within $P$. The geodesic center of $P$ is the unique point in $P$ that minimizes the largest geodesic distance to all other points of $P$. In 1989, Pollack, Sharir and Rote [Disc. \\& Comput. Geom. 89] showed an $O(n\\log n)$-time algorithm that computes the geodesic center of $P$. Since then, a longstanding question has been whether this running time can be improved (explicitly posed by Mitchell [Handbook of Computational Geometry, 2000]"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00561","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:30:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mETSYe0nV3joBPxJJfniC3cZrAfgzBuZyca8LqNT9FmR/03OYKorQmKCShLjjnIs/zdZM5rg/2LxajDkqpxXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:22:00.169710Z"},"content_sha256":"d70345303749473488c3d918c3764ca7da01e4c43df128fbfd35acbf0551c25a","schema_version":"1.0","event_id":"sha256:d70345303749473488c3d918c3764ca7da01e4c43df128fbfd35acbf0551c25a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F74MHUS7DUMQKYIPYLGLDH5RVI/bundle.json","state_url":"https://pith.science/pith/F74MHUS7DUMQKYIPYLGLDH5RVI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F74MHUS7DUMQKYIPYLGLDH5RVI/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-25T09:22:00Z","links":{"resolver":"https://pith.science/pith/F74MHUS7DUMQKYIPYLGLDH5RVI","bundle":"https://pith.science/pith/F74MHUS7DUMQKYIPYLGLDH5RVI/bundle.json","state":"https://pith.science/pith/F74MHUS7DUMQKYIPYLGLDH5RVI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F74MHUS7DUMQKYIPYLGLDH5RVI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:F74MHUS7DUMQKYIPYLGLDH5RVI","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":"b761a6e07a188f49543f9f0088b2bbf1b7ffd9c2e4dd6da1facfeab0060df3b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-03T13:08:23Z","title_canon_sha256":"43fca128f7e9bc70940d5568bc77586415b6afaaefbb698e127257c7799ffb60"},"schema_version":"1.0","source":{"id":"1501.00561","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00561","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00561v1","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00561","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"pith_short_12","alias_value":"F74MHUS7DUMQ","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"F74MHUS7DUMQKYIP","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"F74MHUS7","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:d70345303749473488c3d918c3764ca7da01e4c43df128fbfd35acbf0551c25a","target":"graph","created_at":"2026-05-18T02:30:07Z","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":"Given two points in a simple polygon $P$ of $n$ vertices, its geodesic distance is the length of the shortest path that connects them among all paths that stay within $P$. The geodesic center of $P$ is the unique point in $P$ that minimizes the largest geodesic distance to all other points of $P$. In 1989, Pollack, Sharir and Rote [Disc. \\& Comput. Geom. 89] showed an $O(n\\log n)$-time algorithm that computes the geodesic center of $P$. Since then, a longstanding question has been whether this running time can be improved (explicitly posed by Mitchell [Handbook of Computational Geometry, 2000]","authors_text":"Eunjin Oh, Hee-Kap Ahn, Jean-Lou De Carufel, Luis Barba, Matias Korman, Prosenjit Bose","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-03T13:08:23Z","title":"A linear-time algorithm for the geodesic center of a simple polygon"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00561","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:06ea6dda082402511d168596c0d4f775abce1a9ceaf27c0893f06f678f334ea9","target":"record","created_at":"2026-05-18T02:30:07Z","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":"b761a6e07a188f49543f9f0088b2bbf1b7ffd9c2e4dd6da1facfeab0060df3b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-03T13:08:23Z","title_canon_sha256":"43fca128f7e9bc70940d5568bc77586415b6afaaefbb698e127257c7799ffb60"},"schema_version":"1.0","source":{"id":"1501.00561","kind":"arxiv","version":1}},"canonical_sha256":"2ff8c3d25f1d1905610fc2ccb19fb1aa03baf917761aa3dd2c37cf1a79b87229","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ff8c3d25f1d1905610fc2ccb19fb1aa03baf917761aa3dd2c37cf1a79b87229","first_computed_at":"2026-05-18T02:30:07.253649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:07.253649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V6IKLdR0aX58vzSdDKAgJOkke6C3PV1yvy6W7C2SrG0xMcXQevcpgF9BBU8RG+ZHuofF6g8HlSItO6TfKAQeAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:07.254333Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00561","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06ea6dda082402511d168596c0d4f775abce1a9ceaf27c0893f06f678f334ea9","sha256:d70345303749473488c3d918c3764ca7da01e4c43df128fbfd35acbf0551c25a"],"state_sha256":"0b15b9dc8942468abbc75d2b567ca08ad841486db965133faa99007ca8c0feb5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kbEq6tCH2jEBhUesPTrKMKpgyBVrxN8PtiQqFvDcwcyBCG1DmHWynbH2XiwY28c6Y37siTHXyOYsMqeCiMotDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T09:22:00.173362Z","bundle_sha256":"727bb1165733dca7fe245904efffb67dcf095c14eb01aef9fca15144c69c1561"}}