{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZRRQBNESOX4MQQPLRVIYI6BRKE","short_pith_number":"pith:ZRRQBNES","schema_version":"1.0","canonical_sha256":"cc6300b49275f8c841eb8d5184783151186c131fe2ffd30188c9d32ffe28d343","source":{"kind":"arxiv","id":"1111.1546","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1111.1546","created_at":"2026-05-18T02:29:23.800015+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.1546v2","created_at":"2026-05-18T02:29:23.800015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1546","created_at":"2026-05-18T02:29:23.800015+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZRRQBNESOX4M","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZRRQBNESOX4MQQPL","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZRRQBNES","created_at":"2026-05-18T12:26:50.516681+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/ZRRQBNESOX4MQQPLRVIYI6BRKE","json":"https://pith.science/pith/ZRRQBNESOX4MQQPLRVIYI6BRKE.json","graph_json":"https://pith.science/api/pith-number/ZRRQBNESOX4MQQPLRVIYI6BRKE/graph.json","events_json":"https://pith.science/api/pith-number/ZRRQBNESOX4MQQPLRVIYI6BRKE/events.json","paper":"https://pith.science/paper/ZRRQBNES"},"agent_actions":{"view_html":"https://pith.science/pith/ZRRQBNESOX4MQQPLRVIYI6BRKE","download_json":"https://pith.science/pith/ZRRQBNESOX4MQQPLRVIYI6BRKE.json","view_paper":"https://pith.science/paper/ZRRQBNES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.1546&json=true","fetch_graph":"https://pith.science/api/pith-number/ZRRQBNESOX4MQQPLRVIYI6BRKE/graph.json","fetch_events":"https://pith.science/api/pith-number/ZRRQBNESOX4MQQPLRVIYI6BRKE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZRRQBNESOX4MQQPLRVIYI6BRKE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZRRQBNESOX4MQQPLRVIYI6BRKE/action/storage_attestation","attest_author":"https://pith.science/pith/ZRRQBNESOX4MQQPLRVIYI6BRKE/action/author_attestation","sign_citation":"https://pith.science/pith/ZRRQBNESOX4MQQPLRVIYI6BRKE/action/citation_signature","submit_replication":"https://pith.science/pith/ZRRQBNESOX4MQQPLRVIYI6BRKE/action/replication_record"}},"created_at":"2026-05-18T02:29:23.800015+00:00","updated_at":"2026-05-18T02:29:23.800015+00:00"}