{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7WNA4Q6KQBOZEMM6MITASJWTBD","short_pith_number":"pith:7WNA4Q6K","schema_version":"1.0","canonical_sha256":"fd9a0e43ca805d92319e62260926d308fbd6d5709e39c996ce3ce0e7998fcc34","source":{"kind":"arxiv","id":"1512.05207","version":1},"attestation_state":"computed","paper":{"title":"Computing the Complete Pareto Front","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ruediger Ehlers","submitted_at":"2015-12-16T15:23:16Z","abstract_excerpt":"We give an efficient algorithm to enumerate all elements of a Pareto front in a multi-objective optimization problem in which the space of values is finite for all objectives. Our algorithm uses a feasibility check for a search space element as an oracle and minimizes the number of oracle calls that are necessary to identify the Pareto front of the problem. Given a $k$-dimensional search space in which each dimension has $n$ elements, it needs $p \\cdot (k \\cdot \\lceil \\log_2 n \\rceil + 1) + \\psi(p)$ oracle calls, where $p$ is the size of the Pareto front and $\\psi(p)$ is the number of greatest"},"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":"1512.05207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-16T15:23:16Z","cross_cats_sorted":[],"title_canon_sha256":"13529313e1368f5f329144643f485468527c0bbef9d49eadd385b3ad3ab91bf6","abstract_canon_sha256":"02287565c234ed55794506ca5002c3f2f5d6d395e61806379d75802c9ede9037"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:13.274783Z","signature_b64":"hp0bI5mTPAOySJH2Bd+xAGA4I+mdupLnSltDpMq7bhJ9wKnmaMcINfd9vXx/Rd7eYwu2wMQ9P3qc1NNEbSCEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd9a0e43ca805d92319e62260926d308fbd6d5709e39c996ce3ce0e7998fcc34","last_reissued_at":"2026-05-18T01:24:13.274386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:13.274386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the Complete Pareto Front","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ruediger Ehlers","submitted_at":"2015-12-16T15:23:16Z","abstract_excerpt":"We give an efficient algorithm to enumerate all elements of a Pareto front in a multi-objective optimization problem in which the space of values is finite for all objectives. Our algorithm uses a feasibility check for a search space element as an oracle and minimizes the number of oracle calls that are necessary to identify the Pareto front of the problem. Given a $k$-dimensional search space in which each dimension has $n$ elements, it needs $p \\cdot (k \\cdot \\lceil \\log_2 n \\rceil + 1) + \\psi(p)$ oracle calls, where $p$ is the size of the Pareto front and $\\psi(p)$ is the number of greatest"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05207","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":"1512.05207","created_at":"2026-05-18T01:24:13.274440+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.05207v1","created_at":"2026-05-18T01:24:13.274440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05207","created_at":"2026-05-18T01:24:13.274440+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WNA4Q6KQBOZ","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WNA4Q6KQBOZEMM6","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WNA4Q6K","created_at":"2026-05-18T12:29:10.953037+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/7WNA4Q6KQBOZEMM6MITASJWTBD","json":"https://pith.science/pith/7WNA4Q6KQBOZEMM6MITASJWTBD.json","graph_json":"https://pith.science/api/pith-number/7WNA4Q6KQBOZEMM6MITASJWTBD/graph.json","events_json":"https://pith.science/api/pith-number/7WNA4Q6KQBOZEMM6MITASJWTBD/events.json","paper":"https://pith.science/paper/7WNA4Q6K"},"agent_actions":{"view_html":"https://pith.science/pith/7WNA4Q6KQBOZEMM6MITASJWTBD","download_json":"https://pith.science/pith/7WNA4Q6KQBOZEMM6MITASJWTBD.json","view_paper":"https://pith.science/paper/7WNA4Q6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.05207&json=true","fetch_graph":"https://pith.science/api/pith-number/7WNA4Q6KQBOZEMM6MITASJWTBD/graph.json","fetch_events":"https://pith.science/api/pith-number/7WNA4Q6KQBOZEMM6MITASJWTBD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WNA4Q6KQBOZEMM6MITASJWTBD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WNA4Q6KQBOZEMM6MITASJWTBD/action/storage_attestation","attest_author":"https://pith.science/pith/7WNA4Q6KQBOZEMM6MITASJWTBD/action/author_attestation","sign_citation":"https://pith.science/pith/7WNA4Q6KQBOZEMM6MITASJWTBD/action/citation_signature","submit_replication":"https://pith.science/pith/7WNA4Q6KQBOZEMM6MITASJWTBD/action/replication_record"}},"created_at":"2026-05-18T01:24:13.274440+00:00","updated_at":"2026-05-18T01:24:13.274440+00:00"}