{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YK2VKBNJOMLWDI7C2QPB74DFE6","short_pith_number":"pith:YK2VKBNJ","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"},"canonical_sha256":"c2b55505a9731761a3e2d41e1ff065278cd51c4279b69f9ef3571649ecf03383","source":{"kind":"arxiv","id":"1907.01228","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01228","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01228v1","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01228","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"YK2VKBNJOMLW","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YK2VKBNJOMLWDI7C","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YK2VKBNJ","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YK2VKBNJOMLWDI7C2QPB74DFE6","target":"record","payload":{"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"},"canonical_sha256":"c2b55505a9731761a3e2d41e1ff065278cd51c4279b69f9ef3571649ecf03383","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"},"source_kind":"arxiv","source_id":"1907.01228","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-17T23:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+7aZHBRrzRTR48pcgR2rqXJXzOqM8LkMUjrraOl7dRQebs35r7mdigjn1TXO4zoRkbArVc7bAK4HhPtUmDDUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:33:45.095427Z"},"content_sha256":"e49913e08bca92a2e3bed40474a37f3988e4923b4e04fb3854324031e5e48c91","schema_version":"1.0","event_id":"sha256:e49913e08bca92a2e3bed40474a37f3988e4923b4e04fb3854324031e5e48c91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YK2VKBNJOMLWDI7C2QPB74DFE6","target":"graph","payload":{"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"},"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-17T23:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q4fOjemuP7bDP9R79QziWhi9ztIxRY4A3uQfkT1rOX1Ky1hc4LomgSv4zpPzl70MhZ7dLk/g2VPXNt0f6IrOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:33:45.096078Z"},"content_sha256":"e2ba20eaff54db4ff0bf2d94358e94f7ffb9e62f7b15dc01c4a754d4616e2bfd","schema_version":"1.0","event_id":"sha256:e2ba20eaff54db4ff0bf2d94358e94f7ffb9e62f7b15dc01c4a754d4616e2bfd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YK2VKBNJOMLWDI7C2QPB74DFE6/bundle.json","state_url":"https://pith.science/pith/YK2VKBNJOMLWDI7C2QPB74DFE6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YK2VKBNJOMLWDI7C2QPB74DFE6/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-30T07:33:45Z","links":{"resolver":"https://pith.science/pith/YK2VKBNJOMLWDI7C2QPB74DFE6","bundle":"https://pith.science/pith/YK2VKBNJOMLWDI7C2QPB74DFE6/bundle.json","state":"https://pith.science/pith/YK2VKBNJOMLWDI7C2QPB74DFE6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YK2VKBNJOMLWDI7C2QPB74DFE6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YK2VKBNJOMLWDI7C2QPB74DFE6","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":"23a819bb7e162102b986b81bf9451dcfccf0f132845a685b4cd8a6529a7d6de1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-07-02T08:20:28Z","title_canon_sha256":"57dc34e912a743fc15144e1158684325e9a0f437b2d0a4d72dfb8580c691c33f"},"schema_version":"1.0","source":{"id":"1907.01228","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01228","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01228v1","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01228","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"YK2VKBNJOMLW","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YK2VKBNJOMLWDI7C","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YK2VKBNJ","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:e2ba20eaff54db4ff0bf2d94358e94f7ffb9e62f7b15dc01c4a754d4616e2bfd","target":"graph","created_at":"2026-05-17T23:41:40Z","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":"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","authors_text":"Matthew J. Katz, Omrit Filtser, Stav Ashur","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-07-02T08:20:28Z","title":"A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01228","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:e49913e08bca92a2e3bed40474a37f3988e4923b4e04fb3854324031e5e48c91","target":"record","created_at":"2026-05-17T23:41:40Z","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":"23a819bb7e162102b986b81bf9451dcfccf0f132845a685b4cd8a6529a7d6de1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-07-02T08:20:28Z","title_canon_sha256":"57dc34e912a743fc15144e1158684325e9a0f437b2d0a4d72dfb8580c691c33f"},"schema_version":"1.0","source":{"id":"1907.01228","kind":"arxiv","version":1}},"canonical_sha256":"c2b55505a9731761a3e2d41e1ff065278cd51c4279b69f9ef3571649ecf03383","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2b55505a9731761a3e2d41e1ff065278cd51c4279b69f9ef3571649ecf03383","first_computed_at":"2026-05-17T23:41:40.900290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:40.900290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tL65fBtyNzC4IZ5v/upsMU5EKZDJuLuP0/m8peHN0srPGtPwG0QPu43BgtqwRRPAi1ZdcFnhpgYbNxBY1sgVDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:40.900769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.01228","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e49913e08bca92a2e3bed40474a37f3988e4923b4e04fb3854324031e5e48c91","sha256:e2ba20eaff54db4ff0bf2d94358e94f7ffb9e62f7b15dc01c4a754d4616e2bfd"],"state_sha256":"926068d4b73a4e8871804186e9d1fdcd4e8da97ac1bfbb3a428877bc2cf98e8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+dT367KfvONLborLkqhfvSuOV4AIOUuuBdrqKpJdK29QDYP0fTGgcXBD79t8kDBxtP0QZhBScsMWzdksYj6nCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:33:45.099140Z","bundle_sha256":"1d4abb623f3507e7fcb167d948fab77d907f30c720cd534d4fdd5d3084022af5"}}