{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:DW5HNLRQQ33CH7ISAVENKMYUNP","short_pith_number":"pith:DW5HNLRQ","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"},"canonical_sha256":"1dba76ae3086f623fd120548d533146bc633242a822f45dc7aa1c7ea439ef3a6","source":{"kind":"arxiv","id":"0904.0037","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.0037","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0904.0037v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.0037","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"DW5HNLRQQ33C","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"DW5HNLRQQ33CH7IS","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"DW5HNLRQ","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:DW5HNLRQQ33CH7ISAVENKMYUNP","target":"record","payload":{"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"},"canonical_sha256":"1dba76ae3086f623fd120548d533146bc633242a822f45dc7aa1c7ea439ef3a6","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"},"source_kind":"arxiv","source_id":"0904.0037","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-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OlFk0Py9hw0VmQSMEWRCVIyA071w8Gj70D+aaeBL09gp01HjseMERpHMslKObcJGl+QGFU8aV3MxTD9Xqzf/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T13:51:00.793377Z"},"content_sha256":"d251873f67adbae4789defc650e69a93b77b761630550499c5860e00f430b80b","schema_version":"1.0","event_id":"sha256:d251873f67adbae4789defc650e69a93b77b761630550499c5860e00f430b80b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:DW5HNLRQQ33CH7ISAVENKMYUNP","target":"graph","payload":{"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"},"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-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bc+oMTCQPRRxd+joSZqoP68CM9BFdQDXsZb7B83s1xsNi3oukZp2qloKDau9cYD80JgR76XClD7Rtt8Tuw9gDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T13:51:00.793985Z"},"content_sha256":"2882c4ad8cef524aee04d0a3c82847663ded2e406e178fc8eb73960c05ed0191","schema_version":"1.0","event_id":"sha256:2882c4ad8cef524aee04d0a3c82847663ded2e406e178fc8eb73960c05ed0191"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DW5HNLRQQ33CH7ISAVENKMYUNP/bundle.json","state_url":"https://pith.science/pith/DW5HNLRQQ33CH7ISAVENKMYUNP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DW5HNLRQQ33CH7ISAVENKMYUNP/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-08-13T13:51:00Z","links":{"resolver":"https://pith.science/pith/DW5HNLRQQ33CH7ISAVENKMYUNP","bundle":"https://pith.science/pith/DW5HNLRQQ33CH7ISAVENKMYUNP/bundle.json","state":"https://pith.science/pith/DW5HNLRQQ33CH7ISAVENKMYUNP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DW5HNLRQQ33CH7ISAVENKMYUNP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:DW5HNLRQQ33CH7ISAVENKMYUNP","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":"2d8c38f93876378f62a543c15d564f9d0b57ee358903da8a6f0e3cd3a3a6be37","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-01T00:02:13Z","title_canon_sha256":"327cf63d941e77479343f7af54a9bb6bef9a680a55eecb293c539f572265ad8f"},"schema_version":"1.0","source":{"id":"0904.0037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.0037","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0904.0037v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.0037","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"DW5HNLRQQ33C","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"DW5HNLRQQ33CH7IS","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"DW5HNLRQ","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:2882c4ad8cef524aee04d0a3c82847663ded2e406e178fc8eb73960c05ed0191","target":"graph","created_at":"2026-05-18T00:57:58Z","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":"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","authors_text":"Anders Host-Madsen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-01T00:02:13Z","title":"Deterministic Capacity of MIMO Relay Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.0037","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:d251873f67adbae4789defc650e69a93b77b761630550499c5860e00f430b80b","target":"record","created_at":"2026-05-18T00:57:58Z","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":"2d8c38f93876378f62a543c15d564f9d0b57ee358903da8a6f0e3cd3a3a6be37","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-01T00:02:13Z","title_canon_sha256":"327cf63d941e77479343f7af54a9bb6bef9a680a55eecb293c539f572265ad8f"},"schema_version":"1.0","source":{"id":"0904.0037","kind":"arxiv","version":1}},"canonical_sha256":"1dba76ae3086f623fd120548d533146bc633242a822f45dc7aa1c7ea439ef3a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dba76ae3086f623fd120548d533146bc633242a822f45dc7aa1c7ea439ef3a6","first_computed_at":"2026-05-18T00:57:58.238234Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:58.238234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/R8xyvh9GIp+7aRSo5Orh5vS5RplbLty/LzC2FVMrN1n3n/Ektc4j343kflEBQK2N4fggvmkUPUht/kgeu0AAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:58.238670Z","signed_message":"canonical_sha256_bytes"},"source_id":"0904.0037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d251873f67adbae4789defc650e69a93b77b761630550499c5860e00f430b80b","sha256:2882c4ad8cef524aee04d0a3c82847663ded2e406e178fc8eb73960c05ed0191"],"state_sha256":"238144b1a5c9bfbb2c414a24d80a033526c575c927b6fa006a447cafaab7c5ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yeHKgsF2CJn7rvFq5Mb4ItjUnS7We8yKS9ZhaIyr2G5q3XpCsKZPhOnx8LuPbLCjFYK2UoC+/ilUwRCbYCZdDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T13:51:00.797672Z","bundle_sha256":"a34e655aa098b5486235c4282471e145814a171a56f48a9e7a88f958d8fb6b50"}}