{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7WNA4Q6KQBOZEMM6MITASJWTBD","short_pith_number":"pith:7WNA4Q6K","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"},"canonical_sha256":"fd9a0e43ca805d92319e62260926d308fbd6d5709e39c996ce3ce0e7998fcc34","source":{"kind":"arxiv","id":"1512.05207","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05207","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05207v1","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05207","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"pith_short_12","alias_value":"7WNA4Q6KQBOZ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7WNA4Q6KQBOZEMM6","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7WNA4Q6K","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7WNA4Q6KQBOZEMM6MITASJWTBD","target":"record","payload":{"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"},"canonical_sha256":"fd9a0e43ca805d92319e62260926d308fbd6d5709e39c996ce3ce0e7998fcc34","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"},"source_kind":"arxiv","source_id":"1512.05207","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-18T01:24:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uuJu+VtKAOVMhYbTgP9f0Fun9+ZmLREj9BPDUD+Eyh5++mSAkDu/dbxW5DRh3ODOdVAOIBkqiKUsgzWoofDlDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:46:47.589565Z"},"content_sha256":"281cc6927d33654fa3ff69435fad26cd35b12ea3a5091856969eaea0db462398","schema_version":"1.0","event_id":"sha256:281cc6927d33654fa3ff69435fad26cd35b12ea3a5091856969eaea0db462398"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7WNA4Q6KQBOZEMM6MITASJWTBD","target":"graph","payload":{"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"},"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-18T01:24:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X3mgib2Dumm5qpWtrNMgpo1Eua+IDKLVnaC4OiIlMFlqKYaY5pXZuYcKA3yXkFSU/JofdpbMRTaOLrfgutIWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:46:47.589910Z"},"content_sha256":"4d8ad5c6f1078efd885dd5a1ffe3c032b577bc370ef770673d9f69ca34bda3c1","schema_version":"1.0","event_id":"sha256:4d8ad5c6f1078efd885dd5a1ffe3c032b577bc370ef770673d9f69ca34bda3c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WNA4Q6KQBOZEMM6MITASJWTBD/bundle.json","state_url":"https://pith.science/pith/7WNA4Q6KQBOZEMM6MITASJWTBD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WNA4Q6KQBOZEMM6MITASJWTBD/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-05-28T12:46:47Z","links":{"resolver":"https://pith.science/pith/7WNA4Q6KQBOZEMM6MITASJWTBD","bundle":"https://pith.science/pith/7WNA4Q6KQBOZEMM6MITASJWTBD/bundle.json","state":"https://pith.science/pith/7WNA4Q6KQBOZEMM6MITASJWTBD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WNA4Q6KQBOZEMM6MITASJWTBD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7WNA4Q6KQBOZEMM6MITASJWTBD","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":"02287565c234ed55794506ca5002c3f2f5d6d395e61806379d75802c9ede9037","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-16T15:23:16Z","title_canon_sha256":"13529313e1368f5f329144643f485468527c0bbef9d49eadd385b3ad3ab91bf6"},"schema_version":"1.0","source":{"id":"1512.05207","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05207","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05207v1","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05207","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"pith_short_12","alias_value":"7WNA4Q6KQBOZ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7WNA4Q6KQBOZEMM6","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7WNA4Q6K","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:4d8ad5c6f1078efd885dd5a1ffe3c032b577bc370ef770673d9f69ca34bda3c1","target":"graph","created_at":"2026-05-18T01:24:13Z","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":"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","authors_text":"Ruediger Ehlers","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-16T15:23:16Z","title":"Computing the Complete Pareto Front"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05207","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:281cc6927d33654fa3ff69435fad26cd35b12ea3a5091856969eaea0db462398","target":"record","created_at":"2026-05-18T01:24:13Z","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":"02287565c234ed55794506ca5002c3f2f5d6d395e61806379d75802c9ede9037","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-16T15:23:16Z","title_canon_sha256":"13529313e1368f5f329144643f485468527c0bbef9d49eadd385b3ad3ab91bf6"},"schema_version":"1.0","source":{"id":"1512.05207","kind":"arxiv","version":1}},"canonical_sha256":"fd9a0e43ca805d92319e62260926d308fbd6d5709e39c996ce3ce0e7998fcc34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd9a0e43ca805d92319e62260926d308fbd6d5709e39c996ce3ce0e7998fcc34","first_computed_at":"2026-05-18T01:24:13.274386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:13.274386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hp0bI5mTPAOySJH2Bd+xAGA4I+mdupLnSltDpMq7bhJ9wKnmaMcINfd9vXx/Rd7eYwu2wMQ9P3qc1NNEbSCEAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:13.274783Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.05207","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:281cc6927d33654fa3ff69435fad26cd35b12ea3a5091856969eaea0db462398","sha256:4d8ad5c6f1078efd885dd5a1ffe3c032b577bc370ef770673d9f69ca34bda3c1"],"state_sha256":"3d0fb0eaacb0ffa9e98b0bfaa3840a20cd73158ddc28ab2b97ca68fad97551f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NcUdZizkZuBR5f0ZmbPoa4acYwjUe6JPj6fi+ecZgEqbolrLhROb4vxt3HD/HtLZhQ7J4Qv69g5rJdXNM0auDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:46:47.591829Z","bundle_sha256":"a85efa7f20ac436bac35f03f37b3c823bb8e7f6162d06f52e054683330713370"}}