{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:F4A3QHXLNBESJL5GKPIE5NZ7MQ","short_pith_number":"pith:F4A3QHXL","canonical_record":{"source":{"id":"1503.03175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-03-11T04:59:12Z","cross_cats_sorted":[],"title_canon_sha256":"20f5e8a79b9f62cc17bd483d69d35de8d48f4c1fa87152f2d8cc91a34c4efd52","abstract_canon_sha256":"cb13c2cbd8b1c73b31bc5a4d8a97e2c7eb66f74da9f5ec72e22c4e728a0712ee"},"schema_version":"1.0"},"canonical_sha256":"2f01b81eeb684924afa653d04eb73f6432e0fc896df38bc92b472785c2e31fe7","source":{"kind":"arxiv","id":"1503.03175","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.03175","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1503.03175v1","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03175","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"F4A3QHXLNBES","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"F4A3QHXLNBESJL5G","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"F4A3QHXL","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:F4A3QHXLNBESJL5GKPIE5NZ7MQ","target":"record","payload":{"canonical_record":{"source":{"id":"1503.03175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-03-11T04:59:12Z","cross_cats_sorted":[],"title_canon_sha256":"20f5e8a79b9f62cc17bd483d69d35de8d48f4c1fa87152f2d8cc91a34c4efd52","abstract_canon_sha256":"cb13c2cbd8b1c73b31bc5a4d8a97e2c7eb66f74da9f5ec72e22c4e728a0712ee"},"schema_version":"1.0"},"canonical_sha256":"2f01b81eeb684924afa653d04eb73f6432e0fc896df38bc92b472785c2e31fe7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:22.726110Z","signature_b64":"rOuTRxoJmY1XEzpZQIdMIgxG6kkcAxkGn4b8yGn0+7D5wUXa9KxvPtpBGb6iFFDwk8EJU6SD9S2DaeUxoYEyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f01b81eeb684924afa653d04eb73f6432e0fc896df38bc92b472785c2e31fe7","last_reissued_at":"2026-05-18T00:45:22.725648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:22.725648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.03175","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:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tT9Pg5YbheM+BAQcvovSSrSoeOXHAP5RCtcUThfNYv/XeaKK9H6V+FQTibu8qENNoeFfDR3PnAU4zOg2470tAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:07:22.664005Z"},"content_sha256":"ab7eb6d1e9bcf6b56532ade6c4225685cf6999dedee6ef0eba6440ba14bccf19","schema_version":"1.0","event_id":"sha256:ab7eb6d1e9bcf6b56532ade6c4225685cf6999dedee6ef0eba6440ba14bccf19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:F4A3QHXLNBESJL5GKPIE5NZ7MQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Benchmarking NLopt and state-of-art algorithms for Continuous Global Optimization via Hybrid IACO$_\\mathbb{R}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Jayadeva, Sumit Soman, Udit Kumar","submitted_at":"2015-03-11T04:59:12Z","abstract_excerpt":"This paper presents a comparative analysis of the performance of the Incremental Ant Colony algorithm for continuous optimization ($IACO_\\mathbb{R}$), with different algorithms provided in the NLopt library. The key objective is to understand how the various algorithms in the NLopt library perform in combination with the Multi Trajectory Local Search (Mtsls1) technique. A hybrid approach has been introduced in the local search strategy by the use of a parameter which allows for probabilistic selection between Mtsls1 and a NLopt algorithm. In case of stagnation, the algorithm switch is made bas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03175","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:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yo8cUjl16D44rD+J3IB8RF2u8Y9OJ4bJJl6q6ISLjW/CRPbL5Msy8JDgXj6GqnNG+zGpE7eriC+0RREuXraYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:07:22.664572Z"},"content_sha256":"06f963545d0c89050001579aa67d45f8129c57dd1ca692fc800a66e73ead7423","schema_version":"1.0","event_id":"sha256:06f963545d0c89050001579aa67d45f8129c57dd1ca692fc800a66e73ead7423"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F4A3QHXLNBESJL5GKPIE5NZ7MQ/bundle.json","state_url":"https://pith.science/pith/F4A3QHXLNBESJL5GKPIE5NZ7MQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F4A3QHXLNBESJL5GKPIE5NZ7MQ/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-07T17:07:22Z","links":{"resolver":"https://pith.science/pith/F4A3QHXLNBESJL5GKPIE5NZ7MQ","bundle":"https://pith.science/pith/F4A3QHXLNBESJL5GKPIE5NZ7MQ/bundle.json","state":"https://pith.science/pith/F4A3QHXLNBESJL5GKPIE5NZ7MQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F4A3QHXLNBESJL5GKPIE5NZ7MQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:F4A3QHXLNBESJL5GKPIE5NZ7MQ","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":"cb13c2cbd8b1c73b31bc5a4d8a97e2c7eb66f74da9f5ec72e22c4e728a0712ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-03-11T04:59:12Z","title_canon_sha256":"20f5e8a79b9f62cc17bd483d69d35de8d48f4c1fa87152f2d8cc91a34c4efd52"},"schema_version":"1.0","source":{"id":"1503.03175","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.03175","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1503.03175v1","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03175","created_at":"2026-05-18T00:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"F4A3QHXLNBES","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"F4A3QHXLNBESJL5G","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"F4A3QHXL","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:06f963545d0c89050001579aa67d45f8129c57dd1ca692fc800a66e73ead7423","target":"graph","created_at":"2026-05-18T00:45:22Z","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 presents a comparative analysis of the performance of the Incremental Ant Colony algorithm for continuous optimization ($IACO_\\mathbb{R}$), with different algorithms provided in the NLopt library. The key objective is to understand how the various algorithms in the NLopt library perform in combination with the Multi Trajectory Local Search (Mtsls1) technique. A hybrid approach has been introduced in the local search strategy by the use of a parameter which allows for probabilistic selection between Mtsls1 and a NLopt algorithm. In case of stagnation, the algorithm switch is made bas","authors_text":"Jayadeva, Sumit Soman, Udit Kumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-03-11T04:59:12Z","title":"Benchmarking NLopt and state-of-art algorithms for Continuous Global Optimization via Hybrid IACO$_\\mathbb{R}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03175","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:ab7eb6d1e9bcf6b56532ade6c4225685cf6999dedee6ef0eba6440ba14bccf19","target":"record","created_at":"2026-05-18T00:45:22Z","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":"cb13c2cbd8b1c73b31bc5a4d8a97e2c7eb66f74da9f5ec72e22c4e728a0712ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-03-11T04:59:12Z","title_canon_sha256":"20f5e8a79b9f62cc17bd483d69d35de8d48f4c1fa87152f2d8cc91a34c4efd52"},"schema_version":"1.0","source":{"id":"1503.03175","kind":"arxiv","version":1}},"canonical_sha256":"2f01b81eeb684924afa653d04eb73f6432e0fc896df38bc92b472785c2e31fe7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f01b81eeb684924afa653d04eb73f6432e0fc896df38bc92b472785c2e31fe7","first_computed_at":"2026-05-18T00:45:22.725648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:22.725648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rOuTRxoJmY1XEzpZQIdMIgxG6kkcAxkGn4b8yGn0+7D5wUXa9KxvPtpBGb6iFFDwk8EJU6SD9S2DaeUxoYEyAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:22.726110Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.03175","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab7eb6d1e9bcf6b56532ade6c4225685cf6999dedee6ef0eba6440ba14bccf19","sha256:06f963545d0c89050001579aa67d45f8129c57dd1ca692fc800a66e73ead7423"],"state_sha256":"aeed06eb57706ad73f2b9f2dc086bd922bb8038779486e53ab455cf98b6b6ae8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3rHhOPNAg6gP13i73siJB0DTsCYVLXDOs035jW/aC5z34pmHiXECqZvbHt9x7vfcStDoe9ohXGzkwBQMnq92Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:07:22.668015Z","bundle_sha256":"43ec140dfeae5008945b7d5f939190ecf75d983073dceca23a445d1e451ba634"}}