{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RUQRSRP4OCFYTBWS3W3RNHWTCC","short_pith_number":"pith:RUQRSRP4","canonical_record":{"source":{"id":"1801.00609","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-01-02T11:10:50Z","cross_cats_sorted":[],"title_canon_sha256":"240dee422e153b8670a8137efabe5ac5e574ba34c7d3140d6900d47aac4eded8","abstract_canon_sha256":"2b2779162d16c0c5eff6275652d7ff30749347594b85fd9b153cf4f73d3afcaf"},"schema_version":"1.0"},"canonical_sha256":"8d211945fc708b8986d2ddb7169ed310910d13bc6c6d3ec48d1d3be9c8cc0851","source":{"kind":"arxiv","id":"1801.00609","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00609","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00609v2","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00609","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"RUQRSRP4OCFY","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RUQRSRP4OCFYTBWS","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RUQRSRP4","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RUQRSRP4OCFYTBWS3W3RNHWTCC","target":"record","payload":{"canonical_record":{"source":{"id":"1801.00609","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-01-02T11:10:50Z","cross_cats_sorted":[],"title_canon_sha256":"240dee422e153b8670a8137efabe5ac5e574ba34c7d3140d6900d47aac4eded8","abstract_canon_sha256":"2b2779162d16c0c5eff6275652d7ff30749347594b85fd9b153cf4f73d3afcaf"},"schema_version":"1.0"},"canonical_sha256":"8d211945fc708b8986d2ddb7169ed310910d13bc6c6d3ec48d1d3be9c8cc0851","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:30.430369Z","signature_b64":"5DAXyTebU8eR8EJIOZOJhU0mH+n0015wwV2VR13Yqv2rzvOZrCUXmBvozR1uDpfEyA1n9F5uzb+HNMZJPEnKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d211945fc708b8986d2ddb7169ed310910d13bc6c6d3ec48d1d3be9c8cc0851","last_reissued_at":"2026-05-18T00:04:30.429880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:30.429880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.00609","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:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cE/ieBqd+0O1uf9c0bcpeDRYJEFCGGnLRGNUtC4df8KWOS9yRq9IyAf3hD4wLxiiRTXyYNzk6ARuu2gLUdV8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:18:25.085943Z"},"content_sha256":"8bc30c903beb94041ade94f0f413a0c1001ac4625f20e6fe616e91dd38cd6942","schema_version":"1.0","event_id":"sha256:8bc30c903beb94041ade94f0f413a0c1001ac4625f20e6fe616e91dd38cd6942"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RUQRSRP4OCFYTBWS3W3RNHWTCC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interactive Decomposition Multi-Objective Optimization via Progressively Learned Value Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Dragan Savic, Ke Li, Renzhi Chen, Xin Yao","submitted_at":"2018-01-02T11:10:50Z","abstract_excerpt":"Decomposition has become an increasingly popular technique for evolutionary multi-objective optimization (EMO). A decomposition-based EMO algorithm is usually designed to approximate a whole Pareto-optimal front (PF). However, in practice, the decision maker (DM) might only be interested in her/his region of interest (ROI), i.e., a part of the PF. Solutions outside that might be useless or even noisy to the decision-making procedure. Furthermore, there is no guarantee to find the preferred solutions when tackling many-objective problems. This paper develops an interactive framework for the dec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00609","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:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+/q5CKA0Vyo6bZEnbb1bRoOOR04tn1HLr5Zdyg3rllORf6ZubNkXCFJfKx8mrLfZ+RYjkIjOtDi08MMuBt7CDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:18:25.086598Z"},"content_sha256":"3d904037f76118fad97c25fd0532ad42bb71672328ad9b74699b82bfb47ade3b","schema_version":"1.0","event_id":"sha256:3d904037f76118fad97c25fd0532ad42bb71672328ad9b74699b82bfb47ade3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RUQRSRP4OCFYTBWS3W3RNHWTCC/bundle.json","state_url":"https://pith.science/pith/RUQRSRP4OCFYTBWS3W3RNHWTCC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RUQRSRP4OCFYTBWS3W3RNHWTCC/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:18:25Z","links":{"resolver":"https://pith.science/pith/RUQRSRP4OCFYTBWS3W3RNHWTCC","bundle":"https://pith.science/pith/RUQRSRP4OCFYTBWS3W3RNHWTCC/bundle.json","state":"https://pith.science/pith/RUQRSRP4OCFYTBWS3W3RNHWTCC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RUQRSRP4OCFYTBWS3W3RNHWTCC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RUQRSRP4OCFYTBWS3W3RNHWTCC","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":"2b2779162d16c0c5eff6275652d7ff30749347594b85fd9b153cf4f73d3afcaf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-01-02T11:10:50Z","title_canon_sha256":"240dee422e153b8670a8137efabe5ac5e574ba34c7d3140d6900d47aac4eded8"},"schema_version":"1.0","source":{"id":"1801.00609","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00609","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00609v2","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00609","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"RUQRSRP4OCFY","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RUQRSRP4OCFYTBWS","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RUQRSRP4","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:3d904037f76118fad97c25fd0532ad42bb71672328ad9b74699b82bfb47ade3b","target":"graph","created_at":"2026-05-18T00:04:30Z","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":"Decomposition has become an increasingly popular technique for evolutionary multi-objective optimization (EMO). A decomposition-based EMO algorithm is usually designed to approximate a whole Pareto-optimal front (PF). However, in practice, the decision maker (DM) might only be interested in her/his region of interest (ROI), i.e., a part of the PF. Solutions outside that might be useless or even noisy to the decision-making procedure. Furthermore, there is no guarantee to find the preferred solutions when tackling many-objective problems. This paper develops an interactive framework for the dec","authors_text":"Dragan Savic, Ke Li, Renzhi Chen, Xin Yao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-01-02T11:10:50Z","title":"Interactive Decomposition Multi-Objective Optimization via Progressively Learned Value Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00609","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:8bc30c903beb94041ade94f0f413a0c1001ac4625f20e6fe616e91dd38cd6942","target":"record","created_at":"2026-05-18T00:04:30Z","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":"2b2779162d16c0c5eff6275652d7ff30749347594b85fd9b153cf4f73d3afcaf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-01-02T11:10:50Z","title_canon_sha256":"240dee422e153b8670a8137efabe5ac5e574ba34c7d3140d6900d47aac4eded8"},"schema_version":"1.0","source":{"id":"1801.00609","kind":"arxiv","version":2}},"canonical_sha256":"8d211945fc708b8986d2ddb7169ed310910d13bc6c6d3ec48d1d3be9c8cc0851","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d211945fc708b8986d2ddb7169ed310910d13bc6c6d3ec48d1d3be9c8cc0851","first_computed_at":"2026-05-18T00:04:30.429880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:30.429880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5DAXyTebU8eR8EJIOZOJhU0mH+n0015wwV2VR13Yqv2rzvOZrCUXmBvozR1uDpfEyA1n9F5uzb+HNMZJPEnKAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:30.430369Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.00609","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8bc30c903beb94041ade94f0f413a0c1001ac4625f20e6fe616e91dd38cd6942","sha256:3d904037f76118fad97c25fd0532ad42bb71672328ad9b74699b82bfb47ade3b"],"state_sha256":"ebd415ceb6c462284590834a889c12d16bd1d2e06d882cd261493f1f6b456d4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7DPY7zXDnsni/louyrjat+HoKfKgXzm2YlhybdW3q/mWf20LntUEDOLEWkWXywhrnmQ+jmElkdbMZzGjPmlkCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:18:25.088918Z","bundle_sha256":"436b11a208b1adf8884a6095730299ac53571eef059b679ced3f9074f7c81f12"}}