{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YLRLEBVD7KPDMF62NBIK7YHUPE","short_pith_number":"pith:YLRLEBVD","canonical_record":{"source":{"id":"1610.06009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-26T16:36:39Z","cross_cats_sorted":[],"title_canon_sha256":"af835944f33d38d090a0fefbf79b001f113c397b4cf4290f8ea0a4dc163b9e75","abstract_canon_sha256":"803e87122100314467af4900ba7924b13f49db7006b63bc36c024d4686dde872"},"schema_version":"1.0"},"canonical_sha256":"c2e2b206a3fa9e3617da6850afe0f47932a63a6d14b6f887fcb820ce57cc97df","source":{"kind":"arxiv","id":"1610.06009","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06009","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06009v1","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06009","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"pith_short_12","alias_value":"YLRLEBVD7KPD","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YLRLEBVD7KPDMF62","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YLRLEBVD","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YLRLEBVD7KPDMF62NBIK7YHUPE","target":"record","payload":{"canonical_record":{"source":{"id":"1610.06009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-26T16:36:39Z","cross_cats_sorted":[],"title_canon_sha256":"af835944f33d38d090a0fefbf79b001f113c397b4cf4290f8ea0a4dc163b9e75","abstract_canon_sha256":"803e87122100314467af4900ba7924b13f49db7006b63bc36c024d4686dde872"},"schema_version":"1.0"},"canonical_sha256":"c2e2b206a3fa9e3617da6850afe0f47932a63a6d14b6f887fcb820ce57cc97df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:50.429345Z","signature_b64":"G3Glpa2ejI18aaCqeAA8NdtisjLO0x6N2mlSYLgIzxJ1O/nSPhCAYfJusKQdFA94LwWCPYiTU/hIsuaszxVMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2e2b206a3fa9e3617da6850afe0f47932a63a6d14b6f887fcb820ce57cc97df","last_reissued_at":"2026-05-18T01:01:50.428574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:50.428574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.06009","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-18T01:01:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wmCYmtImAvrdBAewXZZWpV8HxlvLms/xCPdGSBNJ0pKw6zq4bDKK0r5PBb2ndlwawHpOLgT8+mQtQOC2qbU7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T02:07:59.163896Z"},"content_sha256":"d2a3cc12a475c6ba4b7e3a254080308bf49980d1aef2c630d827ddffb8f72879","schema_version":"1.0","event_id":"sha256:d2a3cc12a475c6ba4b7e3a254080308bf49980d1aef2c630d827ddffb8f72879"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YLRLEBVD7KPDMF62NBIK7YHUPE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained Cohort Intelligence using Static and Dynamic Penalty Function Approach for Mechanical Components Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anand J Kulkarni, Ganesh Kakandikar, Ninad Kulkarni, Omkar Kulkarni","submitted_at":"2016-09-26T16:36:39Z","abstract_excerpt":"Most of the metaheuristics can efficiently solve unconstrained problems; however, their performance may degenerate if the constraints are involved. This paper proposes two constraint handling approaches for an emerging metaheuristic of Cohort Intelligence (CI). More specifically CI with static penalty function approach (SCI) and CI with dynamic penalty function approach (DCI) are proposed. The approaches have been tested by solving several constrained test problems. The performance of the SCI and DCI have been compared with algorithms like GA, PSO, ABC, d-Ds. In addition, as well as three real"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06009","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-18T01:01:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ExyfEI33bJ3ZRn8/vuZNcAeOb5zmrDh2kAJyBsMgO+LeHVRERpa0CqpnzaqDW+PoXEyREwOZ7kUrec0eJGNaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T02:07:59.164248Z"},"content_sha256":"27288e364fd54191936d29a56d48aa6ab3e120c881baac01c62797f581d7f93d","schema_version":"1.0","event_id":"sha256:27288e364fd54191936d29a56d48aa6ab3e120c881baac01c62797f581d7f93d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YLRLEBVD7KPDMF62NBIK7YHUPE/bundle.json","state_url":"https://pith.science/pith/YLRLEBVD7KPDMF62NBIK7YHUPE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YLRLEBVD7KPDMF62NBIK7YHUPE/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-30T02:07:59Z","links":{"resolver":"https://pith.science/pith/YLRLEBVD7KPDMF62NBIK7YHUPE","bundle":"https://pith.science/pith/YLRLEBVD7KPDMF62NBIK7YHUPE/bundle.json","state":"https://pith.science/pith/YLRLEBVD7KPDMF62NBIK7YHUPE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YLRLEBVD7KPDMF62NBIK7YHUPE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YLRLEBVD7KPDMF62NBIK7YHUPE","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":"803e87122100314467af4900ba7924b13f49db7006b63bc36c024d4686dde872","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-26T16:36:39Z","title_canon_sha256":"af835944f33d38d090a0fefbf79b001f113c397b4cf4290f8ea0a4dc163b9e75"},"schema_version":"1.0","source":{"id":"1610.06009","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06009","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06009v1","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06009","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"pith_short_12","alias_value":"YLRLEBVD7KPD","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YLRLEBVD7KPDMF62","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YLRLEBVD","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:27288e364fd54191936d29a56d48aa6ab3e120c881baac01c62797f581d7f93d","target":"graph","created_at":"2026-05-18T01:01:50Z","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":"Most of the metaheuristics can efficiently solve unconstrained problems; however, their performance may degenerate if the constraints are involved. This paper proposes two constraint handling approaches for an emerging metaheuristic of Cohort Intelligence (CI). More specifically CI with static penalty function approach (SCI) and CI with dynamic penalty function approach (DCI) are proposed. The approaches have been tested by solving several constrained test problems. The performance of the SCI and DCI have been compared with algorithms like GA, PSO, ABC, d-Ds. In addition, as well as three real","authors_text":"Anand J Kulkarni, Ganesh Kakandikar, Ninad Kulkarni, Omkar Kulkarni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-26T16:36:39Z","title":"Constrained Cohort Intelligence using Static and Dynamic Penalty Function Approach for Mechanical Components Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06009","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:d2a3cc12a475c6ba4b7e3a254080308bf49980d1aef2c630d827ddffb8f72879","target":"record","created_at":"2026-05-18T01:01:50Z","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":"803e87122100314467af4900ba7924b13f49db7006b63bc36c024d4686dde872","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-26T16:36:39Z","title_canon_sha256":"af835944f33d38d090a0fefbf79b001f113c397b4cf4290f8ea0a4dc163b9e75"},"schema_version":"1.0","source":{"id":"1610.06009","kind":"arxiv","version":1}},"canonical_sha256":"c2e2b206a3fa9e3617da6850afe0f47932a63a6d14b6f887fcb820ce57cc97df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2e2b206a3fa9e3617da6850afe0f47932a63a6d14b6f887fcb820ce57cc97df","first_computed_at":"2026-05-18T01:01:50.428574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:50.428574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G3Glpa2ejI18aaCqeAA8NdtisjLO0x6N2mlSYLgIzxJ1O/nSPhCAYfJusKQdFA94LwWCPYiTU/hIsuaszxVMCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:50.429345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.06009","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2a3cc12a475c6ba4b7e3a254080308bf49980d1aef2c630d827ddffb8f72879","sha256:27288e364fd54191936d29a56d48aa6ab3e120c881baac01c62797f581d7f93d"],"state_sha256":"2f89f7b0e0b722323e61e1e7b3b1d2c5720d8fa0226de7d3507bb84b6ea81521"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1IEb9FEa2Pd4QYLEk4ar/OKwJt/aZ94isCM9mBPqmcCi3X/Em8CM1zBLuq7CGIg9/49ozk2a+jeo7VQ6xADNCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T02:07:59.166617Z","bundle_sha256":"6fc1733109c0c76da8a481cf66edf8a4c95c514169fbeb76d57ed40430cd5595"}}