{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RNHEORTL4SCFNAZCF4GI7FNRVS","short_pith_number":"pith:RNHEORTL","canonical_record":{"source":{"id":"1105.2686","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-13T11:04:11Z","cross_cats_sorted":[],"title_canon_sha256":"48120b89279da22aeedf4effb50e5a5b530761fcb2af7904a472ea46c0682a5e","abstract_canon_sha256":"91c86c17a456e27aaeb706a7aeb1f9a60649298556456ebb077c5c66ddf53583"},"schema_version":"1.0"},"canonical_sha256":"8b4e47466be4845683222f0c8f95b1acb80a7971fc46f3f40b8677f6f5cc37dc","source":{"kind":"arxiv","id":"1105.2686","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2686","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2686v2","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2686","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"pith_short_12","alias_value":"RNHEORTL4SCF","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RNHEORTL4SCFNAZC","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RNHEORTL","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RNHEORTL4SCFNAZCF4GI7FNRVS","target":"record","payload":{"canonical_record":{"source":{"id":"1105.2686","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-13T11:04:11Z","cross_cats_sorted":[],"title_canon_sha256":"48120b89279da22aeedf4effb50e5a5b530761fcb2af7904a472ea46c0682a5e","abstract_canon_sha256":"91c86c17a456e27aaeb706a7aeb1f9a60649298556456ebb077c5c66ddf53583"},"schema_version":"1.0"},"canonical_sha256":"8b4e47466be4845683222f0c8f95b1acb80a7971fc46f3f40b8677f6f5cc37dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:10.432736Z","signature_b64":"GwmcgbH0jRyT1SS2+IRPM92bFq2+B5RGrGTattoVYX4/3e/6bLDnvTM0hTxjA8j5it0FrTbTTV0k+rTROuFOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b4e47466be4845683222f0c8f95b1acb80a7971fc46f3f40b8677f6f5cc37dc","last_reissued_at":"2026-05-18T03:27:10.432146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:10.432146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.2686","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-18T03:27:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oxgRQYxLDlmPd3W4RiwdqVM/3IcLz9lOkqYVXCgOCKGRThbH27bzIOznIuC3F5/lblC0y7ADVUwSN54zvCyqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:57:36.572728Z"},"content_sha256":"0aab49e729cbb6c5817d85b6e7d6008ae9abb2130393ce4aeff4bfcab6489193","schema_version":"1.0","event_id":"sha256:0aab49e729cbb6c5817d85b6e7d6008ae9abb2130393ce4aeff4bfcab6489193"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RNHEORTL4SCFNAZCF4GI7FNRVS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Smoothed Performance Guarantees for Local Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cyriel Rutten, Heiko R\\\"oglin, Tjark Vredeveld, Tobias Brunsch","submitted_at":"2011-05-13T11:04:11Z","abstract_excerpt":"We study popular local search and greedy algorithms for scheduling. The performance guarantee of these algorithms is well understood, but the worst-case lower bounds seem somewhat contrived and it is questionable if they arise in practical applications. To find out how robust these bounds are, we study the algorithms in the framework of smoothed analysis, in which instances are subject to some degree of random noise.\n  While the lower bounds for all scheduling variants with restricted machines are rather robust, we find out that the bounds are fragile for unrestricted machines. In particular, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2686","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"},"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-18T03:27:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zimC0eURvA4/Y6iTRfLwp820ZW0dsEnYVxHpUkpq9jWFXrNI2Tgy54YDrO/sQobqH9ANmj8A2qVskhJhll0ZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:57:36.573068Z"},"content_sha256":"e25c064f3dc918711dc94c709b3b8590c9c4a48b1804eb740edb5aa9789859c6","schema_version":"1.0","event_id":"sha256:e25c064f3dc918711dc94c709b3b8590c9c4a48b1804eb740edb5aa9789859c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RNHEORTL4SCFNAZCF4GI7FNRVS/bundle.json","state_url":"https://pith.science/pith/RNHEORTL4SCFNAZCF4GI7FNRVS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RNHEORTL4SCFNAZCF4GI7FNRVS/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-03T18:57:36Z","links":{"resolver":"https://pith.science/pith/RNHEORTL4SCFNAZCF4GI7FNRVS","bundle":"https://pith.science/pith/RNHEORTL4SCFNAZCF4GI7FNRVS/bundle.json","state":"https://pith.science/pith/RNHEORTL4SCFNAZCF4GI7FNRVS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RNHEORTL4SCFNAZCF4GI7FNRVS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RNHEORTL4SCFNAZCF4GI7FNRVS","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":"91c86c17a456e27aaeb706a7aeb1f9a60649298556456ebb077c5c66ddf53583","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-13T11:04:11Z","title_canon_sha256":"48120b89279da22aeedf4effb50e5a5b530761fcb2af7904a472ea46c0682a5e"},"schema_version":"1.0","source":{"id":"1105.2686","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2686","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2686v2","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2686","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"pith_short_12","alias_value":"RNHEORTL4SCF","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RNHEORTL4SCFNAZC","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RNHEORTL","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:e25c064f3dc918711dc94c709b3b8590c9c4a48b1804eb740edb5aa9789859c6","target":"graph","created_at":"2026-05-18T03:27:10Z","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"},"paper":{"abstract_excerpt":"We study popular local search and greedy algorithms for scheduling. The performance guarantee of these algorithms is well understood, but the worst-case lower bounds seem somewhat contrived and it is questionable if they arise in practical applications. To find out how robust these bounds are, we study the algorithms in the framework of smoothed analysis, in which instances are subject to some degree of random noise.\n  While the lower bounds for all scheduling variants with restricted machines are rather robust, we find out that the bounds are fragile for unrestricted machines. In particular, ","authors_text":"Cyriel Rutten, Heiko R\\\"oglin, Tjark Vredeveld, Tobias Brunsch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-13T11:04:11Z","title":"Smoothed Performance Guarantees for Local Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2686","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:0aab49e729cbb6c5817d85b6e7d6008ae9abb2130393ce4aeff4bfcab6489193","target":"record","created_at":"2026-05-18T03:27:10Z","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":"91c86c17a456e27aaeb706a7aeb1f9a60649298556456ebb077c5c66ddf53583","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-13T11:04:11Z","title_canon_sha256":"48120b89279da22aeedf4effb50e5a5b530761fcb2af7904a472ea46c0682a5e"},"schema_version":"1.0","source":{"id":"1105.2686","kind":"arxiv","version":2}},"canonical_sha256":"8b4e47466be4845683222f0c8f95b1acb80a7971fc46f3f40b8677f6f5cc37dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b4e47466be4845683222f0c8f95b1acb80a7971fc46f3f40b8677f6f5cc37dc","first_computed_at":"2026-05-18T03:27:10.432146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:10.432146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GwmcgbH0jRyT1SS2+IRPM92bFq2+B5RGrGTattoVYX4/3e/6bLDnvTM0hTxjA8j5it0FrTbTTV0k+rTROuFOAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:10.432736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.2686","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0aab49e729cbb6c5817d85b6e7d6008ae9abb2130393ce4aeff4bfcab6489193","sha256:e25c064f3dc918711dc94c709b3b8590c9c4a48b1804eb740edb5aa9789859c6"],"state_sha256":"852ebda569532a5efde03ab4dc196b46aa2223bb8b72afb542032405b4ebd4a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oP3TUcRTZlBRFoxXRjp+8pvbx67Qy53fgnoorxA3VZTPT1XqKEEpAs7FuHNx0NwxuwjqH5AUIa9L04lzpPGJCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:57:36.575017Z","bundle_sha256":"63f44532323da81d96a050dc5042c888c869e190b4dea389bef0d5082d3323a6"}}