{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BQUDLWUYHHE2WHBYQ52OOSB5GC","short_pith_number":"pith:BQUDLWUY","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"},"canonical_sha256":"0c2835da9839c9ab1c388774e7483d3088806e11f6c85173693f6fc8f231ef63","source":{"kind":"arxiv","id":"1107.5154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5154","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5154v1","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5154","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"pith_short_12","alias_value":"BQUDLWUYHHE2","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BQUDLWUYHHE2WHBY","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BQUDLWUY","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BQUDLWUYHHE2WHBYQ52OOSB5GC","target":"record","payload":{"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"},"canonical_sha256":"0c2835da9839c9ab1c388774e7483d3088806e11f6c85173693f6fc8f231ef63","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"},"source_kind":"arxiv","source_id":"1107.5154","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:16:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nYphs/vl1EDaOlWo0zOLr6oY7BU6QCqgbcv6l9CCJabQGdCujfCWtszIISNp63wckN3EhLsAXFT2p9vk79bpAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T03:48:34.760807Z"},"content_sha256":"d58ae4abd162b8015de90c8c3eb315722b0ed283d1e60e8a426618326ae70a02","schema_version":"1.0","event_id":"sha256:d58ae4abd162b8015de90c8c3eb315722b0ed283d1e60e8a426618326ae70a02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BQUDLWUYHHE2WHBYQ52OOSB5GC","target":"graph","payload":{"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"},"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:16:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"09qwVVSlj7cjed/sKUHGzJVLY1vv6m9lbHRj9ezO3B7Yo7jBzRRX++yrQLW4Dexcp10F5ml4kBrXbg3/hMtBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T03:48:34.761148Z"},"content_sha256":"6d1e6b085eada95a1002bf3c9dd6fba7926f50059efbd81131befa27dbc8493d","schema_version":"1.0","event_id":"sha256:6d1e6b085eada95a1002bf3c9dd6fba7926f50059efbd81131befa27dbc8493d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQUDLWUYHHE2WHBYQ52OOSB5GC/bundle.json","state_url":"https://pith.science/pith/BQUDLWUYHHE2WHBYQ52OOSB5GC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQUDLWUYHHE2WHBYQ52OOSB5GC/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-30T03:48:34Z","links":{"resolver":"https://pith.science/pith/BQUDLWUYHHE2WHBYQ52OOSB5GC","bundle":"https://pith.science/pith/BQUDLWUYHHE2WHBYQ52OOSB5GC/bundle.json","state":"https://pith.science/pith/BQUDLWUYHHE2WHBYQ52OOSB5GC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQUDLWUYHHE2WHBYQ52OOSB5GC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BQUDLWUYHHE2WHBYQ52OOSB5GC","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":"6ded707db1497b600ccc4d97cbc9c5359f23b3d232dcf2b15c154ca414c6c294","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-26T10:06:51Z","title_canon_sha256":"62d4e1e989c29e9c5ca5ce68408e024eaf3528057d4513e6c992ea27c123f76f"},"schema_version":"1.0","source":{"id":"1107.5154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5154","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5154v1","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5154","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"pith_short_12","alias_value":"BQUDLWUYHHE2","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BQUDLWUYHHE2WHBY","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BQUDLWUY","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:6d1e6b085eada95a1002bf3c9dd6fba7926f50059efbd81131befa27dbc8493d","target":"graph","created_at":"2026-05-18T04:16:52Z","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":"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 ","authors_text":"Aubin Jarry, Florian Huc, Jose Rolim, Pierre Leone","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-26T10:06:51Z","title":"Distributed Planarization and Local Routing Strategies in Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5154","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:d58ae4abd162b8015de90c8c3eb315722b0ed283d1e60e8a426618326ae70a02","target":"record","created_at":"2026-05-18T04:16:52Z","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":"6ded707db1497b600ccc4d97cbc9c5359f23b3d232dcf2b15c154ca414c6c294","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-26T10:06:51Z","title_canon_sha256":"62d4e1e989c29e9c5ca5ce68408e024eaf3528057d4513e6c992ea27c123f76f"},"schema_version":"1.0","source":{"id":"1107.5154","kind":"arxiv","version":1}},"canonical_sha256":"0c2835da9839c9ab1c388774e7483d3088806e11f6c85173693f6fc8f231ef63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c2835da9839c9ab1c388774e7483d3088806e11f6c85173693f6fc8f231ef63","first_computed_at":"2026-05-18T04:16:52.870889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:52.870889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dRTad2ldUPpE3B+5MChjgixdl8rsJgBr55f/wfql+Q+RGiRwObw3P1X67mzVy0+yLZmUA+jrAQxSQYQVRGnAAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:52.871463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.5154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d58ae4abd162b8015de90c8c3eb315722b0ed283d1e60e8a426618326ae70a02","sha256:6d1e6b085eada95a1002bf3c9dd6fba7926f50059efbd81131befa27dbc8493d"],"state_sha256":"e5717b546f9e6cfe9306c4e1dfd5feafcd49ee13d046e97528dc56a52baa5f39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iqb1FwdOTO1V/dJH/q6c3/N5Xb7RMZ2E1UqzInOGq9t+k3yTNviN2jzzCFCuBUfhnj4UZXD9316ghzSjs43TAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T03:48:34.763016Z","bundle_sha256":"bee7504922355d637c68840f559fa96ab34394b5160b7170ddef301b5296f333"}}