{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MXWBS2SVVEB56YZ6XJW4SAD55C","short_pith_number":"pith:MXWBS2SV","canonical_record":{"source":{"id":"1107.3622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-19T04:21:58Z","cross_cats_sorted":[],"title_canon_sha256":"82a2f4a52b7fdc2e2c6ffe2f6a376577497e5bd50c4cc18bb3ded50c29db6575","abstract_canon_sha256":"453a3b11d5002f2f1679d2f5de7890f80c80a5b91c017c28f7d7fa5cd02a6e90"},"schema_version":"1.0"},"canonical_sha256":"65ec196a55a903df633eba6dc9007de895150645f3315d831d71f4353d4dabd9","source":{"kind":"arxiv","id":"1107.3622","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3622","created_at":"2026-05-18T04:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3622v1","created_at":"2026-05-18T04:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3622","created_at":"2026-05-18T04:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"MXWBS2SVVEB5","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"MXWBS2SVVEB56YZ6","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"MXWBS2SV","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MXWBS2SVVEB56YZ6XJW4SAD55C","target":"record","payload":{"canonical_record":{"source":{"id":"1107.3622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-19T04:21:58Z","cross_cats_sorted":[],"title_canon_sha256":"82a2f4a52b7fdc2e2c6ffe2f6a376577497e5bd50c4cc18bb3ded50c29db6575","abstract_canon_sha256":"453a3b11d5002f2f1679d2f5de7890f80c80a5b91c017c28f7d7fa5cd02a6e90"},"schema_version":"1.0"},"canonical_sha256":"65ec196a55a903df633eba6dc9007de895150645f3315d831d71f4353d4dabd9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:24.397429Z","signature_b64":"S8MRQhucQ7QRmhC69iJ2XEWElfa5J/1HDazHGOjm9LVgwPepoHY54izSCGfm4L00PXCTRINJIyaBvfGE9vZCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65ec196a55a903df633eba6dc9007de895150645f3315d831d71f4353d4dabd9","last_reissued_at":"2026-05-18T04:17:24.396458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:24.396458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.3622","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:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/yNbAmC7DtnQdxvOktcWoQtclfRsWEihfFGLilZL8N4x2zGX1mvB+jr+C5Re6+pvTpM5QZPIvEc5cn7f6mnjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:32:17.362249Z"},"content_sha256":"b87edb7db0cf3e2b733b5e05184a7efd1aedf51534ca8939c3321e55c6dc35a8","schema_version":"1.0","event_id":"sha256:b87edb7db0cf3e2b733b5e05184a7efd1aedf51534ca8939c3321e55c6dc35a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MXWBS2SVVEB56YZ6XJW4SAD55C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"K-sort: A new sorting algorithm that beats Heap sort for n <= 70 lakhs!","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kiran Kumar Sundararajan, Mita Pal, N.C. Mahanti, Soubhik Chakraborty","submitted_at":"2011-07-19T04:21:58Z","abstract_excerpt":"Sundararajan and Chakraborty (2007) introduced a new version of Quick sort removing the interchanges. Khreisat (2007) found this algorithm to be competing well with some other versions of Quick sort. However, it uses an auxiliary array thereby increasing the space complexity. Here, we provide a second version of our new sort where we have removed the auxiliary array. This second improved version of the algorithm, which we call K-sort, is found to sort elements faster than Heap sort for an appreciably large array size (n <= 70,00,000) for uniform U[0, 1] inputs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3622","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:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VdtzAsuMt+Yb2JCbil4WNu+xnD66MxlYyc4pjAOuJf8e9gMDIuVm1CBPwalAJiw8jiGdqqyIla3lfrACosRSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:32:17.362607Z"},"content_sha256":"18f2d3cb19de5ac49d89dbf3b94c74e3f9dd9e3032af109da5d2d917e26b6813","schema_version":"1.0","event_id":"sha256:18f2d3cb19de5ac49d89dbf3b94c74e3f9dd9e3032af109da5d2d917e26b6813"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MXWBS2SVVEB56YZ6XJW4SAD55C/bundle.json","state_url":"https://pith.science/pith/MXWBS2SVVEB56YZ6XJW4SAD55C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MXWBS2SVVEB56YZ6XJW4SAD55C/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-24T16:32:17Z","links":{"resolver":"https://pith.science/pith/MXWBS2SVVEB56YZ6XJW4SAD55C","bundle":"https://pith.science/pith/MXWBS2SVVEB56YZ6XJW4SAD55C/bundle.json","state":"https://pith.science/pith/MXWBS2SVVEB56YZ6XJW4SAD55C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MXWBS2SVVEB56YZ6XJW4SAD55C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MXWBS2SVVEB56YZ6XJW4SAD55C","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":"453a3b11d5002f2f1679d2f5de7890f80c80a5b91c017c28f7d7fa5cd02a6e90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-19T04:21:58Z","title_canon_sha256":"82a2f4a52b7fdc2e2c6ffe2f6a376577497e5bd50c4cc18bb3ded50c29db6575"},"schema_version":"1.0","source":{"id":"1107.3622","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3622","created_at":"2026-05-18T04:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3622v1","created_at":"2026-05-18T04:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3622","created_at":"2026-05-18T04:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"MXWBS2SVVEB5","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"MXWBS2SVVEB56YZ6","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"MXWBS2SV","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:18f2d3cb19de5ac49d89dbf3b94c74e3f9dd9e3032af109da5d2d917e26b6813","target":"graph","created_at":"2026-05-18T04:17:24Z","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":"Sundararajan and Chakraborty (2007) introduced a new version of Quick sort removing the interchanges. Khreisat (2007) found this algorithm to be competing well with some other versions of Quick sort. However, it uses an auxiliary array thereby increasing the space complexity. Here, we provide a second version of our new sort where we have removed the auxiliary array. This second improved version of the algorithm, which we call K-sort, is found to sort elements faster than Heap sort for an appreciably large array size (n <= 70,00,000) for uniform U[0, 1] inputs.","authors_text":"Kiran Kumar Sundararajan, Mita Pal, N.C. Mahanti, Soubhik Chakraborty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-19T04:21:58Z","title":"K-sort: A new sorting algorithm that beats Heap sort for n <= 70 lakhs!"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3622","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:b87edb7db0cf3e2b733b5e05184a7efd1aedf51534ca8939c3321e55c6dc35a8","target":"record","created_at":"2026-05-18T04:17:24Z","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":"453a3b11d5002f2f1679d2f5de7890f80c80a5b91c017c28f7d7fa5cd02a6e90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-19T04:21:58Z","title_canon_sha256":"82a2f4a52b7fdc2e2c6ffe2f6a376577497e5bd50c4cc18bb3ded50c29db6575"},"schema_version":"1.0","source":{"id":"1107.3622","kind":"arxiv","version":1}},"canonical_sha256":"65ec196a55a903df633eba6dc9007de895150645f3315d831d71f4353d4dabd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65ec196a55a903df633eba6dc9007de895150645f3315d831d71f4353d4dabd9","first_computed_at":"2026-05-18T04:17:24.396458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:17:24.396458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S8MRQhucQ7QRmhC69iJ2XEWElfa5J/1HDazHGOjm9LVgwPepoHY54izSCGfm4L00PXCTRINJIyaBvfGE9vZCAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:17:24.397429Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.3622","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b87edb7db0cf3e2b733b5e05184a7efd1aedf51534ca8939c3321e55c6dc35a8","sha256:18f2d3cb19de5ac49d89dbf3b94c74e3f9dd9e3032af109da5d2d917e26b6813"],"state_sha256":"40d1d22c0854f89c2027badb3e0ffc07479c6ddab09e8c4964f31fa438ca8fb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ggbyFeJlo+XgtEP6jq4oNWk+WClIFZ6qsIOE65RHs7MWzQ6zhPR08VrOv+/ruij0GaFE5a1SQa7SHhRrZCfjCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T16:32:17.364477Z","bundle_sha256":"57054afde8e1dd69bd9561635c2b80b8416530b02807e0b3f6734eb1e73759b3"}}