{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:67RNTR53CLHQPDLYJKNOYB3DMG","short_pith_number":"pith:67RNTR53","canonical_record":{"source":{"id":"1503.02504","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-09T15:04:30Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ecd9f7960ced1865db9d9c460398c5d3a2ac30e998c7ac91f40188f4f5034528","abstract_canon_sha256":"a118db0e79b327db1718b9109e668d20d72b82fc81753c5fdcdeb365cc2db2c2"},"schema_version":"1.0"},"canonical_sha256":"f7e2d9c7bb12cf078d784a9aec076361a11d14acb133da96f2dbb6c345143760","source":{"kind":"arxiv","id":"1503.02504","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02504","created_at":"2026-05-18T01:31:18Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02504v4","created_at":"2026-05-18T01:31:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02504","created_at":"2026-05-18T01:31:18Z"},{"alias_kind":"pith_short_12","alias_value":"67RNTR53CLHQ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"67RNTR53CLHQPDLY","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"67RNTR53","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:67RNTR53CLHQPDLYJKNOYB3DMG","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02504","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-09T15:04:30Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ecd9f7960ced1865db9d9c460398c5d3a2ac30e998c7ac91f40188f4f5034528","abstract_canon_sha256":"a118db0e79b327db1718b9109e668d20d72b82fc81753c5fdcdeb365cc2db2c2"},"schema_version":"1.0"},"canonical_sha256":"f7e2d9c7bb12cf078d784a9aec076361a11d14acb133da96f2dbb6c345143760","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:18.847720Z","signature_b64":"tQmai5IZIFwHJIMBLgCkX4ax7KF5Tv6hMy989B0fYPLD4gh70BhMv7hpXpJx6uzNNuhKhKLuRd86D3epz/2dBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7e2d9c7bb12cf078d784a9aec076361a11d14acb133da96f2dbb6c345143760","last_reissued_at":"2026-05-18T01:31:18.847163Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:18.847163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02504","source_version":4,"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:31:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oI4/KnD2miBQ32hu7bycmhQ5n/8AefV0Iu+y9fBIxFgPjCUBB9Nbz1c6toxpsDC1dtI965U04ULgndCN5VNeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:41:30.188502Z"},"content_sha256":"8c06ba51d7b2681bf002719f9bc037f394aa5cb46521f624311badb04ab7bb33","schema_version":"1.0","event_id":"sha256:8c06ba51d7b2681bf002719f9bc037f394aa5cb46521f624311badb04ab7bb33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:67RNTR53CLHQPDLYJKNOYB3DMG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Quicksort algorithm and related topics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Vasileios Iliopoulos","submitted_at":"2015-03-09T15:04:30Z","abstract_excerpt":"Sorting algorithms have attracted a great deal of attention and study, as they have numerous applications to Mathematics, Computer Science and related fields. In this thesis, we first deal with the mathematical analysis of the Quicksort algorithm and its variants. Specifically, we study the time complexity of the algorithm and we provide a complete demonstration of the variance of the number of comparisons required, a known result but one whose detailed proof is not easy to read out of the literature. We also examine variants of Quicksort, where multiple pivots are chosen for the partitioning "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02504","kind":"arxiv","version":4},"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:31:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HLFc8p5+VZ8aSUqscmsrtNVNc4qLOesvrYFvjEaCo8dC4UyBGrKv3YExCtU/lERwxoreZauYWeZ7GqasdqilCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:41:30.188850Z"},"content_sha256":"e1f776f648b38ebc4f0bd90d45d9cd1f14195760f53982a761700f42b9d6c5fd","schema_version":"1.0","event_id":"sha256:e1f776f648b38ebc4f0bd90d45d9cd1f14195760f53982a761700f42b9d6c5fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/67RNTR53CLHQPDLYJKNOYB3DMG/bundle.json","state_url":"https://pith.science/pith/67RNTR53CLHQPDLYJKNOYB3DMG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/67RNTR53CLHQPDLYJKNOYB3DMG/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-27T18:41:30Z","links":{"resolver":"https://pith.science/pith/67RNTR53CLHQPDLYJKNOYB3DMG","bundle":"https://pith.science/pith/67RNTR53CLHQPDLYJKNOYB3DMG/bundle.json","state":"https://pith.science/pith/67RNTR53CLHQPDLYJKNOYB3DMG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/67RNTR53CLHQPDLYJKNOYB3DMG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:67RNTR53CLHQPDLYJKNOYB3DMG","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":"a118db0e79b327db1718b9109e668d20d72b82fc81753c5fdcdeb365cc2db2c2","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-09T15:04:30Z","title_canon_sha256":"ecd9f7960ced1865db9d9c460398c5d3a2ac30e998c7ac91f40188f4f5034528"},"schema_version":"1.0","source":{"id":"1503.02504","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02504","created_at":"2026-05-18T01:31:18Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02504v4","created_at":"2026-05-18T01:31:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02504","created_at":"2026-05-18T01:31:18Z"},{"alias_kind":"pith_short_12","alias_value":"67RNTR53CLHQ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"67RNTR53CLHQPDLY","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"67RNTR53","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:e1f776f648b38ebc4f0bd90d45d9cd1f14195760f53982a761700f42b9d6c5fd","target":"graph","created_at":"2026-05-18T01:31:18Z","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":"Sorting algorithms have attracted a great deal of attention and study, as they have numerous applications to Mathematics, Computer Science and related fields. In this thesis, we first deal with the mathematical analysis of the Quicksort algorithm and its variants. Specifically, we study the time complexity of the algorithm and we provide a complete demonstration of the variance of the number of comparisons required, a known result but one whose detailed proof is not easy to read out of the literature. We also examine variants of Quicksort, where multiple pivots are chosen for the partitioning ","authors_text":"Vasileios Iliopoulos","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-09T15:04:30Z","title":"The Quicksort algorithm and related topics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02504","kind":"arxiv","version":4},"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:8c06ba51d7b2681bf002719f9bc037f394aa5cb46521f624311badb04ab7bb33","target":"record","created_at":"2026-05-18T01:31:18Z","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":"a118db0e79b327db1718b9109e668d20d72b82fc81753c5fdcdeb365cc2db2c2","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-09T15:04:30Z","title_canon_sha256":"ecd9f7960ced1865db9d9c460398c5d3a2ac30e998c7ac91f40188f4f5034528"},"schema_version":"1.0","source":{"id":"1503.02504","kind":"arxiv","version":4}},"canonical_sha256":"f7e2d9c7bb12cf078d784a9aec076361a11d14acb133da96f2dbb6c345143760","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7e2d9c7bb12cf078d784a9aec076361a11d14acb133da96f2dbb6c345143760","first_computed_at":"2026-05-18T01:31:18.847163Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:18.847163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tQmai5IZIFwHJIMBLgCkX4ax7KF5Tv6hMy989B0fYPLD4gh70BhMv7hpXpJx6uzNNuhKhKLuRd86D3epz/2dBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:18.847720Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02504","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c06ba51d7b2681bf002719f9bc037f394aa5cb46521f624311badb04ab7bb33","sha256:e1f776f648b38ebc4f0bd90d45d9cd1f14195760f53982a761700f42b9d6c5fd"],"state_sha256":"b793f38b29fa64003cd1b5aa565c4f526e70366f86a24dac3c90c94632304ec0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1fggaQOfuC1FwsDhRgB02thFWdTJC2he0Yo1ZY9o9iSm4auOEiAm5wATPfciW/96jC1k8Bzqgd8lfY6ZSob3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:41:30.190819Z","bundle_sha256":"7f1a173872e7e03b8859e90a9bd3aa5eace809139248ba2b33c9fefb6d132ce4"}}