{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:URDLA3C4JUL2VBCMRCWJFYV5WH","short_pith_number":"pith:URDLA3C4","canonical_record":{"source":{"id":"1303.6336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-25T22:25:36Z","cross_cats_sorted":[],"title_canon_sha256":"252b0153161d9f7f34256b7bcaabb9b05ebd37999c58a20ba83f072b8faf5081","abstract_canon_sha256":"9979d216be5e3caeed5aaf24b7b07e14e380081e2e6817d3e1ec48311ed8d060"},"schema_version":"1.0"},"canonical_sha256":"a446b06c5c4d17aa844c88ac92e2bdb1ce75fb22b1f910c8ce2cd0423bcb4253","source":{"kind":"arxiv","id":"1303.6336","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6336","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6336v1","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6336","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"URDLA3C4JUL2","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"URDLA3C4JUL2VBCM","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"URDLA3C4","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:URDLA3C4JUL2VBCMRCWJFYV5WH","target":"record","payload":{"canonical_record":{"source":{"id":"1303.6336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-25T22:25:36Z","cross_cats_sorted":[],"title_canon_sha256":"252b0153161d9f7f34256b7bcaabb9b05ebd37999c58a20ba83f072b8faf5081","abstract_canon_sha256":"9979d216be5e3caeed5aaf24b7b07e14e380081e2e6817d3e1ec48311ed8d060"},"schema_version":"1.0"},"canonical_sha256":"a446b06c5c4d17aa844c88ac92e2bdb1ce75fb22b1f910c8ce2cd0423bcb4253","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:49.725062Z","signature_b64":"11WdRpaKYkbxKjXE0fcqDccij24wrVtlmkm1XZzvVJwLWZr+dQ0+KUteneUu4Xv4d4DsnyLmC3FDKIz1UWcRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a446b06c5c4d17aa844c88ac92e2bdb1ce75fb22b1f910c8ce2cd0423bcb4253","last_reissued_at":"2026-05-18T03:29:49.724325Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:49.724325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.6336","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-18T03:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N1eU0BJzsW8TzQqhBal7LPfwYO73xPwsn2On5bh4eu5PBIcqM8cjwzoHgAHCLorl5T/YXF3ySD6Zh1+24+tfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:45:03.125946Z"},"content_sha256":"572316752657c3af09e658bde404f82b705e9d6c2e20b654a9c9e6127c077848","schema_version":"1.0","event_id":"sha256:572316752657c3af09e658bde404f82b705e9d6c2e20b654a9c9e6127c077848"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:URDLA3C4JUL2VBCMRCWJFYV5WH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiobjective Firefly Algorithm for Continuous Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Xin-She Yang","submitted_at":"2013-03-25T22:25:36Z","abstract_excerpt":"Design problems in industrial engineering often involve a large number of design variables with multiple objectives, under complex nonlinear constraints. The algorithms for multiobjective problems can be significantly different from the methods for single objective optimization. To find the Pareto front and non-dominated set for a nonlinear multiobjective optimization problem may require significant computing effort, even for seemingly simple problems. Metaheuristic algorithms start to show their advantages in dealing with multiobjective optimization. In this paper, we extend the recently deve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6336","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-18T03:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KdafAR5Zcrd7IH08v3MrPNbCatLE+im+mASxS1aIFitli5fi4zUBCXaKpua9z3N0hE/GNJGghENN0t4kyPHaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:45:03.126611Z"},"content_sha256":"a1a467d13f6759ee4bd6843e2b2a811cfa5a4273b9a4764bea7dcc36260fb463","schema_version":"1.0","event_id":"sha256:a1a467d13f6759ee4bd6843e2b2a811cfa5a4273b9a4764bea7dcc36260fb463"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/URDLA3C4JUL2VBCMRCWJFYV5WH/bundle.json","state_url":"https://pith.science/pith/URDLA3C4JUL2VBCMRCWJFYV5WH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/URDLA3C4JUL2VBCMRCWJFYV5WH/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-25T20:45:03Z","links":{"resolver":"https://pith.science/pith/URDLA3C4JUL2VBCMRCWJFYV5WH","bundle":"https://pith.science/pith/URDLA3C4JUL2VBCMRCWJFYV5WH/bundle.json","state":"https://pith.science/pith/URDLA3C4JUL2VBCMRCWJFYV5WH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/URDLA3C4JUL2VBCMRCWJFYV5WH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:URDLA3C4JUL2VBCMRCWJFYV5WH","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":"9979d216be5e3caeed5aaf24b7b07e14e380081e2e6817d3e1ec48311ed8d060","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-25T22:25:36Z","title_canon_sha256":"252b0153161d9f7f34256b7bcaabb9b05ebd37999c58a20ba83f072b8faf5081"},"schema_version":"1.0","source":{"id":"1303.6336","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6336","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6336v1","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6336","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"URDLA3C4JUL2","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"URDLA3C4JUL2VBCM","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"URDLA3C4","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:a1a467d13f6759ee4bd6843e2b2a811cfa5a4273b9a4764bea7dcc36260fb463","target":"graph","created_at":"2026-05-18T03:29:49Z","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":"Design problems in industrial engineering often involve a large number of design variables with multiple objectives, under complex nonlinear constraints. The algorithms for multiobjective problems can be significantly different from the methods for single objective optimization. To find the Pareto front and non-dominated set for a nonlinear multiobjective optimization problem may require significant computing effort, even for seemingly simple problems. Metaheuristic algorithms start to show their advantages in dealing with multiobjective optimization. In this paper, we extend the recently deve","authors_text":"Xin-She Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-25T22:25:36Z","title":"Multiobjective Firefly Algorithm for Continuous Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6336","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:572316752657c3af09e658bde404f82b705e9d6c2e20b654a9c9e6127c077848","target":"record","created_at":"2026-05-18T03:29:49Z","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":"9979d216be5e3caeed5aaf24b7b07e14e380081e2e6817d3e1ec48311ed8d060","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-25T22:25:36Z","title_canon_sha256":"252b0153161d9f7f34256b7bcaabb9b05ebd37999c58a20ba83f072b8faf5081"},"schema_version":"1.0","source":{"id":"1303.6336","kind":"arxiv","version":1}},"canonical_sha256":"a446b06c5c4d17aa844c88ac92e2bdb1ce75fb22b1f910c8ce2cd0423bcb4253","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a446b06c5c4d17aa844c88ac92e2bdb1ce75fb22b1f910c8ce2cd0423bcb4253","first_computed_at":"2026-05-18T03:29:49.724325Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:49.724325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"11WdRpaKYkbxKjXE0fcqDccij24wrVtlmkm1XZzvVJwLWZr+dQ0+KUteneUu4Xv4d4DsnyLmC3FDKIz1UWcRCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:49.725062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.6336","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:572316752657c3af09e658bde404f82b705e9d6c2e20b654a9c9e6127c077848","sha256:a1a467d13f6759ee4bd6843e2b2a811cfa5a4273b9a4764bea7dcc36260fb463"],"state_sha256":"4c6fce1cb002612837564b8df6725183ab152ebd77705e2224b10507d289af43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CvecF6NaMB4Wa+sT2+mhKtI3Wm6jGykAbUwaIOrXXRfrcLF0su3s3uSbZkbbYkOIoMsKg7C4Y5p8UUTGWogwCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:45:03.129950Z","bundle_sha256":"1fed83dda4a21452fdfc95d3c12bfe83e32a892fe36cd16e97fc3c45f080c171"}}