{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2O4SUISY5E74UPTKRCTOIK624Y","short_pith_number":"pith:2O4SUISY","canonical_record":{"source":{"id":"1204.5083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-23T15:22:43Z","cross_cats_sorted":[],"title_canon_sha256":"c656645d21ca1371f8c3054b5ee6a71875b284359233b115adfcfb6aca3b286d","abstract_canon_sha256":"12225911cabc3f66ee19dddff0f95d0af6b246faa35d7f70d4e3b3bcf0163cf3"},"schema_version":"1.0"},"canonical_sha256":"d3b92a2258e93fca3e6a88a6e42bdae6057fa35e47fbcf08a454a08c0560322c","source":{"kind":"arxiv","id":"1204.5083","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5083","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5083v1","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5083","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"pith_short_12","alias_value":"2O4SUISY5E74","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2O4SUISY5E74UPTK","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2O4SUISY","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2O4SUISY5E74UPTKRCTOIK624Y","target":"record","payload":{"canonical_record":{"source":{"id":"1204.5083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-23T15:22:43Z","cross_cats_sorted":[],"title_canon_sha256":"c656645d21ca1371f8c3054b5ee6a71875b284359233b115adfcfb6aca3b286d","abstract_canon_sha256":"12225911cabc3f66ee19dddff0f95d0af6b246faa35d7f70d4e3b3bcf0163cf3"},"schema_version":"1.0"},"canonical_sha256":"d3b92a2258e93fca3e6a88a6e42bdae6057fa35e47fbcf08a454a08c0560322c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:14.806266Z","signature_b64":"8SU8YPlWdBuRSngyceJYJfS/HwnO917mSXYNg+dJ6D/2ML1I3gmoRQjzAQy0LIsD9yXPLF3PxFO3m7OIWQUPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3b92a2258e93fca3e6a88a6e42bdae6057fa35e47fbcf08a454a08c0560322c","last_reissued_at":"2026-05-18T03:57:14.805844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:14.805844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.5083","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-18T03:57:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZTvMJ1PDo1qOAoV+afIIDX19b0a3y8YVhEyAmbIeuSsA1uhpSk496QXZVkoqaOFXrLR+n76VKFRxP8Q/qRRQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:00:06.147124Z"},"content_sha256":"a57510da19ce9b17a8184b65708cb2dafea9fa18c336c0fe0f6c1aca047911a2","schema_version":"1.0","event_id":"sha256:a57510da19ce9b17a8184b65708cb2dafea9fa18c336c0fe0f6c1aca047911a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2O4SUISY5E74UPTKRCTOIK624Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Smart Sort: Design and Analysis of a Fast, Efficient and Robust Comparison Based Internal Sort Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Niraj Kumar Singh, Soubhik Chakraborty","submitted_at":"2012-04-23T15:22:43Z","abstract_excerpt":"Smart Sort algorithm is a \"smart\" fusion of heap construction procedures (of Heap sort algorithm) into the conventional \"Partition\" function (of Quick sort algorithm) resulting in a robust version of Quick sort algorithm. We have also performed empirical analysis of average case behavior of our proposed algorithm along with the necessary theoretical analysis for best and worst cases. Its performance was checked against some standard probability distributions, both uniform and non-uniform, like Binomial, Poisson, Discrete & Continuous Uniform, Exponential, and Standard Normal. The analysis exhi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5083","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-18T03:57:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZQexxspgqiKYWClf7IJGqUJqTqniSXU70WUX2ETJKGjkf8Z6/zdM5Ysl7Yd43a343MkJQ5zbaJ4pF2RF7fqFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:00:06.147491Z"},"content_sha256":"3fcd14ca54ff8965efa8afb224a1cb114163e5313da5413ef5d24c9f4c354c4f","schema_version":"1.0","event_id":"sha256:3fcd14ca54ff8965efa8afb224a1cb114163e5313da5413ef5d24c9f4c354c4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2O4SUISY5E74UPTKRCTOIK624Y/bundle.json","state_url":"https://pith.science/pith/2O4SUISY5E74UPTKRCTOIK624Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2O4SUISY5E74UPTKRCTOIK624Y/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-24T23:00:06Z","links":{"resolver":"https://pith.science/pith/2O4SUISY5E74UPTKRCTOIK624Y","bundle":"https://pith.science/pith/2O4SUISY5E74UPTKRCTOIK624Y/bundle.json","state":"https://pith.science/pith/2O4SUISY5E74UPTKRCTOIK624Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2O4SUISY5E74UPTKRCTOIK624Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2O4SUISY5E74UPTKRCTOIK624Y","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":"12225911cabc3f66ee19dddff0f95d0af6b246faa35d7f70d4e3b3bcf0163cf3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-23T15:22:43Z","title_canon_sha256":"c656645d21ca1371f8c3054b5ee6a71875b284359233b115adfcfb6aca3b286d"},"schema_version":"1.0","source":{"id":"1204.5083","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5083","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5083v1","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5083","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"pith_short_12","alias_value":"2O4SUISY5E74","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2O4SUISY5E74UPTK","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2O4SUISY","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:3fcd14ca54ff8965efa8afb224a1cb114163e5313da5413ef5d24c9f4c354c4f","target":"graph","created_at":"2026-05-18T03:57:14Z","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":"Smart Sort algorithm is a \"smart\" fusion of heap construction procedures (of Heap sort algorithm) into the conventional \"Partition\" function (of Quick sort algorithm) resulting in a robust version of Quick sort algorithm. We have also performed empirical analysis of average case behavior of our proposed algorithm along with the necessary theoretical analysis for best and worst cases. Its performance was checked against some standard probability distributions, both uniform and non-uniform, like Binomial, Poisson, Discrete & Continuous Uniform, Exponential, and Standard Normal. The analysis exhi","authors_text":"Niraj Kumar Singh, Soubhik Chakraborty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-23T15:22:43Z","title":"Smart Sort: Design and Analysis of a Fast, Efficient and Robust Comparison Based Internal Sort Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5083","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:a57510da19ce9b17a8184b65708cb2dafea9fa18c336c0fe0f6c1aca047911a2","target":"record","created_at":"2026-05-18T03:57:14Z","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":"12225911cabc3f66ee19dddff0f95d0af6b246faa35d7f70d4e3b3bcf0163cf3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-23T15:22:43Z","title_canon_sha256":"c656645d21ca1371f8c3054b5ee6a71875b284359233b115adfcfb6aca3b286d"},"schema_version":"1.0","source":{"id":"1204.5083","kind":"arxiv","version":1}},"canonical_sha256":"d3b92a2258e93fca3e6a88a6e42bdae6057fa35e47fbcf08a454a08c0560322c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3b92a2258e93fca3e6a88a6e42bdae6057fa35e47fbcf08a454a08c0560322c","first_computed_at":"2026-05-18T03:57:14.805844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:14.805844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8SU8YPlWdBuRSngyceJYJfS/HwnO917mSXYNg+dJ6D/2ML1I3gmoRQjzAQy0LIsD9yXPLF3PxFO3m7OIWQUPAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:14.806266Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.5083","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a57510da19ce9b17a8184b65708cb2dafea9fa18c336c0fe0f6c1aca047911a2","sha256:3fcd14ca54ff8965efa8afb224a1cb114163e5313da5413ef5d24c9f4c354c4f"],"state_sha256":"afd7ae4e432a3b4c50dcea0da2334ca9b20cabb055839656095402384c1ff3f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k2nqHVMLku95ejJEpyBI6m/dVP9hYSoqe/Xqn7AVf/RGbWtC7T0aSN1LMiRF6II3cTUOae8cWOkIhX27PNHjCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T23:00:06.149548Z","bundle_sha256":"2a863f42532aec293440faf8257d8eb59a40b558e6bde50d43b4dd3fc3e34251"}}