{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:POAVO4UIE4BOHKJTW3BL2SFMJ4","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":"b76ef5c6044ede26aaf718af6ddaf9f944629e3a3bf73faca266c50d234068f4","cross_cats_sorted":[],"license":"","primary_cat":"cs.NI","submitted_at":"2007-11-20T09:53:40Z","title_canon_sha256":"5fbc18f76adf4b5bc81c391bae1a2d74c343aad6679816a801a3c28ca35b7cd6"},"schema_version":"1.0","source":{"id":"0711.3099","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0711.3099","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0711.3099v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0711.3099","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"POAVO4UIE4BO","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"POAVO4UIE4BOHKJT","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"POAVO4UI","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:dc66fd46240698a8a0f99e69913ca6128948dc0e0ce82804f40c9e76c84d2284","target":"graph","created_at":"2026-05-18T00:57:58Z","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 ad hoc networks scalability is a critical requirement if these technologies have to reach their full potential. Most of the proposed routing protocols do not operate efficiently with networks of more than a few hundred nodes. In this paper, we propose an augmented tree-based address space structure and a hierarchical multi-path routing protocol, referred to as Augmented Tree-based Routing (ATR), which utilizes such a structure in order to solve the scalability problem and to gain good resilience against node failure/mobility and link congestion/instability. Simulation results and performanc","authors_text":"Giancarlo Ferraiuolo, Luigi Paura, Marcello Caleffi","cross_cats":[],"headline":"","license":"","primary_cat":"cs.NI","submitted_at":"2007-11-20T09:53:40Z","title":"Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0711.3099","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:4aa2484ca6bbfe973d620e323731cd627e86ba380e26189e0a6bcbf816b71db7","target":"record","created_at":"2026-05-18T00:57:58Z","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":"b76ef5c6044ede26aaf718af6ddaf9f944629e3a3bf73faca266c50d234068f4","cross_cats_sorted":[],"license":"","primary_cat":"cs.NI","submitted_at":"2007-11-20T09:53:40Z","title_canon_sha256":"5fbc18f76adf4b5bc81c391bae1a2d74c343aad6679816a801a3c28ca35b7cd6"},"schema_version":"1.0","source":{"id":"0711.3099","kind":"arxiv","version":1}},"canonical_sha256":"7b815772882702e3a933b6c2bd48ac4f06ec8f6e826ba6dac79b9c5f943ff193","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b815772882702e3a933b6c2bd48ac4f06ec8f6e826ba6dac79b9c5f943ff193","first_computed_at":"2026-05-18T00:57:58.802140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:58.802140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hFKWQ68HNlFdbglLaVChQatxaJeLukSx02sBtruTuduOcMeDDbrZfRCJh/7gxprIBl9JrXUZdUvLUVkRL264AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:58.802605Z","signed_message":"canonical_sha256_bytes"},"source_id":"0711.3099","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4aa2484ca6bbfe973d620e323731cd627e86ba380e26189e0a6bcbf816b71db7","sha256:dc66fd46240698a8a0f99e69913ca6128948dc0e0ce82804f40c9e76c84d2284"],"state_sha256":"32985b5cb9548d389c94f8a1715a13e239c575b8d7162618edb2a80850f830ac"}