{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3JFNT7J4IO3H4VJXUIFR6FW4U7","short_pith_number":"pith:3JFNT7J4","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"},"canonical_sha256":"da4ad9fd3c43b67e5537a20b1f16dca7debd2031c137ae84d9de22323a8ad1d2","source":{"kind":"arxiv","id":"1110.0938","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0938","created_at":"2026-05-18T04:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0938v1","created_at":"2026-05-18T04:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0938","created_at":"2026-05-18T04:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"3JFNT7J4IO3H","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3JFNT7J4IO3H4VJX","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3JFNT7J4","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3JFNT7J4IO3H4VJXUIFR6FW4U7","target":"record","payload":{"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"},"canonical_sha256":"da4ad9fd3c43b67e5537a20b1f16dca7debd2031c137ae84d9de22323a8ad1d2","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"},"source_kind":"arxiv","source_id":"1110.0938","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:00:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V879WOk5Zr9bcYkDai4FS/xvgepkBBga0XAEWqA7z8JAWoW07PEJ/uOI0/CyFczaLcbxDUcp82qfjXV1WwRfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:49:24.138329Z"},"content_sha256":"dce80237c5a34d2ebd9e97a5c7d2e60dab623297d58a1ad9922e8214aac52938","schema_version":"1.0","event_id":"sha256:dce80237c5a34d2ebd9e97a5c7d2e60dab623297d58a1ad9922e8214aac52938"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3JFNT7J4IO3H4VJXUIFR6FW4U7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:00:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"auHUPUyjqJcE7OOhrul/AsQsdJRf5m5vOrPfuLuMfi9KHVpRJigzgCrxyxalXM88Fp9FQFttLt3BhUTMsa+QAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:49:24.139021Z"},"content_sha256":"19fe970a3b37695d965380f09d983e279c54dba5da8971403b8eefa9f9afba4d","schema_version":"1.0","event_id":"sha256:19fe970a3b37695d965380f09d983e279c54dba5da8971403b8eefa9f9afba4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JFNT7J4IO3H4VJXUIFR6FW4U7/bundle.json","state_url":"https://pith.science/pith/3JFNT7J4IO3H4VJXUIFR6FW4U7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JFNT7J4IO3H4VJXUIFR6FW4U7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T20:49:24Z","links":{"resolver":"https://pith.science/pith/3JFNT7J4IO3H4VJXUIFR6FW4U7","bundle":"https://pith.science/pith/3JFNT7J4IO3H4VJXUIFR6FW4U7/bundle.json","state":"https://pith.science/pith/3JFNT7J4IO3H4VJXUIFR6FW4U7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JFNT7J4IO3H4VJXUIFR6FW4U7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3JFNT7J4IO3H4VJXUIFR6FW4U7","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":"c5d8735c5454b63716e18bf509444a7118fbb849aac929b34e91da5d5152a18d","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-05T10:14:26Z","title_canon_sha256":"589067b5177e8789bc9a000ef0e839bf2c1f1d1f28348f3061eb1a60c443c80d"},"schema_version":"1.0","source":{"id":"1110.0938","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0938","created_at":"2026-05-18T04:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0938v1","created_at":"2026-05-18T04:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0938","created_at":"2026-05-18T04:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"3JFNT7J4IO3H","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3JFNT7J4IO3H4VJX","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3JFNT7J4","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:19fe970a3b37695d965380f09d983e279c54dba5da8971403b8eefa9f9afba4d","target":"graph","created_at":"2026-05-18T04:00:13Z","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":"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","authors_text":"Magnus M. Halldorsson, Pradipta Mitra","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-05T10:14:26Z","title":"Wireless Connectivity and Capacity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0938","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:dce80237c5a34d2ebd9e97a5c7d2e60dab623297d58a1ad9922e8214aac52938","target":"record","created_at":"2026-05-18T04:00:13Z","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":"c5d8735c5454b63716e18bf509444a7118fbb849aac929b34e91da5d5152a18d","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-05T10:14:26Z","title_canon_sha256":"589067b5177e8789bc9a000ef0e839bf2c1f1d1f28348f3061eb1a60c443c80d"},"schema_version":"1.0","source":{"id":"1110.0938","kind":"arxiv","version":1}},"canonical_sha256":"da4ad9fd3c43b67e5537a20b1f16dca7debd2031c137ae84d9de22323a8ad1d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da4ad9fd3c43b67e5537a20b1f16dca7debd2031c137ae84d9de22323a8ad1d2","first_computed_at":"2026-05-18T04:00:13.464728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:13.464728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T+hPdfdD8ypgH/uNZs+wjrQOVk2+RN4rORMtf8dlzjIQ/86F4Yj/U9CRsfDksOWURh9j/JbobeTseJfkJgkzCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:13.465411Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.0938","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dce80237c5a34d2ebd9e97a5c7d2e60dab623297d58a1ad9922e8214aac52938","sha256:19fe970a3b37695d965380f09d983e279c54dba5da8971403b8eefa9f9afba4d"],"state_sha256":"18fbb65eac8a5fc117a322437545e14952d836e9da2112573ce069d16fce102d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zkrYIlKKFlqvOTb+J7S7S7SsYOUpdqBK5z1/4h1ORpeWHWjD6QBdClDkEjf9cho5lvri7CpUdYiLkpYTRltMAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:49:24.143737Z","bundle_sha256":"b1f5b913a681dad4fa04d3b2bb193df3d5077b1d28111dc440e56cd0060dd8d6"}}