{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OKHKEFK2M2PEV2ZYLP5VZUO4WY","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":"53333bdc0bbf6eed810db040196723ba40237963f953e592758fe2f79e8f5d6c","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-31T21:00:32Z","title_canon_sha256":"eb63b9a2787be966f55837294cf2a52d5b7e6d7b07cf61f459f7931882c3e84e"},"schema_version":"1.0","source":{"id":"1106.0027","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0027","created_at":"2026-05-18T04:20:52Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0027v1","created_at":"2026-05-18T04:20:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0027","created_at":"2026-05-18T04:20:52Z"},{"alias_kind":"pith_short_12","alias_value":"OKHKEFK2M2PE","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OKHKEFK2M2PEV2ZY","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OKHKEFK2","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:9625ba6750f18daaf9693c0597cfed5a613676f5ce1fa3706ec387a76a7b07b0","target":"graph","created_at":"2026-05-18T04:20:52Z","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":"We provide a geometric solution to the problem of optimal relay positioning to maximize the multicast rate for low-SNR networks. The networks we consider, consist of a single source, multiple receivers and the only intermediate and locatable node as the relay. We construct network the hypergraph of the system nodes from the underlying information theoretic model of low-SNR regime that operates using superposition coding and FDMA in conjunction (which we call the \"achievable hypergraph model\"). We make the following contributions. 1) We show that the problem of optimal relay positioning maximiz","authors_text":"Mohit Thakur, Muriel M\\'edard, Nadia Fawaz","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-31T21:00:32Z","title":"On the geometry of wireless network multicast in 2-D"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0027","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:05d07eda4bb8779229bfd209ef86e6f81dd7b306eea3d1ca4c2d7d1b0e5160f4","target":"record","created_at":"2026-05-18T04:20:52Z","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":"53333bdc0bbf6eed810db040196723ba40237963f953e592758fe2f79e8f5d6c","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-31T21:00:32Z","title_canon_sha256":"eb63b9a2787be966f55837294cf2a52d5b7e6d7b07cf61f459f7931882c3e84e"},"schema_version":"1.0","source":{"id":"1106.0027","kind":"arxiv","version":1}},"canonical_sha256":"728ea2155a669e4aeb385bfb5cd1dcb61565a4d415ce2f993586c128b9e2d318","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"728ea2155a669e4aeb385bfb5cd1dcb61565a4d415ce2f993586c128b9e2d318","first_computed_at":"2026-05-18T04:20:52.260864Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:52.260864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"imaVLI9BH2Xjpj7YKXsHElaczcBcKTQPxdas5uwI+fAxzziTrff+ojGrsQqT+EWdg8Zzt4W5cC7Yjg7iMpB0CA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:52.261382Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.0027","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05d07eda4bb8779229bfd209ef86e6f81dd7b306eea3d1ca4c2d7d1b0e5160f4","sha256:9625ba6750f18daaf9693c0597cfed5a613676f5ce1fa3706ec387a76a7b07b0"],"state_sha256":"d7e425f0e0e4b955466d250907372f2c0f9346116e4c3367fcd379e1ea7d9ee9"}