{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:N6PYM5AUNQZNKLQHDOP5YUVS3E","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":"1b6deba443b7d2c133bcdbd97bc5ed920658df3fb9c21876842b4b4eb54b12d4","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-29T17:52:53Z","title_canon_sha256":"6264d0f6966fdad04a4add90eb8b7739b60a10d2d899aa1171aeb76c6c927a7f"},"schema_version":"1.0","source":{"id":"1901.00375","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00375","created_at":"2026-05-17T23:57:04Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00375v1","created_at":"2026-05-17T23:57:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00375","created_at":"2026-05-17T23:57:04Z"},{"alias_kind":"pith_short_12","alias_value":"N6PYM5AUNQZN","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N6PYM5AUNQZNKLQH","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N6PYM5AU","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:7233038e6c3708d1a9a0bb3595f5a16eb1baa88ae43eda6bcbd68ae9994f5ebd","target":"graph","created_at":"2026-05-17T23:57:04Z","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":"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 ","authors_text":"Ana\\\"is Vergne (LTCI), Laurent Decreusefond (LTCI), Philippe Martins (LTCI)","cross_cats":["cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-29T17:52:53Z","title":"Computing the $k$-coverage of a wireless network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00375","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:8555b9b6647fc49ba9d8a370d3d9ac20b01e40a08edeaedf84d3ad7c0008040b","target":"record","created_at":"2026-05-17T23:57:04Z","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":"1b6deba443b7d2c133bcdbd97bc5ed920658df3fb9c21876842b4b4eb54b12d4","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-29T17:52:53Z","title_canon_sha256":"6264d0f6966fdad04a4add90eb8b7739b60a10d2d899aa1171aeb76c6c927a7f"},"schema_version":"1.0","source":{"id":"1901.00375","kind":"arxiv","version":1}},"canonical_sha256":"6f9f8674146c32d52e071b9fdc52b2d904977765d9cd9684af99a66ab0179a9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f9f8674146c32d52e071b9fdc52b2d904977765d9cd9684af99a66ab0179a9d","first_computed_at":"2026-05-17T23:57:04.042392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:04.042392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CNj4wftUdlZa6bu11BySqnewnkg9hGWSr/1HpXkcxLQSmUfeqQxnaU46JstsorEDX1GjI0+QQnIeqcM2ROdTBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:04.043051Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.00375","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8555b9b6647fc49ba9d8a370d3d9ac20b01e40a08edeaedf84d3ad7c0008040b","sha256:7233038e6c3708d1a9a0bb3595f5a16eb1baa88ae43eda6bcbd68ae9994f5ebd"],"state_sha256":"244bc50a02ad667d4772ce24cd4a89f510e1d2a9765b20886922992540d0365f"}