{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OPFVSBWVYJHHRAXD6ZIW25JE3Q","short_pith_number":"pith:OPFVSBWV","canonical_record":{"source":{"id":"1708.07040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2017-08-04T08:09:36Z","cross_cats_sorted":["cs.NE","math.OC"],"title_canon_sha256":"96a6af4887b570da1649082a51ebd551463f8849e180445c95df1e97cd7d87e3","abstract_canon_sha256":"f17ebe9b433e96ed097dc9a2902fab153f8e4c14a40a5d8d6b5d959c5bb627d8"},"schema_version":"1.0"},"canonical_sha256":"73cb5906d5c24e7882e3f6516d7524dc08d1519def9d12dc1775dbf3ada87d95","source":{"kind":"arxiv","id":"1708.07040","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07040","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07040v1","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07040","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"pith_short_12","alias_value":"OPFVSBWVYJHH","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OPFVSBWVYJHHRAXD","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OPFVSBWV","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OPFVSBWVYJHHRAXD6ZIW25JE3Q","target":"record","payload":{"canonical_record":{"source":{"id":"1708.07040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2017-08-04T08:09:36Z","cross_cats_sorted":["cs.NE","math.OC"],"title_canon_sha256":"96a6af4887b570da1649082a51ebd551463f8849e180445c95df1e97cd7d87e3","abstract_canon_sha256":"f17ebe9b433e96ed097dc9a2902fab153f8e4c14a40a5d8d6b5d959c5bb627d8"},"schema_version":"1.0"},"canonical_sha256":"73cb5906d5c24e7882e3f6516d7524dc08d1519def9d12dc1775dbf3ada87d95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:48.565311Z","signature_b64":"2JVjaNm8QbgX8fQkDccZmFO7EKZuMouagcZXJVHc12+96TAHj/6aOfb/phcHiOMI5EduVlA70aYkhPu8M2jgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73cb5906d5c24e7882e3f6516d7524dc08d1519def9d12dc1775dbf3ada87d95","last_reissued_at":"2026-05-18T00:36:48.564784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:48.564784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.07040","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-18T00:36:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hi37XFsFw6WUGOLomYDGW0GHm//1ge1boOwM/p9tX0Wg6weyem4fiC9o8qal9NyPNTeocgp0UbCl0beE4tyFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:43:45.630625Z"},"content_sha256":"197965e2f20620a2bba494cac7bc14c31879e87dd554e9de3fdca1f6bb6885e6","schema_version":"1.0","event_id":"sha256:197965e2f20620a2bba494cac7bc14c31879e87dd554e9de3fdca1f6bb6885e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OPFVSBWVYJHHRAXD6ZIW25JE3Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Plant Propagation Algorithm for Solving Economic Load Dispatch Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","math.OC"],"primary_cat":"cs.CE","authors_text":"Sayan Nag","submitted_at":"2017-08-04T08:09:36Z","abstract_excerpt":"Optimization problems in design engineering are complex by nature, often because of the involvement of critical objective functions accompanied by a number of rigid constraints associated with the products involved. One such problem is Economic Load Dispatch (ED) problem which focuses on the optimization of the fuel cost while satisfying some system constraints. Classical optimization algorithms are not sufficient and also inefficient for the ED problem involving highly nonlinear, and non-convex functions both in the objective and in the constraints. This led to the development of metaheuristi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07040","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-18T00:36:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OW4iEcdqLmtJR/ev7d9rCEpMKh4TG3zXgz8Jnc1n5a8R/yFFnjGTYrYCCY0pR95hZ6EbvKlX/a59AhRjsL+dAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:43:45.630974Z"},"content_sha256":"01da6eb2b801f043745d7baa0930ba6204cdca707f4685639cf15ec6d6ba12a1","schema_version":"1.0","event_id":"sha256:01da6eb2b801f043745d7baa0930ba6204cdca707f4685639cf15ec6d6ba12a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OPFVSBWVYJHHRAXD6ZIW25JE3Q/bundle.json","state_url":"https://pith.science/pith/OPFVSBWVYJHHRAXD6ZIW25JE3Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OPFVSBWVYJHHRAXD6ZIW25JE3Q/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-24T08:43:45Z","links":{"resolver":"https://pith.science/pith/OPFVSBWVYJHHRAXD6ZIW25JE3Q","bundle":"https://pith.science/pith/OPFVSBWVYJHHRAXD6ZIW25JE3Q/bundle.json","state":"https://pith.science/pith/OPFVSBWVYJHHRAXD6ZIW25JE3Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OPFVSBWVYJHHRAXD6ZIW25JE3Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OPFVSBWVYJHHRAXD6ZIW25JE3Q","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":"f17ebe9b433e96ed097dc9a2902fab153f8e4c14a40a5d8d6b5d959c5bb627d8","cross_cats_sorted":["cs.NE","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2017-08-04T08:09:36Z","title_canon_sha256":"96a6af4887b570da1649082a51ebd551463f8849e180445c95df1e97cd7d87e3"},"schema_version":"1.0","source":{"id":"1708.07040","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07040","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07040v1","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07040","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"pith_short_12","alias_value":"OPFVSBWVYJHH","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OPFVSBWVYJHHRAXD","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OPFVSBWV","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:01da6eb2b801f043745d7baa0930ba6204cdca707f4685639cf15ec6d6ba12a1","target":"graph","created_at":"2026-05-18T00:36:48Z","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":"Optimization problems in design engineering are complex by nature, often because of the involvement of critical objective functions accompanied by a number of rigid constraints associated with the products involved. One such problem is Economic Load Dispatch (ED) problem which focuses on the optimization of the fuel cost while satisfying some system constraints. Classical optimization algorithms are not sufficient and also inefficient for the ED problem involving highly nonlinear, and non-convex functions both in the objective and in the constraints. This led to the development of metaheuristi","authors_text":"Sayan Nag","cross_cats":["cs.NE","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2017-08-04T08:09:36Z","title":"Adaptive Plant Propagation Algorithm for Solving Economic Load Dispatch Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07040","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:197965e2f20620a2bba494cac7bc14c31879e87dd554e9de3fdca1f6bb6885e6","target":"record","created_at":"2026-05-18T00:36:48Z","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":"f17ebe9b433e96ed097dc9a2902fab153f8e4c14a40a5d8d6b5d959c5bb627d8","cross_cats_sorted":["cs.NE","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2017-08-04T08:09:36Z","title_canon_sha256":"96a6af4887b570da1649082a51ebd551463f8849e180445c95df1e97cd7d87e3"},"schema_version":"1.0","source":{"id":"1708.07040","kind":"arxiv","version":1}},"canonical_sha256":"73cb5906d5c24e7882e3f6516d7524dc08d1519def9d12dc1775dbf3ada87d95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73cb5906d5c24e7882e3f6516d7524dc08d1519def9d12dc1775dbf3ada87d95","first_computed_at":"2026-05-18T00:36:48.564784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:48.564784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2JVjaNm8QbgX8fQkDccZmFO7EKZuMouagcZXJVHc12+96TAHj/6aOfb/phcHiOMI5EduVlA70aYkhPu8M2jgCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:48.565311Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07040","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:197965e2f20620a2bba494cac7bc14c31879e87dd554e9de3fdca1f6bb6885e6","sha256:01da6eb2b801f043745d7baa0930ba6204cdca707f4685639cf15ec6d6ba12a1"],"state_sha256":"1fa6ca262a3360c4a42396a94fab301e3723b6abcbd9cb9f0639c13745f2e387"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rw3PQlfU+PGg3UkmcaXXtd4lZZ1Hjs091Frejvs72R8z1l3V89vS+tGHXlaDwU3eYeS+pKj243ga9Vc3QOWmBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T08:43:45.632919Z","bundle_sha256":"36d856ce8265cac65b21ffb10f98ba5cd207758177bd2b830a127db7e6d266d0"}}