{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:DW5HNLRQQ33CH7ISAVENKMYUNP","short_pith_number":"pith:DW5HNLRQ","schema_version":"1.0","canonical_sha256":"1dba76ae3086f623fd120548d533146bc633242a822f45dc7aa1c7ea439ef3a6","source":{"kind":"arxiv","id":"0904.0037","version":1},"attestation_state":"computed","paper":{"title":"Deterministic Capacity of MIMO Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anders Host-Madsen","submitted_at":"2009-04-01T00:02:13Z","abstract_excerpt":"The deterministic capacity of a relay network is the capacity of a network when relays are restricted to transmitting \\emph{reliable} information, that is, (asymptotically) deterministic function of the source message. In this paper it is shown that the deterministic capacity of a number of MIMO relay networks can be found in the low power regime where $\\SNR\\to0$. This is accomplished through deriving single letter upper bounds and finding the limit of these as $\\SNR\\to0$. The advantage of this technique is that it overcomes the difficulty of finding optimum distributions for mutual informatio"},"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":"0904.0037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-01T00:02:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"327cf63d941e77479343f7af54a9bb6bef9a680a55eecb293c539f572265ad8f","abstract_canon_sha256":"2d8c38f93876378f62a543c15d564f9d0b57ee358903da8a6f0e3cd3a3a6be37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.238670Z","signature_b64":"/R8xyvh9GIp+7aRSo5Orh5vS5RplbLty/LzC2FVMrN1n3n/Ektc4j343kflEBQK2N4fggvmkUPUht/kgeu0AAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dba76ae3086f623fd120548d533146bc633242a822f45dc7aa1c7ea439ef3a6","last_reissued_at":"2026-05-18T00:57:58.238234Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.238234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Capacity of MIMO Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anders Host-Madsen","submitted_at":"2009-04-01T00:02:13Z","abstract_excerpt":"The deterministic capacity of a relay network is the capacity of a network when relays are restricted to transmitting \\emph{reliable} information, that is, (asymptotically) deterministic function of the source message. In this paper it is shown that the deterministic capacity of a number of MIMO relay networks can be found in the low power regime where $\\SNR\\to0$. This is accomplished through deriving single letter upper bounds and finding the limit of these as $\\SNR\\to0$. The advantage of this technique is that it overcomes the difficulty of finding optimum distributions for mutual informatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.0037","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":"0904.0037","created_at":"2026-05-18T00:57:58.238305+00:00"},{"alias_kind":"arxiv_version","alias_value":"0904.0037v1","created_at":"2026-05-18T00:57:58.238305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.0037","created_at":"2026-05-18T00:57:58.238305+00:00"},{"alias_kind":"pith_short_12","alias_value":"DW5HNLRQQ33C","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"DW5HNLRQQ33CH7IS","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"DW5HNLRQ","created_at":"2026-05-18T12:25:59.703012+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/DW5HNLRQQ33CH7ISAVENKMYUNP","json":"https://pith.science/pith/DW5HNLRQQ33CH7ISAVENKMYUNP.json","graph_json":"https://pith.science/api/pith-number/DW5HNLRQQ33CH7ISAVENKMYUNP/graph.json","events_json":"https://pith.science/api/pith-number/DW5HNLRQQ33CH7ISAVENKMYUNP/events.json","paper":"https://pith.science/paper/DW5HNLRQ"},"agent_actions":{"view_html":"https://pith.science/pith/DW5HNLRQQ33CH7ISAVENKMYUNP","download_json":"https://pith.science/pith/DW5HNLRQQ33CH7ISAVENKMYUNP.json","view_paper":"https://pith.science/paper/DW5HNLRQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0904.0037&json=true","fetch_graph":"https://pith.science/api/pith-number/DW5HNLRQQ33CH7ISAVENKMYUNP/graph.json","fetch_events":"https://pith.science/api/pith-number/DW5HNLRQQ33CH7ISAVENKMYUNP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DW5HNLRQQ33CH7ISAVENKMYUNP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DW5HNLRQQ33CH7ISAVENKMYUNP/action/storage_attestation","attest_author":"https://pith.science/pith/DW5HNLRQQ33CH7ISAVENKMYUNP/action/author_attestation","sign_citation":"https://pith.science/pith/DW5HNLRQQ33CH7ISAVENKMYUNP/action/citation_signature","submit_replication":"https://pith.science/pith/DW5HNLRQQ33CH7ISAVENKMYUNP/action/replication_record"}},"created_at":"2026-05-18T00:57:58.238305+00:00","updated_at":"2026-05-18T00:57:58.238305+00:00"}