{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:YCG6HKTOOQAUAXPOPUSTE5JSHF","short_pith_number":"pith:YCG6HKTO","schema_version":"1.0","canonical_sha256":"c08de3aa6e7401405dee7d253275323941c2d7b12869abf3a45b937ec5d27cfa","source":{"kind":"arxiv","id":"0908.3715","version":1},"attestation_state":"computed","paper":{"title":"Overlapping Multi-hop Clustering for Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Adel Youssef, Mohamed Younis, Moustafa Youssef","submitted_at":"2009-08-26T01:43:15Z","abstract_excerpt":"Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Traditionally, clustering algorithms aim at generating a number of disjoint clusters that satisfy some criteria. In this paper, we formulate a novel clustering problem that aims at generating overlapping multi-hop clusters. Overlapping clusters are useful in many sensor network applications, including inter-cluster routing, node localization, and time synchronization protocols. We also propose a randomized, distributed multi-hop clustering algorithm (KOCA) for solving the overlapping"},"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":"0908.3715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-08-26T01:43:15Z","cross_cats_sorted":[],"title_canon_sha256":"f1b1517016b1e2c05938d04d8f797399babc45a28e20ba06dc595a9e6b88fd9e","abstract_canon_sha256":"26e7f22f607e3e268d54d72649f56be9f3106313c1bcd1db8ff1ba0c447a4454"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:54.492438Z","signature_b64":"fE5JOOjkvCYkcjeqYwfmdZpwPkLU6Dame4BB3H6w7VBvffeekqSxArq4HqEj1cF3AePPF8euXy82lD3RxgiZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c08de3aa6e7401405dee7d253275323941c2d7b12869abf3a45b937ec5d27cfa","last_reissued_at":"2026-05-18T03:28:54.491880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:54.491880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Overlapping Multi-hop Clustering for Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Adel Youssef, Mohamed Younis, Moustafa Youssef","submitted_at":"2009-08-26T01:43:15Z","abstract_excerpt":"Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Traditionally, clustering algorithms aim at generating a number of disjoint clusters that satisfy some criteria. In this paper, we formulate a novel clustering problem that aims at generating overlapping multi-hop clusters. Overlapping clusters are useful in many sensor network applications, including inter-cluster routing, node localization, and time synchronization protocols. We also propose a randomized, distributed multi-hop clustering algorithm (KOCA) for solving the overlapping"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.3715","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":"0908.3715","created_at":"2026-05-18T03:28:54.491968+00:00"},{"alias_kind":"arxiv_version","alias_value":"0908.3715v1","created_at":"2026-05-18T03:28:54.491968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.3715","created_at":"2026-05-18T03:28:54.491968+00:00"},{"alias_kind":"pith_short_12","alias_value":"YCG6HKTOOQAU","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"YCG6HKTOOQAUAXPO","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"YCG6HKTO","created_at":"2026-05-18T12:26:02.257875+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/YCG6HKTOOQAUAXPOPUSTE5JSHF","json":"https://pith.science/pith/YCG6HKTOOQAUAXPOPUSTE5JSHF.json","graph_json":"https://pith.science/api/pith-number/YCG6HKTOOQAUAXPOPUSTE5JSHF/graph.json","events_json":"https://pith.science/api/pith-number/YCG6HKTOOQAUAXPOPUSTE5JSHF/events.json","paper":"https://pith.science/paper/YCG6HKTO"},"agent_actions":{"view_html":"https://pith.science/pith/YCG6HKTOOQAUAXPOPUSTE5JSHF","download_json":"https://pith.science/pith/YCG6HKTOOQAUAXPOPUSTE5JSHF.json","view_paper":"https://pith.science/paper/YCG6HKTO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0908.3715&json=true","fetch_graph":"https://pith.science/api/pith-number/YCG6HKTOOQAUAXPOPUSTE5JSHF/graph.json","fetch_events":"https://pith.science/api/pith-number/YCG6HKTOOQAUAXPOPUSTE5JSHF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YCG6HKTOOQAUAXPOPUSTE5JSHF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YCG6HKTOOQAUAXPOPUSTE5JSHF/action/storage_attestation","attest_author":"https://pith.science/pith/YCG6HKTOOQAUAXPOPUSTE5JSHF/action/author_attestation","sign_citation":"https://pith.science/pith/YCG6HKTOOQAUAXPOPUSTE5JSHF/action/citation_signature","submit_replication":"https://pith.science/pith/YCG6HKTOOQAUAXPOPUSTE5JSHF/action/replication_record"}},"created_at":"2026-05-18T03:28:54.491968+00:00","updated_at":"2026-05-18T03:28:54.491968+00:00"}