{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:23ODSONMOUXFUMA4OU26TEWNP4","short_pith_number":"pith:23ODSONM","canonical_record":{"source":{"id":"1506.02253","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-07T11:35:28Z","cross_cats_sorted":[],"title_canon_sha256":"e0e20fd462507dbc58f3fa9f4cce1ee8d746e4a904cad0322289f8f562039276","abstract_canon_sha256":"985d3a6476268eaa730bf25c068d70fcdb6b9a5b349641d60001c0a63c0c127c"},"schema_version":"1.0"},"canonical_sha256":"d6dc3939ac752e5a301c7535e992cd7f10331c3bb4b14d97b85483d417d7059a","source":{"kind":"arxiv","id":"1506.02253","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02253","created_at":"2026-05-18T00:17:46Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02253v3","created_at":"2026-05-18T00:17:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02253","created_at":"2026-05-18T00:17:46Z"},{"alias_kind":"pith_short_12","alias_value":"23ODSONMOUXF","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"23ODSONMOUXFUMA4","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"23ODSONM","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:23ODSONMOUXFUMA4OU26TEWNP4","target":"record","payload":{"canonical_record":{"source":{"id":"1506.02253","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-07T11:35:28Z","cross_cats_sorted":[],"title_canon_sha256":"e0e20fd462507dbc58f3fa9f4cce1ee8d746e4a904cad0322289f8f562039276","abstract_canon_sha256":"985d3a6476268eaa730bf25c068d70fcdb6b9a5b349641d60001c0a63c0c127c"},"schema_version":"1.0"},"canonical_sha256":"d6dc3939ac752e5a301c7535e992cd7f10331c3bb4b14d97b85483d417d7059a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:46.628547Z","signature_b64":"lmVvrirHRuPVGJtO80KHCm7WD1iiSwdJrdzB4Ol9TK+LtF3FyGvjyAooprmP4HguBlf6ANFgDAdI7mPHimfECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6dc3939ac752e5a301c7535e992cd7f10331c3bb4b14d97b85483d417d7059a","last_reissued_at":"2026-05-18T00:17:46.628065Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:46.628065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.02253","source_version":3,"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:17:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"opgRSGCyZAr3a90vQRv7gYZegZEbQz/UVn3WLMmbDWATz06a72ouYT3dqYUYbXoA57rNLpBC6HiZNfSy1KFDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T16:31:02.456217Z"},"content_sha256":"9c62eef784bdbfe777252819c3d29d08ac112d449a44627ad066bb71c2b78cb2","schema_version":"1.0","event_id":"sha256:9c62eef784bdbfe777252819c3d29d08ac112d449a44627ad066bb71c2b78cb2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:23ODSONMOUXFUMA4OU26TEWNP4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Existence, Pareto reducibility, and connectedness in multi-objective optimization: Elementary proofs and extension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Latif Pourkarimi, Majid Soleimani-damaneh","submitted_at":"2015-06-07T11:35:28Z","abstract_excerpt":"This paper is divided to two parts. In the first part, we provide elementary proofs for some important results in multi-objective optimization. The given proofs are so simple and short in compared to the existing ones. Also, a Pareto reducibility result is extended from efficiency to proper efficiency. The second part is devoted to the connections between nonemptiness, $R^p_{\\geqq}$-(semi)compactness, external stability and connectedness of the set of nondominated solutions in multi-objective optimization. Furthermore, it is shown that some assumption in an important result, concerning connect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02253","kind":"arxiv","version":3},"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:17:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xFYN2G2D6nNIhtrVkPnbyK3HWxBd9EFBAOMH1MDcEFkCOdrDICvGssS16GqWCFEyvefwn+uU7uPLR3im42n+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T16:31:02.456576Z"},"content_sha256":"b23b340764d3cf2d1e6f15df1e02a769ba9fd69fdba62dec2207b89065e8035c","schema_version":"1.0","event_id":"sha256:b23b340764d3cf2d1e6f15df1e02a769ba9fd69fdba62dec2207b89065e8035c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/23ODSONMOUXFUMA4OU26TEWNP4/bundle.json","state_url":"https://pith.science/pith/23ODSONMOUXFUMA4OU26TEWNP4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/23ODSONMOUXFUMA4OU26TEWNP4/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-28T16:31:02Z","links":{"resolver":"https://pith.science/pith/23ODSONMOUXFUMA4OU26TEWNP4","bundle":"https://pith.science/pith/23ODSONMOUXFUMA4OU26TEWNP4/bundle.json","state":"https://pith.science/pith/23ODSONMOUXFUMA4OU26TEWNP4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/23ODSONMOUXFUMA4OU26TEWNP4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:23ODSONMOUXFUMA4OU26TEWNP4","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":"985d3a6476268eaa730bf25c068d70fcdb6b9a5b349641d60001c0a63c0c127c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-07T11:35:28Z","title_canon_sha256":"e0e20fd462507dbc58f3fa9f4cce1ee8d746e4a904cad0322289f8f562039276"},"schema_version":"1.0","source":{"id":"1506.02253","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02253","created_at":"2026-05-18T00:17:46Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02253v3","created_at":"2026-05-18T00:17:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02253","created_at":"2026-05-18T00:17:46Z"},{"alias_kind":"pith_short_12","alias_value":"23ODSONMOUXF","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"23ODSONMOUXFUMA4","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"23ODSONM","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:b23b340764d3cf2d1e6f15df1e02a769ba9fd69fdba62dec2207b89065e8035c","target":"graph","created_at":"2026-05-18T00:17:46Z","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 is divided to two parts. In the first part, we provide elementary proofs for some important results in multi-objective optimization. The given proofs are so simple and short in compared to the existing ones. Also, a Pareto reducibility result is extended from efficiency to proper efficiency. The second part is devoted to the connections between nonemptiness, $R^p_{\\geqq}$-(semi)compactness, external stability and connectedness of the set of nondominated solutions in multi-objective optimization. Furthermore, it is shown that some assumption in an important result, concerning connect","authors_text":"Latif Pourkarimi, Majid Soleimani-damaneh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-07T11:35:28Z","title":"Existence, Pareto reducibility, and connectedness in multi-objective optimization: Elementary proofs and extension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02253","kind":"arxiv","version":3},"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:9c62eef784bdbfe777252819c3d29d08ac112d449a44627ad066bb71c2b78cb2","target":"record","created_at":"2026-05-18T00:17:46Z","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":"985d3a6476268eaa730bf25c068d70fcdb6b9a5b349641d60001c0a63c0c127c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-07T11:35:28Z","title_canon_sha256":"e0e20fd462507dbc58f3fa9f4cce1ee8d746e4a904cad0322289f8f562039276"},"schema_version":"1.0","source":{"id":"1506.02253","kind":"arxiv","version":3}},"canonical_sha256":"d6dc3939ac752e5a301c7535e992cd7f10331c3bb4b14d97b85483d417d7059a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6dc3939ac752e5a301c7535e992cd7f10331c3bb4b14d97b85483d417d7059a","first_computed_at":"2026-05-18T00:17:46.628065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:46.628065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lmVvrirHRuPVGJtO80KHCm7WD1iiSwdJrdzB4Ol9TK+LtF3FyGvjyAooprmP4HguBlf6ANFgDAdI7mPHimfECw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:46.628547Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02253","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c62eef784bdbfe777252819c3d29d08ac112d449a44627ad066bb71c2b78cb2","sha256:b23b340764d3cf2d1e6f15df1e02a769ba9fd69fdba62dec2207b89065e8035c"],"state_sha256":"10e9baf585e6bbd75dcbdbe8d7a3e7bf056deb6fb2d7acdafe99c8ca7fca4eb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CvubICmz8HgIJvX6s9be72i55QZCMiIefBcuTJf0KKoG8Nvad1gvzxWN3rI1sGCyJ9TQ9bYKqzLoh1TWJUxADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T16:31:02.458444Z","bundle_sha256":"0b3fb1a815d0e7f00364f2f1064329c6f745366e58db166fbb6ef15757566666"}}