{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:AO4QFRX2WMK3CSR4N4KIPBPM32","short_pith_number":"pith:AO4QFRX2","schema_version":"1.0","canonical_sha256":"03b902c6fab315b14a3c6f148785ecde9c45a289778fefc53447ebcefdc3fcd6","source":{"kind":"arxiv","id":"1107.3876","version":1},"attestation_state":"computed","paper":{"title":"Lower Bounds for the Average and Smoothed Number of Pareto Optima","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Luis Rademacher, Navin Goyal","submitted_at":"2011-07-20T02:13:01Z","abstract_excerpt":"Smoothed analysis of multiobjective 0-1 linear optimization has drawn considerable attention recently. The number of Pareto-optimal solutions (i.e., solutions with the property that no other solution is at least as good in all the coordinates and better in at least one) for multiobjective optimization problems is the central object of study. In this paper, we prove several lower bounds for the expected number of Pareto optima. Our basic result is a lower bound of \\Omega_d(n^(d-1)) for optimization problems with d objectives and n variables under fairly general conditions on the distributions o"},"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":"1107.3876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-20T02:13:01Z","cross_cats_sorted":[],"title_canon_sha256":"2d1ee31ceafd826395ef54ee66f7ee48d245c78759f0b38f5eacf4ce21eaac0d","abstract_canon_sha256":"fec4a916b6d19be8ba13d3f331705f5aba574d15a0c0b61406dce61894aafaad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:14.496356Z","signature_b64":"FKPA22vh/2hqflmepF69UFB3KVSfjYC1qzuTVGHMd0F/0tEzekpwuP0fIbobk4dvh9wfSv4jAroVWIYTvWMmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03b902c6fab315b14a3c6f148785ecde9c45a289778fefc53447ebcefdc3fcd6","last_reissued_at":"2026-05-18T04:17:14.495830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:14.495830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for the Average and Smoothed Number of Pareto Optima","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Luis Rademacher, Navin Goyal","submitted_at":"2011-07-20T02:13:01Z","abstract_excerpt":"Smoothed analysis of multiobjective 0-1 linear optimization has drawn considerable attention recently. The number of Pareto-optimal solutions (i.e., solutions with the property that no other solution is at least as good in all the coordinates and better in at least one) for multiobjective optimization problems is the central object of study. In this paper, we prove several lower bounds for the expected number of Pareto optima. Our basic result is a lower bound of \\Omega_d(n^(d-1)) for optimization problems with d objectives and n variables under fairly general conditions on the distributions o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3876","kind":"arxiv","version":1},"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":"1107.3876","created_at":"2026-05-18T04:17:14.495900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.3876v1","created_at":"2026-05-18T04:17:14.495900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3876","created_at":"2026-05-18T04:17:14.495900+00:00"},{"alias_kind":"pith_short_12","alias_value":"AO4QFRX2WMK3","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"AO4QFRX2WMK3CSR4","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"AO4QFRX2","created_at":"2026-05-18T12:26:24.575870+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/AO4QFRX2WMK3CSR4N4KIPBPM32","json":"https://pith.science/pith/AO4QFRX2WMK3CSR4N4KIPBPM32.json","graph_json":"https://pith.science/api/pith-number/AO4QFRX2WMK3CSR4N4KIPBPM32/graph.json","events_json":"https://pith.science/api/pith-number/AO4QFRX2WMK3CSR4N4KIPBPM32/events.json","paper":"https://pith.science/paper/AO4QFRX2"},"agent_actions":{"view_html":"https://pith.science/pith/AO4QFRX2WMK3CSR4N4KIPBPM32","download_json":"https://pith.science/pith/AO4QFRX2WMK3CSR4N4KIPBPM32.json","view_paper":"https://pith.science/paper/AO4QFRX2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.3876&json=true","fetch_graph":"https://pith.science/api/pith-number/AO4QFRX2WMK3CSR4N4KIPBPM32/graph.json","fetch_events":"https://pith.science/api/pith-number/AO4QFRX2WMK3CSR4N4KIPBPM32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AO4QFRX2WMK3CSR4N4KIPBPM32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AO4QFRX2WMK3CSR4N4KIPBPM32/action/storage_attestation","attest_author":"https://pith.science/pith/AO4QFRX2WMK3CSR4N4KIPBPM32/action/author_attestation","sign_citation":"https://pith.science/pith/AO4QFRX2WMK3CSR4N4KIPBPM32/action/citation_signature","submit_replication":"https://pith.science/pith/AO4QFRX2WMK3CSR4N4KIPBPM32/action/replication_record"}},"created_at":"2026-05-18T04:17:14.495900+00:00","updated_at":"2026-05-18T04:17:14.495900+00:00"}