{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:XUGXAKJ6MLM2O3CGOTMWKQDJBH","short_pith_number":"pith:XUGXAKJ6","schema_version":"1.0","canonical_sha256":"bd0d70293e62d9a76c4674d965406909f97b5799a03e18e7947908589b4f36fe","source":{"kind":"arxiv","id":"1012.1163","version":1},"attestation_state":"computed","paper":{"title":"Lower Bounds for the Smoothed Number of Pareto optimal Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Heiko Roeglin, Tobias Brunsch","submitted_at":"2010-12-06T13:14:36Z","abstract_excerpt":"In 2009, Roeglin and Teng showed that the smoothed number of Pareto optimal solutions of linear multi-criteria optimization problems is polynomially bounded in the number $n$ of variables and the maximum density $\\phi$ of the semi-random input model for any fixed number of objective functions. Their bound is, however, not very practical because the exponents grow exponentially in the number $d+1$ of objective functions. In a recent breakthrough, Moitra and O'Donnell improved this bound significantly to $O(n^{2d} \\phi^{d(d+1)/2})$.\n  An \"intriguing problem\", which Moitra and O'Donnell formulate"},"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":"1012.1163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-06T13:14:36Z","cross_cats_sorted":[],"title_canon_sha256":"8b955765e3d285f08f204d29f317abc88862cedb0989e30625716593395149b0","abstract_canon_sha256":"78d3e40d81c452b819bc217af3835d4f88cbd3d2ada2f09a3826c9b337396c92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:15.442496Z","signature_b64":"BTe9/xqam0QLmRmZw54iA/B294xycdfr84IeX6ODSeVwr7t2Fr4hTaGkeX8pYo+MQKwp1u3t5O2/lOEe+w4qBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd0d70293e62d9a76c4674d965406909f97b5799a03e18e7947908589b4f36fe","last_reissued_at":"2026-05-18T02:23:15.441840Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:15.441840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for the Smoothed Number of Pareto optimal Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Heiko Roeglin, Tobias Brunsch","submitted_at":"2010-12-06T13:14:36Z","abstract_excerpt":"In 2009, Roeglin and Teng showed that the smoothed number of Pareto optimal solutions of linear multi-criteria optimization problems is polynomially bounded in the number $n$ of variables and the maximum density $\\phi$ of the semi-random input model for any fixed number of objective functions. Their bound is, however, not very practical because the exponents grow exponentially in the number $d+1$ of objective functions. In a recent breakthrough, Moitra and O'Donnell improved this bound significantly to $O(n^{2d} \\phi^{d(d+1)/2})$.\n  An \"intriguing problem\", which Moitra and O'Donnell formulate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1163","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":"1012.1163","created_at":"2026-05-18T02:23:15.441950+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.1163v1","created_at":"2026-05-18T02:23:15.441950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1163","created_at":"2026-05-18T02:23:15.441950+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUGXAKJ6MLM2","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUGXAKJ6MLM2O3CG","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUGXAKJ6","created_at":"2026-05-18T12:26:17.028572+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/XUGXAKJ6MLM2O3CGOTMWKQDJBH","json":"https://pith.science/pith/XUGXAKJ6MLM2O3CGOTMWKQDJBH.json","graph_json":"https://pith.science/api/pith-number/XUGXAKJ6MLM2O3CGOTMWKQDJBH/graph.json","events_json":"https://pith.science/api/pith-number/XUGXAKJ6MLM2O3CGOTMWKQDJBH/events.json","paper":"https://pith.science/paper/XUGXAKJ6"},"agent_actions":{"view_html":"https://pith.science/pith/XUGXAKJ6MLM2O3CGOTMWKQDJBH","download_json":"https://pith.science/pith/XUGXAKJ6MLM2O3CGOTMWKQDJBH.json","view_paper":"https://pith.science/paper/XUGXAKJ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.1163&json=true","fetch_graph":"https://pith.science/api/pith-number/XUGXAKJ6MLM2O3CGOTMWKQDJBH/graph.json","fetch_events":"https://pith.science/api/pith-number/XUGXAKJ6MLM2O3CGOTMWKQDJBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUGXAKJ6MLM2O3CGOTMWKQDJBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUGXAKJ6MLM2O3CGOTMWKQDJBH/action/storage_attestation","attest_author":"https://pith.science/pith/XUGXAKJ6MLM2O3CGOTMWKQDJBH/action/author_attestation","sign_citation":"https://pith.science/pith/XUGXAKJ6MLM2O3CGOTMWKQDJBH/action/citation_signature","submit_replication":"https://pith.science/pith/XUGXAKJ6MLM2O3CGOTMWKQDJBH/action/replication_record"}},"created_at":"2026-05-18T02:23:15.441950+00:00","updated_at":"2026-05-18T02:23:15.441950+00:00"}