{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OLOY6HLI3AGWQGCDZSRI6MDSUF","short_pith_number":"pith:OLOY6HLI","canonical_record":{"source":{"id":"1204.2634","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-12T07:07:33Z","cross_cats_sorted":[],"title_canon_sha256":"564fe725d42d1d5f2a986ada154116a8ecbbdff51b4286e45f882e0ccfc66dda","abstract_canon_sha256":"9e8cd5964029e0c95998e51a90abcf95a4a4578d007059a85987d1b75918f135"},"schema_version":"1.0"},"canonical_sha256":"72dd8f1d68d80d681843cca28f3072a17e572217c9dafa4f88f68f50a1070bc2","source":{"kind":"arxiv","id":"1204.2634","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2634","created_at":"2026-05-18T03:58:03Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2634v1","created_at":"2026-05-18T03:58:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2634","created_at":"2026-05-18T03:58:03Z"},{"alias_kind":"pith_short_12","alias_value":"OLOY6HLI3AGW","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OLOY6HLI3AGWQGCD","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OLOY6HLI","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OLOY6HLI3AGWQGCDZSRI6MDSUF","target":"record","payload":{"canonical_record":{"source":{"id":"1204.2634","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-12T07:07:33Z","cross_cats_sorted":[],"title_canon_sha256":"564fe725d42d1d5f2a986ada154116a8ecbbdff51b4286e45f882e0ccfc66dda","abstract_canon_sha256":"9e8cd5964029e0c95998e51a90abcf95a4a4578d007059a85987d1b75918f135"},"schema_version":"1.0"},"canonical_sha256":"72dd8f1d68d80d681843cca28f3072a17e572217c9dafa4f88f68f50a1070bc2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:03.862303Z","signature_b64":"wQo5Ls62gevvTzfeYI6FS0eqUEGvNa9okTdGhaekZu20tiYcdVjhLp3ZqSEMuZ+/scYv8XpkG01i8c8L15V5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72dd8f1d68d80d681843cca28f3072a17e572217c9dafa4f88f68f50a1070bc2","last_reissued_at":"2026-05-18T03:58:03.861698Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:03.861698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.2634","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-18T03:58:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zXY+vJHvyMTVRagZxpcsttETYUmAOnHMI+PDhDLqPrKW0s36BKPPs0DcQB9rvDC4svAkabfrmT3uEKNDcnORAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:17:58.524072Z"},"content_sha256":"b7b10494ad6dd31d734355fc644b00943a9a3ef19db17f8fee2062957fb6e1b7","schema_version":"1.0","event_id":"sha256:b7b10494ad6dd31d734355fc644b00943a9a3ef19db17f8fee2062957fb6e1b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OLOY6HLI3AGWQGCDZSRI6MDSUF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space-efficient Algorithms for Visibility Problems in Simple Polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, Minati De, Subhas C. Nandy","submitted_at":"2012-04-12T07:07:33Z","abstract_excerpt":"Given a simple polygon $P$ consisting of $n$ vertices, we study the problem of designing space-efficient algorithms for computing (i) the visibility polygon of a point inside $P$, (ii) the weak visibility polygon of a line segment inside $P$ and (iii) the minimum link path between a pair of points inside $P$. For problem (i) two algorithms are proposed. The first one is an in-place algorithm where the input array may be lost. It uses only O(1) extra space apart from the input array. The second one assumes that the input is given in a read-only array, and it needs $O(\\sqrt{n})$ extra space. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2634","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-18T03:58:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qCsCfiU8hiuwQ2vyW7f7NE5wA5mrmKeuL6zUh8bIG46rq6kRo/1BO5hxBTC25XYvlvhzI7dgFOXRLbyc2GKpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:17:58.524679Z"},"content_sha256":"93f6f38c7cd35d1b67c9fac2e302596f14325ee70d2a3e57f827a9365c9b214d","schema_version":"1.0","event_id":"sha256:93f6f38c7cd35d1b67c9fac2e302596f14325ee70d2a3e57f827a9365c9b214d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OLOY6HLI3AGWQGCDZSRI6MDSUF/bundle.json","state_url":"https://pith.science/pith/OLOY6HLI3AGWQGCDZSRI6MDSUF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OLOY6HLI3AGWQGCDZSRI6MDSUF/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-06-07T09:17:58Z","links":{"resolver":"https://pith.science/pith/OLOY6HLI3AGWQGCDZSRI6MDSUF","bundle":"https://pith.science/pith/OLOY6HLI3AGWQGCDZSRI6MDSUF/bundle.json","state":"https://pith.science/pith/OLOY6HLI3AGWQGCDZSRI6MDSUF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OLOY6HLI3AGWQGCDZSRI6MDSUF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OLOY6HLI3AGWQGCDZSRI6MDSUF","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":"9e8cd5964029e0c95998e51a90abcf95a4a4578d007059a85987d1b75918f135","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-12T07:07:33Z","title_canon_sha256":"564fe725d42d1d5f2a986ada154116a8ecbbdff51b4286e45f882e0ccfc66dda"},"schema_version":"1.0","source":{"id":"1204.2634","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2634","created_at":"2026-05-18T03:58:03Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2634v1","created_at":"2026-05-18T03:58:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2634","created_at":"2026-05-18T03:58:03Z"},{"alias_kind":"pith_short_12","alias_value":"OLOY6HLI3AGW","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OLOY6HLI3AGWQGCD","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OLOY6HLI","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:93f6f38c7cd35d1b67c9fac2e302596f14325ee70d2a3e57f827a9365c9b214d","target":"graph","created_at":"2026-05-18T03:58:03Z","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 $P$ consisting of $n$ vertices, we study the problem of designing space-efficient algorithms for computing (i) the visibility polygon of a point inside $P$, (ii) the weak visibility polygon of a line segment inside $P$ and (iii) the minimum link path between a pair of points inside $P$. For problem (i) two algorithms are proposed. The first one is an in-place algorithm where the input array may be lost. It uses only O(1) extra space apart from the input array. The second one assumes that the input is given in a read-only array, and it needs $O(\\sqrt{n})$ extra space. The","authors_text":"Anil Maheshwari, Minati De, Subhas C. Nandy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-12T07:07:33Z","title":"Space-efficient Algorithms for Visibility Problems in Simple Polygon"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2634","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:b7b10494ad6dd31d734355fc644b00943a9a3ef19db17f8fee2062957fb6e1b7","target":"record","created_at":"2026-05-18T03:58:03Z","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":"9e8cd5964029e0c95998e51a90abcf95a4a4578d007059a85987d1b75918f135","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-12T07:07:33Z","title_canon_sha256":"564fe725d42d1d5f2a986ada154116a8ecbbdff51b4286e45f882e0ccfc66dda"},"schema_version":"1.0","source":{"id":"1204.2634","kind":"arxiv","version":1}},"canonical_sha256":"72dd8f1d68d80d681843cca28f3072a17e572217c9dafa4f88f68f50a1070bc2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72dd8f1d68d80d681843cca28f3072a17e572217c9dafa4f88f68f50a1070bc2","first_computed_at":"2026-05-18T03:58:03.861698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:03.861698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wQo5Ls62gevvTzfeYI6FS0eqUEGvNa9okTdGhaekZu20tiYcdVjhLp3ZqSEMuZ+/scYv8XpkG01i8c8L15V5DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:03.862303Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.2634","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7b10494ad6dd31d734355fc644b00943a9a3ef19db17f8fee2062957fb6e1b7","sha256:93f6f38c7cd35d1b67c9fac2e302596f14325ee70d2a3e57f827a9365c9b214d"],"state_sha256":"33614cf1ae1aeeb444ed9ae69d371ab07b800ee6155ff6c6b06d23f3e4b4b331"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6d1AKULqrfuHmmQ5C1o6VCA621IATA+OXzagN6eWvB0p529673a+i1K/0Sb9S4LdZuUxZlyPlqG++hF7AdzlAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:17:58.527973Z","bundle_sha256":"de6ee4fd3d217c02656ac8160604ff70d807f2cc8028cdc96acdb269dd679a30"}}