{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AH4L634GF3UQTQMSXGY4MCONRF","short_pith_number":"pith:AH4L634G","canonical_record":{"source":{"id":"1807.05356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-14T08:33:39Z","cross_cats_sorted":[],"title_canon_sha256":"b1aa0d0384cfef737ab35edede77f3bcb25900206b99163fb208793c721daa59","abstract_canon_sha256":"ca2452cc472e0b7e13b3a8c5b52177dc0b7432f65e61534c5fe1ed50459e4173"},"schema_version":"1.0"},"canonical_sha256":"01f8bf6f862ee909c192b9b1c609cd897dedfc84119e60d9d99c12f4ca422174","source":{"kind":"arxiv","id":"1807.05356","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05356","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05356v1","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05356","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"pith_short_12","alias_value":"AH4L634GF3UQ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AH4L634GF3UQTQMS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AH4L634G","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AH4L634GF3UQTQMSXGY4MCONRF","target":"record","payload":{"canonical_record":{"source":{"id":"1807.05356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-14T08:33:39Z","cross_cats_sorted":[],"title_canon_sha256":"b1aa0d0384cfef737ab35edede77f3bcb25900206b99163fb208793c721daa59","abstract_canon_sha256":"ca2452cc472e0b7e13b3a8c5b52177dc0b7432f65e61534c5fe1ed50459e4173"},"schema_version":"1.0"},"canonical_sha256":"01f8bf6f862ee909c192b9b1c609cd897dedfc84119e60d9d99c12f4ca422174","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:43.733915Z","signature_b64":"kyUfIy3w+l9bMje8/5yqW5ueTi1waUfJntspV0hROGik17k87OWziidtBvOjdeyP2FWiNf2GHi+fzhPBERcODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01f8bf6f862ee909c192b9b1c609cd897dedfc84119e60d9d99c12f4ca422174","last_reissued_at":"2026-05-18T00:10:43.733392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:43.733392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.05356","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:10:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8sKoOYamXpv3w9LHMLJ3ccreebP+f3VznE1d0cS0bHSKicjeQ8DHMKktBSoTlqfaoFzsT22wIPNEm+ZPtT73BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:38:47.531361Z"},"content_sha256":"c10ddaa1639c9bb6f1a1607efb054122b976a3c55b4fab5dd3d2c23ef686af1e","schema_version":"1.0","event_id":"sha256:c10ddaa1639c9bb6f1a1607efb054122b976a3c55b4fab5dd3d2c23ef686af1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AH4L634GF3UQTQMSXGY4MCONRF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple and Space Efficient Segment Tree Implementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lei Wang, Xiaodong Wang","submitted_at":"2018-07-14T08:33:39Z","abstract_excerpt":"The segment tree is an extremely versatile data structure. In this paper, a new heap based implementation of segment trees is proposed. In such an implementation of segment tree, the structural information associated with the tree nodes can be removed completely. Some primary computational geometry problems such as stabbing counting queries, measure of union of intervals, and maximum clique size of Intervals are used to demonstrate the efficiency of the new heap based segment tree implementation. Each interval in a set $S=\\{I_1 ,I_2 ,\\cdots,I_n\\}$ of $n$ intervals can be insert into or delete "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05356","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:10:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vfGxdnCvJoRV92dRHxL6/vm+dnyCFPI0LLnPeZkwU1pusyxWN5mTljVK1x8ScNK91+kaoOFl73sA4rVyIGRABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:38:47.531957Z"},"content_sha256":"0d523c0b66ee24c6fd8c30a48ba9f66f84af85c2244aaad88ac1686d69748051","schema_version":"1.0","event_id":"sha256:0d523c0b66ee24c6fd8c30a48ba9f66f84af85c2244aaad88ac1686d69748051"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AH4L634GF3UQTQMSXGY4MCONRF/bundle.json","state_url":"https://pith.science/pith/AH4L634GF3UQTQMSXGY4MCONRF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AH4L634GF3UQTQMSXGY4MCONRF/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-06T20:38:47Z","links":{"resolver":"https://pith.science/pith/AH4L634GF3UQTQMSXGY4MCONRF","bundle":"https://pith.science/pith/AH4L634GF3UQTQMSXGY4MCONRF/bundle.json","state":"https://pith.science/pith/AH4L634GF3UQTQMSXGY4MCONRF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AH4L634GF3UQTQMSXGY4MCONRF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AH4L634GF3UQTQMSXGY4MCONRF","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":"ca2452cc472e0b7e13b3a8c5b52177dc0b7432f65e61534c5fe1ed50459e4173","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-14T08:33:39Z","title_canon_sha256":"b1aa0d0384cfef737ab35edede77f3bcb25900206b99163fb208793c721daa59"},"schema_version":"1.0","source":{"id":"1807.05356","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05356","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05356v1","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05356","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"pith_short_12","alias_value":"AH4L634GF3UQ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AH4L634GF3UQTQMS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AH4L634G","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:0d523c0b66ee24c6fd8c30a48ba9f66f84af85c2244aaad88ac1686d69748051","target":"graph","created_at":"2026-05-18T00:10:43Z","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":"The segment tree is an extremely versatile data structure. In this paper, a new heap based implementation of segment trees is proposed. In such an implementation of segment tree, the structural information associated with the tree nodes can be removed completely. Some primary computational geometry problems such as stabbing counting queries, measure of union of intervals, and maximum clique size of Intervals are used to demonstrate the efficiency of the new heap based segment tree implementation. Each interval in a set $S=\\{I_1 ,I_2 ,\\cdots,I_n\\}$ of $n$ intervals can be insert into or delete ","authors_text":"Lei Wang, Xiaodong Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-14T08:33:39Z","title":"A Simple and Space Efficient Segment Tree Implementation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05356","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:c10ddaa1639c9bb6f1a1607efb054122b976a3c55b4fab5dd3d2c23ef686af1e","target":"record","created_at":"2026-05-18T00:10:43Z","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":"ca2452cc472e0b7e13b3a8c5b52177dc0b7432f65e61534c5fe1ed50459e4173","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-14T08:33:39Z","title_canon_sha256":"b1aa0d0384cfef737ab35edede77f3bcb25900206b99163fb208793c721daa59"},"schema_version":"1.0","source":{"id":"1807.05356","kind":"arxiv","version":1}},"canonical_sha256":"01f8bf6f862ee909c192b9b1c609cd897dedfc84119e60d9d99c12f4ca422174","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01f8bf6f862ee909c192b9b1c609cd897dedfc84119e60d9d99c12f4ca422174","first_computed_at":"2026-05-18T00:10:43.733392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:43.733392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kyUfIy3w+l9bMje8/5yqW5ueTi1waUfJntspV0hROGik17k87OWziidtBvOjdeyP2FWiNf2GHi+fzhPBERcODQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:43.733915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.05356","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c10ddaa1639c9bb6f1a1607efb054122b976a3c55b4fab5dd3d2c23ef686af1e","sha256:0d523c0b66ee24c6fd8c30a48ba9f66f84af85c2244aaad88ac1686d69748051"],"state_sha256":"41d23cc8633a9dccdd9e2a6de5c80c0f39f607a747471776dff4bceb493e43eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sYXxm8fLLsASqxMW4hYLLl2sc0Ce8BeO5J8dcRQwkohpIF2GCg4wOW01A03IQS+RJx5+4+AeHb5ZGNx3AaHSDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:38:47.535614Z","bundle_sha256":"92319770fd31fb9b4998199e6bf0f8cd72d68948680a61d9d9c08d5b409a4efb"}}