{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:POAVO4UIE4BOHKJTW3BL2SFMJ4","short_pith_number":"pith:POAVO4UI","schema_version":"1.0","canonical_sha256":"7b815772882702e3a933b6c2bd48ac4f06ec8f6e826ba6dac79b9c5f943ff193","source":{"kind":"arxiv","id":"0711.3099","version":1},"attestation_state":"computed","paper":{"title":"Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks","license":"","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Giancarlo Ferraiuolo, Luigi Paura, Marcello Caleffi","submitted_at":"2007-11-20T09:53:40Z","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"},"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":"0711.3099","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.NI","submitted_at":"2007-11-20T09:53:40Z","cross_cats_sorted":[],"title_canon_sha256":"5fbc18f76adf4b5bc81c391bae1a2d74c343aad6679816a801a3c28ca35b7cd6","abstract_canon_sha256":"b76ef5c6044ede26aaf718af6ddaf9f944629e3a3bf73faca266c50d234068f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.802605Z","signature_b64":"hFKWQ68HNlFdbglLaVChQatxaJeLukSx02sBtruTuduOcMeDDbrZfRCJh/7gxprIBl9JrXUZdUvLUVkRL264AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b815772882702e3a933b6c2bd48ac4f06ec8f6e826ba6dac79b9c5f943ff193","last_reissued_at":"2026-05-18T00:57:58.802140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.802140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks","license":"","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Giancarlo Ferraiuolo, Luigi Paura, Marcello Caleffi","submitted_at":"2007-11-20T09:53:40Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0711.3099","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":"0711.3099","created_at":"2026-05-18T00:57:58.802196+00:00"},{"alias_kind":"arxiv_version","alias_value":"0711.3099v1","created_at":"2026-05-18T00:57:58.802196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0711.3099","created_at":"2026-05-18T00:57:58.802196+00:00"},{"alias_kind":"pith_short_12","alias_value":"POAVO4UIE4BO","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"POAVO4UIE4BOHKJT","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"POAVO4UI","created_at":"2026-05-18T12:25:55.427421+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/POAVO4UIE4BOHKJTW3BL2SFMJ4","json":"https://pith.science/pith/POAVO4UIE4BOHKJTW3BL2SFMJ4.json","graph_json":"https://pith.science/api/pith-number/POAVO4UIE4BOHKJTW3BL2SFMJ4/graph.json","events_json":"https://pith.science/api/pith-number/POAVO4UIE4BOHKJTW3BL2SFMJ4/events.json","paper":"https://pith.science/paper/POAVO4UI"},"agent_actions":{"view_html":"https://pith.science/pith/POAVO4UIE4BOHKJTW3BL2SFMJ4","download_json":"https://pith.science/pith/POAVO4UIE4BOHKJTW3BL2SFMJ4.json","view_paper":"https://pith.science/paper/POAVO4UI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0711.3099&json=true","fetch_graph":"https://pith.science/api/pith-number/POAVO4UIE4BOHKJTW3BL2SFMJ4/graph.json","fetch_events":"https://pith.science/api/pith-number/POAVO4UIE4BOHKJTW3BL2SFMJ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/POAVO4UIE4BOHKJTW3BL2SFMJ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/POAVO4UIE4BOHKJTW3BL2SFMJ4/action/storage_attestation","attest_author":"https://pith.science/pith/POAVO4UIE4BOHKJTW3BL2SFMJ4/action/author_attestation","sign_citation":"https://pith.science/pith/POAVO4UIE4BOHKJTW3BL2SFMJ4/action/citation_signature","submit_replication":"https://pith.science/pith/POAVO4UIE4BOHKJTW3BL2SFMJ4/action/replication_record"}},"created_at":"2026-05-18T00:57:58.802196+00:00","updated_at":"2026-05-18T00:57:58.802196+00:00"}