{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:BQUDLWUYHHE2WHBYQ52OOSB5GC","short_pith_number":"pith:BQUDLWUY","schema_version":"1.0","canonical_sha256":"0c2835da9839c9ab1c388774e7483d3088806e11f6c85173693f6fc8f231ef63","source":{"kind":"arxiv","id":"1107.5154","version":1},"attestation_state":"computed","paper":{"title":"Distributed Planarization and Local Routing Strategies in Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Aubin Jarry, Florian Huc, Jose Rolim, Pierre Leone","submitted_at":"2011-07-26T10:06:51Z","abstract_excerpt":"We present an algorithm which computes a planar 2-spanner from an Unit Disk Graph when the node density is sufficient. The communication complexity in terms of number of node's identifier sent by the algorithm is $6n$, while the computational complexity is $O(n\\Delta)$, with $\\Delta$ the maximum degree of the communication graph. Furthermore, we present a simple and efficient routing algorithm dedicated to the computed graph.\n  Last but not least, using traditional Euclidean coordinates, our algorithm needs the broadcast of as few as $3n$ node's identifiers. Under the hypothesis of sufficient "},"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":"1107.5154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-26T10:06:51Z","cross_cats_sorted":[],"title_canon_sha256":"62d4e1e989c29e9c5ca5ce68408e024eaf3528057d4513e6c992ea27c123f76f","abstract_canon_sha256":"6ded707db1497b600ccc4d97cbc9c5359f23b3d232dcf2b15c154ca414c6c294"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:52.871463Z","signature_b64":"dRTad2ldUPpE3B+5MChjgixdl8rsJgBr55f/wfql+Q+RGiRwObw3P1X67mzVy0+yLZmUA+jrAQxSQYQVRGnAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c2835da9839c9ab1c388774e7483d3088806e11f6c85173693f6fc8f231ef63","last_reissued_at":"2026-05-18T04:16:52.870889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:52.870889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Planarization and Local Routing Strategies in Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Aubin Jarry, Florian Huc, Jose Rolim, Pierre Leone","submitted_at":"2011-07-26T10:06:51Z","abstract_excerpt":"We present an algorithm which computes a planar 2-spanner from an Unit Disk Graph when the node density is sufficient. The communication complexity in terms of number of node's identifier sent by the algorithm is $6n$, while the computational complexity is $O(n\\Delta)$, with $\\Delta$ the maximum degree of the communication graph. Furthermore, we present a simple and efficient routing algorithm dedicated to the computed graph.\n  Last but not least, using traditional Euclidean coordinates, our algorithm needs the broadcast of as few as $3n$ node's identifiers. Under the hypothesis of sufficient "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5154","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":"1107.5154","created_at":"2026-05-18T04:16:52.870985+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.5154v1","created_at":"2026-05-18T04:16:52.870985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5154","created_at":"2026-05-18T04:16:52.870985+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQUDLWUYHHE2","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQUDLWUYHHE2WHBY","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQUDLWUY","created_at":"2026-05-18T12:26:24.575870+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/BQUDLWUYHHE2WHBYQ52OOSB5GC","json":"https://pith.science/pith/BQUDLWUYHHE2WHBYQ52OOSB5GC.json","graph_json":"https://pith.science/api/pith-number/BQUDLWUYHHE2WHBYQ52OOSB5GC/graph.json","events_json":"https://pith.science/api/pith-number/BQUDLWUYHHE2WHBYQ52OOSB5GC/events.json","paper":"https://pith.science/paper/BQUDLWUY"},"agent_actions":{"view_html":"https://pith.science/pith/BQUDLWUYHHE2WHBYQ52OOSB5GC","download_json":"https://pith.science/pith/BQUDLWUYHHE2WHBYQ52OOSB5GC.json","view_paper":"https://pith.science/paper/BQUDLWUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.5154&json=true","fetch_graph":"https://pith.science/api/pith-number/BQUDLWUYHHE2WHBYQ52OOSB5GC/graph.json","fetch_events":"https://pith.science/api/pith-number/BQUDLWUYHHE2WHBYQ52OOSB5GC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQUDLWUYHHE2WHBYQ52OOSB5GC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQUDLWUYHHE2WHBYQ52OOSB5GC/action/storage_attestation","attest_author":"https://pith.science/pith/BQUDLWUYHHE2WHBYQ52OOSB5GC/action/author_attestation","sign_citation":"https://pith.science/pith/BQUDLWUYHHE2WHBYQ52OOSB5GC/action/citation_signature","submit_replication":"https://pith.science/pith/BQUDLWUYHHE2WHBYQ52OOSB5GC/action/replication_record"}},"created_at":"2026-05-18T04:16:52.870985+00:00","updated_at":"2026-05-18T04:16:52.870985+00:00"}