{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1999:XXZ7UK6E2TGSDHZAMAY7XHDPWU","short_pith_number":"pith:XXZ7UK6E","schema_version":"1.0","canonical_sha256":"bdf3fa2bc4d4cd219f206031fb9c6fb50275affd238338032d56ae81637113ba","source":{"kind":"arxiv","id":"cs/9906008","version":2},"attestation_state":"computed","paper":{"title":"A Lower Bound on the Average-Case Complexity of Shellsort","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ming Li (U. Waterloo), Paul Vitanyi (CWI & U. Amsterdam), Tao Jiang (McMaster U.)","submitted_at":"1999-06-04T15:11:31Z","abstract_excerpt":"We prove a general lower bound on the average-case complexity of Shellsort: the average number of data-movements (and comparisons) made by a $p$-pass Shellsort for any incremental sequence is $\\Omega (pn^{1 + 1/p})$ for every $p$. The proof method is an incompressibility argument based on Kolmogorov complexity. Using similar techniques, the average-case complexity of several other sorting algorithms is analyzed."},"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":"cs/9906008","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"1999-06-04T15:11:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9b1a2af1f8b9f1b80742b4f6ec45074ae5a81822fd511182d4b6380e3948d940","abstract_canon_sha256":"a1467a3dd57b56dc9ea87c3811a76b269e0086829fdb4340b9d6b7ec47f4b464"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:29.754499Z","signature_b64":"d4AeBZPh81KK9TnqOFYbTgvqABot1jErW6zw0WtVCI6xpOaBpOpkNFTlnkWgaEUwaONMCx/T+R/fQYmMzUnwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdf3fa2bc4d4cd219f206031fb9c6fb50275affd238338032d56ae81637113ba","last_reissued_at":"2026-05-18T02:28:29.753939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:29.753939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Lower Bound on the Average-Case Complexity of Shellsort","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ming Li (U. Waterloo), Paul Vitanyi (CWI & U. Amsterdam), Tao Jiang (McMaster U.)","submitted_at":"1999-06-04T15:11:31Z","abstract_excerpt":"We prove a general lower bound on the average-case complexity of Shellsort: the average number of data-movements (and comparisons) made by a $p$-pass Shellsort for any incremental sequence is $\\Omega (pn^{1 + 1/p})$ for every $p$. The proof method is an incompressibility argument based on Kolmogorov complexity. Using similar techniques, the average-case complexity of several other sorting algorithms is analyzed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9906008","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/9906008","created_at":"2026-05-18T02:28:29.754036+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/9906008v2","created_at":"2026-05-18T02:28:29.754036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9906008","created_at":"2026-05-18T02:28:29.754036+00:00"},{"alias_kind":"pith_short_12","alias_value":"XXZ7UK6E2TGS","created_at":"2026-05-18T12:25:49.631198+00:00"},{"alias_kind":"pith_short_16","alias_value":"XXZ7UK6E2TGSDHZA","created_at":"2026-05-18T12:25:49.631198+00:00"},{"alias_kind":"pith_short_8","alias_value":"XXZ7UK6E","created_at":"2026-05-18T12:25:49.631198+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/XXZ7UK6E2TGSDHZAMAY7XHDPWU","json":"https://pith.science/pith/XXZ7UK6E2TGSDHZAMAY7XHDPWU.json","graph_json":"https://pith.science/api/pith-number/XXZ7UK6E2TGSDHZAMAY7XHDPWU/graph.json","events_json":"https://pith.science/api/pith-number/XXZ7UK6E2TGSDHZAMAY7XHDPWU/events.json","paper":"https://pith.science/paper/XXZ7UK6E"},"agent_actions":{"view_html":"https://pith.science/pith/XXZ7UK6E2TGSDHZAMAY7XHDPWU","download_json":"https://pith.science/pith/XXZ7UK6E2TGSDHZAMAY7XHDPWU.json","view_paper":"https://pith.science/paper/XXZ7UK6E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/9906008&json=true","fetch_graph":"https://pith.science/api/pith-number/XXZ7UK6E2TGSDHZAMAY7XHDPWU/graph.json","fetch_events":"https://pith.science/api/pith-number/XXZ7UK6E2TGSDHZAMAY7XHDPWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XXZ7UK6E2TGSDHZAMAY7XHDPWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XXZ7UK6E2TGSDHZAMAY7XHDPWU/action/storage_attestation","attest_author":"https://pith.science/pith/XXZ7UK6E2TGSDHZAMAY7XHDPWU/action/author_attestation","sign_citation":"https://pith.science/pith/XXZ7UK6E2TGSDHZAMAY7XHDPWU/action/citation_signature","submit_replication":"https://pith.science/pith/XXZ7UK6E2TGSDHZAMAY7XHDPWU/action/replication_record"}},"created_at":"2026-05-18T02:28:29.754036+00:00","updated_at":"2026-05-18T02:28:29.754036+00:00"}