{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XDX7EGIXVK3H54MUZ4SPQHDBFP","short_pith_number":"pith:XDX7EGIX","canonical_record":{"source":{"id":"1704.08417","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-27T03:04:36Z","cross_cats_sorted":[],"title_canon_sha256":"40200a10ba073405b3104c8d2cbd8df49fe53304740fa5ad2bc5df73ee6b5d3c","abstract_canon_sha256":"15751887b7fb5bf7fb072b54e8ca9ef0cd7530f52b3282c0aa8fd37dd87021f0"},"schema_version":"1.0"},"canonical_sha256":"b8eff21917aab67ef194cf24f81c612bce699b74496ae831f76c53b96b749427","source":{"kind":"arxiv","id":"1704.08417","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08417","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08417v2","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08417","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"pith_short_12","alias_value":"XDX7EGIXVK3H","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XDX7EGIXVK3H54MU","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XDX7EGIX","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XDX7EGIXVK3H54MUZ4SPQHDBFP","target":"record","payload":{"canonical_record":{"source":{"id":"1704.08417","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-27T03:04:36Z","cross_cats_sorted":[],"title_canon_sha256":"40200a10ba073405b3104c8d2cbd8df49fe53304740fa5ad2bc5df73ee6b5d3c","abstract_canon_sha256":"15751887b7fb5bf7fb072b54e8ca9ef0cd7530f52b3282c0aa8fd37dd87021f0"},"schema_version":"1.0"},"canonical_sha256":"b8eff21917aab67ef194cf24f81c612bce699b74496ae831f76c53b96b749427","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:51.679727Z","signature_b64":"bvkOn89eaNwMU80waecuhlHSESoRxvYMrS4xBiYqb7EdJ1mFhz6b3Bu36kSGG1ejPW13KCjAF6slxH1hIZuAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8eff21917aab67ef194cf24f81c612bce699b74496ae831f76c53b96b749427","last_reissued_at":"2026-05-18T00:29:51.678992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:51.678992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.08417","source_version":2,"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-18T00:29:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nWCCpmLf3JAw7TTJ75+id2CfISL/D2wclJUunVR6zr47TPyJcOOxI+fh6d+akZO0nZGlI75t+wkHvIurNma5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:21:27.595838Z"},"content_sha256":"1029918a95061409f26cc7d649a9f67b4dc4c451264f10070139e0e23ae672e6","schema_version":"1.0","event_id":"sha256:1029918a95061409f26cc7d649a9f67b4dc4c451264f10070139e0e23ae672e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XDX7EGIXVK3H54MUZ4SPQHDBFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Projection Partitioning for parallel multi-objective integer optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Melih Ozlen, William Pettersson","submitted_at":"2017-04-27T03:04:36Z","abstract_excerpt":"This paper introduces a new method of partitioning the solution space of a multi-objective optimisation problem for parallel processing, called Efficient Projection Partitioning. This method projects solutions down into a single dimension, greatly reducing the cost of partitioning the search space. We test EPP on a variety of randomly generated multi-objective combinatorial optimisation problems. The results are compared with the state of the art in parallel partitioning, and we show that in all scenarios tested, our new algorithm performs significantly better. Our proposed method allows the g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08417","kind":"arxiv","version":2},"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-18T00:29:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZF7FPnyqTe5WGgYPdQe5k2rXw86x+03ypOPjaYF9YC6bTFs1d/B/MfigVtPXelTgFARdemdilwDH8eEQyqUsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:21:27.596195Z"},"content_sha256":"d2407a42a2e42ab086d02ef925c20ff77f16cb3093db229d6ec4ca460991fe9d","schema_version":"1.0","event_id":"sha256:d2407a42a2e42ab086d02ef925c20ff77f16cb3093db229d6ec4ca460991fe9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDX7EGIXVK3H54MUZ4SPQHDBFP/bundle.json","state_url":"https://pith.science/pith/XDX7EGIXVK3H54MUZ4SPQHDBFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDX7EGIXVK3H54MUZ4SPQHDBFP/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-24T21:21:27Z","links":{"resolver":"https://pith.science/pith/XDX7EGIXVK3H54MUZ4SPQHDBFP","bundle":"https://pith.science/pith/XDX7EGIXVK3H54MUZ4SPQHDBFP/bundle.json","state":"https://pith.science/pith/XDX7EGIXVK3H54MUZ4SPQHDBFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDX7EGIXVK3H54MUZ4SPQHDBFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XDX7EGIXVK3H54MUZ4SPQHDBFP","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":"15751887b7fb5bf7fb072b54e8ca9ef0cd7530f52b3282c0aa8fd37dd87021f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-27T03:04:36Z","title_canon_sha256":"40200a10ba073405b3104c8d2cbd8df49fe53304740fa5ad2bc5df73ee6b5d3c"},"schema_version":"1.0","source":{"id":"1704.08417","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08417","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08417v2","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08417","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"pith_short_12","alias_value":"XDX7EGIXVK3H","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XDX7EGIXVK3H54MU","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XDX7EGIX","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:d2407a42a2e42ab086d02ef925c20ff77f16cb3093db229d6ec4ca460991fe9d","target":"graph","created_at":"2026-05-18T00:29:51Z","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":"This paper introduces a new method of partitioning the solution space of a multi-objective optimisation problem for parallel processing, called Efficient Projection Partitioning. This method projects solutions down into a single dimension, greatly reducing the cost of partitioning the search space. We test EPP on a variety of randomly generated multi-objective combinatorial optimisation problems. The results are compared with the state of the art in parallel partitioning, and we show that in all scenarios tested, our new algorithm performs significantly better. Our proposed method allows the g","authors_text":"Melih Ozlen, William Pettersson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-27T03:04:36Z","title":"Efficient Projection Partitioning for parallel multi-objective integer optimisation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08417","kind":"arxiv","version":2},"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:1029918a95061409f26cc7d649a9f67b4dc4c451264f10070139e0e23ae672e6","target":"record","created_at":"2026-05-18T00:29:51Z","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":"15751887b7fb5bf7fb072b54e8ca9ef0cd7530f52b3282c0aa8fd37dd87021f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-27T03:04:36Z","title_canon_sha256":"40200a10ba073405b3104c8d2cbd8df49fe53304740fa5ad2bc5df73ee6b5d3c"},"schema_version":"1.0","source":{"id":"1704.08417","kind":"arxiv","version":2}},"canonical_sha256":"b8eff21917aab67ef194cf24f81c612bce699b74496ae831f76c53b96b749427","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8eff21917aab67ef194cf24f81c612bce699b74496ae831f76c53b96b749427","first_computed_at":"2026-05-18T00:29:51.678992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:51.678992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bvkOn89eaNwMU80waecuhlHSESoRxvYMrS4xBiYqb7EdJ1mFhz6b3Bu36kSGG1ejPW13KCjAF6slxH1hIZuAAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:51.679727Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08417","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1029918a95061409f26cc7d649a9f67b4dc4c451264f10070139e0e23ae672e6","sha256:d2407a42a2e42ab086d02ef925c20ff77f16cb3093db229d6ec4ca460991fe9d"],"state_sha256":"4654f3fa070c41b45572f6fa24ccf7458b04df30f5e750bedd093dae47fabaac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WjTN2Xcbp1CQbVZQRd/TNt1kzDUzHH8mQeKAe+yyrNg5oCT1X+UYQfb+J9XadKTI8zajnVZM1wxMnpx1IH7oBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T21:21:27.598191Z","bundle_sha256":"9cb1d4087daa85bad4041ece220e17fb46b2add525918d11b44231ce4324534f"}}