{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AFDWEOBA4CBZBUXL2R6MU2F2TQ","short_pith_number":"pith:AFDWEOBA","schema_version":"1.0","canonical_sha256":"0147623820e08390d2ebd47cca68ba9c38faaf2cdd6e997f8c3d6948db9f13bf","source":{"kind":"arxiv","id":"1902.09565","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Maintenance of the Lower Envelope of Pseudo-Lines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Dan Halperin, Pankaj K. Agarwal, Ravid Cohen, Wolfgang Mulzer","submitted_at":"2019-02-25T19:02:52Z","abstract_excerpt":"We present a fully dynamic data structure for the maintenance of lower envelopes of pseudo-lines. The structure has $O(\\log^2 n)$ update time and $O(\\log n)$ vertical ray shooting query time. To achieve this performance, we devise a new algorithm for finding the intersection between two lower envelopes of pseudo-lines in $O(\\log n)$ time, using \\emph{tentative} binary search; the lower envelopes are special in that at $x=-\\infty$ any pseudo-line contributing to the first envelope lies below every pseudo-line contributing to the second envelope. The structure requires $O(n)$ storage space."},"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":"1902.09565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-02-25T19:02:52Z","cross_cats_sorted":[],"title_canon_sha256":"bdeb1d1e9c197995bafbf579d8195414efe538dd59fef4b7c17ecb9d093dcc53","abstract_canon_sha256":"3a6389019f0818d5699cc2185ef35183675ddccf56b247ed416006df7ab0c5e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:33.206749Z","signature_b64":"NACzvlJEetROOrCHIvnK8ZjficEmyOJTg0k2vRK4C+FMBD3yShqVPmrety4Zm2e01OAtbne67iDxGgDPDROzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0147623820e08390d2ebd47cca68ba9c38faaf2cdd6e997f8c3d6948db9f13bf","last_reissued_at":"2026-05-17T23:50:33.206005Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:33.206005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Maintenance of the Lower Envelope of Pseudo-Lines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Dan Halperin, Pankaj K. Agarwal, Ravid Cohen, Wolfgang Mulzer","submitted_at":"2019-02-25T19:02:52Z","abstract_excerpt":"We present a fully dynamic data structure for the maintenance of lower envelopes of pseudo-lines. The structure has $O(\\log^2 n)$ update time and $O(\\log n)$ vertical ray shooting query time. To achieve this performance, we devise a new algorithm for finding the intersection between two lower envelopes of pseudo-lines in $O(\\log n)$ time, using \\emph{tentative} binary search; the lower envelopes are special in that at $x=-\\infty$ any pseudo-line contributing to the first envelope lies below every pseudo-line contributing to the second envelope. The structure requires $O(n)$ storage space."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09565","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.09565","created_at":"2026-05-17T23:50:33.206107+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.09565v1","created_at":"2026-05-17T23:50:33.206107+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09565","created_at":"2026-05-17T23:50:33.206107+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFDWEOBA4CBZ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFDWEOBA4CBZBUXL","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFDWEOBA","created_at":"2026-05-18T12:33:12.712433+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/AFDWEOBA4CBZBUXL2R6MU2F2TQ","json":"https://pith.science/pith/AFDWEOBA4CBZBUXL2R6MU2F2TQ.json","graph_json":"https://pith.science/api/pith-number/AFDWEOBA4CBZBUXL2R6MU2F2TQ/graph.json","events_json":"https://pith.science/api/pith-number/AFDWEOBA4CBZBUXL2R6MU2F2TQ/events.json","paper":"https://pith.science/paper/AFDWEOBA"},"agent_actions":{"view_html":"https://pith.science/pith/AFDWEOBA4CBZBUXL2R6MU2F2TQ","download_json":"https://pith.science/pith/AFDWEOBA4CBZBUXL2R6MU2F2TQ.json","view_paper":"https://pith.science/paper/AFDWEOBA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.09565&json=true","fetch_graph":"https://pith.science/api/pith-number/AFDWEOBA4CBZBUXL2R6MU2F2TQ/graph.json","fetch_events":"https://pith.science/api/pith-number/AFDWEOBA4CBZBUXL2R6MU2F2TQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFDWEOBA4CBZBUXL2R6MU2F2TQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFDWEOBA4CBZBUXL2R6MU2F2TQ/action/storage_attestation","attest_author":"https://pith.science/pith/AFDWEOBA4CBZBUXL2R6MU2F2TQ/action/author_attestation","sign_citation":"https://pith.science/pith/AFDWEOBA4CBZBUXL2R6MU2F2TQ/action/citation_signature","submit_replication":"https://pith.science/pith/AFDWEOBA4CBZBUXL2R6MU2F2TQ/action/replication_record"}},"created_at":"2026-05-17T23:50:33.206107+00:00","updated_at":"2026-05-17T23:50:33.206107+00:00"}