{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3R2KRK2VGNMX4CHIHEZJX2ZXSG","short_pith_number":"pith:3R2KRK2V","canonical_record":{"source":{"id":"1107.1943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-07-11T06:51:16Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"d792a19efb41431c3b9070cc8777134f2b8cb7d505bdf81a3317514e485375ba","abstract_canon_sha256":"59d199bb77f40f77389c240d6b89689f0e0742c915fa8e62411eb2c4bbbfb1ba"},"schema_version":"1.0"},"canonical_sha256":"dc74a8ab5533597e08e839329beb37919e35228d4fc11cdfcc3fe11cc42be6c8","source":{"kind":"arxiv","id":"1107.1943","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1943","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1943v1","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1943","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"3R2KRK2VGNMX","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3R2KRK2VGNMX4CHI","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3R2KRK2V","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3R2KRK2VGNMX4CHIHEZJX2ZXSG","target":"record","payload":{"canonical_record":{"source":{"id":"1107.1943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-07-11T06:51:16Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"d792a19efb41431c3b9070cc8777134f2b8cb7d505bdf81a3317514e485375ba","abstract_canon_sha256":"59d199bb77f40f77389c240d6b89689f0e0742c915fa8e62411eb2c4bbbfb1ba"},"schema_version":"1.0"},"canonical_sha256":"dc74a8ab5533597e08e839329beb37919e35228d4fc11cdfcc3fe11cc42be6c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:33.806458Z","signature_b64":"g0iIGENGfYrjIy8EATpiwCbf4Op5NrYoCJCb/DB62Z/s90Mwo1yCLsMdxpDqt2lSJ6nJwtkG+bz+jw9mFvc8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc74a8ab5533597e08e839329beb37919e35228d4fc11cdfcc3fe11cc42be6c8","last_reissued_at":"2026-05-18T04:18:33.805908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:33.805908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.1943","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-18T04:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A4e0cvOzibdPDJ7HUo7u943XYP1ci7e0lNccEn8gyUNsf7S8J1NR6Op0+wFbTy+172fbhkT0npeC8p4XkY5YDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:54:20.149833Z"},"content_sha256":"0370f2ddd57f8b61134464d17878af6b2302a4044ab4b5c743cc0443736a1259","schema_version":"1.0","event_id":"sha256:0370f2ddd57f8b61134464d17878af6b2302a4044ab4b5c743cc0443736a1259"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3R2KRK2VGNMX4CHIHEZJX2ZXSG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enhanced Genetic Algorithm approach for Solving Dynamic Shortest Path Routing Problems using Immigrants and Memory Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.NE","authors_text":"Kavitha Sooda, M. B. Yashoda, T. R. GopalaKrishnan Nair","submitted_at":"2011-07-11T06:51:16Z","abstract_excerpt":"In Internet Routing, the static shortest path (SP) problem has been addressed using well known intelligent optimization techniques like artificial neural networks, genetic algorithms (GAs) and particle swarm optimization. Advancement in wireless communication lead more and more mobile wireless networks, such as mobile networks [mobile ad hoc networks (MANETs)] and wireless sensor networks. Dynamic nature of the network is the main characteristic of MANET. Therefore, the SP routing problem in MANET turns into dynamic optimization problem (DOP). Here the nodes ae made aware of the environmental "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1943","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-18T04:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rr7rkiqQZUFEu8NQum1JefQLiE8GW6R5MQ9ftw2HdTgDjA6iyGNBQnIUUypHTa3BGRL9/aiDwc2emqbYmSrIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:54:20.150229Z"},"content_sha256":"b096fa4a0da08e2379c4e29f7c0ce75614c3c72bdd4a5c2c87620aed045a2bef","schema_version":"1.0","event_id":"sha256:b096fa4a0da08e2379c4e29f7c0ce75614c3c72bdd4a5c2c87620aed045a2bef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3R2KRK2VGNMX4CHIHEZJX2ZXSG/bundle.json","state_url":"https://pith.science/pith/3R2KRK2VGNMX4CHIHEZJX2ZXSG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3R2KRK2VGNMX4CHIHEZJX2ZXSG/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-02T12:54:20Z","links":{"resolver":"https://pith.science/pith/3R2KRK2VGNMX4CHIHEZJX2ZXSG","bundle":"https://pith.science/pith/3R2KRK2VGNMX4CHIHEZJX2ZXSG/bundle.json","state":"https://pith.science/pith/3R2KRK2VGNMX4CHIHEZJX2ZXSG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3R2KRK2VGNMX4CHIHEZJX2ZXSG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3R2KRK2VGNMX4CHIHEZJX2ZXSG","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":"59d199bb77f40f77389c240d6b89689f0e0742c915fa8e62411eb2c4bbbfb1ba","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-07-11T06:51:16Z","title_canon_sha256":"d792a19efb41431c3b9070cc8777134f2b8cb7d505bdf81a3317514e485375ba"},"schema_version":"1.0","source":{"id":"1107.1943","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1943","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1943v1","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1943","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"3R2KRK2VGNMX","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3R2KRK2VGNMX4CHI","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3R2KRK2V","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:b096fa4a0da08e2379c4e29f7c0ce75614c3c72bdd4a5c2c87620aed045a2bef","target":"graph","created_at":"2026-05-18T04:18:33Z","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 Internet Routing, the static shortest path (SP) problem has been addressed using well known intelligent optimization techniques like artificial neural networks, genetic algorithms (GAs) and particle swarm optimization. Advancement in wireless communication lead more and more mobile wireless networks, such as mobile networks [mobile ad hoc networks (MANETs)] and wireless sensor networks. Dynamic nature of the network is the main characteristic of MANET. Therefore, the SP routing problem in MANET turns into dynamic optimization problem (DOP). Here the nodes ae made aware of the environmental ","authors_text":"Kavitha Sooda, M. B. Yashoda, T. R. GopalaKrishnan Nair","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-07-11T06:51:16Z","title":"Enhanced Genetic Algorithm approach for Solving Dynamic Shortest Path Routing Problems using Immigrants and Memory Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1943","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:0370f2ddd57f8b61134464d17878af6b2302a4044ab4b5c743cc0443736a1259","target":"record","created_at":"2026-05-18T04:18:33Z","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":"59d199bb77f40f77389c240d6b89689f0e0742c915fa8e62411eb2c4bbbfb1ba","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-07-11T06:51:16Z","title_canon_sha256":"d792a19efb41431c3b9070cc8777134f2b8cb7d505bdf81a3317514e485375ba"},"schema_version":"1.0","source":{"id":"1107.1943","kind":"arxiv","version":1}},"canonical_sha256":"dc74a8ab5533597e08e839329beb37919e35228d4fc11cdfcc3fe11cc42be6c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc74a8ab5533597e08e839329beb37919e35228d4fc11cdfcc3fe11cc42be6c8","first_computed_at":"2026-05-18T04:18:33.805908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:33.805908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g0iIGENGfYrjIy8EATpiwCbf4Op5NrYoCJCb/DB62Z/s90Mwo1yCLsMdxpDqt2lSJ6nJwtkG+bz+jw9mFvc8Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:33.806458Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.1943","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0370f2ddd57f8b61134464d17878af6b2302a4044ab4b5c743cc0443736a1259","sha256:b096fa4a0da08e2379c4e29f7c0ce75614c3c72bdd4a5c2c87620aed045a2bef"],"state_sha256":"b2ccb93e505fa73b46432cf7316178c1c57c6d8e32bac74971733f980a6eba74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bYcKFwbhKeniwrH4FHDmgwIfOGobcmoHNMVq5otJ66cI2N8t05qJDX1hVvGgyvqS+H4T5nPPpACM0uh+MLisDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:54:20.152613Z","bundle_sha256":"b759aeb8597376d126b7c3f98ec8b41072165b0053f002d200fba20c0d3b215b"}}