{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VXPW6RCKDX7ZEPTTHVJQMPMP6B","short_pith_number":"pith:VXPW6RCK","schema_version":"1.0","canonical_sha256":"addf6f444a1dff923e733d53063d8ff06057ba9cf9564bd44e883f7dcde31c44","source":{"kind":"arxiv","id":"1611.06915","version":2},"attestation_state":"computed","paper":{"title":"Space-Efficient Hidden Surface Removal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Frank Kammer, Maarten L\\\"offler, Rodrigo I. Silveira","submitted_at":"2016-11-21T17:44:15Z","abstract_excerpt":"We propose a space-efficient algorithm for hidden surface removal that combines one of the fastest previous algorithms for that problem with techniques based on bit manipulation. Such techniques had been successfully used in other settings, for example to reduce working space for several graph algorithms. However, bit manipulation is not usually employed in geometric algorithms because the standard model of computation (the real RAM) does not support it. For this reason, we first revisit our model of computation to have a reasonable theoretical framework. Under this framework we show how the u"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1611.06915","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-11-21T17:44:15Z","cross_cats_sorted":[],"title_canon_sha256":"b7b2f90b06128dcf7650cb765c49999a01d372c9b00c766985d222e14faeefe2","abstract_canon_sha256":"e8d2d71a094bcc750592ccb3d4727da68c8f80635ede162bfda03574336d9da4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:11.968932Z","signature_b64":"XEhAEx6AxQFCMAuHdvoebdRO2CyUHjXdJ7/95CPjhSHxOHIueWdEjTliO+TdMbE1y4U+0kC07PTywENFBrZuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"addf6f444a1dff923e733d53063d8ff06057ba9cf9564bd44e883f7dcde31c44","last_reissued_at":"2026-05-18T00:53:11.968534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:11.968534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Space-Efficient Hidden Surface Removal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Frank Kammer, Maarten L\\\"offler, Rodrigo I. Silveira","submitted_at":"2016-11-21T17:44:15Z","abstract_excerpt":"We propose a space-efficient algorithm for hidden surface removal that combines one of the fastest previous algorithms for that problem with techniques based on bit manipulation. Such techniques had been successfully used in other settings, for example to reduce working space for several graph algorithms. However, bit manipulation is not usually employed in geometric algorithms because the standard model of computation (the real RAM) does not support it. For this reason, we first revisit our model of computation to have a reasonable theoretical framework. Under this framework we show how the u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06915","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.06915","created_at":"2026-05-18T00:53:11.968597+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.06915v2","created_at":"2026-05-18T00:53:11.968597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06915","created_at":"2026-05-18T00:53:11.968597+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXPW6RCKDX7Z","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXPW6RCKDX7ZEPTT","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXPW6RCK","created_at":"2026-05-18T12:30:48.956258+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VXPW6RCKDX7ZEPTTHVJQMPMP6B","json":"https://pith.science/pith/VXPW6RCKDX7ZEPTTHVJQMPMP6B.json","graph_json":"https://pith.science/api/pith-number/VXPW6RCKDX7ZEPTTHVJQMPMP6B/graph.json","events_json":"https://pith.science/api/pith-number/VXPW6RCKDX7ZEPTTHVJQMPMP6B/events.json","paper":"https://pith.science/paper/VXPW6RCK"},"agent_actions":{"view_html":"https://pith.science/pith/VXPW6RCKDX7ZEPTTHVJQMPMP6B","download_json":"https://pith.science/pith/VXPW6RCKDX7ZEPTTHVJQMPMP6B.json","view_paper":"https://pith.science/paper/VXPW6RCK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.06915&json=true","fetch_graph":"https://pith.science/api/pith-number/VXPW6RCKDX7ZEPTTHVJQMPMP6B/graph.json","fetch_events":"https://pith.science/api/pith-number/VXPW6RCKDX7ZEPTTHVJQMPMP6B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXPW6RCKDX7ZEPTTHVJQMPMP6B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXPW6RCKDX7ZEPTTHVJQMPMP6B/action/storage_attestation","attest_author":"https://pith.science/pith/VXPW6RCKDX7ZEPTTHVJQMPMP6B/action/author_attestation","sign_citation":"https://pith.science/pith/VXPW6RCKDX7ZEPTTHVJQMPMP6B/action/citation_signature","submit_replication":"https://pith.science/pith/VXPW6RCKDX7ZEPTTHVJQMPMP6B/action/replication_record"}},"created_at":"2026-05-18T00:53:11.968597+00:00","updated_at":"2026-05-18T00:53:11.968597+00:00"}