{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:I26UHLQ5OUC4RIFNQE5VGIU5I3","short_pith_number":"pith:I26UHLQ5","schema_version":"1.0","canonical_sha256":"46bd43ae1d7505c8a0ad813b53229d46f0c66e59f33a99c9ce8b19f9228981a9","source":{"kind":"arxiv","id":"1008.3295","version":2},"attestation_state":"computed","paper":{"title":"Optimal relay location and power allocation for low SNR broadcast relay channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Mohit Thakur, Muriel M\\'edard, Nadia Fawaz","submitted_at":"2010-08-19T13:20:16Z","abstract_excerpt":"We consider the broadcast relay channel (BRC), where a single source transmits to multiple destinations with the help of a relay, in the limit of a large bandwidth. We address the problem of optimal relay positioning and power allocations at source and relay, to maximize the multicast rate from source to all destinations. To solve such a network planning problem, we develop a three-faceted approach based on an underlying information theoretic model, computational geometric aspects, and network optimization tools. Firstly, assuming superposition coding and frequency division between the source "},"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":"1008.3295","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-19T13:20:16Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"7dd983187687d8c8ed51421fe1cd70073dc9092f54674241dada0772737c7c2c","abstract_canon_sha256":"9b5ce1e893a3c805e993cecad01cf02a883f6f547abbac47afc922429282e902"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:32.466887Z","signature_b64":"bKtUra0NriF8tbu/8OFHGQUS7pwpncdf+ay2yGUbq/Gu0NQpQ560XtLz+uhlPLgmMPaDD4f1iT2ZYTmyH+rcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46bd43ae1d7505c8a0ad813b53229d46f0c66e59f33a99c9ce8b19f9228981a9","last_reissued_at":"2026-05-18T04:31:32.466361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:32.466361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal relay location and power allocation for low SNR broadcast relay channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Mohit Thakur, Muriel M\\'edard, Nadia Fawaz","submitted_at":"2010-08-19T13:20:16Z","abstract_excerpt":"We consider the broadcast relay channel (BRC), where a single source transmits to multiple destinations with the help of a relay, in the limit of a large bandwidth. We address the problem of optimal relay positioning and power allocations at source and relay, to maximize the multicast rate from source to all destinations. To solve such a network planning problem, we develop a three-faceted approach based on an underlying information theoretic model, computational geometric aspects, and network optimization tools. Firstly, assuming superposition coding and frequency division between the source "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3295","kind":"arxiv","version":2},"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":"1008.3295","created_at":"2026-05-18T04:31:32.466442+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.3295v2","created_at":"2026-05-18T04:31:32.466442+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3295","created_at":"2026-05-18T04:31:32.466442+00:00"},{"alias_kind":"pith_short_12","alias_value":"I26UHLQ5OUC4","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"I26UHLQ5OUC4RIFN","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"I26UHLQ5","created_at":"2026-05-18T12:26:07.630475+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/I26UHLQ5OUC4RIFNQE5VGIU5I3","json":"https://pith.science/pith/I26UHLQ5OUC4RIFNQE5VGIU5I3.json","graph_json":"https://pith.science/api/pith-number/I26UHLQ5OUC4RIFNQE5VGIU5I3/graph.json","events_json":"https://pith.science/api/pith-number/I26UHLQ5OUC4RIFNQE5VGIU5I3/events.json","paper":"https://pith.science/paper/I26UHLQ5"},"agent_actions":{"view_html":"https://pith.science/pith/I26UHLQ5OUC4RIFNQE5VGIU5I3","download_json":"https://pith.science/pith/I26UHLQ5OUC4RIFNQE5VGIU5I3.json","view_paper":"https://pith.science/paper/I26UHLQ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.3295&json=true","fetch_graph":"https://pith.science/api/pith-number/I26UHLQ5OUC4RIFNQE5VGIU5I3/graph.json","fetch_events":"https://pith.science/api/pith-number/I26UHLQ5OUC4RIFNQE5VGIU5I3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I26UHLQ5OUC4RIFNQE5VGIU5I3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I26UHLQ5OUC4RIFNQE5VGIU5I3/action/storage_attestation","attest_author":"https://pith.science/pith/I26UHLQ5OUC4RIFNQE5VGIU5I3/action/author_attestation","sign_citation":"https://pith.science/pith/I26UHLQ5OUC4RIFNQE5VGIU5I3/action/citation_signature","submit_replication":"https://pith.science/pith/I26UHLQ5OUC4RIFNQE5VGIU5I3/action/replication_record"}},"created_at":"2026-05-18T04:31:32.466442+00:00","updated_at":"2026-05-18T04:31:32.466442+00:00"}