{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2C5WIAZZG3US2QH4QYMW3XFTTZ","short_pith_number":"pith:2C5WIAZZ","schema_version":"1.0","canonical_sha256":"d0bb64033936e92d40fc86196ddcb39e5ae1fbcb97128980eb91faab88cd7d19","source":{"kind":"arxiv","id":"1503.06572","version":1},"attestation_state":"computed","paper":{"title":"A Machine Learning Approach to Predicting the Smoothed Complexity of Sorting Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"cs.LG","authors_text":"Bichen Shi, Georgiana Ifrim, Michel Schellekens","submitted_at":"2015-03-23T09:37:33Z","abstract_excerpt":"Smoothed analysis is a framework for analyzing the complexity of an algorithm, acting as a bridge between average and worst-case behaviour. For example, Quicksort and the Simplex algorithm are widely used in practical applications, despite their heavy worst-case complexity. Smoothed complexity aims to better characterize such algorithms. Existing theoretical bounds for the smoothed complexity of sorting algorithms are still quite weak. Furthermore, empirically computing the smoothed complexity via its original definition is computationally infeasible, even for modest input sizes. In this paper"},"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":"1503.06572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-23T09:37:33Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"26b704dc9269741810aec0650d99fe1ce294ed8b1df1aed2dd21648d0a751ff5","abstract_canon_sha256":"979ee5e2ba3d6f581e15879a71476750ffb48d5273f06a75f686ba2bf2080b43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:18.363039Z","signature_b64":"4s5Xor/vn7GN+5D4lnUhNHu9fqxLMdpN7vl1V3RFMx23sSxONlPuYzFWB1L1he7ec1fYqhOUn6dN65DwoPVxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0bb64033936e92d40fc86196ddcb39e5ae1fbcb97128980eb91faab88cd7d19","last_reissued_at":"2026-05-18T02:20:18.362428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:18.362428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Machine Learning Approach to Predicting the Smoothed Complexity of Sorting Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"cs.LG","authors_text":"Bichen Shi, Georgiana Ifrim, Michel Schellekens","submitted_at":"2015-03-23T09:37:33Z","abstract_excerpt":"Smoothed analysis is a framework for analyzing the complexity of an algorithm, acting as a bridge between average and worst-case behaviour. For example, Quicksort and the Simplex algorithm are widely used in practical applications, despite their heavy worst-case complexity. Smoothed complexity aims to better characterize such algorithms. Existing theoretical bounds for the smoothed complexity of sorting algorithms are still quite weak. Furthermore, empirically computing the smoothed complexity via its original definition is computationally infeasible, even for modest input sizes. In this paper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06572","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.06572","created_at":"2026-05-18T02:20:18.362536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.06572v1","created_at":"2026-05-18T02:20:18.362536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06572","created_at":"2026-05-18T02:20:18.362536+00:00"},{"alias_kind":"pith_short_12","alias_value":"2C5WIAZZG3US","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2C5WIAZZG3US2QH4","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2C5WIAZZ","created_at":"2026-05-18T12:28:59.999130+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/2C5WIAZZG3US2QH4QYMW3XFTTZ","json":"https://pith.science/pith/2C5WIAZZG3US2QH4QYMW3XFTTZ.json","graph_json":"https://pith.science/api/pith-number/2C5WIAZZG3US2QH4QYMW3XFTTZ/graph.json","events_json":"https://pith.science/api/pith-number/2C5WIAZZG3US2QH4QYMW3XFTTZ/events.json","paper":"https://pith.science/paper/2C5WIAZZ"},"agent_actions":{"view_html":"https://pith.science/pith/2C5WIAZZG3US2QH4QYMW3XFTTZ","download_json":"https://pith.science/pith/2C5WIAZZG3US2QH4QYMW3XFTTZ.json","view_paper":"https://pith.science/paper/2C5WIAZZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.06572&json=true","fetch_graph":"https://pith.science/api/pith-number/2C5WIAZZG3US2QH4QYMW3XFTTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/2C5WIAZZG3US2QH4QYMW3XFTTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2C5WIAZZG3US2QH4QYMW3XFTTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2C5WIAZZG3US2QH4QYMW3XFTTZ/action/storage_attestation","attest_author":"https://pith.science/pith/2C5WIAZZG3US2QH4QYMW3XFTTZ/action/author_attestation","sign_citation":"https://pith.science/pith/2C5WIAZZG3US2QH4QYMW3XFTTZ/action/citation_signature","submit_replication":"https://pith.science/pith/2C5WIAZZG3US2QH4QYMW3XFTTZ/action/replication_record"}},"created_at":"2026-05-18T02:20:18.362536+00:00","updated_at":"2026-05-18T02:20:18.362536+00:00"}