{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:X2C2EJEUZJYTWAA3P337WVOFPQ","short_pith_number":"pith:X2C2EJEU","canonical_record":{"source":{"id":"1203.1830","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-08T15:42:04Z","cross_cats_sorted":[],"title_canon_sha256":"9fa1f59efc6f8aa86445fbd076f57c9a7bd1e3255827447d25c29f2bd4b509b2","abstract_canon_sha256":"e9471509058a9006b8b133313dcc63af06fbe5db596c10b6eef1e3a15088b20b"},"schema_version":"1.0"},"canonical_sha256":"be85a22494ca713b001b7ef7fb55c57c30bf7d272b324a7d0812cab5f1b045aa","source":{"kind":"arxiv","id":"1203.1830","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1830","created_at":"2026-05-18T03:59:13Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1830v2","created_at":"2026-05-18T03:59:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1830","created_at":"2026-05-18T03:59:13Z"},{"alias_kind":"pith_short_12","alias_value":"X2C2EJEUZJYT","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"X2C2EJEUZJYTWAA3","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"X2C2EJEU","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:X2C2EJEUZJYTWAA3P337WVOFPQ","target":"record","payload":{"canonical_record":{"source":{"id":"1203.1830","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-08T15:42:04Z","cross_cats_sorted":[],"title_canon_sha256":"9fa1f59efc6f8aa86445fbd076f57c9a7bd1e3255827447d25c29f2bd4b509b2","abstract_canon_sha256":"e9471509058a9006b8b133313dcc63af06fbe5db596c10b6eef1e3a15088b20b"},"schema_version":"1.0"},"canonical_sha256":"be85a22494ca713b001b7ef7fb55c57c30bf7d272b324a7d0812cab5f1b045aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:13.459805Z","signature_b64":"09eNZfu+d2n1sPVewoWeq1mkQ+qNvPY6GnNsPsS1ZguOdhAcpPG1yKlOcn01SHtPVAW3wl/JA5C8b+L4RreYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be85a22494ca713b001b7ef7fb55c57c30bf7d272b324a7d0812cab5f1b045aa","last_reissued_at":"2026-05-18T03:59:13.459165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:13.459165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.1830","source_version":2,"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-18T03:59:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DK5DC8WF7IPbvGIs+bHMqCeQZN2tqW9ut3xbZDzXJptSuARC9GG05bmy+XCmCJCsGI+lgk8SjIpwh8dQwGiNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:25:57.414643Z"},"content_sha256":"fe53a03370033bf15d78af5c506a433c6ad1154bdbcabac20408756f97d36373","schema_version":"1.0","event_id":"sha256:fe53a03370033bf15d78af5c506a433c6ad1154bdbcabac20408756f97d36373"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:X2C2EJEUZJYTWAA3P337WVOFPQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partition Sort Revisited: Reconfirming the Robustness in Average Case and much more!","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mita Pal, Niraj Kumar Singh, Soubhik Chakraborty","submitted_at":"2012-03-08T15:42:04Z","abstract_excerpt":"In our previous work there was some indication that Partition Sort could be having a more robust average case O(nlogn) complexity than the popular Quick Sort. In our first study in this paper, we reconfirm this through computer experiments for inputs from Cauchy distribution for which expectation theoretically does not exist. Additionally, the algorithm is found to be sensitive to parameters of the input probability distribution demanding further investigation on parameterized complexity. The results on this algorithm for Binomial inputs in our second study are very encouraging in that directi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1830","kind":"arxiv","version":2},"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-18T03:59:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ktbfcZUWiRsZTX989ZDp5XAyfIuIDIcttEVbUeBGxgu/3Y//dHw3KEL9iTonzRGY9Hcx6CF7TjJSGt00h25eAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:25:57.414988Z"},"content_sha256":"92dfd0b399f3e19ffc54fb12fa885251450dd95826a277fbe69025cfffeeac61","schema_version":"1.0","event_id":"sha256:92dfd0b399f3e19ffc54fb12fa885251450dd95826a277fbe69025cfffeeac61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X2C2EJEUZJYTWAA3P337WVOFPQ/bundle.json","state_url":"https://pith.science/pith/X2C2EJEUZJYTWAA3P337WVOFPQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X2C2EJEUZJYTWAA3P337WVOFPQ/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-24T20:25:57Z","links":{"resolver":"https://pith.science/pith/X2C2EJEUZJYTWAA3P337WVOFPQ","bundle":"https://pith.science/pith/X2C2EJEUZJYTWAA3P337WVOFPQ/bundle.json","state":"https://pith.science/pith/X2C2EJEUZJYTWAA3P337WVOFPQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X2C2EJEUZJYTWAA3P337WVOFPQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:X2C2EJEUZJYTWAA3P337WVOFPQ","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":"e9471509058a9006b8b133313dcc63af06fbe5db596c10b6eef1e3a15088b20b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-08T15:42:04Z","title_canon_sha256":"9fa1f59efc6f8aa86445fbd076f57c9a7bd1e3255827447d25c29f2bd4b509b2"},"schema_version":"1.0","source":{"id":"1203.1830","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1830","created_at":"2026-05-18T03:59:13Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1830v2","created_at":"2026-05-18T03:59:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1830","created_at":"2026-05-18T03:59:13Z"},{"alias_kind":"pith_short_12","alias_value":"X2C2EJEUZJYT","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"X2C2EJEUZJYTWAA3","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"X2C2EJEU","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:92dfd0b399f3e19ffc54fb12fa885251450dd95826a277fbe69025cfffeeac61","target":"graph","created_at":"2026-05-18T03:59:13Z","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":"In our previous work there was some indication that Partition Sort could be having a more robust average case O(nlogn) complexity than the popular Quick Sort. In our first study in this paper, we reconfirm this through computer experiments for inputs from Cauchy distribution for which expectation theoretically does not exist. Additionally, the algorithm is found to be sensitive to parameters of the input probability distribution demanding further investigation on parameterized complexity. The results on this algorithm for Binomial inputs in our second study are very encouraging in that directi","authors_text":"Mita Pal, Niraj Kumar Singh, Soubhik Chakraborty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-08T15:42:04Z","title":"Partition Sort Revisited: Reconfirming the Robustness in Average Case and much more!"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1830","kind":"arxiv","version":2},"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:fe53a03370033bf15d78af5c506a433c6ad1154bdbcabac20408756f97d36373","target":"record","created_at":"2026-05-18T03:59:13Z","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":"e9471509058a9006b8b133313dcc63af06fbe5db596c10b6eef1e3a15088b20b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-08T15:42:04Z","title_canon_sha256":"9fa1f59efc6f8aa86445fbd076f57c9a7bd1e3255827447d25c29f2bd4b509b2"},"schema_version":"1.0","source":{"id":"1203.1830","kind":"arxiv","version":2}},"canonical_sha256":"be85a22494ca713b001b7ef7fb55c57c30bf7d272b324a7d0812cab5f1b045aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be85a22494ca713b001b7ef7fb55c57c30bf7d272b324a7d0812cab5f1b045aa","first_computed_at":"2026-05-18T03:59:13.459165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:13.459165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"09eNZfu+d2n1sPVewoWeq1mkQ+qNvPY6GnNsPsS1ZguOdhAcpPG1yKlOcn01SHtPVAW3wl/JA5C8b+L4RreYAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:13.459805Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.1830","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe53a03370033bf15d78af5c506a433c6ad1154bdbcabac20408756f97d36373","sha256:92dfd0b399f3e19ffc54fb12fa885251450dd95826a277fbe69025cfffeeac61"],"state_sha256":"22ae9a6908de4f81e949d1b240401d2a107a136469c32c8fbfa77a24c93a7bf6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+3taMlcB+aLhxZ9kXc0rvUJfWJ+nMoiPw7OA4kIqmTDrdseNa9lpD64EMX4YNB+H/TSw0LXCbSgY108NLP95DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T20:25:57.416912Z","bundle_sha256":"2a6db6edd994869519472033327261d76fccbf705f967ddb7bc86839fe0130fa"}}