{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VCQ7ULXKXTX7IBSR7CXNCBSCKG","short_pith_number":"pith:VCQ7ULXK","canonical_record":{"source":{"id":"1902.00257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-01T10:06:52Z","cross_cats_sorted":[],"title_canon_sha256":"3ca49fc0afb2a6c2eb39d710a216e558d6e379503a8e5ae1b562ff80e223311e","abstract_canon_sha256":"9a15195819fcd230f44d751d5cc19b7bcc25e949e0c750c3486189fb357b699d"},"schema_version":"1.0"},"canonical_sha256":"a8a1fa2eeabceff40651f8aed1064251a0f90b30f8d4a9f7dff3e131796bc0b3","source":{"kind":"arxiv","id":"1902.00257","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00257","created_at":"2026-05-17T23:54:57Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00257v1","created_at":"2026-05-17T23:54:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00257","created_at":"2026-05-17T23:54:57Z"},{"alias_kind":"pith_short_12","alias_value":"VCQ7ULXKXTX7","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VCQ7ULXKXTX7IBSR","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VCQ7ULXK","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VCQ7ULXKXTX7IBSR7CXNCBSCKG","target":"record","payload":{"canonical_record":{"source":{"id":"1902.00257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-01T10:06:52Z","cross_cats_sorted":[],"title_canon_sha256":"3ca49fc0afb2a6c2eb39d710a216e558d6e379503a8e5ae1b562ff80e223311e","abstract_canon_sha256":"9a15195819fcd230f44d751d5cc19b7bcc25e949e0c750c3486189fb357b699d"},"schema_version":"1.0"},"canonical_sha256":"a8a1fa2eeabceff40651f8aed1064251a0f90b30f8d4a9f7dff3e131796bc0b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:57.907171Z","signature_b64":"YPWtLLBwmFYCCbp7CBbXevO2No3AQTkHYcmm4zwcK41dkGPKRhGC2xyg/b5sc8F2Z79C0tFrziKp2fVtUoryDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8a1fa2eeabceff40651f8aed1064251a0f90b30f8d4a9f7dff3e131796bc0b3","last_reissued_at":"2026-05-17T23:54:57.906525Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:57.906525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.00257","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-17T23:54:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wIQoIj+YVyMob7ksbS9rDoG/DH3pFsN8KP/Mu815qMeyrLbUk3CA3JHH2HZ/X1tsVRTwmjDSVKOWOsfDykxzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:23:51.262512Z"},"content_sha256":"55ae4c20659ca428b15328afc9fd9baae58b945aafa84d3a32cbf78b4862e56e","schema_version":"1.0","event_id":"sha256:55ae4c20659ca428b15328afc9fd9baae58b945aafa84d3a32cbf78b4862e56e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VCQ7ULXKXTX7IBSR7CXNCBSCKG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient sorting algorithm - Ultimate Heapsort(UHS)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Feiyang Chen, Hanlin Hu, Hanyang Mao, Nan Chen","submitted_at":"2019-02-01T10:06:52Z","abstract_excerpt":"Motivated by the development of computer theory, the sorting algorithm is emerging in an endless stream. Inspired by decrease and conquer method, we propose a brand new sorting algorithmUltimately Heapsort. The algorithm consists of two parts: building a heap and adjusting a heap. Through the asymptotic analysis and experimental analysis of the algorithm, the time complexity of our algorithm can reach O(nlogn) under any condition. Moreover, its space complexity is only O(1). It can be seen that our algorithm is superior to all previous algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00257","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-17T23:54:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4SJWn8Tia6YWi62/YJoYcn+0reO/dsYt/0q4wY68MBaho3BxjUStUc3m7UOL1ZRTKpLWcBzYU3q8dJFLP3J1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:23:51.263179Z"},"content_sha256":"3d23fa7e0bfa9a9a1b633f4bd7d3df36fb92e4c78281599fbf5fb50a2ca6cfa5","schema_version":"1.0","event_id":"sha256:3d23fa7e0bfa9a9a1b633f4bd7d3df36fb92e4c78281599fbf5fb50a2ca6cfa5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VCQ7ULXKXTX7IBSR7CXNCBSCKG/bundle.json","state_url":"https://pith.science/pith/VCQ7ULXKXTX7IBSR7CXNCBSCKG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VCQ7ULXKXTX7IBSR7CXNCBSCKG/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-06T12:23:51Z","links":{"resolver":"https://pith.science/pith/VCQ7ULXKXTX7IBSR7CXNCBSCKG","bundle":"https://pith.science/pith/VCQ7ULXKXTX7IBSR7CXNCBSCKG/bundle.json","state":"https://pith.science/pith/VCQ7ULXKXTX7IBSR7CXNCBSCKG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VCQ7ULXKXTX7IBSR7CXNCBSCKG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VCQ7ULXKXTX7IBSR7CXNCBSCKG","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":"9a15195819fcd230f44d751d5cc19b7bcc25e949e0c750c3486189fb357b699d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-01T10:06:52Z","title_canon_sha256":"3ca49fc0afb2a6c2eb39d710a216e558d6e379503a8e5ae1b562ff80e223311e"},"schema_version":"1.0","source":{"id":"1902.00257","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00257","created_at":"2026-05-17T23:54:57Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00257v1","created_at":"2026-05-17T23:54:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00257","created_at":"2026-05-17T23:54:57Z"},{"alias_kind":"pith_short_12","alias_value":"VCQ7ULXKXTX7","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VCQ7ULXKXTX7IBSR","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VCQ7ULXK","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:3d23fa7e0bfa9a9a1b633f4bd7d3df36fb92e4c78281599fbf5fb50a2ca6cfa5","target":"graph","created_at":"2026-05-17T23:54:57Z","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":"Motivated by the development of computer theory, the sorting algorithm is emerging in an endless stream. Inspired by decrease and conquer method, we propose a brand new sorting algorithmUltimately Heapsort. The algorithm consists of two parts: building a heap and adjusting a heap. Through the asymptotic analysis and experimental analysis of the algorithm, the time complexity of our algorithm can reach O(nlogn) under any condition. Moreover, its space complexity is only O(1). It can be seen that our algorithm is superior to all previous algorithms.","authors_text":"Feiyang Chen, Hanlin Hu, Hanyang Mao, Nan Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-01T10:06:52Z","title":"An efficient sorting algorithm - Ultimate Heapsort(UHS)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00257","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:55ae4c20659ca428b15328afc9fd9baae58b945aafa84d3a32cbf78b4862e56e","target":"record","created_at":"2026-05-17T23:54:57Z","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":"9a15195819fcd230f44d751d5cc19b7bcc25e949e0c750c3486189fb357b699d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-01T10:06:52Z","title_canon_sha256":"3ca49fc0afb2a6c2eb39d710a216e558d6e379503a8e5ae1b562ff80e223311e"},"schema_version":"1.0","source":{"id":"1902.00257","kind":"arxiv","version":1}},"canonical_sha256":"a8a1fa2eeabceff40651f8aed1064251a0f90b30f8d4a9f7dff3e131796bc0b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8a1fa2eeabceff40651f8aed1064251a0f90b30f8d4a9f7dff3e131796bc0b3","first_computed_at":"2026-05-17T23:54:57.906525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:57.906525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YPWtLLBwmFYCCbp7CBbXevO2No3AQTkHYcmm4zwcK41dkGPKRhGC2xyg/b5sc8F2Z79C0tFrziKp2fVtUoryDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:57.907171Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00257","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55ae4c20659ca428b15328afc9fd9baae58b945aafa84d3a32cbf78b4862e56e","sha256:3d23fa7e0bfa9a9a1b633f4bd7d3df36fb92e4c78281599fbf5fb50a2ca6cfa5"],"state_sha256":"ce3beffdf3bbb04e73a216a480e7fe79d2ce03462a555539b1f333700e3e10dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3t7DWy/g/GIVCWFsEu460ZWx/6V8q43ddrtiLCJ4aEPT8rIuEMAKLKZrSwCnzkMy4j/lVa65a0ZwHD5vTR5IAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T12:23:51.267260Z","bundle_sha256":"69b081e7b51b87bafaf3c7285dbd0edc55cc9b35ba0a97d6c34a7904e266f6eb"}}