{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZGFCK6IHDTAHAE5XJNGE5DSGYE","short_pith_number":"pith:ZGFCK6IH","canonical_record":{"source":{"id":"1104.0355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-04-03T05:18:40Z","cross_cats_sorted":[],"title_canon_sha256":"54720c97bb772e984f500efce94a4899d8740a6c7de8a9aaf9fcf7154ea066f1","abstract_canon_sha256":"008292d1170efd8cd84ea445c15ca9a8500a20bd56f4d98682cec7e2e667f395"},"schema_version":"1.0"},"canonical_sha256":"c98a2579071cc07013b74b4c4e8e46c12bfdf7f47a85f0ecb1a619cc3860deec","source":{"kind":"arxiv","id":"1104.0355","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0355","created_at":"2026-05-18T04:25:04Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0355v1","created_at":"2026-05-18T04:25:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0355","created_at":"2026-05-18T04:25:04Z"},{"alias_kind":"pith_short_12","alias_value":"ZGFCK6IHDTAH","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZGFCK6IHDTAHAE5X","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZGFCK6IH","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZGFCK6IHDTAHAE5XJNGE5DSGYE","target":"record","payload":{"canonical_record":{"source":{"id":"1104.0355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-04-03T05:18:40Z","cross_cats_sorted":[],"title_canon_sha256":"54720c97bb772e984f500efce94a4899d8740a6c7de8a9aaf9fcf7154ea066f1","abstract_canon_sha256":"008292d1170efd8cd84ea445c15ca9a8500a20bd56f4d98682cec7e2e667f395"},"schema_version":"1.0"},"canonical_sha256":"c98a2579071cc07013b74b4c4e8e46c12bfdf7f47a85f0ecb1a619cc3860deec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:04.170332Z","signature_b64":"9Hd5SDxNKvjx+lCtbMH1mSYB8jsBQDsw/Im5a5X8qesALlb/cMCC6VVs73hLE//e0In5aynKWkyopXOH79eBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c98a2579071cc07013b74b4c4e8e46c12bfdf7f47a85f0ecb1a619cc3860deec","last_reissued_at":"2026-05-18T04:25:04.169885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:04.169885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.0355","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:25:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ayc2M9UKKaJWv4kJ+9757tvDGlqvBT4pjTOyvUvzGhkb9wV5azlbMZgeC+QMeuNG23gAdoktdScGExTUwEHQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T16:32:58.237416Z"},"content_sha256":"b4fa163f1b7c7bbde5c1bad5cd186f1bc5e02b4f7de182f4c68eac66f684a8ae","schema_version":"1.0","event_id":"sha256:b4fa163f1b7c7bbde5c1bad5cd186f1bc5e02b4f7de182f4c68eac66f684a8ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZGFCK6IHDTAHAE5XJNGE5DSGYE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Method Based on Genetic Algorithms to Solve Sensor Network Optimization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ali Movaghar, Ehsan Heidari","submitted_at":"2011-04-03T05:18:40Z","abstract_excerpt":"Minimization of the number of cluster heads in a wireless sensor network is a very important problem to reduce channel contention and to improve the efficiency of the algorithm when executed at the level of cluster-heads. In this paper, we propose an efficient method based on genetic algorithms (GAs) to solve a sensor network optimization problem. Long communication distances between sensors and a sink in a sensor network can greatly drain the energy of sensors and reduce the lifetime of a network. By clustering a sensor network into a number of independent clusters using a GA, we can greatly "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0355","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:25:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5FvjKZeHfzlMWwNzogn5UejrNnnqgmkrGf4BLT00dGyT8TbsEyCgc2hH0Wz6hexxjNANmhXauB8wyzw1g7fiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T16:32:58.237767Z"},"content_sha256":"b7f6d31f3e6d77925938b704ec8668a66c08b803f418bbd4242c6dc0fd76e1f0","schema_version":"1.0","event_id":"sha256:b7f6d31f3e6d77925938b704ec8668a66c08b803f418bbd4242c6dc0fd76e1f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZGFCK6IHDTAHAE5XJNGE5DSGYE/bundle.json","state_url":"https://pith.science/pith/ZGFCK6IHDTAHAE5XJNGE5DSGYE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZGFCK6IHDTAHAE5XJNGE5DSGYE/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-26T16:32:58Z","links":{"resolver":"https://pith.science/pith/ZGFCK6IHDTAHAE5XJNGE5DSGYE","bundle":"https://pith.science/pith/ZGFCK6IHDTAHAE5XJNGE5DSGYE/bundle.json","state":"https://pith.science/pith/ZGFCK6IHDTAHAE5XJNGE5DSGYE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZGFCK6IHDTAHAE5XJNGE5DSGYE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZGFCK6IHDTAHAE5XJNGE5DSGYE","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":"008292d1170efd8cd84ea445c15ca9a8500a20bd56f4d98682cec7e2e667f395","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-04-03T05:18:40Z","title_canon_sha256":"54720c97bb772e984f500efce94a4899d8740a6c7de8a9aaf9fcf7154ea066f1"},"schema_version":"1.0","source":{"id":"1104.0355","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0355","created_at":"2026-05-18T04:25:04Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0355v1","created_at":"2026-05-18T04:25:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0355","created_at":"2026-05-18T04:25:04Z"},{"alias_kind":"pith_short_12","alias_value":"ZGFCK6IHDTAH","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZGFCK6IHDTAHAE5X","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZGFCK6IH","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:b7f6d31f3e6d77925938b704ec8668a66c08b803f418bbd4242c6dc0fd76e1f0","target":"graph","created_at":"2026-05-18T04:25:04Z","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":"Minimization of the number of cluster heads in a wireless sensor network is a very important problem to reduce channel contention and to improve the efficiency of the algorithm when executed at the level of cluster-heads. In this paper, we propose an efficient method based on genetic algorithms (GAs) to solve a sensor network optimization problem. Long communication distances between sensors and a sink in a sensor network can greatly drain the energy of sensors and reduce the lifetime of a network. By clustering a sensor network into a number of independent clusters using a GA, we can greatly ","authors_text":"Ali Movaghar, Ehsan Heidari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-04-03T05:18:40Z","title":"An Efficient Method Based on Genetic Algorithms to Solve Sensor Network Optimization Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0355","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:b4fa163f1b7c7bbde5c1bad5cd186f1bc5e02b4f7de182f4c68eac66f684a8ae","target":"record","created_at":"2026-05-18T04:25:04Z","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":"008292d1170efd8cd84ea445c15ca9a8500a20bd56f4d98682cec7e2e667f395","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-04-03T05:18:40Z","title_canon_sha256":"54720c97bb772e984f500efce94a4899d8740a6c7de8a9aaf9fcf7154ea066f1"},"schema_version":"1.0","source":{"id":"1104.0355","kind":"arxiv","version":1}},"canonical_sha256":"c98a2579071cc07013b74b4c4e8e46c12bfdf7f47a85f0ecb1a619cc3860deec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c98a2579071cc07013b74b4c4e8e46c12bfdf7f47a85f0ecb1a619cc3860deec","first_computed_at":"2026-05-18T04:25:04.169885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:04.169885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Hd5SDxNKvjx+lCtbMH1mSYB8jsBQDsw/Im5a5X8qesALlb/cMCC6VVs73hLE//e0In5aynKWkyopXOH79eBDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:04.170332Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.0355","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4fa163f1b7c7bbde5c1bad5cd186f1bc5e02b4f7de182f4c68eac66f684a8ae","sha256:b7f6d31f3e6d77925938b704ec8668a66c08b803f418bbd4242c6dc0fd76e1f0"],"state_sha256":"3e956b5bbd72ba4620a91f939e115676f4e5e504ed6be67561e7cdb675f39962"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uQcDO9/ad21dsUYu57UQcVYrZ9LZdJdHU0xAoZG8rqcMEYmtm4hjYKpazWYmZ2pstHY5+u/+pJA2M0SpoHcaCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T16:32:58.239717Z","bundle_sha256":"9db552ba8b9ecc9ed34d8ab01d3c9d451a1dfbd516f17569fe8bebd4d3b11948"}}