{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3WZLQ56CUNHLJGSIZOKWSZ5OWL","short_pith_number":"pith:3WZLQ56C","canonical_record":{"source":{"id":"1204.2150","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-10T13:49:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"82a74a77638584de1d1ffc356de281d57a63f1a90fdd42aea483c35256fdbf1b","abstract_canon_sha256":"b1867e42ba13ef03b48558a44bf443f4cf3d71177c681cfc0f95e7928b2a1ab7"},"schema_version":"1.0"},"canonical_sha256":"ddb2b877c2a34eb49a48cb956967aeb2ef22cef12b941389e082ecc5e23f9f10","source":{"kind":"arxiv","id":"1204.2150","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2150","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2150v2","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2150","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"pith_short_12","alias_value":"3WZLQ56CUNHL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3WZLQ56CUNHLJGSI","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3WZLQ56C","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3WZLQ56CUNHLJGSIZOKWSZ5OWL","target":"record","payload":{"canonical_record":{"source":{"id":"1204.2150","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-10T13:49:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"82a74a77638584de1d1ffc356de281d57a63f1a90fdd42aea483c35256fdbf1b","abstract_canon_sha256":"b1867e42ba13ef03b48558a44bf443f4cf3d71177c681cfc0f95e7928b2a1ab7"},"schema_version":"1.0"},"canonical_sha256":"ddb2b877c2a34eb49a48cb956967aeb2ef22cef12b941389e082ecc5e23f9f10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:15.613268Z","signature_b64":"Kdf3GM4pLOloOQk+MhZ4aPgow0KvYrDGxXGceqBZW99KbkU1xxdfT2r5qn80G0qCj/BKlQMK63bJQHLWIOYbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddb2b877c2a34eb49a48cb956967aeb2ef22cef12b941389e082ecc5e23f9f10","last_reissued_at":"2026-05-18T03:57:15.612647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:15.612647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.2150","source_version":2,"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-18T03:57:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oTsMFend4WWvwqiFQCJ8MwIaU6V6C5m7WGIx8YXdyawSaIo//WR5tU5uBBhTCEfOFvDZ57cO4Z/8sYcT9ZDHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:53:43.374873Z"},"content_sha256":"2b9a087764e9ace710e298a35fd151f637b2e884f9d72b39027658c497a37edf","schema_version":"1.0","event_id":"sha256:2b9a087764e9ace710e298a35fd151f637b2e884f9d72b39027658c497a37edf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3WZLQ56CUNHLJGSIZOKWSZ5OWL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analog Network Coding in General SNR Regime: Performance of Network Simplification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Minghua Chen, Samar Agnihotri, Sidharth Jaggi","submitted_at":"2012-04-10T13:49:57Z","abstract_excerpt":"We consider a communication scenario where a source communicates with a destination over a directed layered relay network. Each relay performs analog network coding where it scales and forwards the signals received at its input. In this scenario, we address the question: What portion of the maximum end-to-end achievable rate can be maintained if only a fraction of relay nodes available at each layer are used?\n  We consider, in particular, the Gaussian diamond network (layered network with a single layer of relay nodes) and a class of symmetric layered networks. For these networks we show that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2150","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"},"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-18T03:57:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3+5XeCSt6L8hf4hv5eKi7RqzCwa7TNetGbdpWdxLv5DB/NZvE2XjVwQCnzQxGimJUMculh4W6eAv5HVD046sDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:53:43.375374Z"},"content_sha256":"dfaf8516b038240680a3b6e203af97faa0f20748d19b7661020e87b4137e091d","schema_version":"1.0","event_id":"sha256:dfaf8516b038240680a3b6e203af97faa0f20748d19b7661020e87b4137e091d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3WZLQ56CUNHLJGSIZOKWSZ5OWL/bundle.json","state_url":"https://pith.science/pith/3WZLQ56CUNHLJGSIZOKWSZ5OWL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3WZLQ56CUNHLJGSIZOKWSZ5OWL/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-05-25T21:53:43Z","links":{"resolver":"https://pith.science/pith/3WZLQ56CUNHLJGSIZOKWSZ5OWL","bundle":"https://pith.science/pith/3WZLQ56CUNHLJGSIZOKWSZ5OWL/bundle.json","state":"https://pith.science/pith/3WZLQ56CUNHLJGSIZOKWSZ5OWL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3WZLQ56CUNHLJGSIZOKWSZ5OWL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3WZLQ56CUNHLJGSIZOKWSZ5OWL","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":"b1867e42ba13ef03b48558a44bf443f4cf3d71177c681cfc0f95e7928b2a1ab7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-10T13:49:57Z","title_canon_sha256":"82a74a77638584de1d1ffc356de281d57a63f1a90fdd42aea483c35256fdbf1b"},"schema_version":"1.0","source":{"id":"1204.2150","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2150","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2150v2","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2150","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"pith_short_12","alias_value":"3WZLQ56CUNHL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3WZLQ56CUNHLJGSI","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3WZLQ56C","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:dfaf8516b038240680a3b6e203af97faa0f20748d19b7661020e87b4137e091d","target":"graph","created_at":"2026-05-18T03:57:15Z","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 consider a communication scenario where a source communicates with a destination over a directed layered relay network. Each relay performs analog network coding where it scales and forwards the signals received at its input. In this scenario, we address the question: What portion of the maximum end-to-end achievable rate can be maintained if only a fraction of relay nodes available at each layer are used?\n  We consider, in particular, the Gaussian diamond network (layered network with a single layer of relay nodes) and a class of symmetric layered networks. For these networks we show that ","authors_text":"Minghua Chen, Samar Agnihotri, Sidharth Jaggi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-10T13:49:57Z","title":"Analog Network Coding in General SNR Regime: Performance of Network Simplification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2150","kind":"arxiv","version":2},"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:2b9a087764e9ace710e298a35fd151f637b2e884f9d72b39027658c497a37edf","target":"record","created_at":"2026-05-18T03:57:15Z","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":"b1867e42ba13ef03b48558a44bf443f4cf3d71177c681cfc0f95e7928b2a1ab7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-10T13:49:57Z","title_canon_sha256":"82a74a77638584de1d1ffc356de281d57a63f1a90fdd42aea483c35256fdbf1b"},"schema_version":"1.0","source":{"id":"1204.2150","kind":"arxiv","version":2}},"canonical_sha256":"ddb2b877c2a34eb49a48cb956967aeb2ef22cef12b941389e082ecc5e23f9f10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ddb2b877c2a34eb49a48cb956967aeb2ef22cef12b941389e082ecc5e23f9f10","first_computed_at":"2026-05-18T03:57:15.612647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:15.612647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kdf3GM4pLOloOQk+MhZ4aPgow0KvYrDGxXGceqBZW99KbkU1xxdfT2r5qn80G0qCj/BKlQMK63bJQHLWIOYbBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:15.613268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.2150","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b9a087764e9ace710e298a35fd151f637b2e884f9d72b39027658c497a37edf","sha256:dfaf8516b038240680a3b6e203af97faa0f20748d19b7661020e87b4137e091d"],"state_sha256":"127c7bd4295510b15bad24042b2f5df8e2a62ea80746bcd68092709fc2d514a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FW+5V23HBEV07Vq11s0QoaL+LyDnEtk2aqrPV6b/PAXKvrYUOb4iHj8X12rrz18r8Eci+dt+CwQ3dv8MCODuBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:53:43.378841Z","bundle_sha256":"5841fe355bc3ede5824591310ead4ba194d0cc2fb7705bd9297dc09d02a9e191"}}