{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OHNGEWRND3BMYTXFXDRTBXUPEZ","short_pith_number":"pith:OHNGEWRN","canonical_record":{"source":{"id":"1408.1087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-05T18:12:58Z","cross_cats_sorted":[],"title_canon_sha256":"b65ff64a4f922b0f21efb557ecd97364e202aecd2ca10303730317cbd0902175","abstract_canon_sha256":"cde741e23eddf00272febfe6e6db7ccd79cc87421d46e2f475f935aa781a054e"},"schema_version":"1.0"},"canonical_sha256":"71da625a2d1ec2cc4ee5b8e330de8f264bcd2ec07bd9c16d2173f4392c70d608","source":{"kind":"arxiv","id":"1408.1087","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1087","created_at":"2026-05-18T02:45:48Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1087v1","created_at":"2026-05-18T02:45:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1087","created_at":"2026-05-18T02:45:48Z"},{"alias_kind":"pith_short_12","alias_value":"OHNGEWRND3BM","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OHNGEWRND3BMYTXF","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OHNGEWRN","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OHNGEWRND3BMYTXFXDRTBXUPEZ","target":"record","payload":{"canonical_record":{"source":{"id":"1408.1087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-05T18:12:58Z","cross_cats_sorted":[],"title_canon_sha256":"b65ff64a4f922b0f21efb557ecd97364e202aecd2ca10303730317cbd0902175","abstract_canon_sha256":"cde741e23eddf00272febfe6e6db7ccd79cc87421d46e2f475f935aa781a054e"},"schema_version":"1.0"},"canonical_sha256":"71da625a2d1ec2cc4ee5b8e330de8f264bcd2ec07bd9c16d2173f4392c70d608","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:48.243526Z","signature_b64":"aqn1q9r/KI9cQ8o3vTM6VuGOvWv2NyGFsyAKW9nwD3VPYZtkrrysU0awrtba8MumLF9IgrETGdi/Ap5uQU77Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71da625a2d1ec2cc4ee5b8e330de8f264bcd2ec07bd9c16d2173f4392c70d608","last_reissued_at":"2026-05-18T02:45:48.243025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:48.243025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.1087","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:45:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CD8tQ6wUxjO6/n+b33Ax2G2Z3v1g3HX4UrZNV20u3QCwxuHK1d/ov15r2ts5HYqoHCKV8du8n0yuX168efGSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:20:03.844985Z"},"content_sha256":"e01e692d5984f426a38a6efcb7f2dd16dddcbf5349f226aae9dfdb416e301cde","schema_version":"1.0","event_id":"sha256:e01e692d5984f426a38a6efcb7f2dd16dddcbf5349f226aae9dfdb416e301cde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OHNGEWRND3BMYTXFXDRTBXUPEZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Competitive performance analysis of two evolutionary algorithms for routing optimization in graded network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Kavitha Sooda, T. R. GopalaKrishnan Nair","submitted_at":"2014-08-05T18:12:58Z","abstract_excerpt":"In this paper we compare the two intelligent route generation system and its performance capability in graded networks using Artificial Bee Colony (ABC) algorithm and Genetic Algorithm (GA). Both ABC and GA have found its importance in optimization technique for determining optimal path while routing operations in the network. The paper shows how ABC approach has been utilized for determining the optimal path based on bandwidth availability of the links and determines better quality paths over GA. Here the nodes participating in the routing are evaluated for their QoS metric. The nodes which s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1087","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:45:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iVXSkui1yXb7d9D5DylkjfkpVRgTQ1b9JPzW70evi5xurLiASQHaQcJP09QMZvPrbbuU7KCMXv4PVhxWvZXqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:20:03.845349Z"},"content_sha256":"7c6852c222583709ed682f81bfd104ecc1aadfa1895afca34a770ac08b850e0d","schema_version":"1.0","event_id":"sha256:7c6852c222583709ed682f81bfd104ecc1aadfa1895afca34a770ac08b850e0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OHNGEWRND3BMYTXFXDRTBXUPEZ/bundle.json","state_url":"https://pith.science/pith/OHNGEWRND3BMYTXFXDRTBXUPEZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OHNGEWRND3BMYTXFXDRTBXUPEZ/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-31T03:20:03Z","links":{"resolver":"https://pith.science/pith/OHNGEWRND3BMYTXFXDRTBXUPEZ","bundle":"https://pith.science/pith/OHNGEWRND3BMYTXFXDRTBXUPEZ/bundle.json","state":"https://pith.science/pith/OHNGEWRND3BMYTXFXDRTBXUPEZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OHNGEWRND3BMYTXFXDRTBXUPEZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OHNGEWRND3BMYTXFXDRTBXUPEZ","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":"cde741e23eddf00272febfe6e6db7ccd79cc87421d46e2f475f935aa781a054e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-05T18:12:58Z","title_canon_sha256":"b65ff64a4f922b0f21efb557ecd97364e202aecd2ca10303730317cbd0902175"},"schema_version":"1.0","source":{"id":"1408.1087","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1087","created_at":"2026-05-18T02:45:48Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1087v1","created_at":"2026-05-18T02:45:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1087","created_at":"2026-05-18T02:45:48Z"},{"alias_kind":"pith_short_12","alias_value":"OHNGEWRND3BM","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OHNGEWRND3BMYTXF","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OHNGEWRN","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:7c6852c222583709ed682f81bfd104ecc1aadfa1895afca34a770ac08b850e0d","target":"graph","created_at":"2026-05-18T02:45: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":"In this paper we compare the two intelligent route generation system and its performance capability in graded networks using Artificial Bee Colony (ABC) algorithm and Genetic Algorithm (GA). Both ABC and GA have found its importance in optimization technique for determining optimal path while routing operations in the network. The paper shows how ABC approach has been utilized for determining the optimal path based on bandwidth availability of the links and determines better quality paths over GA. Here the nodes participating in the routing are evaluated for their QoS metric. The nodes which s","authors_text":"Kavitha Sooda, T. R. GopalaKrishnan Nair","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-05T18:12:58Z","title":"Competitive performance analysis of two evolutionary algorithms for routing optimization in graded network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1087","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:e01e692d5984f426a38a6efcb7f2dd16dddcbf5349f226aae9dfdb416e301cde","target":"record","created_at":"2026-05-18T02:45: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":"cde741e23eddf00272febfe6e6db7ccd79cc87421d46e2f475f935aa781a054e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-05T18:12:58Z","title_canon_sha256":"b65ff64a4f922b0f21efb557ecd97364e202aecd2ca10303730317cbd0902175"},"schema_version":"1.0","source":{"id":"1408.1087","kind":"arxiv","version":1}},"canonical_sha256":"71da625a2d1ec2cc4ee5b8e330de8f264bcd2ec07bd9c16d2173f4392c70d608","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71da625a2d1ec2cc4ee5b8e330de8f264bcd2ec07bd9c16d2173f4392c70d608","first_computed_at":"2026-05-18T02:45:48.243025Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:48.243025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aqn1q9r/KI9cQ8o3vTM6VuGOvWv2NyGFsyAKW9nwD3VPYZtkrrysU0awrtba8MumLF9IgrETGdi/Ap5uQU77Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:48.243526Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1087","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e01e692d5984f426a38a6efcb7f2dd16dddcbf5349f226aae9dfdb416e301cde","sha256:7c6852c222583709ed682f81bfd104ecc1aadfa1895afca34a770ac08b850e0d"],"state_sha256":"1c57d9c527c3c063de19d10228f4cf3b741bdcc86f2f2e69bad0a1f21fc8c414"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pz+MZlAAIMIvWN+v6O/F8v7O68ernLLR3p3nq78G0UzHMKEt5702n6qHaKxl4XH+QkdmmYMUhkO6LasXDjmIBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:20:03.847636Z","bundle_sha256":"a96aa832e1c6996958cd9593664b9b2ad0e0c9f20d8950bf7c21c041985a254e"}}