{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YK2VKBNJOMLWDI7C2QPB74DFE6","short_pith_number":"pith:YK2VKBNJ","schema_version":"1.0","canonical_sha256":"c2b55505a9731761a3e2d41e1ff065278cd51c4279b69f9ef3571649ecf03383","source":{"kind":"arxiv","id":"1907.01228","version":1},"attestation_state":"computed","paper":{"title":"A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Matthew J. Katz, Omrit Filtser, Stav Ashur","submitted_at":"2019-07-02T08:20:28Z","abstract_excerpt":"The problem of vertex guarding a simple polygon was first studied by Subir K. Ghosh (1987), who presented a polynomial-time $O(\\log n)$-approximation algorithm for placing as few guards as possible at vertices of a simple $n$-gon $P$, such that every point in $P$ is visible to at least one of the guards. Ghosh also conjectured that this problem admits a polynomial-time algorithm with constant approximation ratio. Due to the centrality of guarding problems in the field of computational geometry, much effort has been invested throughout the years in trying to resolve this conjecture. Despite som"},"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":"1907.01228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-07-02T08:20:28Z","cross_cats_sorted":[],"title_canon_sha256":"57dc34e912a743fc15144e1158684325e9a0f437b2d0a4d72dfb8580c691c33f","abstract_canon_sha256":"23a819bb7e162102b986b81bf9451dcfccf0f132845a685b4cd8a6529a7d6de1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:40.900769Z","signature_b64":"tL65fBtyNzC4IZ5v/upsMU5EKZDJuLuP0/m8peHN0srPGtPwG0QPu43BgtqwRRPAi1ZdcFnhpgYbNxBY1sgVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2b55505a9731761a3e2d41e1ff065278cd51c4279b69f9ef3571649ecf03383","last_reissued_at":"2026-05-17T23:41:40.900290Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:40.900290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Matthew J. Katz, Omrit Filtser, Stav Ashur","submitted_at":"2019-07-02T08:20:28Z","abstract_excerpt":"The problem of vertex guarding a simple polygon was first studied by Subir K. Ghosh (1987), who presented a polynomial-time $O(\\log n)$-approximation algorithm for placing as few guards as possible at vertices of a simple $n$-gon $P$, such that every point in $P$ is visible to at least one of the guards. Ghosh also conjectured that this problem admits a polynomial-time algorithm with constant approximation ratio. Due to the centrality of guarding problems in the field of computational geometry, much effort has been invested throughout the years in trying to resolve this conjecture. Despite som"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01228","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":"1907.01228","created_at":"2026-05-17T23:41:40.900359+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01228v1","created_at":"2026-05-17T23:41:40.900359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01228","created_at":"2026-05-17T23:41:40.900359+00:00"},{"alias_kind":"pith_short_12","alias_value":"YK2VKBNJOMLW","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YK2VKBNJOMLWDI7C","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YK2VKBNJ","created_at":"2026-05-18T12:33:33.725879+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/YK2VKBNJOMLWDI7C2QPB74DFE6","json":"https://pith.science/pith/YK2VKBNJOMLWDI7C2QPB74DFE6.json","graph_json":"https://pith.science/api/pith-number/YK2VKBNJOMLWDI7C2QPB74DFE6/graph.json","events_json":"https://pith.science/api/pith-number/YK2VKBNJOMLWDI7C2QPB74DFE6/events.json","paper":"https://pith.science/paper/YK2VKBNJ"},"agent_actions":{"view_html":"https://pith.science/pith/YK2VKBNJOMLWDI7C2QPB74DFE6","download_json":"https://pith.science/pith/YK2VKBNJOMLWDI7C2QPB74DFE6.json","view_paper":"https://pith.science/paper/YK2VKBNJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01228&json=true","fetch_graph":"https://pith.science/api/pith-number/YK2VKBNJOMLWDI7C2QPB74DFE6/graph.json","fetch_events":"https://pith.science/api/pith-number/YK2VKBNJOMLWDI7C2QPB74DFE6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YK2VKBNJOMLWDI7C2QPB74DFE6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YK2VKBNJOMLWDI7C2QPB74DFE6/action/storage_attestation","attest_author":"https://pith.science/pith/YK2VKBNJOMLWDI7C2QPB74DFE6/action/author_attestation","sign_citation":"https://pith.science/pith/YK2VKBNJOMLWDI7C2QPB74DFE6/action/citation_signature","submit_replication":"https://pith.science/pith/YK2VKBNJOMLWDI7C2QPB74DFE6/action/replication_record"}},"created_at":"2026-05-17T23:41:40.900359+00:00","updated_at":"2026-05-17T23:41:40.900359+00:00"}