{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N6PYM5AUNQZNKLQHDOP5YUVS3E","short_pith_number":"pith:N6PYM5AU","schema_version":"1.0","canonical_sha256":"6f9f8674146c32d52e071b9fdc52b2d904977765d9cd9684af99a66ab0179a9d","source":{"kind":"arxiv","id":"1901.00375","version":1},"attestation_state":"computed","paper":{"title":"Computing the $k$-coverage of a wireless network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.NI","authors_text":"Ana\\\"is Vergne (LTCI), Laurent Decreusefond (LTCI), Philippe Martins (LTCI)","submitted_at":"2018-12-29T17:52:53Z","abstract_excerpt":"Coverage is one of the main quality of service of a wirelessnetwork. $k$-coverage, that is to be covered simultaneously by $k$network nodes,  is synonym of reliability and numerous applicationssuch as multiple site MIMO features, or handovers. We introduce here anew algorithm for computing the $k$-coverage of a wirelessnetwork. Our method is based on the observation that $k$-coverage canbe interpreted as $k$ layers of $1$-coverage, or simply coverage. Weuse simplicial homology to compute the network's topology and areduction algorithm to indentify the layers of $1$-coverage. Weprovide figures "},"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":"1901.00375","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-29T17:52:53Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"6264d0f6966fdad04a4add90eb8b7739b60a10d2d899aa1171aeb76c6c927a7f","abstract_canon_sha256":"1b6deba443b7d2c133bcdbd97bc5ed920658df3fb9c21876842b4b4eb54b12d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:04.043051Z","signature_b64":"CNj4wftUdlZa6bu11BySqnewnkg9hGWSr/1HpXkcxLQSmUfeqQxnaU46JstsorEDX1GjI0+QQnIeqcM2ROdTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f9f8674146c32d52e071b9fdc52b2d904977765d9cd9684af99a66ab0179a9d","last_reissued_at":"2026-05-17T23:57:04.042392Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:04.042392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the $k$-coverage of a wireless network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.NI","authors_text":"Ana\\\"is Vergne (LTCI), Laurent Decreusefond (LTCI), Philippe Martins (LTCI)","submitted_at":"2018-12-29T17:52:53Z","abstract_excerpt":"Coverage is one of the main quality of service of a wirelessnetwork. $k$-coverage, that is to be covered simultaneously by $k$network nodes,  is synonym of reliability and numerous applicationssuch as multiple site MIMO features, or handovers. We introduce here anew algorithm for computing the $k$-coverage of a wirelessnetwork. Our method is based on the observation that $k$-coverage canbe interpreted as $k$ layers of $1$-coverage, or simply coverage. Weuse simplicial homology to compute the network's topology and areduction algorithm to indentify the layers of $1$-coverage. Weprovide figures "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00375","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":"1901.00375","created_at":"2026-05-17T23:57:04.042523+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.00375v1","created_at":"2026-05-17T23:57:04.042523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00375","created_at":"2026-05-17T23:57:04.042523+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6PYM5AUNQZN","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6PYM5AUNQZNKLQH","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6PYM5AU","created_at":"2026-05-18T12:32:40.477152+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/N6PYM5AUNQZNKLQHDOP5YUVS3E","json":"https://pith.science/pith/N6PYM5AUNQZNKLQHDOP5YUVS3E.json","graph_json":"https://pith.science/api/pith-number/N6PYM5AUNQZNKLQHDOP5YUVS3E/graph.json","events_json":"https://pith.science/api/pith-number/N6PYM5AUNQZNKLQHDOP5YUVS3E/events.json","paper":"https://pith.science/paper/N6PYM5AU"},"agent_actions":{"view_html":"https://pith.science/pith/N6PYM5AUNQZNKLQHDOP5YUVS3E","download_json":"https://pith.science/pith/N6PYM5AUNQZNKLQHDOP5YUVS3E.json","view_paper":"https://pith.science/paper/N6PYM5AU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.00375&json=true","fetch_graph":"https://pith.science/api/pith-number/N6PYM5AUNQZNKLQHDOP5YUVS3E/graph.json","fetch_events":"https://pith.science/api/pith-number/N6PYM5AUNQZNKLQHDOP5YUVS3E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6PYM5AUNQZNKLQHDOP5YUVS3E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6PYM5AUNQZNKLQHDOP5YUVS3E/action/storage_attestation","attest_author":"https://pith.science/pith/N6PYM5AUNQZNKLQHDOP5YUVS3E/action/author_attestation","sign_citation":"https://pith.science/pith/N6PYM5AUNQZNKLQHDOP5YUVS3E/action/citation_signature","submit_replication":"https://pith.science/pith/N6PYM5AUNQZNKLQHDOP5YUVS3E/action/replication_record"}},"created_at":"2026-05-17T23:57:04.042523+00:00","updated_at":"2026-05-17T23:57:04.042523+00:00"}