{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:EAIQL5O6GZLQGBQ5SLIU7YBN53","short_pith_number":"pith:EAIQL5O6","canonical_record":{"source":{"id":"1109.0389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-09-02T09:16:09Z","cross_cats_sorted":[],"title_canon_sha256":"a359b21ae4e2392fd581a728e88c540ce644f604bda7c902137455964feab1b7","abstract_canon_sha256":"77684b7891883391213f8b4c02c91d12f623358bf9615069ae2225ad5f58dd18"},"schema_version":"1.0"},"canonical_sha256":"201105f5de365703061d92d14fe02deec3f44b9bbfe3f23d6c68468b2a243c77","source":{"kind":"arxiv","id":"1109.0389","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.0389","created_at":"2026-05-18T04:14:15Z"},{"alias_kind":"arxiv_version","alias_value":"1109.0389v1","created_at":"2026-05-18T04:14:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0389","created_at":"2026-05-18T04:14:15Z"},{"alias_kind":"pith_short_12","alias_value":"EAIQL5O6GZLQ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"EAIQL5O6GZLQGBQ5","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"EAIQL5O6","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:EAIQL5O6GZLQGBQ5SLIU7YBN53","target":"record","payload":{"canonical_record":{"source":{"id":"1109.0389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-09-02T09:16:09Z","cross_cats_sorted":[],"title_canon_sha256":"a359b21ae4e2392fd581a728e88c540ce644f604bda7c902137455964feab1b7","abstract_canon_sha256":"77684b7891883391213f8b4c02c91d12f623358bf9615069ae2225ad5f58dd18"},"schema_version":"1.0"},"canonical_sha256":"201105f5de365703061d92d14fe02deec3f44b9bbfe3f23d6c68468b2a243c77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:15.795199Z","signature_b64":"IxtbMIaqQC49Z0I9SXfmPi449FqGeHAEsVFMxdH6VzeDy/+PH5tki4aZua5DgakRpOPV/uWlaEiHPohrvGbDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"201105f5de365703061d92d14fe02deec3f44b9bbfe3f23d6c68468b2a243c77","last_reissued_at":"2026-05-18T04:14:15.794545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:15.794545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.0389","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-18T04:14:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zn+J1JhUdyBYmRPETus3Fbg0faPAYCZFZU/NCe1PTIf2ClKYCG9Xn38yelY6eHDhdFFgvN3Ckxwx/b54DmR3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:21:22.271741Z"},"content_sha256":"7cb97597bb921166c4a8e1c6ea1bc835d7f49e63e9c4df06e07d6b5c67bff8cf","schema_version":"1.0","event_id":"sha256:7cb97597bb921166c4a8e1c6ea1bc835d7f49e63e9c4df06e07d6b5c67bff8cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:EAIQL5O6GZLQGBQ5SLIU7YBN53","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Athanasios Tsakalidis, Kostas Tsichlas","submitted_at":"2011-09-02T09:16:09Z","abstract_excerpt":"We investigate the problem of finding the visible pieces of a scene of objects from a specified viewpoint. In particular, we are interested in the design of an efficient hidden surface removal algorithm for a scene comprised of iso-oriented rectangles. We propose an algorithm where given a set of $n$ iso-oriented rectangles we report all visible surfaces in $O((n+k)\\log n)$ time and linear space, where $k$ is the number of surfaces reported. The previous best result by Bern, has the same time complexity but uses $O(n\\log n)$ space."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0389","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-18T04:14:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rNmH/zzAgMU3awy87fCOdULof0A6YB7UVHC0GBkp23UHMFw0kEaiVjmq7CjgIMPyAte+FBZULb67M+1NUvGVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:21:22.272082Z"},"content_sha256":"50fdd8cc0917fa0504881d2158a3aa5783048882cbbb8246be8e9437d953fb2e","schema_version":"1.0","event_id":"sha256:50fdd8cc0917fa0504881d2158a3aa5783048882cbbb8246be8e9437d953fb2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EAIQL5O6GZLQGBQ5SLIU7YBN53/bundle.json","state_url":"https://pith.science/pith/EAIQL5O6GZLQGBQ5SLIU7YBN53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EAIQL5O6GZLQGBQ5SLIU7YBN53/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-22T17:21:22Z","links":{"resolver":"https://pith.science/pith/EAIQL5O6GZLQGBQ5SLIU7YBN53","bundle":"https://pith.science/pith/EAIQL5O6GZLQGBQ5SLIU7YBN53/bundle.json","state":"https://pith.science/pith/EAIQL5O6GZLQGBQ5SLIU7YBN53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EAIQL5O6GZLQGBQ5SLIU7YBN53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:EAIQL5O6GZLQGBQ5SLIU7YBN53","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":"77684b7891883391213f8b4c02c91d12f623358bf9615069ae2225ad5f58dd18","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-09-02T09:16:09Z","title_canon_sha256":"a359b21ae4e2392fd581a728e88c540ce644f604bda7c902137455964feab1b7"},"schema_version":"1.0","source":{"id":"1109.0389","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.0389","created_at":"2026-05-18T04:14:15Z"},{"alias_kind":"arxiv_version","alias_value":"1109.0389v1","created_at":"2026-05-18T04:14:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0389","created_at":"2026-05-18T04:14:15Z"},{"alias_kind":"pith_short_12","alias_value":"EAIQL5O6GZLQ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"EAIQL5O6GZLQGBQ5","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"EAIQL5O6","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:50fdd8cc0917fa0504881d2158a3aa5783048882cbbb8246be8e9437d953fb2e","target":"graph","created_at":"2026-05-18T04:14:15Z","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 investigate the problem of finding the visible pieces of a scene of objects from a specified viewpoint. In particular, we are interested in the design of an efficient hidden surface removal algorithm for a scene comprised of iso-oriented rectangles. We propose an algorithm where given a set of $n$ iso-oriented rectangles we report all visible surfaces in $O((n+k)\\log n)$ time and linear space, where $k$ is the number of surfaces reported. The previous best result by Bern, has the same time complexity but uses $O(n\\log n)$ space.","authors_text":"Athanasios Tsakalidis, Kostas Tsichlas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-09-02T09:16:09Z","title":"A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0389","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:7cb97597bb921166c4a8e1c6ea1bc835d7f49e63e9c4df06e07d6b5c67bff8cf","target":"record","created_at":"2026-05-18T04:14:15Z","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":"77684b7891883391213f8b4c02c91d12f623358bf9615069ae2225ad5f58dd18","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-09-02T09:16:09Z","title_canon_sha256":"a359b21ae4e2392fd581a728e88c540ce644f604bda7c902137455964feab1b7"},"schema_version":"1.0","source":{"id":"1109.0389","kind":"arxiv","version":1}},"canonical_sha256":"201105f5de365703061d92d14fe02deec3f44b9bbfe3f23d6c68468b2a243c77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"201105f5de365703061d92d14fe02deec3f44b9bbfe3f23d6c68468b2a243c77","first_computed_at":"2026-05-18T04:14:15.794545Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:15.794545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IxtbMIaqQC49Z0I9SXfmPi449FqGeHAEsVFMxdH6VzeDy/+PH5tki4aZua5DgakRpOPV/uWlaEiHPohrvGbDBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:15.795199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.0389","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cb97597bb921166c4a8e1c6ea1bc835d7f49e63e9c4df06e07d6b5c67bff8cf","sha256:50fdd8cc0917fa0504881d2158a3aa5783048882cbbb8246be8e9437d953fb2e"],"state_sha256":"47aba28919bb56dc1ecd10adf0b0a421f748ae3a2d691b53c4c0167ad62cf7e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6QKz/RCVD08A/H28bwTt1bT5jCZG0yaGDhvTMh/5TmzHNYUB7T0Wy8FK9Dx434/5btJhlaVTa1NUwyeiXt9SDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T17:21:22.273954Z","bundle_sha256":"3f2a0dc2d8816f3f053a6f215df8813b38ff42a66dc1d68ecbbcdbd3178b638e"}}