{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BDYBJHNK5JJAD56PG333Z4CHWA","short_pith_number":"pith:BDYBJHNK","schema_version":"1.0","canonical_sha256":"08f0149daaea5201f7cf36f7bcf047b009efa047a174b1ef5f9154352ee8182f","source":{"kind":"arxiv","id":"2504.04197","version":2},"attestation_state":"computed","paper":{"title":"Optimal Smoothed Analysis of the Simplex Method","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eleon Bach, Sophie Huiberts","submitted_at":"2025-04-05T15:05:52Z","abstract_excerpt":"Smoothed analysis is a method for analyzing the performance of algorithms, used especially for those algorithms whose running time in practice is significantly better than what can be proven through worst-case analysis. Spielman and Teng (STOC '01) introduced the smoothed analysis framework of algorithm analysis and applied it to the simplex method. Given an arbitrary linear program with $d$ variables and $n$ inequality constraints, Spielman and Teng proved that the simplex method runs in time $O(\\sigma^{-30} d^{55} n^{86})$, where $\\sigma > 0$ is the standard deviation of Gaussian distributed"},"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":"2504.04197","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-05T15:05:52Z","cross_cats_sorted":[],"title_canon_sha256":"5ac05bae41cbda16b578b31c39e49676697cb2406345d77d8f16489c98a41cda","abstract_canon_sha256":"9068cd457cfe9383a193282cbadb98d21a994dd75dd29c75d6c0e09ae923c99f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:11.934121Z","signature_b64":"B2xJRBYsfRYWKcs+P9TUeYvDMHEYwj0y9esDqr+lU7ExOzy5E1G5p1wWrMnuxweVs2U/oK2Rw6s03kMB1cJZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08f0149daaea5201f7cf36f7bcf047b009efa047a174b1ef5f9154352ee8182f","last_reissued_at":"2026-05-26T01:03:11.933306Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:11.933306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Smoothed Analysis of the Simplex Method","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eleon Bach, Sophie Huiberts","submitted_at":"2025-04-05T15:05:52Z","abstract_excerpt":"Smoothed analysis is a method for analyzing the performance of algorithms, used especially for those algorithms whose running time in practice is significantly better than what can be proven through worst-case analysis. Spielman and Teng (STOC '01) introduced the smoothed analysis framework of algorithm analysis and applied it to the simplex method. Given an arbitrary linear program with $d$ variables and $n$ inequality constraints, Spielman and Teng proved that the simplex method runs in time $O(\\sigma^{-30} d^{55} n^{86})$, where $\\sigma > 0$ is the standard deviation of Gaussian distributed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.04197","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.04197/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2504.04197","created_at":"2026-05-26T01:03:11.933420+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.04197v2","created_at":"2026-05-26T01:03:11.933420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.04197","created_at":"2026-05-26T01:03:11.933420+00:00"},{"alias_kind":"pith_short_12","alias_value":"BDYBJHNK5JJA","created_at":"2026-05-26T01:03:11.933420+00:00"},{"alias_kind":"pith_short_16","alias_value":"BDYBJHNK5JJAD56P","created_at":"2026-05-26T01:03:11.933420+00:00"},{"alias_kind":"pith_short_8","alias_value":"BDYBJHNK","created_at":"2026-05-26T01:03:11.933420+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/BDYBJHNK5JJAD56PG333Z4CHWA","json":"https://pith.science/pith/BDYBJHNK5JJAD56PG333Z4CHWA.json","graph_json":"https://pith.science/api/pith-number/BDYBJHNK5JJAD56PG333Z4CHWA/graph.json","events_json":"https://pith.science/api/pith-number/BDYBJHNK5JJAD56PG333Z4CHWA/events.json","paper":"https://pith.science/paper/BDYBJHNK"},"agent_actions":{"view_html":"https://pith.science/pith/BDYBJHNK5JJAD56PG333Z4CHWA","download_json":"https://pith.science/pith/BDYBJHNK5JJAD56PG333Z4CHWA.json","view_paper":"https://pith.science/paper/BDYBJHNK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.04197&json=true","fetch_graph":"https://pith.science/api/pith-number/BDYBJHNK5JJAD56PG333Z4CHWA/graph.json","fetch_events":"https://pith.science/api/pith-number/BDYBJHNK5JJAD56PG333Z4CHWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BDYBJHNK5JJAD56PG333Z4CHWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BDYBJHNK5JJAD56PG333Z4CHWA/action/storage_attestation","attest_author":"https://pith.science/pith/BDYBJHNK5JJAD56PG333Z4CHWA/action/author_attestation","sign_citation":"https://pith.science/pith/BDYBJHNK5JJAD56PG333Z4CHWA/action/citation_signature","submit_replication":"https://pith.science/pith/BDYBJHNK5JJAD56PG333Z4CHWA/action/replication_record"}},"created_at":"2026-05-26T01:03:11.933420+00:00","updated_at":"2026-05-26T01:03:11.933420+00:00"}