{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BOQ7URODBWX2LD5SAVGYZ5AUMT","short_pith_number":"pith:BOQ7UROD","canonical_record":{"source":{"id":"1404.0695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-04-02T20:28:51Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"606956cea847f9020697b468489116371c1434e97522e7241adef23b55315bfe","abstract_canon_sha256":"c9eef1efad021137c3a9404e3dd9e94ab567522b77c8ea89fd0a1e604942ebf0"},"schema_version":"1.0"},"canonical_sha256":"0ba1fa45c30dafa58fb2054d8cf41464c7fdc41d53c2af26e7984f0924b60d0f","source":{"kind":"arxiv","id":"1404.0695","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0695","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0695v1","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0695","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"pith_short_12","alias_value":"BOQ7URODBWX2","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BOQ7URODBWX2LD5S","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BOQ7UROD","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BOQ7URODBWX2LD5SAVGYZ5AUMT","target":"record","payload":{"canonical_record":{"source":{"id":"1404.0695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-04-02T20:28:51Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"606956cea847f9020697b468489116371c1434e97522e7241adef23b55315bfe","abstract_canon_sha256":"c9eef1efad021137c3a9404e3dd9e94ab567522b77c8ea89fd0a1e604942ebf0"},"schema_version":"1.0"},"canonical_sha256":"0ba1fa45c30dafa58fb2054d8cf41464c7fdc41d53c2af26e7984f0924b60d0f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:55.687601Z","signature_b64":"JtB8nJIjEqUAD2g/5Na734zHIwRsW66l/XUa+bzwdme/4ezQANf56/waLTuZ7ERb+8qiYk8/KTyV1d2QQqeWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ba1fa45c30dafa58fb2054d8cf41464c7fdc41d53c2af26e7984f0924b60d0f","last_reissued_at":"2026-05-18T02:54:55.686963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:55.686963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.0695","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-18T02:54:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HKmAY1PW4vVf6QHDI7oiFsKRvKXfTn7x3W828Hc1E/3POaa3U18OCxyHp7A+oN3/kUvWgxZSH/xnr88lO3B8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:03:47.520637Z"},"content_sha256":"ddcb98c8fe8b8b1630974b2333074fdc3ad1f2454b1b9f1980b6fc75c3edd2ce","schema_version":"1.0","event_id":"sha256:ddcb98c8fe8b8b1630974b2333074fdc3ad1f2454b1b9f1980b6fc75c3edd2ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BOQ7URODBWX2LD5SAVGYZ5AUMT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-objective Flower Algorithm for Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NE","authors_text":"M. Karamanoglu, Xingshi He, Xin-She Yang","submitted_at":"2014-04-02T20:28:51Z","abstract_excerpt":"Flower pollination algorithm is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, we extend this flower algorithm to solve multi-objective optimization problems in engineering. By using the weighted sum method with random weights, we show that the proposed multi-objective flower algorithm can accurately find the Pareto fronts for a set of test functions. We then solve a bi-objective disc brake design problem, which indeed converges quickly."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0695","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-18T02:54:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IygPmudR5o7d4UT8xZ0VGZR3cuNpUPTAx2Ex+Wl6r5U7AjN7Ld4DR2L0p4ueMTXWerdyWv3/gF8YlbWkEQdoDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:03:47.521148Z"},"content_sha256":"5f5ecfa2b604edc992a76faf21bd0987573e6bc7b2fcfb9564fa77f0cbda75c7","schema_version":"1.0","event_id":"sha256:5f5ecfa2b604edc992a76faf21bd0987573e6bc7b2fcfb9564fa77f0cbda75c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BOQ7URODBWX2LD5SAVGYZ5AUMT/bundle.json","state_url":"https://pith.science/pith/BOQ7URODBWX2LD5SAVGYZ5AUMT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BOQ7URODBWX2LD5SAVGYZ5AUMT/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-26T10:03:47Z","links":{"resolver":"https://pith.science/pith/BOQ7URODBWX2LD5SAVGYZ5AUMT","bundle":"https://pith.science/pith/BOQ7URODBWX2LD5SAVGYZ5AUMT/bundle.json","state":"https://pith.science/pith/BOQ7URODBWX2LD5SAVGYZ5AUMT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BOQ7URODBWX2LD5SAVGYZ5AUMT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BOQ7URODBWX2LD5SAVGYZ5AUMT","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":"c9eef1efad021137c3a9404e3dd9e94ab567522b77c8ea89fd0a1e604942ebf0","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-04-02T20:28:51Z","title_canon_sha256":"606956cea847f9020697b468489116371c1434e97522e7241adef23b55315bfe"},"schema_version":"1.0","source":{"id":"1404.0695","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0695","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0695v1","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0695","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"pith_short_12","alias_value":"BOQ7URODBWX2","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BOQ7URODBWX2LD5S","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BOQ7UROD","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:5f5ecfa2b604edc992a76faf21bd0987573e6bc7b2fcfb9564fa77f0cbda75c7","target":"graph","created_at":"2026-05-18T02:54:55Z","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":"Flower pollination algorithm is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, we extend this flower algorithm to solve multi-objective optimization problems in engineering. By using the weighted sum method with random weights, we show that the proposed multi-objective flower algorithm can accurately find the Pareto fronts for a set of test functions. We then solve a bi-objective disc brake design problem, which indeed converges quickly.","authors_text":"M. Karamanoglu, Xingshi He, Xin-She Yang","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-04-02T20:28:51Z","title":"Multi-objective Flower Algorithm for Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0695","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:ddcb98c8fe8b8b1630974b2333074fdc3ad1f2454b1b9f1980b6fc75c3edd2ce","target":"record","created_at":"2026-05-18T02:54:55Z","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":"c9eef1efad021137c3a9404e3dd9e94ab567522b77c8ea89fd0a1e604942ebf0","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-04-02T20:28:51Z","title_canon_sha256":"606956cea847f9020697b468489116371c1434e97522e7241adef23b55315bfe"},"schema_version":"1.0","source":{"id":"1404.0695","kind":"arxiv","version":1}},"canonical_sha256":"0ba1fa45c30dafa58fb2054d8cf41464c7fdc41d53c2af26e7984f0924b60d0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ba1fa45c30dafa58fb2054d8cf41464c7fdc41d53c2af26e7984f0924b60d0f","first_computed_at":"2026-05-18T02:54:55.686963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:55.686963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JtB8nJIjEqUAD2g/5Na734zHIwRsW66l/XUa+bzwdme/4ezQANf56/waLTuZ7ERb+8qiYk8/KTyV1d2QQqeWCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:55.687601Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.0695","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ddcb98c8fe8b8b1630974b2333074fdc3ad1f2454b1b9f1980b6fc75c3edd2ce","sha256:5f5ecfa2b604edc992a76faf21bd0987573e6bc7b2fcfb9564fa77f0cbda75c7"],"state_sha256":"ff379f2b3a1b11dd113f20eb94c76795f0596f9c1c9cb273dd5a543d28713aa5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rMjf2nMJiL70V0/t4rLQhgVPwhLFwhyxPk53IK288nKx4bIhBDs4NuibbOyixCKmth4rdaPwCOjAu1W/cIdlDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:03:47.525030Z","bundle_sha256":"f28f423de88fd09c95064a6708e24c871ad81760fa291801c625d39aec308670"}}