{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4HR5FWDIWX6HOETXW7T6UXFNA4","short_pith_number":"pith:4HR5FWDI","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"},"canonical_sha256":"e1e3d2d868b5fc771277b7e7ea5cad0720f351682c102108115cc353669e0f14","source":{"kind":"arxiv","id":"1805.08612","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08612","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08612v3","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08612","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"4HR5FWDIWX6H","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4HR5FWDIWX6HOETX","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4HR5FWDI","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4HR5FWDIWX6HOETXW7T6UXFNA4","target":"record","payload":{"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"},"canonical_sha256":"e1e3d2d868b5fc771277b7e7ea5cad0720f351682c102108115cc353669e0f14","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"},"source_kind":"arxiv","source_id":"1805.08612","source_version":3,"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-17T23:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WbUnGkxNC/ObLQetwFubHtMiOE+U+PoK6uybgcBNME0PpniIXxjE/IBIsIEAffCXtHdaQM92h8hTNV4J/hf2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:02:49.954923Z"},"content_sha256":"0e8170d37ecdc5a6ab20b6975480bfebc757e0b41a5072a1c74b15e72fb8d9d2","schema_version":"1.0","event_id":"sha256:0e8170d37ecdc5a6ab20b6975480bfebc757e0b41a5072a1c74b15e72fb8d9d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4HR5FWDIWX6HOETXW7T6UXFNA4","target":"graph","payload":{"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"},"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-17T23:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eCFIXoP9i3LwSiKMG0yAhlxV0uTyvzYoGdIoRZcT3dD8xFeLP4WiuRTalKm9AWEbosO6p9TOOh7MRWhZ5XSwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:02:49.955293Z"},"content_sha256":"35b60c16664706f5fad39542249d05c823d4db38baa68bf2dfcf027dc9038d11","schema_version":"1.0","event_id":"sha256:35b60c16664706f5fad39542249d05c823d4db38baa68bf2dfcf027dc9038d11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4HR5FWDIWX6HOETXW7T6UXFNA4/bundle.json","state_url":"https://pith.science/pith/4HR5FWDIWX6HOETXW7T6UXFNA4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4HR5FWDIWX6HOETXW7T6UXFNA4/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-02T22:02:49Z","links":{"resolver":"https://pith.science/pith/4HR5FWDIWX6HOETXW7T6UXFNA4","bundle":"https://pith.science/pith/4HR5FWDIWX6HOETXW7T6UXFNA4/bundle.json","state":"https://pith.science/pith/4HR5FWDIWX6HOETXW7T6UXFNA4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4HR5FWDIWX6HOETXW7T6UXFNA4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4HR5FWDIWX6HOETXW7T6UXFNA4","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":"073d048f0377e827c700c23317aa820595a44470fcabb00d03474731477ada31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-22T14:27:38Z","title_canon_sha256":"83576a11251953f663875240875895b969e5d21682c1cb6ce55cb40d9fbefc6a"},"schema_version":"1.0","source":{"id":"1805.08612","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08612","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08612v3","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08612","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"4HR5FWDIWX6H","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4HR5FWDIWX6HOETX","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4HR5FWDI","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:35b60c16664706f5fad39542249d05c823d4db38baa68bf2dfcf027dc9038d11","target":"graph","created_at":"2026-05-17T23:41: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":"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 ","authors_text":"Carine Pivoteau, Cyril Nicaud, Nicolas Auger, Vincent Jug\\'e","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-22T14:27:38Z","title":"On the Worst-Case Complexity of TimSort"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08612","kind":"arxiv","version":3},"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:0e8170d37ecdc5a6ab20b6975480bfebc757e0b41a5072a1c74b15e72fb8d9d2","target":"record","created_at":"2026-05-17T23:41: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":"073d048f0377e827c700c23317aa820595a44470fcabb00d03474731477ada31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-22T14:27:38Z","title_canon_sha256":"83576a11251953f663875240875895b969e5d21682c1cb6ce55cb40d9fbefc6a"},"schema_version":"1.0","source":{"id":"1805.08612","kind":"arxiv","version":3}},"canonical_sha256":"e1e3d2d868b5fc771277b7e7ea5cad0720f351682c102108115cc353669e0f14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1e3d2d868b5fc771277b7e7ea5cad0720f351682c102108115cc353669e0f14","first_computed_at":"2026-05-17T23:41:18.062815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:18.062815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IlMAV8z/CqFbFBZHxWIooiXNa/Aymz1mU/FC6XJCK0NayBlvPjbpkf7QlgVv8IFTztM3zRPUbDZtzvhwiWoZCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:18.063250Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08612","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e8170d37ecdc5a6ab20b6975480bfebc757e0b41a5072a1c74b15e72fb8d9d2","sha256:35b60c16664706f5fad39542249d05c823d4db38baa68bf2dfcf027dc9038d11"],"state_sha256":"641fd806537bfeddaffd9b7dcdb2c3a2afa6a4085c0aaf831d1c8b4cd740b9c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QcHHeer0l1Kky112gYC4nzAMZMtcT+mbL9SaHQTIN8s0PskSLdLRcikRG4qeCsbmsxTcd+jhHaotgGFgSDvgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:02:49.957220Z","bundle_sha256":"d12a8684c2e9e216913bace09b77faf841981424363e9a1e27e13d168f4d8511"}}