{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6PV2F7DQ2Z4P2ZEMJMGR5TJYZ6","short_pith_number":"pith:6PV2F7DQ","canonical_record":{"source":{"id":"1506.01446","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DC","submitted_at":"2015-06-04T02:01:43Z","cross_cats_sorted":[],"title_canon_sha256":"71fb26c6b640774e69e522db49f66d85b61ad6bd9276c5f5a99702fdd1f0c5a2","abstract_canon_sha256":"c0c9e8cd1bba6bed73ef2c0099524319b5e3736d452de1480c17ada67e8fe762"},"schema_version":"1.0"},"canonical_sha256":"f3eba2fc70d678fd648c4b0d1ecd38cf95abcc70dbb7ce7cf07f9de7b092a45d","source":{"kind":"arxiv","id":"1506.01446","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01446","created_at":"2026-05-18T01:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01446v1","created_at":"2026-05-18T01:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01446","created_at":"2026-05-18T01:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"6PV2F7DQ2Z4P","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6PV2F7DQ2Z4P2ZEM","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6PV2F7DQ","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6PV2F7DQ2Z4P2ZEMJMGR5TJYZ6","target":"record","payload":{"canonical_record":{"source":{"id":"1506.01446","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DC","submitted_at":"2015-06-04T02:01:43Z","cross_cats_sorted":[],"title_canon_sha256":"71fb26c6b640774e69e522db49f66d85b61ad6bd9276c5f5a99702fdd1f0c5a2","abstract_canon_sha256":"c0c9e8cd1bba6bed73ef2c0099524319b5e3736d452de1480c17ada67e8fe762"},"schema_version":"1.0"},"canonical_sha256":"f3eba2fc70d678fd648c4b0d1ecd38cf95abcc70dbb7ce7cf07f9de7b092a45d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:01.569464Z","signature_b64":"c6EhP/Yxfw9Vmdwcp8YcFGZpZOqexO31Ad+nMGMY5hNak5AIXk4brt/Fsy04PnuiqjPwGQQOwwh7P2OqHjoHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3eba2fc70d678fd648c4b0d1ecd38cf95abcc70dbb7ce7cf07f9de7b092a45d","last_reissued_at":"2026-05-18T01:01:01.568998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:01.568998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.01446","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-18T01:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GBBYFbzx7YkSJDXNjGsnWKzZbSzp/hNAHI7CjG2zGC8+FmkHPbbgaGhh2FaLE0LXUPSBY+jc354QLB6wTfasCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:35:09.719540Z"},"content_sha256":"911f3f5c05c3386e91a0bee7ab81ff21abb1e51a33e5c6e95590e69cc7252f72","schema_version":"1.0","event_id":"sha256:911f3f5c05c3386e91a0bee7ab81ff21abb1e51a33e5c6e95590e69cc7252f72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6PV2F7DQ2Z4P2ZEMJMGR5TJYZ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The implementation and optimization of Bitonic sort algorithm based on CUDA","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Liqing Cui, Qi Mu, Yufei Song","submitted_at":"2015-06-04T02:01:43Z","abstract_excerpt":"This paper describes in detail the bitonic sort algorithm,and implements the bitonic sort algorithm based on cuda architecture.At the same time,we conduct two effective optimization of implementation details according to the characteristics of the GPU,which greatly improve the efficiency. Finally,we survey the optimized Bitonic sort algorithm on the GPU with the speedup of quick sort algorithm on the CPU.Since Quick Sort is not suitable to be implemented in parallel,but it is more efficient than other sorting algorithms on CPU to some extend.Hence,to see the speedup and performance,we compare "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01446","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-18T01:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8QZLeumVxU+qOMwiBwxAlat4wiJp6SyRVScQnuJl0vN79ElPn1/ELLmP7pqgVYujph5UZCpLlExlR0TsLMe3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:35:09.720218Z"},"content_sha256":"5b1628e2f2578e71080c75c46dd405c06753778adc674b8c0aae5e14d936ff64","schema_version":"1.0","event_id":"sha256:5b1628e2f2578e71080c75c46dd405c06753778adc674b8c0aae5e14d936ff64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6PV2F7DQ2Z4P2ZEMJMGR5TJYZ6/bundle.json","state_url":"https://pith.science/pith/6PV2F7DQ2Z4P2ZEMJMGR5TJYZ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6PV2F7DQ2Z4P2ZEMJMGR5TJYZ6/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-05-26T11:35:09Z","links":{"resolver":"https://pith.science/pith/6PV2F7DQ2Z4P2ZEMJMGR5TJYZ6","bundle":"https://pith.science/pith/6PV2F7DQ2Z4P2ZEMJMGR5TJYZ6/bundle.json","state":"https://pith.science/pith/6PV2F7DQ2Z4P2ZEMJMGR5TJYZ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6PV2F7DQ2Z4P2ZEMJMGR5TJYZ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6PV2F7DQ2Z4P2ZEMJMGR5TJYZ6","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":"c0c9e8cd1bba6bed73ef2c0099524319b5e3736d452de1480c17ada67e8fe762","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DC","submitted_at":"2015-06-04T02:01:43Z","title_canon_sha256":"71fb26c6b640774e69e522db49f66d85b61ad6bd9276c5f5a99702fdd1f0c5a2"},"schema_version":"1.0","source":{"id":"1506.01446","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01446","created_at":"2026-05-18T01:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01446v1","created_at":"2026-05-18T01:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01446","created_at":"2026-05-18T01:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"6PV2F7DQ2Z4P","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6PV2F7DQ2Z4P2ZEM","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6PV2F7DQ","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:5b1628e2f2578e71080c75c46dd405c06753778adc674b8c0aae5e14d936ff64","target":"graph","created_at":"2026-05-18T01:01: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":"This paper describes in detail the bitonic sort algorithm,and implements the bitonic sort algorithm based on cuda architecture.At the same time,we conduct two effective optimization of implementation details according to the characteristics of the GPU,which greatly improve the efficiency. Finally,we survey the optimized Bitonic sort algorithm on the GPU with the speedup of quick sort algorithm on the CPU.Since Quick Sort is not suitable to be implemented in parallel,but it is more efficient than other sorting algorithms on CPU to some extend.Hence,to see the speedup and performance,we compare ","authors_text":"Liqing Cui, Qi Mu, Yufei Song","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DC","submitted_at":"2015-06-04T02:01:43Z","title":"The implementation and optimization of Bitonic sort algorithm based on CUDA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01446","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:911f3f5c05c3386e91a0bee7ab81ff21abb1e51a33e5c6e95590e69cc7252f72","target":"record","created_at":"2026-05-18T01:01: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":"c0c9e8cd1bba6bed73ef2c0099524319b5e3736d452de1480c17ada67e8fe762","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DC","submitted_at":"2015-06-04T02:01:43Z","title_canon_sha256":"71fb26c6b640774e69e522db49f66d85b61ad6bd9276c5f5a99702fdd1f0c5a2"},"schema_version":"1.0","source":{"id":"1506.01446","kind":"arxiv","version":1}},"canonical_sha256":"f3eba2fc70d678fd648c4b0d1ecd38cf95abcc70dbb7ce7cf07f9de7b092a45d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3eba2fc70d678fd648c4b0d1ecd38cf95abcc70dbb7ce7cf07f9de7b092a45d","first_computed_at":"2026-05-18T01:01:01.568998Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:01.568998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c6EhP/Yxfw9Vmdwcp8YcFGZpZOqexO31Ad+nMGMY5hNak5AIXk4brt/Fsy04PnuiqjPwGQQOwwh7P2OqHjoHDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:01.569464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.01446","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:911f3f5c05c3386e91a0bee7ab81ff21abb1e51a33e5c6e95590e69cc7252f72","sha256:5b1628e2f2578e71080c75c46dd405c06753778adc674b8c0aae5e14d936ff64"],"state_sha256":"a19e6c58c8abd9db632321f58bafcf66083f8501980d3767f8485629e22f98b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jlXK9xCUpmakT5BtYY2knqtLulX3D0zlDz1vjf0eaTFZR/ApTihusKlshDUHIE2epaOocmnDyj91ocIa5QtZAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:35:09.723939Z","bundle_sha256":"3032eaa5220a8d3ec61ff641587b23310fe3d1f04c8b02651b32b4f3c52318cd"}}