{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DSFJJTZNSFCOI7UNONLIVJLZNT","short_pith_number":"pith:DSFJJTZN","canonical_record":{"source":{"id":"1803.10184","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-27T17:07:26Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"e1c18e0ccdaf4c8d8915631aff124c4cdbfb4b80e2397691c61531651e22d005","abstract_canon_sha256":"a6d8a41287d99c9cf3c4e8f96fe4207c6169d52e1a40aec6c09bb99e2c0e1fd2"},"schema_version":"1.0"},"canonical_sha256":"1c8a94cf2d9144e47e8d73568aa5796cd044289b8765c6f1ee760749ac86c947","source":{"kind":"arxiv","id":"1803.10184","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10184","created_at":"2026-05-18T00:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10184v3","created_at":"2026-05-18T00:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10184","created_at":"2026-05-18T00:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"DSFJJTZNSFCO","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DSFJJTZNSFCOI7UN","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DSFJJTZN","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DSFJJTZNSFCOI7UNONLIVJLZNT","target":"record","payload":{"canonical_record":{"source":{"id":"1803.10184","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-27T17:07:26Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"e1c18e0ccdaf4c8d8915631aff124c4cdbfb4b80e2397691c61531651e22d005","abstract_canon_sha256":"a6d8a41287d99c9cf3c4e8f96fe4207c6169d52e1a40aec6c09bb99e2c0e1fd2"},"schema_version":"1.0"},"canonical_sha256":"1c8a94cf2d9144e47e8d73568aa5796cd044289b8765c6f1ee760749ac86c947","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:10.973646Z","signature_b64":"P6anwfBSqIG1AxOthiEvAxI3ewHJnKh2ORj28jQXLeWSVUCVe74t8A2pn2CGPSJLzzDjPp6QMsLDm/1epnMYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c8a94cf2d9144e47e8d73568aa5796cd044289b8765c6f1ee760749ac86c947","last_reissued_at":"2026-05-18T00:19:10.973119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:10.973119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.10184","source_version":3,"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-18T00:19:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rxD8y8WriRjY4581cPTRKkIDtqHbSJh+dQQOmIexS77wMQgg6UlCMunQfp3LPn3Hun8rQsU5ht1nI+66aLUdDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:04:17.254284Z"},"content_sha256":"34e3c242efd3a2ad583da94e6648945caac9ebf5a474e8541a3c91a0612908f2","schema_version":"1.0","event_id":"sha256:34e3c242efd3a2ad583da94e6648945caac9ebf5a474e8541a3c91a0612908f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DSFJJTZNSFCOI7UNONLIVJLZNT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Optimal Algorithm for Computing the Visibility Area of a simple Polygon from a Viewpoint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.CG","authors_text":"Alireza Bagheri, Hamid Hoorfar","submitted_at":"2018-03-27T17:07:26Z","abstract_excerpt":"Given a simple polygon $ \\mathcal {P} $ of $ n $ vertices in the Plane. We study the problem of computing the visibility area from a given viewpoint $ q $ inside $ \\mathcal {P} $ where only sub-linear variables are allowed for working space. Without any memory-constrained, this problem was previously solved in $ O(n) $-time and $ O(n) $-variables space. In a newer research, the visibility area of a point be computed in $ O(n) $-time, using $ O(\\sqrt{n}) $ variables for working space. In this paper, we present an optimal-time algorithm, using $ O(c/\\log n) $ variables space for computing visibi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10184","kind":"arxiv","version":3},"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-18T00:19:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v7+nUMbkeHOBlyUYLBOaZjY2/UDg4QVWAO/HfT8xMvoQVAWHTjyCFsi/7fi2zGrHp6SxrpNPxhkNXT45jUWqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:04:17.255043Z"},"content_sha256":"494647d98d952a4d06c077ab63b646f0c1b7d5d11d64f27432312e45c705c60e","schema_version":"1.0","event_id":"sha256:494647d98d952a4d06c077ab63b646f0c1b7d5d11d64f27432312e45c705c60e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DSFJJTZNSFCOI7UNONLIVJLZNT/bundle.json","state_url":"https://pith.science/pith/DSFJJTZNSFCOI7UNONLIVJLZNT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DSFJJTZNSFCOI7UNONLIVJLZNT/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-30T18:04:17Z","links":{"resolver":"https://pith.science/pith/DSFJJTZNSFCOI7UNONLIVJLZNT","bundle":"https://pith.science/pith/DSFJJTZNSFCOI7UNONLIVJLZNT/bundle.json","state":"https://pith.science/pith/DSFJJTZNSFCOI7UNONLIVJLZNT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DSFJJTZNSFCOI7UNONLIVJLZNT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DSFJJTZNSFCOI7UNONLIVJLZNT","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":"a6d8a41287d99c9cf3c4e8f96fe4207c6169d52e1a40aec6c09bb99e2c0e1fd2","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-27T17:07:26Z","title_canon_sha256":"e1c18e0ccdaf4c8d8915631aff124c4cdbfb4b80e2397691c61531651e22d005"},"schema_version":"1.0","source":{"id":"1803.10184","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10184","created_at":"2026-05-18T00:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10184v3","created_at":"2026-05-18T00:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10184","created_at":"2026-05-18T00:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"DSFJJTZNSFCO","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DSFJJTZNSFCOI7UN","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DSFJJTZN","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:494647d98d952a4d06c077ab63b646f0c1b7d5d11d64f27432312e45c705c60e","target":"graph","created_at":"2026-05-18T00:19:10Z","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":"Given a simple polygon $ \\mathcal {P} $ of $ n $ vertices in the Plane. We study the problem of computing the visibility area from a given viewpoint $ q $ inside $ \\mathcal {P} $ where only sub-linear variables are allowed for working space. Without any memory-constrained, this problem was previously solved in $ O(n) $-time and $ O(n) $-variables space. In a newer research, the visibility area of a point be computed in $ O(n) $-time, using $ O(\\sqrt{n}) $ variables for working space. In this paper, we present an optimal-time algorithm, using $ O(c/\\log n) $ variables space for computing visibi","authors_text":"Alireza Bagheri, Hamid Hoorfar","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-27T17:07:26Z","title":"A New Optimal Algorithm for Computing the Visibility Area of a simple Polygon from a Viewpoint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10184","kind":"arxiv","version":3},"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:34e3c242efd3a2ad583da94e6648945caac9ebf5a474e8541a3c91a0612908f2","target":"record","created_at":"2026-05-18T00:19:10Z","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":"a6d8a41287d99c9cf3c4e8f96fe4207c6169d52e1a40aec6c09bb99e2c0e1fd2","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-27T17:07:26Z","title_canon_sha256":"e1c18e0ccdaf4c8d8915631aff124c4cdbfb4b80e2397691c61531651e22d005"},"schema_version":"1.0","source":{"id":"1803.10184","kind":"arxiv","version":3}},"canonical_sha256":"1c8a94cf2d9144e47e8d73568aa5796cd044289b8765c6f1ee760749ac86c947","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c8a94cf2d9144e47e8d73568aa5796cd044289b8765c6f1ee760749ac86c947","first_computed_at":"2026-05-18T00:19:10.973119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:10.973119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P6anwfBSqIG1AxOthiEvAxI3ewHJnKh2ORj28jQXLeWSVUCVe74t8A2pn2CGPSJLzzDjPp6QMsLDm/1epnMYCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:10.973646Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.10184","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34e3c242efd3a2ad583da94e6648945caac9ebf5a474e8541a3c91a0612908f2","sha256:494647d98d952a4d06c077ab63b646f0c1b7d5d11d64f27432312e45c705c60e"],"state_sha256":"091cd3df3caba92e0609965de18cfd50e9a92ad7bc0f932a8900b69c00d17928"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bu/RRGYc0w69YtvjS8RsqvueChLWK/A4DClfT84TC7aR928Y6cNvmtcEggJNwSrlXoXoI/aDveGndPmwiAz4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:04:17.258735Z","bundle_sha256":"70513b12622e6269d8ba3c3f1657f537cbb5e9dc3cc6cb76ddcdab7a6262b841"}}