{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ROC66APCEZX2UXMLV2X6VWX55Z","short_pith_number":"pith:ROC66APC","canonical_record":{"source":{"id":"1408.1052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-05T18:02:25Z","cross_cats_sorted":[],"title_canon_sha256":"48d985fc18712c6610bb5f9ed3c3bcd1f70bf4395b1f803c6c8e28f2de425c37","abstract_canon_sha256":"ce2eeb3aaa18d5f272854138eb30db3d504bd4509b3c314f33f83412c322b95c"},"schema_version":"1.0"},"canonical_sha256":"8b85ef01e2266faa5d8baeafeadafdee68670bc7a61b41451de78c70b3862087","source":{"kind":"arxiv","id":"1408.1052","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1052","created_at":"2026-05-18T02:45:49Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1052v1","created_at":"2026-05-18T02:45:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1052","created_at":"2026-05-18T02:45:49Z"},{"alias_kind":"pith_short_12","alias_value":"ROC66APCEZX2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"ROC66APCEZX2UXML","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"ROC66APC","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ROC66APCEZX2UXMLV2X6VWX55Z","target":"record","payload":{"canonical_record":{"source":{"id":"1408.1052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-05T18:02:25Z","cross_cats_sorted":[],"title_canon_sha256":"48d985fc18712c6610bb5f9ed3c3bcd1f70bf4395b1f803c6c8e28f2de425c37","abstract_canon_sha256":"ce2eeb3aaa18d5f272854138eb30db3d504bd4509b3c314f33f83412c322b95c"},"schema_version":"1.0"},"canonical_sha256":"8b85ef01e2266faa5d8baeafeadafdee68670bc7a61b41451de78c70b3862087","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:49.121013Z","signature_b64":"fY2YV6stZfA/azLDVwbKW6263mMUx6a7xJIc3Flh7DZ5Sl1ummuYG3wK7sZU4446jbYdcgPvPntnuxEimeJuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b85ef01e2266faa5d8baeafeadafdee68670bc7a61b41451de78c70b3862087","last_reissued_at":"2026-05-18T02:45:49.120640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:49.120640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.1052","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:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fj5HSavrjlcXp/BZfTCgES08vTNbA0BtO/8aJAA5MkT50pnsDzaRXmoU64WImFMTX0XyNadB2jUVibRruIclBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:05:43.831300Z"},"content_sha256":"40469db87274a5a4584e3dd039f9f420df503b7889280b6646bdf16d43495e9b","schema_version":"1.0","event_id":"sha256:40469db87274a5a4584e3dd039f9f420df503b7889280b6646bdf16d43495e9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ROC66APCEZX2UXMLV2X6VWX55Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal path selection in Graded network using Artificial Bee Colony algorithm with Agent enabled Information","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:02:25Z","abstract_excerpt":"In this paper we propose a network aware approach for routing in graded network using Artificial Bee Colony (ABC) algorithm. ABC has been used as a good search process for optimality exploitation and exploration. The paper shows how ABC approach has been utilized for determining the optimal path based on bandwidth availability of the link and how it outperformed non graded network while deriving the optimal path. The selection of the nodes is based on the direction of the destination node also. This would help in narrowing down the number of nodes participating in routing. Here an agent system"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1052","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:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"arTVp02YKD+daq5WGMp8G6h3IJThBOgqo9lnEea0EgDVbfzOl02nZgn53yLFjSGuDKtBHzSRlRHjmvHBjCakDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:05:43.832083Z"},"content_sha256":"ca4ca114da5e4845d895ab276b81692dc9bc3945e641c14747db14061f2eff59","schema_version":"1.0","event_id":"sha256:ca4ca114da5e4845d895ab276b81692dc9bc3945e641c14747db14061f2eff59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ROC66APCEZX2UXMLV2X6VWX55Z/bundle.json","state_url":"https://pith.science/pith/ROC66APCEZX2UXMLV2X6VWX55Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ROC66APCEZX2UXMLV2X6VWX55Z/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-30T22:05:43Z","links":{"resolver":"https://pith.science/pith/ROC66APCEZX2UXMLV2X6VWX55Z","bundle":"https://pith.science/pith/ROC66APCEZX2UXMLV2X6VWX55Z/bundle.json","state":"https://pith.science/pith/ROC66APCEZX2UXMLV2X6VWX55Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ROC66APCEZX2UXMLV2X6VWX55Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ROC66APCEZX2UXMLV2X6VWX55Z","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":"ce2eeb3aaa18d5f272854138eb30db3d504bd4509b3c314f33f83412c322b95c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-05T18:02:25Z","title_canon_sha256":"48d985fc18712c6610bb5f9ed3c3bcd1f70bf4395b1f803c6c8e28f2de425c37"},"schema_version":"1.0","source":{"id":"1408.1052","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1052","created_at":"2026-05-18T02:45:49Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1052v1","created_at":"2026-05-18T02:45:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1052","created_at":"2026-05-18T02:45:49Z"},{"alias_kind":"pith_short_12","alias_value":"ROC66APCEZX2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"ROC66APCEZX2UXML","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"ROC66APC","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:ca4ca114da5e4845d895ab276b81692dc9bc3945e641c14747db14061f2eff59","target":"graph","created_at":"2026-05-18T02:45: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":"In this paper we propose a network aware approach for routing in graded network using Artificial Bee Colony (ABC) algorithm. ABC has been used as a good search process for optimality exploitation and exploration. The paper shows how ABC approach has been utilized for determining the optimal path based on bandwidth availability of the link and how it outperformed non graded network while deriving the optimal path. The selection of the nodes is based on the direction of the destination node also. This would help in narrowing down the number of nodes participating in routing. Here an agent system","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:02:25Z","title":"Optimal path selection in Graded network using Artificial Bee Colony algorithm with Agent enabled Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1052","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:40469db87274a5a4584e3dd039f9f420df503b7889280b6646bdf16d43495e9b","target":"record","created_at":"2026-05-18T02:45: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":"ce2eeb3aaa18d5f272854138eb30db3d504bd4509b3c314f33f83412c322b95c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-05T18:02:25Z","title_canon_sha256":"48d985fc18712c6610bb5f9ed3c3bcd1f70bf4395b1f803c6c8e28f2de425c37"},"schema_version":"1.0","source":{"id":"1408.1052","kind":"arxiv","version":1}},"canonical_sha256":"8b85ef01e2266faa5d8baeafeadafdee68670bc7a61b41451de78c70b3862087","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b85ef01e2266faa5d8baeafeadafdee68670bc7a61b41451de78c70b3862087","first_computed_at":"2026-05-18T02:45:49.120640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:49.120640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fY2YV6stZfA/azLDVwbKW6263mMUx6a7xJIc3Flh7DZ5Sl1ummuYG3wK7sZU4446jbYdcgPvPntnuxEimeJuBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:49.121013Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1052","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40469db87274a5a4584e3dd039f9f420df503b7889280b6646bdf16d43495e9b","sha256:ca4ca114da5e4845d895ab276b81692dc9bc3945e641c14747db14061f2eff59"],"state_sha256":"92ae43a89ff983cb953512ad6469dab98ccdc2be1897867e7a73643cacb290ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bymlfwnOo4vLpty5EtMurbMvQgXeN019gtf4KcOftqMHGMciPaL/vJaZSconZ/oilIbHux29uZ8kkwow+70yDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:05:43.836456Z","bundle_sha256":"cbae1864d600be7989c76546b29a7f658dd7ad5793c4d6e05aa625a62b25f328"}}