{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:S4RYAJLMYD2GAOGF3DSXEUZGFE","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":"5c5a61dcb50746f0bba7809463ccd14c52921e784043a0c51a911221149fc6e9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-04T22:54:22Z","title_canon_sha256":"a7f6fab5597e608d702d865b55c940d52a1a2c7f8f1439e4a246d4a597b3d8ad"},"schema_version":"1.0","source":{"id":"1510.00994","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00994","created_at":"2026-05-18T01:31:05Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00994v1","created_at":"2026-05-18T01:31:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00994","created_at":"2026-05-18T01:31:05Z"},{"alias_kind":"pith_short_12","alias_value":"S4RYAJLMYD2G","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S4RYAJLMYD2GAOGF","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S4RYAJLM","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:3ab57fe4bca2c7e6280c59c3b4dba5c6138d24bebf1d873375163997515dd6cb","target":"graph","created_at":"2026-05-18T01:31:05Z","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":"A class of diamond networks is studied where the broadcast component is orthogonal and modeled by two independent bit-pipes. New upper and lower bounds on the capacity are derived. The proof technique for the upper bound generalizes bounding techniques of Ozarow for the Gaussian multiple description problem (1981) and Kang and Liu for the Gaussian diamond network (2011). The lower bound is based on Marton's coding technique and superposition coding. The bounds are evaluated for Gaussian and binary adder multiple access channels (MACs). For Gaussian MACs, both the lower and upper bounds strengt","authors_text":"Gerhard Kramer, Shirin Saeedi Bidokhti","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-04T22:54:22Z","title":"Capacity Bounds for Diamond Networks with an Orthogonal Broadcast Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00994","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:f0ef4272d2d038bb2f3b032932748fe021f66fe42069a6e6034be0ccb48642e1","target":"record","created_at":"2026-05-18T01:31:05Z","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":"5c5a61dcb50746f0bba7809463ccd14c52921e784043a0c51a911221149fc6e9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-04T22:54:22Z","title_canon_sha256":"a7f6fab5597e608d702d865b55c940d52a1a2c7f8f1439e4a246d4a597b3d8ad"},"schema_version":"1.0","source":{"id":"1510.00994","kind":"arxiv","version":1}},"canonical_sha256":"972380256cc0f46038c5d8e572532629239b8e3103f067ec862c532b76875de6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"972380256cc0f46038c5d8e572532629239b8e3103f067ec862c532b76875de6","first_computed_at":"2026-05-18T01:31:05.050728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:05.050728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"egIiNUUKYeVfMIahM093c8haslcSSriPtBlYfP45JDZJ8twYue4n79MrizH6DgaDqeA4ChAi6OAFevZT2twmAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:05.051459Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.00994","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0ef4272d2d038bb2f3b032932748fe021f66fe42069a6e6034be0ccb48642e1","sha256:3ab57fe4bca2c7e6280c59c3b4dba5c6138d24bebf1d873375163997515dd6cb"],"state_sha256":"34d3dcedc5bd5bf140ae48a15d7519602698a1877c473009f751e728696e2e21"}