{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2MDANGWNNG2VM3SHBOTUAJU6ZS","short_pith_number":"pith:2MDANGWN","canonical_record":{"source":{"id":"1408.1770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-08T07:14:18Z","cross_cats_sorted":[],"title_canon_sha256":"a909cc3f32fd7eaac9428ae39a72a3e96dd816ed398f3f9c6ea139da85f38135","abstract_canon_sha256":"cfce3a085b6a1cef53ca612c47818a06b26269f97246e7821eda1ad4e305ca87"},"schema_version":"1.0"},"canonical_sha256":"d306069acd69b5566e470ba740269ecc895abc694bf1085d6c12142145fd2932","source":{"kind":"arxiv","id":"1408.1770","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1770","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1770v1","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1770","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"pith_short_12","alias_value":"2MDANGWNNG2V","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2MDANGWNNG2VM3SH","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2MDANGWN","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2MDANGWNNG2VM3SHBOTUAJU6ZS","target":"record","payload":{"canonical_record":{"source":{"id":"1408.1770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-08T07:14:18Z","cross_cats_sorted":[],"title_canon_sha256":"a909cc3f32fd7eaac9428ae39a72a3e96dd816ed398f3f9c6ea139da85f38135","abstract_canon_sha256":"cfce3a085b6a1cef53ca612c47818a06b26269f97246e7821eda1ad4e305ca87"},"schema_version":"1.0"},"canonical_sha256":"d306069acd69b5566e470ba740269ecc895abc694bf1085d6c12142145fd2932","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:39.059577Z","signature_b64":"qRAaRE2BUX+a6Fu9wot0RfQZ1bBnLZOCk5FnkI8mSuSFtSIN/A6VkSB5DvXmaBvqj9nKkyCFX0G3yht/tgGkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d306069acd69b5566e470ba740269ecc895abc694bf1085d6c12142145fd2932","last_reissued_at":"2026-05-18T02:45:39.059185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:39.059185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.1770","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:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/OkHA8AitEmBrDnI+MAREuCvreZgLezDF2vGEDjwu0uJ6Af+kW63iIwDt1iAdbYCw4mBV65l/kFwK75JbRnVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:49:33.289013Z"},"content_sha256":"07348f6befdc91fe6144a371ddf86ba98cb8cfbbf7f916e9771dda6ce1737b0f","schema_version":"1.0","event_id":"sha256:07348f6befdc91fe6144a371ddf86ba98cb8cfbbf7f916e9771dda6ce1737b0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2MDANGWNNG2VM3SHBOTUAJU6ZS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A QoS based Routing Approach using Genetic Algorithms for Bandwidth Maximization in Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Kavitha Sooda, R Selvarani, T R GopalaKrishnan Nair","submitted_at":"2014-08-08T07:14:18Z","abstract_excerpt":"This paper addresses the path selection problem from a known source to the destination in dense networks. The proposed solution for route discovery uses the genetic algorithm approach for a QoS based network. The multi point crossover and mutation helps in determining the optimal path and alternate path when required. The input to the genetic algorithm is a learnt module which is a part of the cognitive router that takes care of four QoS parameters. Here the set of nodes selected for routing is determined by delay, jitter and loss. On this graded surface of nodes selected, the bandwidth parame"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1770","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:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y7PfKYjmBcS42Wekx6qxXfqxcbtVzna09UFHVZ4TexNO6BaKocDtguRq3zxSBUlnSflE6CAqfgivRZ/CeD1KBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:49:33.289667Z"},"content_sha256":"bbcc78977f675033db0edf60117212cedba5c38252f603f5a591e0c2ab13b459","schema_version":"1.0","event_id":"sha256:bbcc78977f675033db0edf60117212cedba5c38252f603f5a591e0c2ab13b459"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2MDANGWNNG2VM3SHBOTUAJU6ZS/bundle.json","state_url":"https://pith.science/pith/2MDANGWNNG2VM3SHBOTUAJU6ZS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2MDANGWNNG2VM3SHBOTUAJU6ZS/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-06-09T03:49:33Z","links":{"resolver":"https://pith.science/pith/2MDANGWNNG2VM3SHBOTUAJU6ZS","bundle":"https://pith.science/pith/2MDANGWNNG2VM3SHBOTUAJU6ZS/bundle.json","state":"https://pith.science/pith/2MDANGWNNG2VM3SHBOTUAJU6ZS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2MDANGWNNG2VM3SHBOTUAJU6ZS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2MDANGWNNG2VM3SHBOTUAJU6ZS","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":"cfce3a085b6a1cef53ca612c47818a06b26269f97246e7821eda1ad4e305ca87","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-08T07:14:18Z","title_canon_sha256":"a909cc3f32fd7eaac9428ae39a72a3e96dd816ed398f3f9c6ea139da85f38135"},"schema_version":"1.0","source":{"id":"1408.1770","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1770","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1770v1","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1770","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"pith_short_12","alias_value":"2MDANGWNNG2V","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2MDANGWNNG2VM3SH","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2MDANGWN","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:bbcc78977f675033db0edf60117212cedba5c38252f603f5a591e0c2ab13b459","target":"graph","created_at":"2026-05-18T02:45:39Z","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":"This paper addresses the path selection problem from a known source to the destination in dense networks. The proposed solution for route discovery uses the genetic algorithm approach for a QoS based network. The multi point crossover and mutation helps in determining the optimal path and alternate path when required. The input to the genetic algorithm is a learnt module which is a part of the cognitive router that takes care of four QoS parameters. Here the set of nodes selected for routing is determined by delay, jitter and loss. On this graded surface of nodes selected, the bandwidth parame","authors_text":"Kavitha Sooda, R Selvarani, T R GopalaKrishnan Nair","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-08T07:14:18Z","title":"A QoS based Routing Approach using Genetic Algorithms for Bandwidth Maximization in Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1770","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:07348f6befdc91fe6144a371ddf86ba98cb8cfbbf7f916e9771dda6ce1737b0f","target":"record","created_at":"2026-05-18T02:45:39Z","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":"cfce3a085b6a1cef53ca612c47818a06b26269f97246e7821eda1ad4e305ca87","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-08T07:14:18Z","title_canon_sha256":"a909cc3f32fd7eaac9428ae39a72a3e96dd816ed398f3f9c6ea139da85f38135"},"schema_version":"1.0","source":{"id":"1408.1770","kind":"arxiv","version":1}},"canonical_sha256":"d306069acd69b5566e470ba740269ecc895abc694bf1085d6c12142145fd2932","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d306069acd69b5566e470ba740269ecc895abc694bf1085d6c12142145fd2932","first_computed_at":"2026-05-18T02:45:39.059185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:39.059185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qRAaRE2BUX+a6Fu9wot0RfQZ1bBnLZOCk5FnkI8mSuSFtSIN/A6VkSB5DvXmaBvqj9nKkyCFX0G3yht/tgGkBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:39.059577Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1770","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07348f6befdc91fe6144a371ddf86ba98cb8cfbbf7f916e9771dda6ce1737b0f","sha256:bbcc78977f675033db0edf60117212cedba5c38252f603f5a591e0c2ab13b459"],"state_sha256":"a6ef5a08faffa99cb1e15a241211742249c628c5e3d3a10b74da239e57d8b6ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NRG55RsUTI8ze5PiFqjVjKdT+4oxsmPjrdquUGsATXpNGj4o54FmG1hRgpqFUJ9qou9e8fgTehl5nBuvk/HPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T03:49:33.293167Z","bundle_sha256":"03e6e13302f5b52aa74a3704c5130a759da621e6eac7e35d2ac10adc6f33da18"}}