{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:52DGDQMGBY2ZWNF6VOY34NHLF2","short_pith_number":"pith:52DGDQMG","canonical_record":{"source":{"id":"1203.6713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-30T05:03:15Z","cross_cats_sorted":[],"title_canon_sha256":"23c0a088c7f304376d36999322e43bbac2ad258de2e47c5650bbfaa0cb84e0ed","abstract_canon_sha256":"e5fcd74a4ad1c1e978ca4d5c4c125168369b58f2d7540a07d97fa159c44e0991"},"schema_version":"1.0"},"canonical_sha256":"ee8661c1860e359b34beabb1be34eb2eb8157cd46cd811fcc3c9e229808ae786","source":{"kind":"arxiv","id":"1203.6713","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.6713","created_at":"2026-05-18T03:59:00Z"},{"alias_kind":"arxiv_version","alias_value":"1203.6713v1","created_at":"2026-05-18T03:59:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6713","created_at":"2026-05-18T03:59:00Z"},{"alias_kind":"pith_short_12","alias_value":"52DGDQMGBY2Z","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"52DGDQMGBY2ZWNF6","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"52DGDQMG","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:52DGDQMGBY2ZWNF6VOY34NHLF2","target":"record","payload":{"canonical_record":{"source":{"id":"1203.6713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-30T05:03:15Z","cross_cats_sorted":[],"title_canon_sha256":"23c0a088c7f304376d36999322e43bbac2ad258de2e47c5650bbfaa0cb84e0ed","abstract_canon_sha256":"e5fcd74a4ad1c1e978ca4d5c4c125168369b58f2d7540a07d97fa159c44e0991"},"schema_version":"1.0"},"canonical_sha256":"ee8661c1860e359b34beabb1be34eb2eb8157cd46cd811fcc3c9e229808ae786","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:00.897917Z","signature_b64":"BeQ5UOsa3aI8YdBe9FnbcBQQgp5XzUeOlUnDBQFG5pOMsifozDJTkOy/59aaNrBly0xanzB75/FKP6iPMHXACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee8661c1860e359b34beabb1be34eb2eb8157cd46cd811fcc3c9e229808ae786","last_reissued_at":"2026-05-18T03:59:00.897150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:00.897150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.6713","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-18T03:59:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vHJxGqZjXpCjwtirWM0XKvhoT0YoSujBZFieo6UJzC3NU2jfzJuHbMPJ4Si+HQGcCtLj+aXUC+eUwcnnLNatCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:41:41.520261Z"},"content_sha256":"5fb2264a87c884e0a559a835de763f7de9d964e795ad55453688f948528f0aec","schema_version":"1.0","event_id":"sha256:5fb2264a87c884e0a559a835de763f7de9d964e795ad55453688f948528f0aec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:52DGDQMGBY2ZWNF6VOY34NHLF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Application of Genetic Algorithm on Quality Graded Networks for Intelligent Routing","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":"2012-03-30T05:03:15Z","abstract_excerpt":"In the past decade, significant research has been carried out for realizing intelligent network routing using advertisement, position and near-optimum node selection schemes. In this paper, a grade-based two-level node selection method along with genetic algorithm (GA) is proposed for realizing an efficient routing scheme. This method assumes that the nodes are intelligent and that there exists a knowledge base about the environment in their local memory. There are two levels for approaching the effective route selection process through grading. At the first level, grade-based selection is app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6713","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-18T03:59:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S9QADvXxRSKjBnbZSLbdnMObW9p427Xs1ZvdssRuGmQ7KpCYGpbpwGGhlFrDaP49EZiCuhJxSq4wyNm2CJsQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:41:41.520626Z"},"content_sha256":"64ebed36966205a4f1242150960449afc1ea0123ec1dab953952e75a7b412562","schema_version":"1.0","event_id":"sha256:64ebed36966205a4f1242150960449afc1ea0123ec1dab953952e75a7b412562"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/52DGDQMGBY2ZWNF6VOY34NHLF2/bundle.json","state_url":"https://pith.science/pith/52DGDQMGBY2ZWNF6VOY34NHLF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/52DGDQMGBY2ZWNF6VOY34NHLF2/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-31T08:41:41Z","links":{"resolver":"https://pith.science/pith/52DGDQMGBY2ZWNF6VOY34NHLF2","bundle":"https://pith.science/pith/52DGDQMGBY2ZWNF6VOY34NHLF2/bundle.json","state":"https://pith.science/pith/52DGDQMGBY2ZWNF6VOY34NHLF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/52DGDQMGBY2ZWNF6VOY34NHLF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:52DGDQMGBY2ZWNF6VOY34NHLF2","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":"e5fcd74a4ad1c1e978ca4d5c4c125168369b58f2d7540a07d97fa159c44e0991","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-30T05:03:15Z","title_canon_sha256":"23c0a088c7f304376d36999322e43bbac2ad258de2e47c5650bbfaa0cb84e0ed"},"schema_version":"1.0","source":{"id":"1203.6713","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.6713","created_at":"2026-05-18T03:59:00Z"},{"alias_kind":"arxiv_version","alias_value":"1203.6713v1","created_at":"2026-05-18T03:59:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6713","created_at":"2026-05-18T03:59:00Z"},{"alias_kind":"pith_short_12","alias_value":"52DGDQMGBY2Z","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"52DGDQMGBY2ZWNF6","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"52DGDQMG","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:64ebed36966205a4f1242150960449afc1ea0123ec1dab953952e75a7b412562","target":"graph","created_at":"2026-05-18T03:59:00Z","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 the past decade, significant research has been carried out for realizing intelligent network routing using advertisement, position and near-optimum node selection schemes. In this paper, a grade-based two-level node selection method along with genetic algorithm (GA) is proposed for realizing an efficient routing scheme. This method assumes that the nodes are intelligent and that there exists a knowledge base about the environment in their local memory. There are two levels for approaching the effective route selection process through grading. At the first level, grade-based selection is app","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":"2012-03-30T05:03:15Z","title":"Application of Genetic Algorithm on Quality Graded Networks for Intelligent Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6713","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:5fb2264a87c884e0a559a835de763f7de9d964e795ad55453688f948528f0aec","target":"record","created_at":"2026-05-18T03:59:00Z","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":"e5fcd74a4ad1c1e978ca4d5c4c125168369b58f2d7540a07d97fa159c44e0991","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-30T05:03:15Z","title_canon_sha256":"23c0a088c7f304376d36999322e43bbac2ad258de2e47c5650bbfaa0cb84e0ed"},"schema_version":"1.0","source":{"id":"1203.6713","kind":"arxiv","version":1}},"canonical_sha256":"ee8661c1860e359b34beabb1be34eb2eb8157cd46cd811fcc3c9e229808ae786","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee8661c1860e359b34beabb1be34eb2eb8157cd46cd811fcc3c9e229808ae786","first_computed_at":"2026-05-18T03:59:00.897150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:00.897150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BeQ5UOsa3aI8YdBe9FnbcBQQgp5XzUeOlUnDBQFG5pOMsifozDJTkOy/59aaNrBly0xanzB75/FKP6iPMHXACQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:00.897917Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.6713","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fb2264a87c884e0a559a835de763f7de9d964e795ad55453688f948528f0aec","sha256:64ebed36966205a4f1242150960449afc1ea0123ec1dab953952e75a7b412562"],"state_sha256":"bcc435418b41faf2d367496acfaf8fdcde39184182fa454324f1f19602eb58be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E5scfBXvNlOaXkverj/7WN+4pd7n/GfigZqGkiN6rosGusaZg6gW2UfpYxupaIWjXcTdxT5xJvqa/BFKmAfRDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:41:41.522899Z","bundle_sha256":"58dbc653f84f9df16deec7ca597e03a9a2207a94638cab318184a2a74c24038d"}}