{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CMA46NJWGMPUZKCO7KOZNJGIT7","short_pith_number":"pith:CMA46NJW","canonical_record":{"source":{"id":"1602.02120","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-05T19:03:08Z","cross_cats_sorted":[],"title_canon_sha256":"d30dd078aa0f67a207ad3ca0f9b9194eff39780e2f941a56d957a010d49e6103","abstract_canon_sha256":"c715e8a8235d7c5c125990a56f4671fecd16bc64cfaa3778c37b9fe8c6f84569"},"schema_version":"1.0"},"canonical_sha256":"1301cf3536331f4ca84efa9d96a4c89ffc5cef787a9df98c445fd48a55bb9680","source":{"kind":"arxiv","id":"1602.02120","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02120","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02120v4","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02120","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"pith_short_12","alias_value":"CMA46NJWGMPU","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CMA46NJWGMPUZKCO","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CMA46NJW","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CMA46NJWGMPUZKCO7KOZNJGIT7","target":"record","payload":{"canonical_record":{"source":{"id":"1602.02120","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-05T19:03:08Z","cross_cats_sorted":[],"title_canon_sha256":"d30dd078aa0f67a207ad3ca0f9b9194eff39780e2f941a56d957a010d49e6103","abstract_canon_sha256":"c715e8a8235d7c5c125990a56f4671fecd16bc64cfaa3778c37b9fe8c6f84569"},"schema_version":"1.0"},"canonical_sha256":"1301cf3536331f4ca84efa9d96a4c89ffc5cef787a9df98c445fd48a55bb9680","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:25.969121Z","signature_b64":"El2/VRXc6xZnHHKpbgslvFSVk+WSbJhlBGBNG8T3YBkpNbr7YPRNSvv4h9rIAwhStFi1pVNOVQl/+z8yVk1jBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1301cf3536331f4ca84efa9d96a4c89ffc5cef787a9df98c445fd48a55bb9680","last_reissued_at":"2026-05-18T00:59:25.968433Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:25.968433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.02120","source_version":4,"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:59:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zdveQy6RUcutfTM0/415YPkU1TELJiXYSXrkO50BgIsFLM6Phw+mulNju3Hh8MJXW/ZkRcct8nVT/74ehKdnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:13:24.116952Z"},"content_sha256":"16a270275da774a99294764f291ad20e4ec26f0ca9b4cc70035e7f7b9c993f41","schema_version":"1.0","event_id":"sha256:16a270275da774a99294764f291ad20e4ec26f0ca9b4cc70035e7f7b9c993f41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CMA46NJWGMPUZKCO7KOZNJGIT7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Ordered Sets Using Join","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Ferizovic, Guy Blelloch, Yihan Sun","submitted_at":"2016-02-05T19:03:08Z","abstract_excerpt":"The ordered set is one of the most important data type in both theoretical algorithm design and analysis and practical programming. In this paper we study the set operations on two ordered sets, including Union, Intersect and Difference, based on four types of balanced Binary Search Trees (BST) including AVL trees, red-black trees, weight balanced trees and treaps. We introduced only one subroutine Join that needs to be implemented differently for each balanced BST, and on top of which we can implement generic, simple and efficient parallel functions for ordered sets. We first prove the work-e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02120","kind":"arxiv","version":4},"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:59:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uLtgdQk4HIAR1DPjSPGnalHRiaSc4t81mejIOtwmFfLNXWnJjzdpbVgR2LB/DFW8G1izsrt7jedxFjGbE/inDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:13:24.117611Z"},"content_sha256":"177725961f26d52469007461a78a91ffd951f15cc8195a74eec081de79d422f2","schema_version":"1.0","event_id":"sha256:177725961f26d52469007461a78a91ffd951f15cc8195a74eec081de79d422f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CMA46NJWGMPUZKCO7KOZNJGIT7/bundle.json","state_url":"https://pith.science/pith/CMA46NJWGMPUZKCO7KOZNJGIT7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CMA46NJWGMPUZKCO7KOZNJGIT7/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-05T20:13:24Z","links":{"resolver":"https://pith.science/pith/CMA46NJWGMPUZKCO7KOZNJGIT7","bundle":"https://pith.science/pith/CMA46NJWGMPUZKCO7KOZNJGIT7/bundle.json","state":"https://pith.science/pith/CMA46NJWGMPUZKCO7KOZNJGIT7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CMA46NJWGMPUZKCO7KOZNJGIT7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CMA46NJWGMPUZKCO7KOZNJGIT7","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":"c715e8a8235d7c5c125990a56f4671fecd16bc64cfaa3778c37b9fe8c6f84569","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-05T19:03:08Z","title_canon_sha256":"d30dd078aa0f67a207ad3ca0f9b9194eff39780e2f941a56d957a010d49e6103"},"schema_version":"1.0","source":{"id":"1602.02120","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02120","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02120v4","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02120","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"pith_short_12","alias_value":"CMA46NJWGMPU","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CMA46NJWGMPUZKCO","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CMA46NJW","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:177725961f26d52469007461a78a91ffd951f15cc8195a74eec081de79d422f2","target":"graph","created_at":"2026-05-18T00:59:25Z","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 ordered set is one of the most important data type in both theoretical algorithm design and analysis and practical programming. In this paper we study the set operations on two ordered sets, including Union, Intersect and Difference, based on four types of balanced Binary Search Trees (BST) including AVL trees, red-black trees, weight balanced trees and treaps. We introduced only one subroutine Join that needs to be implemented differently for each balanced BST, and on top of which we can implement generic, simple and efficient parallel functions for ordered sets. We first prove the work-e","authors_text":"Daniel Ferizovic, Guy Blelloch, Yihan Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-05T19:03:08Z","title":"Parallel Ordered Sets Using Join"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02120","kind":"arxiv","version":4},"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:16a270275da774a99294764f291ad20e4ec26f0ca9b4cc70035e7f7b9c993f41","target":"record","created_at":"2026-05-18T00:59:25Z","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":"c715e8a8235d7c5c125990a56f4671fecd16bc64cfaa3778c37b9fe8c6f84569","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-05T19:03:08Z","title_canon_sha256":"d30dd078aa0f67a207ad3ca0f9b9194eff39780e2f941a56d957a010d49e6103"},"schema_version":"1.0","source":{"id":"1602.02120","kind":"arxiv","version":4}},"canonical_sha256":"1301cf3536331f4ca84efa9d96a4c89ffc5cef787a9df98c445fd48a55bb9680","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1301cf3536331f4ca84efa9d96a4c89ffc5cef787a9df98c445fd48a55bb9680","first_computed_at":"2026-05-18T00:59:25.968433Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:25.968433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"El2/VRXc6xZnHHKpbgslvFSVk+WSbJhlBGBNG8T3YBkpNbr7YPRNSvv4h9rIAwhStFi1pVNOVQl/+z8yVk1jBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:25.969121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02120","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16a270275da774a99294764f291ad20e4ec26f0ca9b4cc70035e7f7b9c993f41","sha256:177725961f26d52469007461a78a91ffd951f15cc8195a74eec081de79d422f2"],"state_sha256":"7b392da9765f9b942709c831b511c731e04eaa2b06e129dafb705f55615ce449"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LGPV6ZKvzHok8uLgBUwzWoyypyizp9QKBf0pZ1Ol2ohGqxDHY+/WL6d9othVjbBQqjfS/txRbM+5/O4lFgEtAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:13:24.121347Z","bundle_sha256":"68b7fb370051fa09ff996df0037c817b22f76f61776ea54809d1e936ed16ba5b"}}