{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:M3DVOGBAXSUQ55S6B6LEMVFFOX","short_pith_number":"pith:M3DVOGBA","canonical_record":{"source":{"id":"1303.5481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-21T22:41:52Z","cross_cats_sorted":[],"title_canon_sha256":"2cbf534632c4af66c542009eddaff52dcb514227edc914c9bd46ecaa00de6abd","abstract_canon_sha256":"893889b7e03471c805f9bc06091ccaf86919d8cf80a523e2c361d81e3aced3d1"},"schema_version":"1.0"},"canonical_sha256":"66c7571820bca90ef65e0f964654a575f3e5ebc1790cde66909c69b1750803e3","source":{"kind":"arxiv","id":"1303.5481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5481","created_at":"2026-05-18T03:30:04Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5481v1","created_at":"2026-05-18T03:30:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5481","created_at":"2026-05-18T03:30:04Z"},{"alias_kind":"pith_short_12","alias_value":"M3DVOGBAXSUQ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M3DVOGBAXSUQ55S6","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M3DVOGBA","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:M3DVOGBAXSUQ55S6B6LEMVFFOX","target":"record","payload":{"canonical_record":{"source":{"id":"1303.5481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-21T22:41:52Z","cross_cats_sorted":[],"title_canon_sha256":"2cbf534632c4af66c542009eddaff52dcb514227edc914c9bd46ecaa00de6abd","abstract_canon_sha256":"893889b7e03471c805f9bc06091ccaf86919d8cf80a523e2c361d81e3aced3d1"},"schema_version":"1.0"},"canonical_sha256":"66c7571820bca90ef65e0f964654a575f3e5ebc1790cde66909c69b1750803e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:04.053342Z","signature_b64":"SjqujlMNxNQa4Oz9pTUfu0jXKKAPB+PlBE5eDqhjisRTJ5Wlej+f2Y/dBLCXqioGZe+BKoMSPpK0XTt+rXUJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66c7571820bca90ef65e0f964654a575f3e5ebc1790cde66909c69b1750803e3","last_reissued_at":"2026-05-18T03:30:04.052822Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:04.052822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.5481","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:30:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xHMVm4QGPSgitVTi7VZvfgL0WFOPAXgkR++0GUIHLtd0MVI78kgXx+MXwQt7HOzbXqfUJfMXXOj3bY9xnHhQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T13:18:04.683705Z"},"content_sha256":"f75b7248cea9749bcfc46363aa4fdfb82321f943d385b7f0626bd5482e721ad7","schema_version":"1.0","event_id":"sha256:f75b7248cea9749bcfc46363aa4fdfb82321f943d385b7f0626bd5482e721ad7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:M3DVOGBAXSUQ55S6B6LEMVFFOX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Novel O(H(N)+N/H(N)) Algorithmic Techniques for Several Types of Queries and Updates on Rooted Trees and Lists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mugurel Ionut Andreica","submitted_at":"2013-03-21T22:41:52Z","abstract_excerpt":"In this paper we present novel algorithmic techniques with a O(H(N)+N/H(N)) time complexity for performing several types of queries and updates on general rooted trees, binary search trees and lists of size N. For rooted trees we introduce a new compressed super-node tree representation which can be used for efficiently addressing a wide range of applications. For binary search trees we discuss the idea of globally rebuilding the entire tree in a fully balanced manner whenever the height of the tree exceeds the value of a conveniently chosen function of the number of tree nodes. In the end of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5481","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:30:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MZdsLZyrNgUTvbCu6BscTRBgddmspCMFhM2TufCnZHI3CxwaNimp+OXIGMfMm7SCC2//puUvQD8mCivGZ5TeCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T13:18:04.684339Z"},"content_sha256":"6950b8476dddead04c2c14ecaff8430be6a8bd2212a803abf8f0048a666d85b6","schema_version":"1.0","event_id":"sha256:6950b8476dddead04c2c14ecaff8430be6a8bd2212a803abf8f0048a666d85b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M3DVOGBAXSUQ55S6B6LEMVFFOX/bundle.json","state_url":"https://pith.science/pith/M3DVOGBAXSUQ55S6B6LEMVFFOX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M3DVOGBAXSUQ55S6B6LEMVFFOX/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-07T13:18:04Z","links":{"resolver":"https://pith.science/pith/M3DVOGBAXSUQ55S6B6LEMVFFOX","bundle":"https://pith.science/pith/M3DVOGBAXSUQ55S6B6LEMVFFOX/bundle.json","state":"https://pith.science/pith/M3DVOGBAXSUQ55S6B6LEMVFFOX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M3DVOGBAXSUQ55S6B6LEMVFFOX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:M3DVOGBAXSUQ55S6B6LEMVFFOX","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":"893889b7e03471c805f9bc06091ccaf86919d8cf80a523e2c361d81e3aced3d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-21T22:41:52Z","title_canon_sha256":"2cbf534632c4af66c542009eddaff52dcb514227edc914c9bd46ecaa00de6abd"},"schema_version":"1.0","source":{"id":"1303.5481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5481","created_at":"2026-05-18T03:30:04Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5481v1","created_at":"2026-05-18T03:30:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5481","created_at":"2026-05-18T03:30:04Z"},{"alias_kind":"pith_short_12","alias_value":"M3DVOGBAXSUQ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M3DVOGBAXSUQ55S6","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M3DVOGBA","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:6950b8476dddead04c2c14ecaff8430be6a8bd2212a803abf8f0048a666d85b6","target":"graph","created_at":"2026-05-18T03:30:04Z","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":"In this paper we present novel algorithmic techniques with a O(H(N)+N/H(N)) time complexity for performing several types of queries and updates on general rooted trees, binary search trees and lists of size N. For rooted trees we introduce a new compressed super-node tree representation which can be used for efficiently addressing a wide range of applications. For binary search trees we discuss the idea of globally rebuilding the entire tree in a fully balanced manner whenever the height of the tree exceeds the value of a conveniently chosen function of the number of tree nodes. In the end of ","authors_text":"Mugurel Ionut Andreica","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-21T22:41:52Z","title":"Novel O(H(N)+N/H(N)) Algorithmic Techniques for Several Types of Queries and Updates on Rooted Trees and Lists"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5481","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:f75b7248cea9749bcfc46363aa4fdfb82321f943d385b7f0626bd5482e721ad7","target":"record","created_at":"2026-05-18T03:30:04Z","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":"893889b7e03471c805f9bc06091ccaf86919d8cf80a523e2c361d81e3aced3d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-21T22:41:52Z","title_canon_sha256":"2cbf534632c4af66c542009eddaff52dcb514227edc914c9bd46ecaa00de6abd"},"schema_version":"1.0","source":{"id":"1303.5481","kind":"arxiv","version":1}},"canonical_sha256":"66c7571820bca90ef65e0f964654a575f3e5ebc1790cde66909c69b1750803e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66c7571820bca90ef65e0f964654a575f3e5ebc1790cde66909c69b1750803e3","first_computed_at":"2026-05-18T03:30:04.052822Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:04.052822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SjqujlMNxNQa4Oz9pTUfu0jXKKAPB+PlBE5eDqhjisRTJ5Wlej+f2Y/dBLCXqioGZe+BKoMSPpK0XTt+rXUJBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:04.053342Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.5481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f75b7248cea9749bcfc46363aa4fdfb82321f943d385b7f0626bd5482e721ad7","sha256:6950b8476dddead04c2c14ecaff8430be6a8bd2212a803abf8f0048a666d85b6"],"state_sha256":"b46707bb09a6fa4d905e8c483f642496c66eb0e393ed57387b9312b60c55f6d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wRRDcKNidJK2Rj8UVZTeI16MXPxe8FrpEvqBN37L4Yla7YWjmR93rq++ufuSaEy4oTQIhl1yKcvSkIeA8YOPCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T13:18:04.688102Z","bundle_sha256":"5b5f1a021ee192cce68281036a29c4ca262f04b1e95a6d5bbb21ab612e27dedf"}}