{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HKWQVW5J5HG6CUFAWN4KSWFR56","short_pith_number":"pith:HKWQVW5J","canonical_record":{"source":{"id":"1804.02112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-06T02:10:25Z","cross_cats_sorted":[],"title_canon_sha256":"fd5710c0a33c2ac0dd070a3bacbb3b2947aecf5a8f1b8d8644f7086cac487f53","abstract_canon_sha256":"977f0b0ef6e2cc36a0e2492e0c5ca5dadda6fc1aaa81af305a947c7d2684983a"},"schema_version":"1.0"},"canonical_sha256":"3aad0adba9e9cde150a0b378a958b1efbadaf90f3ddd05c1f4c5f0fe406b1471","source":{"kind":"arxiv","id":"1804.02112","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02112","created_at":"2026-05-18T00:19:07Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02112v1","created_at":"2026-05-18T00:19:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02112","created_at":"2026-05-18T00:19:07Z"},{"alias_kind":"pith_short_12","alias_value":"HKWQVW5J5HG6","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HKWQVW5J5HG6CUFA","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HKWQVW5J","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HKWQVW5J5HG6CUFAWN4KSWFR56","target":"record","payload":{"canonical_record":{"source":{"id":"1804.02112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-06T02:10:25Z","cross_cats_sorted":[],"title_canon_sha256":"fd5710c0a33c2ac0dd070a3bacbb3b2947aecf5a8f1b8d8644f7086cac487f53","abstract_canon_sha256":"977f0b0ef6e2cc36a0e2492e0c5ca5dadda6fc1aaa81af305a947c7d2684983a"},"schema_version":"1.0"},"canonical_sha256":"3aad0adba9e9cde150a0b378a958b1efbadaf90f3ddd05c1f4c5f0fe406b1471","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:07.832356Z","signature_b64":"P+TTac5egX02HGaIHR/eXfxO+khgwAi45VBkKcC5E1K80WAFGiixEbtshzhm+AkD3yVpBks6KPPfhX4L8D6UCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3aad0adba9e9cde150a0b378a958b1efbadaf90f3ddd05c1f4c5f0fe406b1471","last_reissued_at":"2026-05-18T00:19:07.831768Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:07.831768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.02112","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-18T00:19:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eupaaPP7lJtZ5oU4ET9dRRMapKXrMpJjtctZI4vnYZs0G9CAozghpMCfO1FRzAUu0jHn8gllELl2BmMSPvtYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:21:20.914850Z"},"content_sha256":"15d26fc6579daa54c77501dc93f362b1bd59f7e295be6cd92e1491d9bc7ac1bc","schema_version":"1.0","event_id":"sha256:15d26fc6579daa54c77501dc93f362b1bd59f7e295be6cd92e1491d9bc7ac1bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HKWQVW5J5HG6CUFAWN4KSWFR56","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Red-Black Trees with Constant Update Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amr Elmasry, Fady Ahdy, Mahmoud Hashem, Mostafa Kahla","submitted_at":"2018-04-06T02:10:25Z","abstract_excerpt":"We show how a few modifications to the red-black trees allow for $O(1)$ worst-case update time (once the position of the inserted or deleted element is known). The resulting structure is based on relaxing some of the properties of the red-black trees while guaranteeing that the height remains logarithmic with respect to the number of nodes. Compared to the other search trees with constant update time, our tree is the first to provide a tailored deletion procedure without using the global rebuilding technique. In addition, our structure is very simple to implement and allows for a simpler proof"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02112","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-18T00:19:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pSr2C67ZYPsSdCNLtBXZYregM9FfHukkAgHTGpvXEVVc++y965o/F6As+b5H3A6sxdSuinOUl3dfxJk6QuY4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:21:20.915187Z"},"content_sha256":"6b8cb831cc234e7f51708b323f41c69571025f13b8157b8ae2fb39f4f2efd89e","schema_version":"1.0","event_id":"sha256:6b8cb831cc234e7f51708b323f41c69571025f13b8157b8ae2fb39f4f2efd89e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HKWQVW5J5HG6CUFAWN4KSWFR56/bundle.json","state_url":"https://pith.science/pith/HKWQVW5J5HG6CUFAWN4KSWFR56/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HKWQVW5J5HG6CUFAWN4KSWFR56/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-24T07:21:20Z","links":{"resolver":"https://pith.science/pith/HKWQVW5J5HG6CUFAWN4KSWFR56","bundle":"https://pith.science/pith/HKWQVW5J5HG6CUFAWN4KSWFR56/bundle.json","state":"https://pith.science/pith/HKWQVW5J5HG6CUFAWN4KSWFR56/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HKWQVW5J5HG6CUFAWN4KSWFR56/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HKWQVW5J5HG6CUFAWN4KSWFR56","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":"977f0b0ef6e2cc36a0e2492e0c5ca5dadda6fc1aaa81af305a947c7d2684983a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-06T02:10:25Z","title_canon_sha256":"fd5710c0a33c2ac0dd070a3bacbb3b2947aecf5a8f1b8d8644f7086cac487f53"},"schema_version":"1.0","source":{"id":"1804.02112","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02112","created_at":"2026-05-18T00:19:07Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02112v1","created_at":"2026-05-18T00:19:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02112","created_at":"2026-05-18T00:19:07Z"},{"alias_kind":"pith_short_12","alias_value":"HKWQVW5J5HG6","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HKWQVW5J5HG6CUFA","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HKWQVW5J","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:6b8cb831cc234e7f51708b323f41c69571025f13b8157b8ae2fb39f4f2efd89e","target":"graph","created_at":"2026-05-18T00:19:07Z","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 show how a few modifications to the red-black trees allow for $O(1)$ worst-case update time (once the position of the inserted or deleted element is known). The resulting structure is based on relaxing some of the properties of the red-black trees while guaranteeing that the height remains logarithmic with respect to the number of nodes. Compared to the other search trees with constant update time, our tree is the first to provide a tailored deletion procedure without using the global rebuilding technique. In addition, our structure is very simple to implement and allows for a simpler proof","authors_text":"Amr Elmasry, Fady Ahdy, Mahmoud Hashem, Mostafa Kahla","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-06T02:10:25Z","title":"Red-Black Trees with Constant Update Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02112","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:15d26fc6579daa54c77501dc93f362b1bd59f7e295be6cd92e1491d9bc7ac1bc","target":"record","created_at":"2026-05-18T00:19:07Z","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":"977f0b0ef6e2cc36a0e2492e0c5ca5dadda6fc1aaa81af305a947c7d2684983a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-06T02:10:25Z","title_canon_sha256":"fd5710c0a33c2ac0dd070a3bacbb3b2947aecf5a8f1b8d8644f7086cac487f53"},"schema_version":"1.0","source":{"id":"1804.02112","kind":"arxiv","version":1}},"canonical_sha256":"3aad0adba9e9cde150a0b378a958b1efbadaf90f3ddd05c1f4c5f0fe406b1471","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3aad0adba9e9cde150a0b378a958b1efbadaf90f3ddd05c1f4c5f0fe406b1471","first_computed_at":"2026-05-18T00:19:07.831768Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:07.831768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P+TTac5egX02HGaIHR/eXfxO+khgwAi45VBkKcC5E1K80WAFGiixEbtshzhm+AkD3yVpBks6KPPfhX4L8D6UCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:07.832356Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.02112","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15d26fc6579daa54c77501dc93f362b1bd59f7e295be6cd92e1491d9bc7ac1bc","sha256:6b8cb831cc234e7f51708b323f41c69571025f13b8157b8ae2fb39f4f2efd89e"],"state_sha256":"d1ab921a18f50edc242e10a3b7f861e3f9b4b66bb5776abab7244921e99f48ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E1vjZMcqgXLgAOtwiBGI3mo2vUseaFFm1aiGTFpXoCr2nCxPB1FWB+oBZq/cpFssJWQoWOJOao+52H2WFZr3Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T07:21:20.917074Z","bundle_sha256":"e8aeb975c1f3bd6d48f60386a4b522205d563044e664d490393b13d05267e980"}}