{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3JFNT7J4IO3H4VJXUIFR6FW4U7","short_pith_number":"pith:3JFNT7J4","schema_version":"1.0","canonical_sha256":"da4ad9fd3c43b67e5537a20b1f16dca7debd2031c137ae84d9de22323a8ad1d2","source":{"kind":"arxiv","id":"1110.0938","version":1},"attestation_state":"computed","paper":{"title":"Wireless Connectivity and Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Magnus M. Halldorsson, Pradipta Mitra","submitted_at":"2011-10-05T10:14:26Z","abstract_excerpt":"Given $n$ wireless transceivers located in a plane, a fundamental problem in wireless communications is to construct a strongly connected digraph on them such that the constituent links can be scheduled in fewest possible time slots, assuming the SINR model of interference.\n  In this paper, we provide an algorithm that connects an arbitrary point set in $O(\\log n)$ slots, improving on the previous best bound of $O(\\log^2 n)$ due to Moscibroda. This is complemented with a super-constant lower bound on our approach to connectivity. An important feature is that the algorithms allow for bi-directi"},"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":"1110.0938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-05T10:14:26Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"589067b5177e8789bc9a000ef0e839bf2c1f1d1f28348f3061eb1a60c443c80d","abstract_canon_sha256":"c5d8735c5454b63716e18bf509444a7118fbb849aac929b34e91da5d5152a18d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:13.465411Z","signature_b64":"T+hPdfdD8ypgH/uNZs+wjrQOVk2+RN4rORMtf8dlzjIQ/86F4Yj/U9CRsfDksOWURh9j/JbobeTseJfkJgkzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da4ad9fd3c43b67e5537a20b1f16dca7debd2031c137ae84d9de22323a8ad1d2","last_reissued_at":"2026-05-18T04:00:13.464728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:13.464728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Wireless Connectivity and Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Magnus M. Halldorsson, Pradipta Mitra","submitted_at":"2011-10-05T10:14:26Z","abstract_excerpt":"Given $n$ wireless transceivers located in a plane, a fundamental problem in wireless communications is to construct a strongly connected digraph on them such that the constituent links can be scheduled in fewest possible time slots, assuming the SINR model of interference.\n  In this paper, we provide an algorithm that connects an arbitrary point set in $O(\\log n)$ slots, improving on the previous best bound of $O(\\log^2 n)$ due to Moscibroda. This is complemented with a super-constant lower bound on our approach to connectivity. An important feature is that the algorithms allow for bi-directi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0938","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":"1110.0938","created_at":"2026-05-18T04:00:13.464821+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.0938v1","created_at":"2026-05-18T04:00:13.464821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0938","created_at":"2026-05-18T04:00:13.464821+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JFNT7J4IO3H","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JFNT7J4IO3H4VJX","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JFNT7J4","created_at":"2026-05-18T12:26:18.847500+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/3JFNT7J4IO3H4VJXUIFR6FW4U7","json":"https://pith.science/pith/3JFNT7J4IO3H4VJXUIFR6FW4U7.json","graph_json":"https://pith.science/api/pith-number/3JFNT7J4IO3H4VJXUIFR6FW4U7/graph.json","events_json":"https://pith.science/api/pith-number/3JFNT7J4IO3H4VJXUIFR6FW4U7/events.json","paper":"https://pith.science/paper/3JFNT7J4"},"agent_actions":{"view_html":"https://pith.science/pith/3JFNT7J4IO3H4VJXUIFR6FW4U7","download_json":"https://pith.science/pith/3JFNT7J4IO3H4VJXUIFR6FW4U7.json","view_paper":"https://pith.science/paper/3JFNT7J4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.0938&json=true","fetch_graph":"https://pith.science/api/pith-number/3JFNT7J4IO3H4VJXUIFR6FW4U7/graph.json","fetch_events":"https://pith.science/api/pith-number/3JFNT7J4IO3H4VJXUIFR6FW4U7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JFNT7J4IO3H4VJXUIFR6FW4U7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JFNT7J4IO3H4VJXUIFR6FW4U7/action/storage_attestation","attest_author":"https://pith.science/pith/3JFNT7J4IO3H4VJXUIFR6FW4U7/action/author_attestation","sign_citation":"https://pith.science/pith/3JFNT7J4IO3H4VJXUIFR6FW4U7/action/citation_signature","submit_replication":"https://pith.science/pith/3JFNT7J4IO3H4VJXUIFR6FW4U7/action/replication_record"}},"created_at":"2026-05-18T04:00:13.464821+00:00","updated_at":"2026-05-18T04:00:13.464821+00:00"}