{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BTCLJFIC5DQRPMOWRBZEU7NZ26","short_pith_number":"pith:BTCLJFIC","schema_version":"1.0","canonical_sha256":"0cc4b49502e8e117b1d688724a7db9d7b951d73deafc762f1e683fa4464612d2","source":{"kind":"arxiv","id":"1711.05667","version":4},"attestation_state":"computed","paper":{"title":"A Friendly Smoothed Analysis of the Simplex Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Dadush, Sophie Huiberts","submitted_at":"2017-11-15T17:04:52Z","abstract_excerpt":"Explaining the excellent practical performance of the simplex method for linear programming has been a major topic of research for over 50 years. One of the most successful frameworks for understanding the simplex method was given by Spielman and Teng (JACM `04), who developed the notion of smoothed analysis. Starting from an arbitrary linear program with $d$ variables and $n$ constraints, Spielman and Teng analyzed the expected runtime over random perturbations of the LP (smoothed LP), where variance $\\sigma^2$ Gaussian noise is added to the LP data. In particular, they gave a two-stage shado"},"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":"1711.05667","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-15T17:04:52Z","cross_cats_sorted":[],"title_canon_sha256":"b39b5975f1e1387c4955221e807aca05916a3c4168e8c8842067ca24f6a09bd4","abstract_canon_sha256":"a569002d56bfdad2374ec10838409c39a0afb7e5fad5f99b3a9655d8c8611c52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:38.469855Z","signature_b64":"4Owfx2rn/f/+QogTszUyrCfdzCIea4gpAxX78OSYph0Lf4nfXywPEajasDPCwI+cajS9LQ6ARqAlFD0wbSjwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cc4b49502e8e117b1d688724a7db9d7b951d73deafc762f1e683fa4464612d2","last_reissued_at":"2026-05-17T23:43:38.469260Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:38.469260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Friendly Smoothed Analysis of the Simplex Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Dadush, Sophie Huiberts","submitted_at":"2017-11-15T17:04:52Z","abstract_excerpt":"Explaining the excellent practical performance of the simplex method for linear programming has been a major topic of research for over 50 years. One of the most successful frameworks for understanding the simplex method was given by Spielman and Teng (JACM `04), who developed the notion of smoothed analysis. Starting from an arbitrary linear program with $d$ variables and $n$ constraints, Spielman and Teng analyzed the expected runtime over random perturbations of the LP (smoothed LP), where variance $\\sigma^2$ Gaussian noise is added to the LP data. In particular, they gave a two-stage shado"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05667","kind":"arxiv","version":4},"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":"1711.05667","created_at":"2026-05-17T23:43:38.469354+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.05667v4","created_at":"2026-05-17T23:43:38.469354+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05667","created_at":"2026-05-17T23:43:38.469354+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTCLJFIC5DQR","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTCLJFIC5DQRPMOW","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTCLJFIC","created_at":"2026-05-18T12:31:08.081275+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/BTCLJFIC5DQRPMOWRBZEU7NZ26","json":"https://pith.science/pith/BTCLJFIC5DQRPMOWRBZEU7NZ26.json","graph_json":"https://pith.science/api/pith-number/BTCLJFIC5DQRPMOWRBZEU7NZ26/graph.json","events_json":"https://pith.science/api/pith-number/BTCLJFIC5DQRPMOWRBZEU7NZ26/events.json","paper":"https://pith.science/paper/BTCLJFIC"},"agent_actions":{"view_html":"https://pith.science/pith/BTCLJFIC5DQRPMOWRBZEU7NZ26","download_json":"https://pith.science/pith/BTCLJFIC5DQRPMOWRBZEU7NZ26.json","view_paper":"https://pith.science/paper/BTCLJFIC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.05667&json=true","fetch_graph":"https://pith.science/api/pith-number/BTCLJFIC5DQRPMOWRBZEU7NZ26/graph.json","fetch_events":"https://pith.science/api/pith-number/BTCLJFIC5DQRPMOWRBZEU7NZ26/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTCLJFIC5DQRPMOWRBZEU7NZ26/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTCLJFIC5DQRPMOWRBZEU7NZ26/action/storage_attestation","attest_author":"https://pith.science/pith/BTCLJFIC5DQRPMOWRBZEU7NZ26/action/author_attestation","sign_citation":"https://pith.science/pith/BTCLJFIC5DQRPMOWRBZEU7NZ26/action/citation_signature","submit_replication":"https://pith.science/pith/BTCLJFIC5DQRPMOWRBZEU7NZ26/action/replication_record"}},"created_at":"2026-05-17T23:43:38.469354+00:00","updated_at":"2026-05-17T23:43:38.469354+00:00"}