{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:J644Q5HSNHMMPNGJNW5SGMIPIW","short_pith_number":"pith:J644Q5HS","schema_version":"1.0","canonical_sha256":"4fb9c874f269d8c7b4c96dbb23310f4593d250232c4829a915b0927e50f12074","source":{"kind":"arxiv","id":"1403.5543","version":1},"attestation_state":"computed","paper":{"title":"Disaster Recovery in Wireless Networks: A Homology-Based Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"math.PR","authors_text":"Ana\\\"is Vergne (LTCI), Ian Flint (LTCI), Laurent Decreusefond (LTCI), Philippe Martins (LTCI)","submitted_at":"2014-03-21T18:58:16Z","abstract_excerpt":"In this paper, we present an algorithm for the recovery of wireless networks after a disaster. Considering a damaged wireless network, presenting coverage holes or/and many disconnected components, we propose a disaster recovery algorithm which repairs the network. It provides the list of locations where to put new nodes in order to patch the coverage holes and mend the disconnected components. In order to do this we first consider the simplicial complex representation of the network, then the algorithm adds supplementary vertices in excessive number, and afterwards runs a reduction algorithm "},"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":"1403.5543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-03-21T18:58:16Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"16f8d94e6ac180652585f8a2de267cc950d50649690907844691f6083024dd6b","abstract_canon_sha256":"9e4c423f88db8c921f332ee1bfcc03496e5096182e368fc99edcf01aa39d05e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:42.604657Z","signature_b64":"5wu2mbSOf2smkVZ2Aq/0Chb6ZVTfOWG/ugLbpPZm9WCD/Eha2AKERPeQ+YRdgFGSI8H113xjcjbqfTvd+LQrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fb9c874f269d8c7b4c96dbb23310f4593d250232c4829a915b0927e50f12074","last_reissued_at":"2026-05-18T00:09:42.603906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:42.603906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Disaster Recovery in Wireless Networks: A Homology-Based Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"math.PR","authors_text":"Ana\\\"is Vergne (LTCI), Ian Flint (LTCI), Laurent Decreusefond (LTCI), Philippe Martins (LTCI)","submitted_at":"2014-03-21T18:58:16Z","abstract_excerpt":"In this paper, we present an algorithm for the recovery of wireless networks after a disaster. Considering a damaged wireless network, presenting coverage holes or/and many disconnected components, we propose a disaster recovery algorithm which repairs the network. It provides the list of locations where to put new nodes in order to patch the coverage holes and mend the disconnected components. In order to do this we first consider the simplicial complex representation of the network, then the algorithm adds supplementary vertices in excessive number, and afterwards runs a reduction algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5543","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":"1403.5543","created_at":"2026-05-18T00:09:42.604012+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5543v1","created_at":"2026-05-18T00:09:42.604012+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5543","created_at":"2026-05-18T00:09:42.604012+00:00"},{"alias_kind":"pith_short_12","alias_value":"J644Q5HSNHMM","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"J644Q5HSNHMMPNGJ","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"J644Q5HS","created_at":"2026-05-18T12:28:33.132498+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/J644Q5HSNHMMPNGJNW5SGMIPIW","json":"https://pith.science/pith/J644Q5HSNHMMPNGJNW5SGMIPIW.json","graph_json":"https://pith.science/api/pith-number/J644Q5HSNHMMPNGJNW5SGMIPIW/graph.json","events_json":"https://pith.science/api/pith-number/J644Q5HSNHMMPNGJNW5SGMIPIW/events.json","paper":"https://pith.science/paper/J644Q5HS"},"agent_actions":{"view_html":"https://pith.science/pith/J644Q5HSNHMMPNGJNW5SGMIPIW","download_json":"https://pith.science/pith/J644Q5HSNHMMPNGJNW5SGMIPIW.json","view_paper":"https://pith.science/paper/J644Q5HS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5543&json=true","fetch_graph":"https://pith.science/api/pith-number/J644Q5HSNHMMPNGJNW5SGMIPIW/graph.json","fetch_events":"https://pith.science/api/pith-number/J644Q5HSNHMMPNGJNW5SGMIPIW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J644Q5HSNHMMPNGJNW5SGMIPIW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J644Q5HSNHMMPNGJNW5SGMIPIW/action/storage_attestation","attest_author":"https://pith.science/pith/J644Q5HSNHMMPNGJNW5SGMIPIW/action/author_attestation","sign_citation":"https://pith.science/pith/J644Q5HSNHMMPNGJNW5SGMIPIW/action/citation_signature","submit_replication":"https://pith.science/pith/J644Q5HSNHMMPNGJNW5SGMIPIW/action/replication_record"}},"created_at":"2026-05-18T00:09:42.604012+00:00","updated_at":"2026-05-18T00:09:42.604012+00:00"}