{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:F74MHUS7DUMQKYIPYLGLDH5RVI","short_pith_number":"pith:F74MHUS7","schema_version":"1.0","canonical_sha256":"2ff8c3d25f1d1905610fc2ccb19fb1aa03baf917761aa3dd2c37cf1a79b87229","source":{"kind":"arxiv","id":"1501.00561","version":1},"attestation_state":"computed","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]"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.00561","created_at":"2026-05-18T02:30:07.253756+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00561v1","created_at":"2026-05-18T02:30:07.253756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00561","created_at":"2026-05-18T02:30:07.253756+00:00"},{"alias_kind":"pith_short_12","alias_value":"F74MHUS7DUMQ","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"F74MHUS7DUMQKYIP","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"F74MHUS7","created_at":"2026-05-18T12:29:19.899920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F74MHUS7DUMQKYIPYLGLDH5RVI","json":"https://pith.science/pith/F74MHUS7DUMQKYIPYLGLDH5RVI.json","graph_json":"https://pith.science/api/pith-number/F74MHUS7DUMQKYIPYLGLDH5RVI/graph.json","events_json":"https://pith.science/api/pith-number/F74MHUS7DUMQKYIPYLGLDH5RVI/events.json","paper":"https://pith.science/paper/F74MHUS7"},"agent_actions":{"view_html":"https://pith.science/pith/F74MHUS7DUMQKYIPYLGLDH5RVI","download_json":"https://pith.science/pith/F74MHUS7DUMQKYIPYLGLDH5RVI.json","view_paper":"https://pith.science/paper/F74MHUS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00561&json=true","fetch_graph":"https://pith.science/api/pith-number/F74MHUS7DUMQKYIPYLGLDH5RVI/graph.json","fetch_events":"https://pith.science/api/pith-number/F74MHUS7DUMQKYIPYLGLDH5RVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F74MHUS7DUMQKYIPYLGLDH5RVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F74MHUS7DUMQKYIPYLGLDH5RVI/action/storage_attestation","attest_author":"https://pith.science/pith/F74MHUS7DUMQKYIPYLGLDH5RVI/action/author_attestation","sign_citation":"https://pith.science/pith/F74MHUS7DUMQKYIPYLGLDH5RVI/action/citation_signature","submit_replication":"https://pith.science/pith/F74MHUS7DUMQKYIPYLGLDH5RVI/action/replication_record"}},"created_at":"2026-05-18T02:30:07.253756+00:00","updated_at":"2026-05-18T02:30:07.253756+00:00"}