{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:XUGXAKJ6MLM2O3CGOTMWKQDJBH","short_pith_number":"pith:XUGXAKJ6","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"},"canonical_sha256":"bd0d70293e62d9a76c4674d965406909f97b5799a03e18e7947908589b4f36fe","source":{"kind":"arxiv","id":"1012.1163","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.1163","created_at":"2026-05-18T02:23:15Z"},{"alias_kind":"arxiv_version","alias_value":"1012.1163v1","created_at":"2026-05-18T02:23:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1163","created_at":"2026-05-18T02:23:15Z"},{"alias_kind":"pith_short_12","alias_value":"XUGXAKJ6MLM2","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XUGXAKJ6MLM2O3CG","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XUGXAKJ6","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:XUGXAKJ6MLM2O3CGOTMWKQDJBH","target":"record","payload":{"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"},"canonical_sha256":"bd0d70293e62d9a76c4674d965406909f97b5799a03e18e7947908589b4f36fe","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"},"source_kind":"arxiv","source_id":"1012.1163","source_version":1,"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:23:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YezJvxt+36haEuPn29NwoWOivcDC61nFkISsM/B97OCvvfH2bHJt8N58JvRQDCJY7nnbzOuuw2DpXvauP2NZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T16:46:45.781750Z"},"content_sha256":"a8251cc444f1f728f5dd2eebfa5d4d57dea0d3b1cdb079b2d7a19647bc4af301","schema_version":"1.0","event_id":"sha256:a8251cc444f1f728f5dd2eebfa5d4d57dea0d3b1cdb079b2d7a19647bc4af301"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:XUGXAKJ6MLM2O3CGOTMWKQDJBH","target":"graph","payload":{"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"},"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:23:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j4mMAvkOfq4H6ARkxcfBFEZxWTnEmRRqSxsSrhtI3D/1+CVS/jhDPw6EsZVGwjR8TMHAO6h5rCk5mdR8YcYoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T16:46:45.782077Z"},"content_sha256":"efa1401392c94f49204d9ba351a677b0c17c61319d4ce1d0a97ded4fc9c51cc7","schema_version":"1.0","event_id":"sha256:efa1401392c94f49204d9ba351a677b0c17c61319d4ce1d0a97ded4fc9c51cc7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XUGXAKJ6MLM2O3CGOTMWKQDJBH/bundle.json","state_url":"https://pith.science/pith/XUGXAKJ6MLM2O3CGOTMWKQDJBH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XUGXAKJ6MLM2O3CGOTMWKQDJBH/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-20T16:46:45Z","links":{"resolver":"https://pith.science/pith/XUGXAKJ6MLM2O3CGOTMWKQDJBH","bundle":"https://pith.science/pith/XUGXAKJ6MLM2O3CGOTMWKQDJBH/bundle.json","state":"https://pith.science/pith/XUGXAKJ6MLM2O3CGOTMWKQDJBH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XUGXAKJ6MLM2O3CGOTMWKQDJBH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:XUGXAKJ6MLM2O3CGOTMWKQDJBH","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":"78d3e40d81c452b819bc217af3835d4f88cbd3d2ada2f09a3826c9b337396c92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-06T13:14:36Z","title_canon_sha256":"8b955765e3d285f08f204d29f317abc88862cedb0989e30625716593395149b0"},"schema_version":"1.0","source":{"id":"1012.1163","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.1163","created_at":"2026-05-18T02:23:15Z"},{"alias_kind":"arxiv_version","alias_value":"1012.1163v1","created_at":"2026-05-18T02:23:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1163","created_at":"2026-05-18T02:23:15Z"},{"alias_kind":"pith_short_12","alias_value":"XUGXAKJ6MLM2","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XUGXAKJ6MLM2O3CG","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XUGXAKJ6","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:efa1401392c94f49204d9ba351a677b0c17c61319d4ce1d0a97ded4fc9c51cc7","target":"graph","created_at":"2026-05-18T02:23:15Z","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":"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","authors_text":"Heiko Roeglin, Tobias Brunsch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-06T13:14:36Z","title":"Lower Bounds for the Smoothed Number of Pareto optimal Solutions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1163","kind":"arxiv","version":1},"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:a8251cc444f1f728f5dd2eebfa5d4d57dea0d3b1cdb079b2d7a19647bc4af301","target":"record","created_at":"2026-05-18T02:23:15Z","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":"78d3e40d81c452b819bc217af3835d4f88cbd3d2ada2f09a3826c9b337396c92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-06T13:14:36Z","title_canon_sha256":"8b955765e3d285f08f204d29f317abc88862cedb0989e30625716593395149b0"},"schema_version":"1.0","source":{"id":"1012.1163","kind":"arxiv","version":1}},"canonical_sha256":"bd0d70293e62d9a76c4674d965406909f97b5799a03e18e7947908589b4f36fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd0d70293e62d9a76c4674d965406909f97b5799a03e18e7947908589b4f36fe","first_computed_at":"2026-05-18T02:23:15.441840Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:15.441840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BTe9/xqam0QLmRmZw54iA/B294xycdfr84IeX6ODSeVwr7t2Fr4hTaGkeX8pYo+MQKwp1u3t5O2/lOEe+w4qBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:15.442496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.1163","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8251cc444f1f728f5dd2eebfa5d4d57dea0d3b1cdb079b2d7a19647bc4af301","sha256:efa1401392c94f49204d9ba351a677b0c17c61319d4ce1d0a97ded4fc9c51cc7"],"state_sha256":"4637aef8049ca30d981cef7553ceaa03cacbc85182cb1136d8499b98dc0e6aa7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OunXv+CbXAHEK18eushiyuD65279LnTeH3yteri9JRxVeuEzT8G77cUek/S9traeoMQKrtCnIaOrURsiiMpnAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T16:46:45.783911Z","bundle_sha256":"6d57655976832294a57c19a124380d4b177ddb834eac50799a9763dd813ac5db"}}