{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OFTZXQDT4IRYVZV2KWODBI7I5T","short_pith_number":"pith:OFTZXQDT","schema_version":"1.0","canonical_sha256":"71679bc073e2238ae6ba559c30a3e8ecc633345845be84a1a31cafecc09c7850","source":{"kind":"arxiv","id":"1608.02032","version":1},"attestation_state":"computed","paper":{"title":"Unique coverage in Boolean models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Amites Sarkar, Martin Haenggi","submitted_at":"2016-08-05T22:07:01Z","abstract_excerpt":"Consider a wireless cellular network consisting of small, densely scattered base stations. A user $u$ is {\\em uniquely covered} by a base station $b$ if $u$ is the only user within distance $r$ of $b$. This makes it possible to assign the user $u$ to the base station $b$ without interference from any other user $u'$. We investigate the maximum possible proportion of users who are uniquely covered. We solve this problem completely in one dimension and provide bounds, approximations and simulation results for the two-dimensional case."},"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":"1608.02032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-05T22:07:01Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"f64c842af14125895726e77bdf2451e8c1a36e9dd5fd79770769c759c26cb047","abstract_canon_sha256":"84c0ddd438ab394324939e034ff1fa256fbc6b18bebe3ad443d771b73efe734d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:41.100040Z","signature_b64":"AAnsftkmEORZ6YFUGh5ij8YSjBny2a2JSrVtSwwQKJrsh3JHzdNyN2ZhpZ/IGn7DNtmkh+umaPv6L4GhbcMWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71679bc073e2238ae6ba559c30a3e8ecc633345845be84a1a31cafecc09c7850","last_reissued_at":"2026-05-18T01:09:41.099460Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:41.099460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unique coverage in Boolean models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Amites Sarkar, Martin Haenggi","submitted_at":"2016-08-05T22:07:01Z","abstract_excerpt":"Consider a wireless cellular network consisting of small, densely scattered base stations. A user $u$ is {\\em uniquely covered} by a base station $b$ if $u$ is the only user within distance $r$ of $b$. This makes it possible to assign the user $u$ to the base station $b$ without interference from any other user $u'$. We investigate the maximum possible proportion of users who are uniquely covered. We solve this problem completely in one dimension and provide bounds, approximations and simulation results for the two-dimensional case."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02032","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":"1608.02032","created_at":"2026-05-18T01:09:41.099547+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.02032v1","created_at":"2026-05-18T01:09:41.099547+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02032","created_at":"2026-05-18T01:09:41.099547+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFTZXQDT4IRY","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFTZXQDT4IRYVZV2","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFTZXQDT","created_at":"2026-05-18T12:30:36.002864+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/OFTZXQDT4IRYVZV2KWODBI7I5T","json":"https://pith.science/pith/OFTZXQDT4IRYVZV2KWODBI7I5T.json","graph_json":"https://pith.science/api/pith-number/OFTZXQDT4IRYVZV2KWODBI7I5T/graph.json","events_json":"https://pith.science/api/pith-number/OFTZXQDT4IRYVZV2KWODBI7I5T/events.json","paper":"https://pith.science/paper/OFTZXQDT"},"agent_actions":{"view_html":"https://pith.science/pith/OFTZXQDT4IRYVZV2KWODBI7I5T","download_json":"https://pith.science/pith/OFTZXQDT4IRYVZV2KWODBI7I5T.json","view_paper":"https://pith.science/paper/OFTZXQDT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.02032&json=true","fetch_graph":"https://pith.science/api/pith-number/OFTZXQDT4IRYVZV2KWODBI7I5T/graph.json","fetch_events":"https://pith.science/api/pith-number/OFTZXQDT4IRYVZV2KWODBI7I5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFTZXQDT4IRYVZV2KWODBI7I5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFTZXQDT4IRYVZV2KWODBI7I5T/action/storage_attestation","attest_author":"https://pith.science/pith/OFTZXQDT4IRYVZV2KWODBI7I5T/action/author_attestation","sign_citation":"https://pith.science/pith/OFTZXQDT4IRYVZV2KWODBI7I5T/action/citation_signature","submit_replication":"https://pith.science/pith/OFTZXQDT4IRYVZV2KWODBI7I5T/action/replication_record"}},"created_at":"2026-05-18T01:09:41.099547+00:00","updated_at":"2026-05-18T01:09:41.099547+00:00"}