{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:X2YAKUJXOOVPI4BCURH7FNUUXE","short_pith_number":"pith:X2YAKUJX","canonical_record":{"source":{"id":"1111.3584","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-15T17:10:52Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"79f2c20cc54b613eaddba4f3af1cbbb5a03069533cbe494a0f1578fb2fba4991","abstract_canon_sha256":"443d14f3e5ee4a4e5122d0dd94012f45375b829b4701e784bb72f3c2e8dd5680"},"schema_version":"1.0"},"canonical_sha256":"beb005513773aaf47022a44ff2b694b939e49eeb6d2c1e7d01b5219a716f00b0","source":{"kind":"arxiv","id":"1111.3584","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3584","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3584v2","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3584","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"pith_short_12","alias_value":"X2YAKUJXOOVP","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"X2YAKUJXOOVPI4BC","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"X2YAKUJX","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:X2YAKUJXOOVPI4BCURH7FNUUXE","target":"record","payload":{"canonical_record":{"source":{"id":"1111.3584","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-15T17:10:52Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"79f2c20cc54b613eaddba4f3af1cbbb5a03069533cbe494a0f1578fb2fba4991","abstract_canon_sha256":"443d14f3e5ee4a4e5122d0dd94012f45375b829b4701e784bb72f3c2e8dd5680"},"schema_version":"1.0"},"canonical_sha256":"beb005513773aaf47022a44ff2b694b939e49eeb6d2c1e7d01b5219a716f00b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:54.121757Z","signature_b64":"zhTZioMNTFKnlobvcSKWiW9RcIlNl/1TVsyneQuP2SKonTNUd8jLNMQUaHWj3eAXzQpi/W4v4TbHUjy3oSzYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"beb005513773aaf47022a44ff2b694b939e49eeb6d2c1e7d01b5219a716f00b0","last_reissued_at":"2026-05-18T03:28:54.121074Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:54.121074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.3584","source_version":2,"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-18T03:28:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eoS+5jmUFq+N8xJCaVLTs458k95l3lvCLUAHWBh2V59ipqj6fSy7wlobzHYK14fOHMO2N1Lg3jdSlGP8Yv2UDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:36:22.436271Z"},"content_sha256":"f3bc1ce39d23e453c79e45ea8419d09bd01728ed36e3ae5250695fc10a4ed946","schema_version":"1.0","event_id":"sha256:f3bc1ce39d23e453c79e45ea8419d09bd01728ed36e3ae5250695fc10a4ed946"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:X2YAKUJXOOVPI4BCURH7FNUUXE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing a visibility polygon using few variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Luis Barba, Matias Korman, Rodrigo I. Silveira, Stefan Langerman","submitted_at":"2011-11-15T17:10:52Z","abstract_excerpt":"We present several algorithms for computing the visibility polygon of a simple polygon $P$ from a viewpoint inside the polygon, when the polygon resides in read-only memory and only few working variables can be used. The first algorithm uses a constant number of variables, and outputs the vertices of the visibility polygon in $O(n\\Rout)$ time, where $\\Rout$ denotes the number of reflex vertices of $P$ that are part of the output. The next two algorithms use $O(\\log \\Rin)$ variables, and output the visibility polygon in $O(n\\log \\Rin)$ randomized expected time or $O(n\\log^2 \\Rin)$ deterministic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3584","kind":"arxiv","version":2},"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-18T03:28:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yNN68E2lv2ZYylSUkA7lL3QCRNicJVlSDBi+/IA6/igoJZDjtmb9bYi/oVWVlhlb5bodJJIaeIwRPjfJ7NlLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:36:22.436959Z"},"content_sha256":"b1a2368ef49de84eb49c3c4e6bd6e9ea5b7df34ae647ccf63570d8a2778332c5","schema_version":"1.0","event_id":"sha256:b1a2368ef49de84eb49c3c4e6bd6e9ea5b7df34ae647ccf63570d8a2778332c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X2YAKUJXOOVPI4BCURH7FNUUXE/bundle.json","state_url":"https://pith.science/pith/X2YAKUJXOOVPI4BCURH7FNUUXE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X2YAKUJXOOVPI4BCURH7FNUUXE/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-27T10:36:22Z","links":{"resolver":"https://pith.science/pith/X2YAKUJXOOVPI4BCURH7FNUUXE","bundle":"https://pith.science/pith/X2YAKUJXOOVPI4BCURH7FNUUXE/bundle.json","state":"https://pith.science/pith/X2YAKUJXOOVPI4BCURH7FNUUXE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X2YAKUJXOOVPI4BCURH7FNUUXE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:X2YAKUJXOOVPI4BCURH7FNUUXE","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":"443d14f3e5ee4a4e5122d0dd94012f45375b829b4701e784bb72f3c2e8dd5680","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-15T17:10:52Z","title_canon_sha256":"79f2c20cc54b613eaddba4f3af1cbbb5a03069533cbe494a0f1578fb2fba4991"},"schema_version":"1.0","source":{"id":"1111.3584","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3584","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3584v2","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3584","created_at":"2026-05-18T03:28:54Z"},{"alias_kind":"pith_short_12","alias_value":"X2YAKUJXOOVP","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"X2YAKUJXOOVPI4BC","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"X2YAKUJX","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:b1a2368ef49de84eb49c3c4e6bd6e9ea5b7df34ae647ccf63570d8a2778332c5","target":"graph","created_at":"2026-05-18T03:28:54Z","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":"We present several algorithms for computing the visibility polygon of a simple polygon $P$ from a viewpoint inside the polygon, when the polygon resides in read-only memory and only few working variables can be used. The first algorithm uses a constant number of variables, and outputs the vertices of the visibility polygon in $O(n\\Rout)$ time, where $\\Rout$ denotes the number of reflex vertices of $P$ that are part of the output. The next two algorithms use $O(\\log \\Rin)$ variables, and output the visibility polygon in $O(n\\log \\Rin)$ randomized expected time or $O(n\\log^2 \\Rin)$ deterministic","authors_text":"Luis Barba, Matias Korman, Rodrigo I. Silveira, Stefan Langerman","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-15T17:10:52Z","title":"Computing a visibility polygon using few variables"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3584","kind":"arxiv","version":2},"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:f3bc1ce39d23e453c79e45ea8419d09bd01728ed36e3ae5250695fc10a4ed946","target":"record","created_at":"2026-05-18T03:28:54Z","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":"443d14f3e5ee4a4e5122d0dd94012f45375b829b4701e784bb72f3c2e8dd5680","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-15T17:10:52Z","title_canon_sha256":"79f2c20cc54b613eaddba4f3af1cbbb5a03069533cbe494a0f1578fb2fba4991"},"schema_version":"1.0","source":{"id":"1111.3584","kind":"arxiv","version":2}},"canonical_sha256":"beb005513773aaf47022a44ff2b694b939e49eeb6d2c1e7d01b5219a716f00b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"beb005513773aaf47022a44ff2b694b939e49eeb6d2c1e7d01b5219a716f00b0","first_computed_at":"2026-05-18T03:28:54.121074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:54.121074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zhTZioMNTFKnlobvcSKWiW9RcIlNl/1TVsyneQuP2SKonTNUd8jLNMQUaHWj3eAXzQpi/W4v4TbHUjy3oSzYDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:54.121757Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.3584","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3bc1ce39d23e453c79e45ea8419d09bd01728ed36e3ae5250695fc10a4ed946","sha256:b1a2368ef49de84eb49c3c4e6bd6e9ea5b7df34ae647ccf63570d8a2778332c5"],"state_sha256":"6958dd29257deb5ccffbc7f35bb6e5445bd39528f5ff07e7193e2f4fe7733191"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xsoVcIN+Djv9FrBWYJDjV7nR0i+/OXrOZ/aDcaLMOiPxXgSgWPYEbss/UPDBEJOkvoqoMhQkyj6sMsRNE81LBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:36:22.440602Z","bundle_sha256":"2ef5d29aea5b4d2665aaceb6ed35a34bc4b7bae3e2247b17516356c7f3e2d820"}}