{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:H3IDE5OANNDJ5GAQUQBY52AWOY","short_pith_number":"pith:H3IDE5OA","schema_version":"1.0","canonical_sha256":"3ed03275c06b469e9810a4038ee81676017798e8e90118cf614d678f86662413","source":{"kind":"arxiv","id":"1202.1936","version":2},"attestation_state":"computed","paper":{"title":"Smoothed Complexity Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bodo Manthey, Markus Bl\\\"aser","submitted_at":"2012-02-09T10:17:53Z","abstract_excerpt":"Smoothed analysis is a new way of analyzing algorithms introduced by Spielman and Teng (J. ACM, 2004). Classical methods like worst-case or average-case analysis have accompanying complexity classes, like P and AvgP, respectively. While worst-case or average-case analysis give us a means to talk about the running time of a particular algorithm, complexity classes allows us to talk about the inherent difficulty of problems.\n  Smoothed analysis is a hybrid of worst-case and average-case analysis and compensates some of their drawbacks. Despite its success for the analysis of single algorithms an"},"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":"1202.1936","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-02-09T10:17:53Z","cross_cats_sorted":[],"title_canon_sha256":"3ba970a3ce609fb3d0690124713787268e131adbfbcbc824855fc95314483809","abstract_canon_sha256":"aa3ee9d7b369fb71ac24add6e0860a2dd13d2519eec959f405e0be8025cc6843"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:18.006412Z","signature_b64":"u3v2RiQyngTJgbPh1Mv/s0AEiiKtGCKyY03EP7SIocqePMgrwaOiga0lCRQ4v7kE7yuZfKPsMlOV5Z2RCQ/sCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ed03275c06b469e9810a4038ee81676017798e8e90118cf614d678f86662413","last_reissued_at":"2026-05-18T02:21:18.005774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:18.005774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smoothed Complexity Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bodo Manthey, Markus Bl\\\"aser","submitted_at":"2012-02-09T10:17:53Z","abstract_excerpt":"Smoothed analysis is a new way of analyzing algorithms introduced by Spielman and Teng (J. ACM, 2004). Classical methods like worst-case or average-case analysis have accompanying complexity classes, like P and AvgP, respectively. While worst-case or average-case analysis give us a means to talk about the running time of a particular algorithm, complexity classes allows us to talk about the inherent difficulty of problems.\n  Smoothed analysis is a hybrid of worst-case and average-case analysis and compensates some of their drawbacks. Despite its success for the analysis of single algorithms an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1936","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":"1202.1936","created_at":"2026-05-18T02:21:18.005901+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.1936v2","created_at":"2026-05-18T02:21:18.005901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1936","created_at":"2026-05-18T02:21:18.005901+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3IDE5OANNDJ","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3IDE5OANNDJ5GAQ","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3IDE5OA","created_at":"2026-05-18T12:27:06.952714+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/H3IDE5OANNDJ5GAQUQBY52AWOY","json":"https://pith.science/pith/H3IDE5OANNDJ5GAQUQBY52AWOY.json","graph_json":"https://pith.science/api/pith-number/H3IDE5OANNDJ5GAQUQBY52AWOY/graph.json","events_json":"https://pith.science/api/pith-number/H3IDE5OANNDJ5GAQUQBY52AWOY/events.json","paper":"https://pith.science/paper/H3IDE5OA"},"agent_actions":{"view_html":"https://pith.science/pith/H3IDE5OANNDJ5GAQUQBY52AWOY","download_json":"https://pith.science/pith/H3IDE5OANNDJ5GAQUQBY52AWOY.json","view_paper":"https://pith.science/paper/H3IDE5OA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.1936&json=true","fetch_graph":"https://pith.science/api/pith-number/H3IDE5OANNDJ5GAQUQBY52AWOY/graph.json","fetch_events":"https://pith.science/api/pith-number/H3IDE5OANNDJ5GAQUQBY52AWOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3IDE5OANNDJ5GAQUQBY52AWOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3IDE5OANNDJ5GAQUQBY52AWOY/action/storage_attestation","attest_author":"https://pith.science/pith/H3IDE5OANNDJ5GAQUQBY52AWOY/action/author_attestation","sign_citation":"https://pith.science/pith/H3IDE5OANNDJ5GAQUQBY52AWOY/action/citation_signature","submit_replication":"https://pith.science/pith/H3IDE5OANNDJ5GAQUQBY52AWOY/action/replication_record"}},"created_at":"2026-05-18T02:21:18.005901+00:00","updated_at":"2026-05-18T02:21:18.005901+00:00"}