{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:3AGF76R344AA2BPZWXCELI3HGG","short_pith_number":"pith:3AGF76R3","canonical_record":{"source":{"id":"1001.3920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2010-01-22T06:34:52Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"dc22031386c0577473814228dfb4bc9c208e04e3e58fc6731112e6aad7dbe0f1","abstract_canon_sha256":"20b19235e747750efd21a0a7ac0fbf487a103eba74480790831756d23dcfbbbf"},"schema_version":"1.0"},"canonical_sha256":"d80c5ffa3be7000d05f9b5c445a367319da6d3541a85e96c2dfcdf0b905202b1","source":{"kind":"arxiv","id":"1001.3920","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.3920","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"arxiv_version","alias_value":"1001.3920v1","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3920","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"pith_short_12","alias_value":"3AGF76R344AA","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3AGF76R344AA2BPZ","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3AGF76R3","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:3AGF76R344AA2BPZWXCELI3HGG","target":"record","payload":{"canonical_record":{"source":{"id":"1001.3920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2010-01-22T06:34:52Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"dc22031386c0577473814228dfb4bc9c208e04e3e58fc6731112e6aad7dbe0f1","abstract_canon_sha256":"20b19235e747750efd21a0a7ac0fbf487a103eba74480790831756d23dcfbbbf"},"schema_version":"1.0"},"canonical_sha256":"d80c5ffa3be7000d05f9b5c445a367319da6d3541a85e96c2dfcdf0b905202b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:58.849727Z","signature_b64":"HPKJ3VyK2AtFg5DkOXcM3F93CVVjkvwSPAKWlQsnye3NaRW+Gzo3IFA9FsIT/FaWoXz38dkTmJg+glAWh96JBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d80c5ffa3be7000d05f9b5c445a367319da6d3541a85e96c2dfcdf0b905202b1","last_reissued_at":"2026-05-18T01:04:58.849209Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:58.849209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.3920","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-18T01:04:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/RUhvdOL7hHyOmA3v4ZP5U9pVTlosc7xVZsQXXYfUn5tbkZ2Uu4kIdaYrkUYSEUcRdYtdE+KsPYh8ZLTHXppDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:01:22.572490Z"},"content_sha256":"2c473aede19a299ff10e446351aa92508ccf980fb6c42984e0b61207399af0e3","schema_version":"1.0","event_id":"sha256:2c473aede19a299ff10e446351aa92508ccf980fb6c42984e0b61207399af0e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:3AGF76R344AA2BPZWXCELI3HGG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Comparison of Genetic Algorithm and Simulated Annealing Technique for Optimal Path Selection In Network Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.NE","authors_text":"Kavitha Sooda, T.R. GopalaKrishnan nair","submitted_at":"2010-01-22T06:34:52Z","abstract_excerpt":"This paper addresses the path selection problem from a known sender to the receiver. The proposed work shows path selection using genetic algorithm(GA)and simulated annealing (SA) approaches. In genetic algorithm approach, the multi point crossover and mutation helps in determining the optimal path and also alternate path if required. The input to both the algorithms is a learnt module which is a part of the cognitive router that takes care of four QoS parameters.The aim of the approach is to maximize the bandwidth along the forward channels and minimize the route length. The population size i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3920","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-18T01:04:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WxRZ9gKW38e8FV7XGvFyj3VfSfWQq5Pva8IUmTnfqb00Q8YTofkh4I+cENe3c5FGE7yy8qR9XNzKy6DV2CAXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:01:22.572837Z"},"content_sha256":"3ee79fa126d2c40c67783d9e0184454cf000752814aa6f5ceb739305f5b020e6","schema_version":"1.0","event_id":"sha256:3ee79fa126d2c40c67783d9e0184454cf000752814aa6f5ceb739305f5b020e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3AGF76R344AA2BPZWXCELI3HGG/bundle.json","state_url":"https://pith.science/pith/3AGF76R344AA2BPZWXCELI3HGG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3AGF76R344AA2BPZWXCELI3HGG/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-30T09:01:22Z","links":{"resolver":"https://pith.science/pith/3AGF76R344AA2BPZWXCELI3HGG","bundle":"https://pith.science/pith/3AGF76R344AA2BPZWXCELI3HGG/bundle.json","state":"https://pith.science/pith/3AGF76R344AA2BPZWXCELI3HGG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3AGF76R344AA2BPZWXCELI3HGG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:3AGF76R344AA2BPZWXCELI3HGG","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":"20b19235e747750efd21a0a7ac0fbf487a103eba74480790831756d23dcfbbbf","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2010-01-22T06:34:52Z","title_canon_sha256":"dc22031386c0577473814228dfb4bc9c208e04e3e58fc6731112e6aad7dbe0f1"},"schema_version":"1.0","source":{"id":"1001.3920","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.3920","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"arxiv_version","alias_value":"1001.3920v1","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3920","created_at":"2026-05-18T01:04:58Z"},{"alias_kind":"pith_short_12","alias_value":"3AGF76R344AA","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3AGF76R344AA2BPZ","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3AGF76R3","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:3ee79fa126d2c40c67783d9e0184454cf000752814aa6f5ceb739305f5b020e6","target":"graph","created_at":"2026-05-18T01:04:58Z","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 sender to the receiver. The proposed work shows path selection using genetic algorithm(GA)and simulated annealing (SA) approaches. In genetic algorithm approach, the multi point crossover and mutation helps in determining the optimal path and also alternate path if required. The input to both the algorithms is a learnt module which is a part of the cognitive router that takes care of four QoS parameters.The aim of the approach is to maximize the bandwidth along the forward channels and minimize the route length. The population size i","authors_text":"Kavitha Sooda, T.R. GopalaKrishnan nair","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2010-01-22T06:34:52Z","title":"Comparison of Genetic Algorithm and Simulated Annealing Technique for Optimal Path Selection In Network Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3920","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:2c473aede19a299ff10e446351aa92508ccf980fb6c42984e0b61207399af0e3","target":"record","created_at":"2026-05-18T01:04:58Z","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":"20b19235e747750efd21a0a7ac0fbf487a103eba74480790831756d23dcfbbbf","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2010-01-22T06:34:52Z","title_canon_sha256":"dc22031386c0577473814228dfb4bc9c208e04e3e58fc6731112e6aad7dbe0f1"},"schema_version":"1.0","source":{"id":"1001.3920","kind":"arxiv","version":1}},"canonical_sha256":"d80c5ffa3be7000d05f9b5c445a367319da6d3541a85e96c2dfcdf0b905202b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d80c5ffa3be7000d05f9b5c445a367319da6d3541a85e96c2dfcdf0b905202b1","first_computed_at":"2026-05-18T01:04:58.849209Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:58.849209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HPKJ3VyK2AtFg5DkOXcM3F93CVVjkvwSPAKWlQsnye3NaRW+Gzo3IFA9FsIT/FaWoXz38dkTmJg+glAWh96JBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:58.849727Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.3920","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c473aede19a299ff10e446351aa92508ccf980fb6c42984e0b61207399af0e3","sha256:3ee79fa126d2c40c67783d9e0184454cf000752814aa6f5ceb739305f5b020e6"],"state_sha256":"4bbe414428acfe33ea553e1ff5c112b3fac7c32d05b4c608d526c920835cc4f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fc2tRur+zkSEh/9j0p1RHGNZiuQwddJ4MervMhbDJAyoEOxIjfoSWVQSb19XGq/AbKUhsCYPD1MmCozlcf94Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:01:22.574822Z","bundle_sha256":"440f6f8b70bb7fc58bd00ba6fb0f5b8519dee9d0204093afe5ed7f98bead8dae"}}