{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KDWSBANVBFKE45I6IQRMHRMZ4N","short_pith_number":"pith:KDWSBANV","canonical_record":{"source":{"id":"1103.4521","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2011-03-23T13:57:18Z","cross_cats_sorted":["cs.CG","cs.SE"],"title_canon_sha256":"8bae396514be8484e29f31f9d16181218435d73b64a2c52b00fe6d262ffcdbc2","abstract_canon_sha256":"3367eb526c7f90bc140251dc4ad0de13d17893ab90a809dac095328a6de3e721"},"schema_version":"1.0"},"canonical_sha256":"50ed2081b509544e751e4422c3c599e365ce1d4dc217f74469f80b3fce52acca","source":{"kind":"arxiv","id":"1103.4521","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4521","created_at":"2026-05-18T04:26:01Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4521v1","created_at":"2026-05-18T04:26:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4521","created_at":"2026-05-18T04:26:01Z"},{"alias_kind":"pith_short_12","alias_value":"KDWSBANVBFKE","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KDWSBANVBFKE45I6","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KDWSBANV","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KDWSBANVBFKE45I6IQRMHRMZ4N","target":"record","payload":{"canonical_record":{"source":{"id":"1103.4521","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2011-03-23T13:57:18Z","cross_cats_sorted":["cs.CG","cs.SE"],"title_canon_sha256":"8bae396514be8484e29f31f9d16181218435d73b64a2c52b00fe6d262ffcdbc2","abstract_canon_sha256":"3367eb526c7f90bc140251dc4ad0de13d17893ab90a809dac095328a6de3e721"},"schema_version":"1.0"},"canonical_sha256":"50ed2081b509544e751e4422c3c599e365ce1d4dc217f74469f80b3fce52acca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:01.863461Z","signature_b64":"uaXJnyZTD7JzU+OhhN16t2G0Dv+YWa95X0hxK3LkciN9+fIs/iDYmcY7kdxyIawyBbqflYpVWxYhGWCvc8T+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50ed2081b509544e751e4422c3c599e365ce1d4dc217f74469f80b3fce52acca","last_reissued_at":"2026-05-18T04:26:01.862928Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:01.862928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.4521","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-18T04:26:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0AIZJihas+Gnkmo1Y1KvFvlWCkvUrDZRiFo+B8QKlegkQeuIy9JAkU5XrNC4Ug8fNNsG/rvzwJh1LmEckYd8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:04:41.969736Z"},"content_sha256":"98002c80e3a914eb5bc8f2c44b31ddc4d07228fb109eefcfbb16a69651304f14","schema_version":"1.0","event_id":"sha256:98002c80e3a914eb5bc8f2c44b31ddc4d07228fb109eefcfbb16a69651304f14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KDWSBANVBFKE45I6IQRMHRMZ4N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An implementation of range trees with fractional cascading in C++","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.CG","cs.SE"],"primary_cat":"cs.DS","authors_text":"Vissarion Fisikopoulos","submitted_at":"2011-03-23T13:57:18Z","abstract_excerpt":"Range trees are multidimensional binary trees which are used to perform d-dimensional orthogonal range searching. In this technical report we study the implementation issues of range trees with fractional cascading, named layered range trees. We also document our implementation of range trees with fractional cascading in C++ using STL and generic programming techniques."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4521","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-18T04:26:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iaon4hNX4z331JMjqJCTYvo5BEfsTIxM0pUoOFC0aql6uqhr/G37xY0lsmUPAZVRF3eZkEY1MPmw8y25cVJUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:04:41.970387Z"},"content_sha256":"a31f2599c5eb41e88658018237f92de4ff8a8de403deab551b801dd3ab56a7ca","schema_version":"1.0","event_id":"sha256:a31f2599c5eb41e88658018237f92de4ff8a8de403deab551b801dd3ab56a7ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KDWSBANVBFKE45I6IQRMHRMZ4N/bundle.json","state_url":"https://pith.science/pith/KDWSBANVBFKE45I6IQRMHRMZ4N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KDWSBANVBFKE45I6IQRMHRMZ4N/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-10T07:04:41Z","links":{"resolver":"https://pith.science/pith/KDWSBANVBFKE45I6IQRMHRMZ4N","bundle":"https://pith.science/pith/KDWSBANVBFKE45I6IQRMHRMZ4N/bundle.json","state":"https://pith.science/pith/KDWSBANVBFKE45I6IQRMHRMZ4N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KDWSBANVBFKE45I6IQRMHRMZ4N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KDWSBANVBFKE45I6IQRMHRMZ4N","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":"3367eb526c7f90bc140251dc4ad0de13d17893ab90a809dac095328a6de3e721","cross_cats_sorted":["cs.CG","cs.SE"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2011-03-23T13:57:18Z","title_canon_sha256":"8bae396514be8484e29f31f9d16181218435d73b64a2c52b00fe6d262ffcdbc2"},"schema_version":"1.0","source":{"id":"1103.4521","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4521","created_at":"2026-05-18T04:26:01Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4521v1","created_at":"2026-05-18T04:26:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4521","created_at":"2026-05-18T04:26:01Z"},{"alias_kind":"pith_short_12","alias_value":"KDWSBANVBFKE","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KDWSBANVBFKE45I6","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KDWSBANV","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:a31f2599c5eb41e88658018237f92de4ff8a8de403deab551b801dd3ab56a7ca","target":"graph","created_at":"2026-05-18T04:26:01Z","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":"Range trees are multidimensional binary trees which are used to perform d-dimensional orthogonal range searching. In this technical report we study the implementation issues of range trees with fractional cascading, named layered range trees. We also document our implementation of range trees with fractional cascading in C++ using STL and generic programming techniques.","authors_text":"Vissarion Fisikopoulos","cross_cats":["cs.CG","cs.SE"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2011-03-23T13:57:18Z","title":"An implementation of range trees with fractional cascading in C++"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4521","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:98002c80e3a914eb5bc8f2c44b31ddc4d07228fb109eefcfbb16a69651304f14","target":"record","created_at":"2026-05-18T04:26:01Z","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":"3367eb526c7f90bc140251dc4ad0de13d17893ab90a809dac095328a6de3e721","cross_cats_sorted":["cs.CG","cs.SE"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2011-03-23T13:57:18Z","title_canon_sha256":"8bae396514be8484e29f31f9d16181218435d73b64a2c52b00fe6d262ffcdbc2"},"schema_version":"1.0","source":{"id":"1103.4521","kind":"arxiv","version":1}},"canonical_sha256":"50ed2081b509544e751e4422c3c599e365ce1d4dc217f74469f80b3fce52acca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50ed2081b509544e751e4422c3c599e365ce1d4dc217f74469f80b3fce52acca","first_computed_at":"2026-05-18T04:26:01.862928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:01.862928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uaXJnyZTD7JzU+OhhN16t2G0Dv+YWa95X0hxK3LkciN9+fIs/iDYmcY7kdxyIawyBbqflYpVWxYhGWCvc8T+Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:01.863461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.4521","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98002c80e3a914eb5bc8f2c44b31ddc4d07228fb109eefcfbb16a69651304f14","sha256:a31f2599c5eb41e88658018237f92de4ff8a8de403deab551b801dd3ab56a7ca"],"state_sha256":"77a42f0ec2ec02d3b83fef88418c39a31be76957fd73c289b0fbb97020f86470"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h0J+Bk0T+mnqS7M/L7jhcNI9DUeOxlHV4ZyjEjtM3+hnwlVKB576AqvZSyI/TbHjqRPbGogQCXGDS32Hl7XnCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T07:04:41.974555Z","bundle_sha256":"284ba7a18e73266bf13511a09c40f9271e44a5ed0683617396f75e217e389d27"}}