{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SLUU7RUDZI4TH22UY6V46NYVRC","short_pith_number":"pith:SLUU7RUD","canonical_record":{"source":{"id":"1409.4621","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-16T13:13:44Z","cross_cats_sorted":[],"title_canon_sha256":"e72ad19078c2ccdd65a3137707090e298f56616b63c8eb3f66eda7195a878800","abstract_canon_sha256":"b5f86dbfe81d987fb984eece3d1614716c46dfb55c19d22a1a15981e315f88ae"},"schema_version":"1.0"},"canonical_sha256":"92e94fc683ca3933eb54c7abcf371588b8de9ad3da257d0862ab71b9f454083a","source":{"kind":"arxiv","id":"1409.4621","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4621","created_at":"2026-05-18T01:15:59Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4621v5","created_at":"2026-05-18T01:15:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4621","created_at":"2026-05-18T01:15:59Z"},{"alias_kind":"pith_short_12","alias_value":"SLUU7RUDZI4T","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SLUU7RUDZI4TH22U","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SLUU7RUD","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SLUU7RUDZI4TH22UY6V46NYVRC","target":"record","payload":{"canonical_record":{"source":{"id":"1409.4621","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-16T13:13:44Z","cross_cats_sorted":[],"title_canon_sha256":"e72ad19078c2ccdd65a3137707090e298f56616b63c8eb3f66eda7195a878800","abstract_canon_sha256":"b5f86dbfe81d987fb984eece3d1614716c46dfb55c19d22a1a15981e315f88ae"},"schema_version":"1.0"},"canonical_sha256":"92e94fc683ca3933eb54c7abcf371588b8de9ad3da257d0862ab71b9f454083a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:59.069880Z","signature_b64":"6XQ1/J9QFS1pp9glTd6T4TseYqdpNTSshC83fxset/gUnB3zuX8+qyb/T6y+zd1prFWfV+7xEV4yvJAlzq2pBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92e94fc683ca3933eb54c7abcf371588b8de9ad3da257d0862ab71b9f454083a","last_reissued_at":"2026-05-18T01:15:59.069259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:59.069259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.4621","source_version":5,"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:15:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GxV7o3CjsORgMKpy9iwo7dgbLOSv6fa8f/rHdFkKfsfsE6AKzZMSAl7w7Lf5/8kFnjH4CRAyrCqxYWTj490FBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:21:20.899275Z"},"content_sha256":"74c92ad28b39f6e78c6a3a6da679d74d1b5ab0c2eed0e89ff879b4e33cf7a720","schema_version":"1.0","event_id":"sha256:74c92ad28b39f6e78c6a3a6da679d74d1b5ab0c2eed0e89ff879b4e33cf7a720"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SLUU7RUDZI4TH22UY6V46NYVRC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximability of Guarding Weak Visibility Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bodhayan Roy, Pritam Bhattacharya, Subir Kumar Ghosh","submitted_at":"2014-09-16T13:13:44Z","abstract_excerpt":"The art gallery problem enquires about the least number of guards that are sufficient to ensure that an art gallery, represented by a polygon $P$, is fully guarded. In 1998, the problems of finding the minimum number of point guards, vertex guards, and edge guards required to guard $P$ were shown to be APX-hard by Eidenbenz, Widmayer and Stamm. In 1987, Ghosh presented approximation algorithms for vertex guards and edge guards that achieved a ratio of $\\mathcal{O}(\\log n)$, which was improved upto $\\mathcal{O}(\\log\\log OPT)$ by King and Kirkpatrick in 2011. It has been conjectured that constan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4621","kind":"arxiv","version":5},"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:15:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z76B33BIZeH0DP9pvlSkPHwZnUJYST1uikLIbcYmPIhyncmRmv/PlZbEC0/XE/Y9U28YnpdTQDJsXIN1fLy8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:21:20.899946Z"},"content_sha256":"7d615276ef66acdd05354ac801bd445439ba4c14566fb835680579da7a94054d","schema_version":"1.0","event_id":"sha256:7d615276ef66acdd05354ac801bd445439ba4c14566fb835680579da7a94054d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SLUU7RUDZI4TH22UY6V46NYVRC/bundle.json","state_url":"https://pith.science/pith/SLUU7RUDZI4TH22UY6V46NYVRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SLUU7RUDZI4TH22UY6V46NYVRC/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-30T05:21:20Z","links":{"resolver":"https://pith.science/pith/SLUU7RUDZI4TH22UY6V46NYVRC","bundle":"https://pith.science/pith/SLUU7RUDZI4TH22UY6V46NYVRC/bundle.json","state":"https://pith.science/pith/SLUU7RUDZI4TH22UY6V46NYVRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SLUU7RUDZI4TH22UY6V46NYVRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SLUU7RUDZI4TH22UY6V46NYVRC","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":"b5f86dbfe81d987fb984eece3d1614716c46dfb55c19d22a1a15981e315f88ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-16T13:13:44Z","title_canon_sha256":"e72ad19078c2ccdd65a3137707090e298f56616b63c8eb3f66eda7195a878800"},"schema_version":"1.0","source":{"id":"1409.4621","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4621","created_at":"2026-05-18T01:15:59Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4621v5","created_at":"2026-05-18T01:15:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4621","created_at":"2026-05-18T01:15:59Z"},{"alias_kind":"pith_short_12","alias_value":"SLUU7RUDZI4T","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SLUU7RUDZI4TH22U","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SLUU7RUD","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:7d615276ef66acdd05354ac801bd445439ba4c14566fb835680579da7a94054d","target":"graph","created_at":"2026-05-18T01:15:59Z","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 art gallery problem enquires about the least number of guards that are sufficient to ensure that an art gallery, represented by a polygon $P$, is fully guarded. In 1998, the problems of finding the minimum number of point guards, vertex guards, and edge guards required to guard $P$ were shown to be APX-hard by Eidenbenz, Widmayer and Stamm. In 1987, Ghosh presented approximation algorithms for vertex guards and edge guards that achieved a ratio of $\\mathcal{O}(\\log n)$, which was improved upto $\\mathcal{O}(\\log\\log OPT)$ by King and Kirkpatrick in 2011. It has been conjectured that constan","authors_text":"Bodhayan Roy, Pritam Bhattacharya, Subir Kumar Ghosh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-16T13:13:44Z","title":"Approximability of Guarding Weak Visibility Polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4621","kind":"arxiv","version":5},"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:74c92ad28b39f6e78c6a3a6da679d74d1b5ab0c2eed0e89ff879b4e33cf7a720","target":"record","created_at":"2026-05-18T01:15:59Z","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":"b5f86dbfe81d987fb984eece3d1614716c46dfb55c19d22a1a15981e315f88ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-16T13:13:44Z","title_canon_sha256":"e72ad19078c2ccdd65a3137707090e298f56616b63c8eb3f66eda7195a878800"},"schema_version":"1.0","source":{"id":"1409.4621","kind":"arxiv","version":5}},"canonical_sha256":"92e94fc683ca3933eb54c7abcf371588b8de9ad3da257d0862ab71b9f454083a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92e94fc683ca3933eb54c7abcf371588b8de9ad3da257d0862ab71b9f454083a","first_computed_at":"2026-05-18T01:15:59.069259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:59.069259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6XQ1/J9QFS1pp9glTd6T4TseYqdpNTSshC83fxset/gUnB3zuX8+qyb/T6y+zd1prFWfV+7xEV4yvJAlzq2pBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:59.069880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.4621","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74c92ad28b39f6e78c6a3a6da679d74d1b5ab0c2eed0e89ff879b4e33cf7a720","sha256:7d615276ef66acdd05354ac801bd445439ba4c14566fb835680579da7a94054d"],"state_sha256":"94ef5da0614d9381ef4414f8108b23242e40d290575147bbc03a0908b1bc9cd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F65V7QlXzRPvtAWPeWT8e+HgUuXL7cn0RjC0zAtgVhuHmZbJXv97qC5WoHh9W++ztrcBOQrVH9jjzlQl9TbjBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:21:20.904359Z","bundle_sha256":"3b25b04795a65f54282e1f068b563a21728375372aad1310afb0bcc05735a868"}}