{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XOOVXMT726T3MGI35HUVF5IWOF","short_pith_number":"pith:XOOVXMT7","canonical_record":{"source":{"id":"1109.3987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-19T10:14:29Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"752131e17c49a71cb47757b3051d830496aef258669cf1945e9e09b0b008d741","abstract_canon_sha256":"4511b7356fa674131f8618294f009a0609085c62414006fe685885a988c8655c"},"schema_version":"1.0"},"canonical_sha256":"bb9d5bb27fd7a7b6191be9e952f516715d311cf4f882188d2df096720dba4ab7","source":{"kind":"arxiv","id":"1109.3987","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3987","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3987v1","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3987","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"pith_short_12","alias_value":"XOOVXMT726T3","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XOOVXMT726T3MGI3","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XOOVXMT7","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XOOVXMT726T3MGI35HUVF5IWOF","target":"record","payload":{"canonical_record":{"source":{"id":"1109.3987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-19T10:14:29Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"752131e17c49a71cb47757b3051d830496aef258669cf1945e9e09b0b008d741","abstract_canon_sha256":"4511b7356fa674131f8618294f009a0609085c62414006fe685885a988c8655c"},"schema_version":"1.0"},"canonical_sha256":"bb9d5bb27fd7a7b6191be9e952f516715d311cf4f882188d2df096720dba4ab7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:45.405994Z","signature_b64":"bu5G/AK0QXFs+GAOroTWwOnz5jfte/0F/e7NYekOlsQf1aGihLsj/wrrCOsCi82xlcWdkXPff7hWVqL4YHSiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb9d5bb27fd7a7b6191be9e952f516715d311cf4f882188d2df096720dba4ab7","last_reissued_at":"2026-05-18T04:12:45.405303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:45.405303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.3987","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:12:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zf4xaiSEAlcVp3bTmjeVZM0741W+5C/GWvt/Jl+6PRkqu6i+dpVkUuQXtBmRrDvhNYbawJA4kVW8XgaQ72ONCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T18:17:41.042793Z"},"content_sha256":"e51da18f877070189aa3d0caf9bebdd1929ce4c666b2be5f8a9846b11a8eb175","schema_version":"1.0","event_id":"sha256:e51da18f877070189aa3d0caf9bebdd1929ce4c666b2be5f8a9846b11a8eb175"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XOOVXMT726T3MGI35HUVF5IWOF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustering of Mobile Ad Hoc Networks: An Adaptive Broadcast Period Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Basilis Mamalis, Charalampos Konstantopoulos, Damianos Gavalas, Grammati Pantziou","submitted_at":"2011-09-19T10:14:29Z","abstract_excerpt":"Organization, scalability and routing have been identified as key problems hindering viability and commercial success of mobile ad hoc networks. Clustering of mobile nodes among separate domains has been proposed as an efficient approach to address those issues. In this work, we introduce an efficient distributed clustering algorithm that uses both location and energy metrics for cluster formation. Our proposed solution mainly addresses cluster stability, manageability and energy efficiency issues. Also, unlike existing active clustering methods, our algorithm relieves the network from the unn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3987","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:12:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"42HAGbLw9RIeyVKTzOcbNnubz/W4FeWVrwKlZ2P2pD33DP3RTLBYh9tlh4KE+Wr3eUS2lkqX84uRPEwAXNjZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T18:17:41.043261Z"},"content_sha256":"8f75a15523b9ff01dc3deb4a001c2f45d975d06e5a82c532c8526e394087c2c3","schema_version":"1.0","event_id":"sha256:8f75a15523b9ff01dc3deb4a001c2f45d975d06e5a82c532c8526e394087c2c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XOOVXMT726T3MGI35HUVF5IWOF/bundle.json","state_url":"https://pith.science/pith/XOOVXMT726T3MGI35HUVF5IWOF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XOOVXMT726T3MGI35HUVF5IWOF/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-30T18:17:41Z","links":{"resolver":"https://pith.science/pith/XOOVXMT726T3MGI35HUVF5IWOF","bundle":"https://pith.science/pith/XOOVXMT726T3MGI35HUVF5IWOF/bundle.json","state":"https://pith.science/pith/XOOVXMT726T3MGI35HUVF5IWOF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XOOVXMT726T3MGI35HUVF5IWOF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XOOVXMT726T3MGI35HUVF5IWOF","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":"4511b7356fa674131f8618294f009a0609085c62414006fe685885a988c8655c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-19T10:14:29Z","title_canon_sha256":"752131e17c49a71cb47757b3051d830496aef258669cf1945e9e09b0b008d741"},"schema_version":"1.0","source":{"id":"1109.3987","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3987","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3987v1","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3987","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"pith_short_12","alias_value":"XOOVXMT726T3","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XOOVXMT726T3MGI3","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XOOVXMT7","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:8f75a15523b9ff01dc3deb4a001c2f45d975d06e5a82c532c8526e394087c2c3","target":"graph","created_at":"2026-05-18T04:12:45Z","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":"Organization, scalability and routing have been identified as key problems hindering viability and commercial success of mobile ad hoc networks. Clustering of mobile nodes among separate domains has been proposed as an efficient approach to address those issues. In this work, we introduce an efficient distributed clustering algorithm that uses both location and energy metrics for cluster formation. Our proposed solution mainly addresses cluster stability, manageability and energy efficiency issues. Also, unlike existing active clustering methods, our algorithm relieves the network from the unn","authors_text":"Basilis Mamalis, Charalampos Konstantopoulos, Damianos Gavalas, Grammati Pantziou","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-19T10:14:29Z","title":"Clustering of Mobile Ad Hoc Networks: An Adaptive Broadcast Period Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3987","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:e51da18f877070189aa3d0caf9bebdd1929ce4c666b2be5f8a9846b11a8eb175","target":"record","created_at":"2026-05-18T04:12:45Z","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":"4511b7356fa674131f8618294f009a0609085c62414006fe685885a988c8655c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-19T10:14:29Z","title_canon_sha256":"752131e17c49a71cb47757b3051d830496aef258669cf1945e9e09b0b008d741"},"schema_version":"1.0","source":{"id":"1109.3987","kind":"arxiv","version":1}},"canonical_sha256":"bb9d5bb27fd7a7b6191be9e952f516715d311cf4f882188d2df096720dba4ab7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb9d5bb27fd7a7b6191be9e952f516715d311cf4f882188d2df096720dba4ab7","first_computed_at":"2026-05-18T04:12:45.405303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:45.405303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bu5G/AK0QXFs+GAOroTWwOnz5jfte/0F/e7NYekOlsQf1aGihLsj/wrrCOsCi82xlcWdkXPff7hWVqL4YHSiDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:45.405994Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.3987","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e51da18f877070189aa3d0caf9bebdd1929ce4c666b2be5f8a9846b11a8eb175","sha256:8f75a15523b9ff01dc3deb4a001c2f45d975d06e5a82c532c8526e394087c2c3"],"state_sha256":"0818138ef3e1b5295d7d75d1885e012ad8d7f36df436da740b500add87a06aba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H+/fsdmi02oKK01/e3jR6qNXE7Be3sXJnP/8NyqirMttY5IAE3xHzv953/4jocDC3YoE/yKrzmF/eNqGS6fyAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T18:17:41.046336Z","bundle_sha256":"2a300eadebf8ea87cc4a34934a9b753ffa6e161c7369ebb2f793d41d2a512b4e"}}