{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:52DGDQMGBY2ZWNF6VOY34NHLF2","short_pith_number":"pith:52DGDQMG","schema_version":"1.0","canonical_sha256":"ee8661c1860e359b34beabb1be34eb2eb8157cd46cd811fcc3c9e229808ae786","source":{"kind":"arxiv","id":"1203.6713","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1203.6713","created_at":"2026-05-18T03:59:00.897276+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.6713v1","created_at":"2026-05-18T03:59:00.897276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6713","created_at":"2026-05-18T03:59:00.897276+00:00"},{"alias_kind":"pith_short_12","alias_value":"52DGDQMGBY2Z","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"52DGDQMGBY2ZWNF6","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"52DGDQMG","created_at":"2026-05-18T12:26:53.410803+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/52DGDQMGBY2ZWNF6VOY34NHLF2","json":"https://pith.science/pith/52DGDQMGBY2ZWNF6VOY34NHLF2.json","graph_json":"https://pith.science/api/pith-number/52DGDQMGBY2ZWNF6VOY34NHLF2/graph.json","events_json":"https://pith.science/api/pith-number/52DGDQMGBY2ZWNF6VOY34NHLF2/events.json","paper":"https://pith.science/paper/52DGDQMG"},"agent_actions":{"view_html":"https://pith.science/pith/52DGDQMGBY2ZWNF6VOY34NHLF2","download_json":"https://pith.science/pith/52DGDQMGBY2ZWNF6VOY34NHLF2.json","view_paper":"https://pith.science/paper/52DGDQMG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.6713&json=true","fetch_graph":"https://pith.science/api/pith-number/52DGDQMGBY2ZWNF6VOY34NHLF2/graph.json","fetch_events":"https://pith.science/api/pith-number/52DGDQMGBY2ZWNF6VOY34NHLF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/52DGDQMGBY2ZWNF6VOY34NHLF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/52DGDQMGBY2ZWNF6VOY34NHLF2/action/storage_attestation","attest_author":"https://pith.science/pith/52DGDQMGBY2ZWNF6VOY34NHLF2/action/author_attestation","sign_citation":"https://pith.science/pith/52DGDQMGBY2ZWNF6VOY34NHLF2/action/citation_signature","submit_replication":"https://pith.science/pith/52DGDQMGBY2ZWNF6VOY34NHLF2/action/replication_record"}},"created_at":"2026-05-18T03:59:00.897276+00:00","updated_at":"2026-05-18T03:59:00.897276+00:00"}