{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TY43QEALQH4MRA63FWNSG6VAS2","short_pith_number":"pith:TY43QEAL","canonical_record":{"source":{"id":"1408.1358","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-06T17:10:46Z","cross_cats_sorted":[],"title_canon_sha256":"0b2452d81decbf88159f8617aea63d70c9dcf4569c2b4e7f2490874d48395039","abstract_canon_sha256":"553b5c6ac8197effbc6405a3301cca59bc8d293a46716e8ed365bc8a0c3cac12"},"schema_version":"1.0"},"canonical_sha256":"9e39b8100b81f8c883db2d9b237aa096b92b9f88d492ae8f328f46b284bd45e6","source":{"kind":"arxiv","id":"1408.1358","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1358","created_at":"2026-05-18T02:45:41Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1358v1","created_at":"2026-05-18T02:45:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1358","created_at":"2026-05-18T02:45:41Z"},{"alias_kind":"pith_short_12","alias_value":"TY43QEALQH4M","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TY43QEALQH4MRA63","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TY43QEAL","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TY43QEALQH4MRA63FWNSG6VAS2","target":"record","payload":{"canonical_record":{"source":{"id":"1408.1358","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-06T17:10:46Z","cross_cats_sorted":[],"title_canon_sha256":"0b2452d81decbf88159f8617aea63d70c9dcf4569c2b4e7f2490874d48395039","abstract_canon_sha256":"553b5c6ac8197effbc6405a3301cca59bc8d293a46716e8ed365bc8a0c3cac12"},"schema_version":"1.0"},"canonical_sha256":"9e39b8100b81f8c883db2d9b237aa096b92b9f88d492ae8f328f46b284bd45e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:41.486397Z","signature_b64":"gxOF/6si8Y1y8IV2ZlMFIlp/hM4zcdR/wKN4RY1cYSK8rYX8fTjmXVBgm2Rh3YwyXO9PnZdiOCwe1M1HKW0FCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e39b8100b81f8c883db2d9b237aa096b92b9f88d492ae8f328f46b284bd45e6","last_reissued_at":"2026-05-18T02:45:41.485919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:41.485919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.1358","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:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MmcKa9MDouJLxNpYD9X2N840dMxvq9oiZ0WCojbvw8Zm6zj1chvH3O+CjCJP6/t+KDRCrkiBzIhmnzthJFF/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:36:04.323620Z"},"content_sha256":"1cd6cec5b3228bb2efd93a28dfafa703a8da020000811800a7e78ee1c6f27877","schema_version":"1.0","event_id":"sha256:1cd6cec5b3228bb2efd93a28dfafa703a8da020000811800a7e78ee1c6f27877"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TY43QEALQH4MRA63FWNSG6VAS2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An intelligent routing approach using genetic algorithms for quality 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-06T17:10:46Z","abstract_excerpt":"Intelligent routing in networks has opened up many challenges in modelling and methods, over the past decade. Many techniques do exist for routing on such an environment where path determination was carried out by advertisement, position and near-optimum node selection schemes. In this paper, an efficient routing scheme has been proposed using genetic algorithm for a grade-based two-level node selection method. This method assumes that nodes have the knowledge of its environment and is capable of taking decision for route discovery. The data learnt from the topology which is under consideratio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1358","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:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IjgOKrQwGGsv6aoL8paqnqOPZzCrQvTuWY/zxLXu+HkjAKNZsXEXafud5U1eqjxZKCTc6egFtn1x7ex0RED3DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:36:04.323959Z"},"content_sha256":"7305f2b067375b65f8d8c65659c3b9a92a9d909d50fffef1040d6b65f3f8a969","schema_version":"1.0","event_id":"sha256:7305f2b067375b65f8d8c65659c3b9a92a9d909d50fffef1040d6b65f3f8a969"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TY43QEALQH4MRA63FWNSG6VAS2/bundle.json","state_url":"https://pith.science/pith/TY43QEALQH4MRA63FWNSG6VAS2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TY43QEALQH4MRA63FWNSG6VAS2/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-30T08:36:04Z","links":{"resolver":"https://pith.science/pith/TY43QEALQH4MRA63FWNSG6VAS2","bundle":"https://pith.science/pith/TY43QEALQH4MRA63FWNSG6VAS2/bundle.json","state":"https://pith.science/pith/TY43QEALQH4MRA63FWNSG6VAS2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TY43QEALQH4MRA63FWNSG6VAS2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TY43QEALQH4MRA63FWNSG6VAS2","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":"553b5c6ac8197effbc6405a3301cca59bc8d293a46716e8ed365bc8a0c3cac12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-06T17:10:46Z","title_canon_sha256":"0b2452d81decbf88159f8617aea63d70c9dcf4569c2b4e7f2490874d48395039"},"schema_version":"1.0","source":{"id":"1408.1358","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1358","created_at":"2026-05-18T02:45:41Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1358v1","created_at":"2026-05-18T02:45:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1358","created_at":"2026-05-18T02:45:41Z"},{"alias_kind":"pith_short_12","alias_value":"TY43QEALQH4M","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TY43QEALQH4MRA63","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TY43QEAL","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:7305f2b067375b65f8d8c65659c3b9a92a9d909d50fffef1040d6b65f3f8a969","target":"graph","created_at":"2026-05-18T02:45:41Z","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":"Intelligent routing in networks has opened up many challenges in modelling and methods, over the past decade. Many techniques do exist for routing on such an environment where path determination was carried out by advertisement, position and near-optimum node selection schemes. In this paper, an efficient routing scheme has been proposed using genetic algorithm for a grade-based two-level node selection method. This method assumes that nodes have the knowledge of its environment and is capable of taking decision for route discovery. The data learnt from the topology which is under consideratio","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-06T17:10:46Z","title":"An intelligent routing approach using genetic algorithms for quality graded network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1358","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:1cd6cec5b3228bb2efd93a28dfafa703a8da020000811800a7e78ee1c6f27877","target":"record","created_at":"2026-05-18T02:45:41Z","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":"553b5c6ac8197effbc6405a3301cca59bc8d293a46716e8ed365bc8a0c3cac12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-06T17:10:46Z","title_canon_sha256":"0b2452d81decbf88159f8617aea63d70c9dcf4569c2b4e7f2490874d48395039"},"schema_version":"1.0","source":{"id":"1408.1358","kind":"arxiv","version":1}},"canonical_sha256":"9e39b8100b81f8c883db2d9b237aa096b92b9f88d492ae8f328f46b284bd45e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e39b8100b81f8c883db2d9b237aa096b92b9f88d492ae8f328f46b284bd45e6","first_computed_at":"2026-05-18T02:45:41.485919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:41.485919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gxOF/6si8Y1y8IV2ZlMFIlp/hM4zcdR/wKN4RY1cYSK8rYX8fTjmXVBgm2Rh3YwyXO9PnZdiOCwe1M1HKW0FCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:41.486397Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1358","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cd6cec5b3228bb2efd93a28dfafa703a8da020000811800a7e78ee1c6f27877","sha256:7305f2b067375b65f8d8c65659c3b9a92a9d909d50fffef1040d6b65f3f8a969"],"state_sha256":"b1e2403e0e6bbcc3b6981f57dd18fd2ac0e5d7f612d63fe060d207b143a2be4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GqECFdY2CkVDdw4cywOeeUgNRbVM6WwPrNDB5/vsD7Q94kkoEXfVeKrWvrYi0TjE2Vrgx7uTs1YLfyrEOUXfDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:36:04.325885Z","bundle_sha256":"1191456956bfd25e65f37f40ac95cefa3f15e1a5ec2459bffd677fc83844620e"}}