{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4HR5FWDIWX6HOETXW7T6UXFNA4","short_pith_number":"pith:4HR5FWDI","schema_version":"1.0","canonical_sha256":"e1e3d2d868b5fc771277b7e7ea5cad0720f351682c102108115cc353669e0f14","source":{"kind":"arxiv","id":"1805.08612","version":3},"attestation_state":"computed","paper":{"title":"On the Worst-Case Complexity of TimSort","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carine Pivoteau, Cyril Nicaud, Nicolas Auger, Vincent Jug\\'e","submitted_at":"2018-05-22T14:27:38Z","abstract_excerpt":"TimSort is an intriguing sorting algorithm designed in 2002 for Python, whose worst-case complexity was announced, but not proved until our recent preprint. In fact, there are two slightly different versions of TimSort that are currently implemented in Python and in Java respectively. We propose a pedagogical and insightful proof that the Python version runs in $\\mathcal{O}(n\\log n)$. The approach we use in the analysis also applies to the Java version, although not without very involved technical details. As a byproduct of our study, we uncover a bug in the Java implementation that can cause "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1805.08612","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-22T14:27:38Z","cross_cats_sorted":[],"title_canon_sha256":"83576a11251953f663875240875895b969e5d21682c1cb6ce55cb40d9fbefc6a","abstract_canon_sha256":"073d048f0377e827c700c23317aa820595a44470fcabb00d03474731477ada31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:18.063250Z","signature_b64":"IlMAV8z/CqFbFBZHxWIooiXNa/Aymz1mU/FC6XJCK0NayBlvPjbpkf7QlgVv8IFTztM3zRPUbDZtzvhwiWoZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1e3d2d868b5fc771277b7e7ea5cad0720f351682c102108115cc353669e0f14","last_reissued_at":"2026-05-17T23:41:18.062815Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:18.062815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Worst-Case Complexity of TimSort","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carine Pivoteau, Cyril Nicaud, Nicolas Auger, Vincent Jug\\'e","submitted_at":"2018-05-22T14:27:38Z","abstract_excerpt":"TimSort is an intriguing sorting algorithm designed in 2002 for Python, whose worst-case complexity was announced, but not proved until our recent preprint. In fact, there are two slightly different versions of TimSort that are currently implemented in Python and in Java respectively. We propose a pedagogical and insightful proof that the Python version runs in $\\mathcal{O}(n\\log n)$. The approach we use in the analysis also applies to the Java version, although not without very involved technical details. As a byproduct of our study, we uncover a bug in the Java implementation that can cause "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08612","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.08612","created_at":"2026-05-17T23:41:18.062881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08612v3","created_at":"2026-05-17T23:41:18.062881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08612","created_at":"2026-05-17T23:41:18.062881+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HR5FWDIWX6H","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HR5FWDIWX6HOETX","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HR5FWDI","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4HR5FWDIWX6HOETXW7T6UXFNA4","json":"https://pith.science/pith/4HR5FWDIWX6HOETXW7T6UXFNA4.json","graph_json":"https://pith.science/api/pith-number/4HR5FWDIWX6HOETXW7T6UXFNA4/graph.json","events_json":"https://pith.science/api/pith-number/4HR5FWDIWX6HOETXW7T6UXFNA4/events.json","paper":"https://pith.science/paper/4HR5FWDI"},"agent_actions":{"view_html":"https://pith.science/pith/4HR5FWDIWX6HOETXW7T6UXFNA4","download_json":"https://pith.science/pith/4HR5FWDIWX6HOETXW7T6UXFNA4.json","view_paper":"https://pith.science/paper/4HR5FWDI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08612&json=true","fetch_graph":"https://pith.science/api/pith-number/4HR5FWDIWX6HOETXW7T6UXFNA4/graph.json","fetch_events":"https://pith.science/api/pith-number/4HR5FWDIWX6HOETXW7T6UXFNA4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HR5FWDIWX6HOETXW7T6UXFNA4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HR5FWDIWX6HOETXW7T6UXFNA4/action/storage_attestation","attest_author":"https://pith.science/pith/4HR5FWDIWX6HOETXW7T6UXFNA4/action/author_attestation","sign_citation":"https://pith.science/pith/4HR5FWDIWX6HOETXW7T6UXFNA4/action/citation_signature","submit_replication":"https://pith.science/pith/4HR5FWDIWX6HOETXW7T6UXFNA4/action/replication_record"}},"created_at":"2026-05-17T23:41:18.062881+00:00","updated_at":"2026-05-17T23:41:18.062881+00:00"}