{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZRRQBNESOX4MQQPLRVIYI6BRKE","short_pith_number":"pith:ZRRQBNES","canonical_record":{"source":{"id":"1111.1546","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T11:28:33Z","cross_cats_sorted":[],"title_canon_sha256":"208f512fe2e248ac082608f399271ebf406d430cc86852644da0f74a2b2d66f2","abstract_canon_sha256":"3ed6d019ce8292d17cd7858255caf3c146da04f3ab462cbedbdb667019d70930"},"schema_version":"1.0"},"canonical_sha256":"cc6300b49275f8c841eb8d5184783151186c131fe2ffd30188c9d32ffe28d343","source":{"kind":"arxiv","id":"1111.1546","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1546","created_at":"2026-05-18T02:29:23Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1546v2","created_at":"2026-05-18T02:29:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1546","created_at":"2026-05-18T02:29:23Z"},{"alias_kind":"pith_short_12","alias_value":"ZRRQBNESOX4M","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZRRQBNESOX4MQQPL","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZRRQBNES","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZRRQBNESOX4MQQPLRVIYI6BRKE","target":"record","payload":{"canonical_record":{"source":{"id":"1111.1546","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T11:28:33Z","cross_cats_sorted":[],"title_canon_sha256":"208f512fe2e248ac082608f399271ebf406d430cc86852644da0f74a2b2d66f2","abstract_canon_sha256":"3ed6d019ce8292d17cd7858255caf3c146da04f3ab462cbedbdb667019d70930"},"schema_version":"1.0"},"canonical_sha256":"cc6300b49275f8c841eb8d5184783151186c131fe2ffd30188c9d32ffe28d343","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:23.800400Z","signature_b64":"ISC1JPwxWpErQi+v/VlJBg7E5GimwhgSUrI+jQzACgfNCfimTdynCUOjeNtfOtuQw5esCxcO8cGdfBaZ/u8SAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc6300b49275f8c841eb8d5184783151186c131fe2ffd30188c9d32ffe28d343","last_reissued_at":"2026-05-18T02:29:23.799946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:23.799946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.1546","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-18T02:29:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BE7oq5u0DEDXuwKKs0roQhGjcSVZ46CquiqShia9m1hP2j+ZzbkIykZ5zR1i9XyQxl1Vm3li8/TVYWB3JrAfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:58:51.620774Z"},"content_sha256":"576f9609f073a7cf77ff9e1f05e3d025468b3b00d6284819235b4048215d3fab","schema_version":"1.0","event_id":"sha256:576f9609f073a7cf77ff9e1f05e3d025468b3b00d6284819235b4048215d3fab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZRRQBNESOX4MQQPLRVIYI6BRKE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Smoothed Analysis of Multiobjective Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Heiko R\\\"oglin, Tobias Brunsch","submitted_at":"2011-11-07T11:28:33Z","abstract_excerpt":"We present several new results about smoothed analysis of multiobjective optimization problems. Motivated by the discrepancy between worst-case analysis and practical experience, this line of research has gained a lot of attention in the last decade. We consider problems in which d linear and one arbitrary objective function are to be optimized over a subset S of {0,1}^n of feasible solutions. We improve the previously best known bound for the smoothed number of Pareto-optimal solutions to O(n^{2d} phi^d), where phi denotes the perturbation parameter. Additionally, we show that for any constan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1546","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-18T02:29:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CBsYQIwWFdlIeE4oOBis9GWvr3aBXbf8Jz3+fz7pXq6WOb34iap9SoJHRhYFn+fazoNb1QZyTwfLWYHevVnLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:58:51.621113Z"},"content_sha256":"1488215f4bc1aa5f61f6ce777b8025036fe765791d19429b441d4cc10c54cb17","schema_version":"1.0","event_id":"sha256:1488215f4bc1aa5f61f6ce777b8025036fe765791d19429b441d4cc10c54cb17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZRRQBNESOX4MQQPLRVIYI6BRKE/bundle.json","state_url":"https://pith.science/pith/ZRRQBNESOX4MQQPLRVIYI6BRKE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZRRQBNESOX4MQQPLRVIYI6BRKE/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-04T03:58:51Z","links":{"resolver":"https://pith.science/pith/ZRRQBNESOX4MQQPLRVIYI6BRKE","bundle":"https://pith.science/pith/ZRRQBNESOX4MQQPLRVIYI6BRKE/bundle.json","state":"https://pith.science/pith/ZRRQBNESOX4MQQPLRVIYI6BRKE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZRRQBNESOX4MQQPLRVIYI6BRKE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZRRQBNESOX4MQQPLRVIYI6BRKE","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":"3ed6d019ce8292d17cd7858255caf3c146da04f3ab462cbedbdb667019d70930","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T11:28:33Z","title_canon_sha256":"208f512fe2e248ac082608f399271ebf406d430cc86852644da0f74a2b2d66f2"},"schema_version":"1.0","source":{"id":"1111.1546","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1546","created_at":"2026-05-18T02:29:23Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1546v2","created_at":"2026-05-18T02:29:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1546","created_at":"2026-05-18T02:29:23Z"},{"alias_kind":"pith_short_12","alias_value":"ZRRQBNESOX4M","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZRRQBNESOX4MQQPL","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZRRQBNES","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:1488215f4bc1aa5f61f6ce777b8025036fe765791d19429b441d4cc10c54cb17","target":"graph","created_at":"2026-05-18T02:29:23Z","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 present several new results about smoothed analysis of multiobjective optimization problems. Motivated by the discrepancy between worst-case analysis and practical experience, this line of research has gained a lot of attention in the last decade. We consider problems in which d linear and one arbitrary objective function are to be optimized over a subset S of {0,1}^n of feasible solutions. We improve the previously best known bound for the smoothed number of Pareto-optimal solutions to O(n^{2d} phi^d), where phi denotes the perturbation parameter. Additionally, we show that for any constan","authors_text":"Heiko R\\\"oglin, Tobias Brunsch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T11:28:33Z","title":"Improved Smoothed Analysis of Multiobjective Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1546","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:576f9609f073a7cf77ff9e1f05e3d025468b3b00d6284819235b4048215d3fab","target":"record","created_at":"2026-05-18T02:29:23Z","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":"3ed6d019ce8292d17cd7858255caf3c146da04f3ab462cbedbdb667019d70930","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T11:28:33Z","title_canon_sha256":"208f512fe2e248ac082608f399271ebf406d430cc86852644da0f74a2b2d66f2"},"schema_version":"1.0","source":{"id":"1111.1546","kind":"arxiv","version":2}},"canonical_sha256":"cc6300b49275f8c841eb8d5184783151186c131fe2ffd30188c9d32ffe28d343","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc6300b49275f8c841eb8d5184783151186c131fe2ffd30188c9d32ffe28d343","first_computed_at":"2026-05-18T02:29:23.799946Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:23.799946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ISC1JPwxWpErQi+v/VlJBg7E5GimwhgSUrI+jQzACgfNCfimTdynCUOjeNtfOtuQw5esCxcO8cGdfBaZ/u8SAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:23.800400Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.1546","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:576f9609f073a7cf77ff9e1f05e3d025468b3b00d6284819235b4048215d3fab","sha256:1488215f4bc1aa5f61f6ce777b8025036fe765791d19429b441d4cc10c54cb17"],"state_sha256":"3ddadd704b8d92178e4ad71e7381319999b09174b135869b5bd8bd3db9abf5a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EDFNXBZW/eLfh7p06tDDm/JxE+3p1mJz4mT7NJ0Z+3XvwrKODdj5CJkNSSi1yeXnGCeZwYlgOAzLK9wGOMdoDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:58:51.623038Z","bundle_sha256":"098114a38ce792eaa2407b21b81b43b4d93515d24abaed0fe7a7435fbc8060c2"}}