{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:BDYBJHNK5JJAD56PG333Z4CHWA","short_pith_number":"pith:BDYBJHNK","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"},"canonical_sha256":"08f0149daaea5201f7cf36f7bcf047b009efa047a174b1ef5f9154352ee8182f","source":{"kind":"arxiv","id":"2504.04197","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.04197","created_at":"2026-05-26T01:03:11Z"},{"alias_kind":"arxiv_version","alias_value":"2504.04197v2","created_at":"2026-05-26T01:03:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.04197","created_at":"2026-05-26T01:03:11Z"},{"alias_kind":"pith_short_12","alias_value":"BDYBJHNK5JJA","created_at":"2026-05-26T01:03:11Z"},{"alias_kind":"pith_short_16","alias_value":"BDYBJHNK5JJAD56P","created_at":"2026-05-26T01:03:11Z"},{"alias_kind":"pith_short_8","alias_value":"BDYBJHNK","created_at":"2026-05-26T01:03:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:BDYBJHNK5JJAD56PG333Z4CHWA","target":"record","payload":{"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"},"canonical_sha256":"08f0149daaea5201f7cf36f7bcf047b009efa047a174b1ef5f9154352ee8182f","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"},"source_kind":"arxiv","source_id":"2504.04197","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-26T01:03:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qelhwRfII9+II2gDKBOlb/CQryCT7SbmoOuksRr7fmI6utoj3aUQPopvBgipA5lR8maEAFwidhCYmkWaR7RzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T00:05:34.069917Z"},"content_sha256":"3fd98b70406b69291aa3fff16980812bdb5fab5fc8076ebb7b93e256920b2425","schema_version":"1.0","event_id":"sha256:3fd98b70406b69291aa3fff16980812bdb5fab5fc8076ebb7b93e256920b2425"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:BDYBJHNK5JJAD56PG333Z4CHWA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-26T01:03:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DZuNJLti1PBNWWLfDuDRNaHlBryBaRVGiyuhLmYFq928LXa+ZohDFswYN2RpLECCJDELxvby+/+iisWlo2AVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T00:05:34.070365Z"},"content_sha256":"80bf0d2caac53d8d7fc9dc610bd84df34d96df60fd94a80f1720999e79805cab","schema_version":"1.0","event_id":"sha256:80bf0d2caac53d8d7fc9dc610bd84df34d96df60fd94a80f1720999e79805cab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BDYBJHNK5JJAD56PG333Z4CHWA/bundle.json","state_url":"https://pith.science/pith/BDYBJHNK5JJAD56PG333Z4CHWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BDYBJHNK5JJAD56PG333Z4CHWA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-30T00:05:34Z","links":{"resolver":"https://pith.science/pith/BDYBJHNK5JJAD56PG333Z4CHWA","bundle":"https://pith.science/pith/BDYBJHNK5JJAD56PG333Z4CHWA/bundle.json","state":"https://pith.science/pith/BDYBJHNK5JJAD56PG333Z4CHWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BDYBJHNK5JJAD56PG333Z4CHWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BDYBJHNK5JJAD56PG333Z4CHWA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9068cd457cfe9383a193282cbadb98d21a994dd75dd29c75d6c0e09ae923c99f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-05T15:05:52Z","title_canon_sha256":"5ac05bae41cbda16b578b31c39e49676697cb2406345d77d8f16489c98a41cda"},"schema_version":"1.0","source":{"id":"2504.04197","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.04197","created_at":"2026-05-26T01:03:11Z"},{"alias_kind":"arxiv_version","alias_value":"2504.04197v2","created_at":"2026-05-26T01:03:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.04197","created_at":"2026-05-26T01:03:11Z"},{"alias_kind":"pith_short_12","alias_value":"BDYBJHNK5JJA","created_at":"2026-05-26T01:03:11Z"},{"alias_kind":"pith_short_16","alias_value":"BDYBJHNK5JJAD56P","created_at":"2026-05-26T01:03:11Z"},{"alias_kind":"pith_short_8","alias_value":"BDYBJHNK","created_at":"2026-05-26T01:03:11Z"}],"graph_snapshots":[{"event_id":"sha256:80bf0d2caac53d8d7fc9dc610bd84df34d96df60fd94a80f1720999e79805cab","target":"graph","created_at":"2026-05-26T01:03:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.04197/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Eleon Bach, Sophie Huiberts","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-05T15:05:52Z","title":"Optimal Smoothed Analysis of the Simplex Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.04197","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3fd98b70406b69291aa3fff16980812bdb5fab5fc8076ebb7b93e256920b2425","target":"record","created_at":"2026-05-26T01:03:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9068cd457cfe9383a193282cbadb98d21a994dd75dd29c75d6c0e09ae923c99f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-05T15:05:52Z","title_canon_sha256":"5ac05bae41cbda16b578b31c39e49676697cb2406345d77d8f16489c98a41cda"},"schema_version":"1.0","source":{"id":"2504.04197","kind":"arxiv","version":2}},"canonical_sha256":"08f0149daaea5201f7cf36f7bcf047b009efa047a174b1ef5f9154352ee8182f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08f0149daaea5201f7cf36f7bcf047b009efa047a174b1ef5f9154352ee8182f","first_computed_at":"2026-05-26T01:03:11.933306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:03:11.933306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B2xJRBYsfRYWKcs+P9TUeYvDMHEYwj0y9esDqr+lU7ExOzy5E1G5p1wWrMnuxweVs2U/oK2Rw6s03kMB1cJZCw==","signature_status":"signed_v1","signed_at":"2026-05-26T01:03:11.934121Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.04197","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fd98b70406b69291aa3fff16980812bdb5fab5fc8076ebb7b93e256920b2425","sha256:80bf0d2caac53d8d7fc9dc610bd84df34d96df60fd94a80f1720999e79805cab"],"state_sha256":"6e46553b11e9d34076433fc9bf2fda776e28235855466bc51c87e50afe08638e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gzvI8x7s+cerl+BMLZgqe/KFXmt15MNsEKXzGjhabYAXlPIROLC4A/WoYweuegT3+WSxo8CAXyEwpvrWiLQmCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T00:05:34.072351Z","bundle_sha256":"dc419b4371f9d6167e8f782b8698219f9bf80b998999c08d4d201427880d7ac8"}}