{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QY6YKMIFVP7YDHWUACJCZ4EYGB","short_pith_number":"pith:QY6YKMIF","canonical_record":{"source":{"id":"1109.3997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-19T11:11:57Z","cross_cats_sorted":[],"title_canon_sha256":"2496c29f814898fda076f1f560b4328aa0589b84c6b30a763fc815c09b33c60c","abstract_canon_sha256":"27dbb32140a190c87fe1f98e56abb513cb41733ada76213957a32b4904a11081"},"schema_version":"1.0"},"canonical_sha256":"863d853105abff819ed400922cf0983055f5ac2d8e75e071ae47dfdbf29db8a2","source":{"kind":"arxiv","id":"1109.3997","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3997","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3997v1","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3997","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"pith_short_12","alias_value":"QY6YKMIFVP7Y","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QY6YKMIFVP7YDHWU","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QY6YKMIF","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QY6YKMIFVP7YDHWUACJCZ4EYGB","target":"record","payload":{"canonical_record":{"source":{"id":"1109.3997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-19T11:11:57Z","cross_cats_sorted":[],"title_canon_sha256":"2496c29f814898fda076f1f560b4328aa0589b84c6b30a763fc815c09b33c60c","abstract_canon_sha256":"27dbb32140a190c87fe1f98e56abb513cb41733ada76213957a32b4904a11081"},"schema_version":"1.0"},"canonical_sha256":"863d853105abff819ed400922cf0983055f5ac2d8e75e071ae47dfdbf29db8a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:45.382338Z","signature_b64":"YkeDrjfzw4oh27iPqXrkadxctAsNyMWa2uSgYBI2GQzid2rchmaYXlTvWiTjCvxpIhOj80b9fHEIVf2lW0OAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"863d853105abff819ed400922cf0983055f5ac2d8e75e071ae47dfdbf29db8a2","last_reissued_at":"2026-05-18T04:12:45.381852Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:45.381852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.3997","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":"J26MhF82xXsAsY3fUM1lM73kTZmF7sJRu+CHC6Y9UrGSjJfmaDMGZ43chuDkOKytIhO9o5gia4uSzmothjqNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T18:54:35.060474Z"},"content_sha256":"96df7d1c2924c7b7cfb464c6c81f4c1d045f01250dc8e85ac3174ad29940d745","schema_version":"1.0","event_id":"sha256:96df7d1c2924c7b7cfb464c6c81f4c1d045f01250dc8e85ac3174ad29940d745"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QY6YKMIFVP7YDHWUACJCZ4EYGB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lowest-ID with Adaptive ID Reassignment: A Novel Mobile Ad-Hoc Networks Clustering Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Basilis Mamalis, Charalampos Konstantopoulos, Damianos Gavalas, Grammati Pantziou","submitted_at":"2011-09-19T11:11:57Z","abstract_excerpt":"Clustering is a promising approach for building hierarchies and simplifying the routing process in mobile ad-hoc network environments. The main objective of clustering is to identify suitable node representatives, i.e. cluster heads (CHs), to store routing and topology information and maximize clusters stability. Traditional clustering algorithms suggest CH election exclusively based on node IDs or location information and involve frequent broadcasting of control packets, even when network topology remains unchanged. More recent works take into account additional metrics (such as energy and mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3997","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":"hh3impodg/daVB2PlGy+2NjVy38xZ2foTnR2Fi2F8qL6XFOE12f3cFhmX2rMtlerOOHMo21yEIdtvoF2GahVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T18:54:35.060822Z"},"content_sha256":"9a8fef46ff9fe54a482fe2030e48566178571420c9f02d4675bd75780b7573a2","schema_version":"1.0","event_id":"sha256:9a8fef46ff9fe54a482fe2030e48566178571420c9f02d4675bd75780b7573a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QY6YKMIFVP7YDHWUACJCZ4EYGB/bundle.json","state_url":"https://pith.science/pith/QY6YKMIFVP7YDHWUACJCZ4EYGB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QY6YKMIFVP7YDHWUACJCZ4EYGB/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:54:35Z","links":{"resolver":"https://pith.science/pith/QY6YKMIFVP7YDHWUACJCZ4EYGB","bundle":"https://pith.science/pith/QY6YKMIFVP7YDHWUACJCZ4EYGB/bundle.json","state":"https://pith.science/pith/QY6YKMIFVP7YDHWUACJCZ4EYGB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QY6YKMIFVP7YDHWUACJCZ4EYGB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QY6YKMIFVP7YDHWUACJCZ4EYGB","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":"27dbb32140a190c87fe1f98e56abb513cb41733ada76213957a32b4904a11081","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-19T11:11:57Z","title_canon_sha256":"2496c29f814898fda076f1f560b4328aa0589b84c6b30a763fc815c09b33c60c"},"schema_version":"1.0","source":{"id":"1109.3997","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3997","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3997v1","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3997","created_at":"2026-05-18T04:12:45Z"},{"alias_kind":"pith_short_12","alias_value":"QY6YKMIFVP7Y","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QY6YKMIFVP7YDHWU","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QY6YKMIF","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:9a8fef46ff9fe54a482fe2030e48566178571420c9f02d4675bd75780b7573a2","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":"Clustering is a promising approach for building hierarchies and simplifying the routing process in mobile ad-hoc network environments. The main objective of clustering is to identify suitable node representatives, i.e. cluster heads (CHs), to store routing and topology information and maximize clusters stability. Traditional clustering algorithms suggest CH election exclusively based on node IDs or location information and involve frequent broadcasting of control packets, even when network topology remains unchanged. More recent works take into account additional metrics (such as energy and mo","authors_text":"Basilis Mamalis, Charalampos Konstantopoulos, Damianos Gavalas, Grammati Pantziou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-19T11:11:57Z","title":"Lowest-ID with Adaptive ID Reassignment: A Novel Mobile Ad-Hoc Networks Clustering Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3997","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:96df7d1c2924c7b7cfb464c6c81f4c1d045f01250dc8e85ac3174ad29940d745","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":"27dbb32140a190c87fe1f98e56abb513cb41733ada76213957a32b4904a11081","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-19T11:11:57Z","title_canon_sha256":"2496c29f814898fda076f1f560b4328aa0589b84c6b30a763fc815c09b33c60c"},"schema_version":"1.0","source":{"id":"1109.3997","kind":"arxiv","version":1}},"canonical_sha256":"863d853105abff819ed400922cf0983055f5ac2d8e75e071ae47dfdbf29db8a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"863d853105abff819ed400922cf0983055f5ac2d8e75e071ae47dfdbf29db8a2","first_computed_at":"2026-05-18T04:12:45.381852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:45.381852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YkeDrjfzw4oh27iPqXrkadxctAsNyMWa2uSgYBI2GQzid2rchmaYXlTvWiTjCvxpIhOj80b9fHEIVf2lW0OAAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:45.382338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.3997","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96df7d1c2924c7b7cfb464c6c81f4c1d045f01250dc8e85ac3174ad29940d745","sha256:9a8fef46ff9fe54a482fe2030e48566178571420c9f02d4675bd75780b7573a2"],"state_sha256":"487e749cf1f84acf67f89998b0115298c2791f290b27c31cefb527b057a7bc51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LBkosQ/IFvTp7UasMNrQMXTaXERxkkia6jguS8lmaf41mo6zxAu+dlEGIVDa/XXMEs2w1TdPA3/HeRnMUWxWCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T18:54:35.062777Z","bundle_sha256":"693a00e5553fb223790d34bda897df964ea1d54559e8727990af1411fe06a434"}}