{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:EXNKGRPUGGVZOOVI4JUXXT53AY","short_pith_number":"pith:EXNKGRPU","canonical_record":{"source":{"id":"1111.4244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-18T00:29:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7ee3730fd42d84031efd5066828f65b52e97846071b467c5d483774578a6b18d","abstract_canon_sha256":"7d255505894a344cd92e7d045fc0da1ecc3178e4420a16fbd849b6008962e23c"},"schema_version":"1.0"},"canonical_sha256":"25daa345f431ab973aa8e2697bcfbb0636188a23668b8d8a6aee6255e4d8d2a4","source":{"kind":"arxiv","id":"1111.4244","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4244","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4244v1","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4244","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"pith_short_12","alias_value":"EXNKGRPUGGVZ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EXNKGRPUGGVZOOVI","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EXNKGRPU","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:EXNKGRPUGGVZOOVI4JUXXT53AY","target":"record","payload":{"canonical_record":{"source":{"id":"1111.4244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-18T00:29:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7ee3730fd42d84031efd5066828f65b52e97846071b467c5d483774578a6b18d","abstract_canon_sha256":"7d255505894a344cd92e7d045fc0da1ecc3178e4420a16fbd849b6008962e23c"},"schema_version":"1.0"},"canonical_sha256":"25daa345f431ab973aa8e2697bcfbb0636188a23668b8d8a6aee6255e4d8d2a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:04.730367Z","signature_b64":"qzVd0s9NA1e4LmOrkRHQhpm+caJeCKq0zlmCFHs0DqdwnfhAL9ySxeNCBlnwXKjbXb8uCvaijNSUsDmykZ6ADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25daa345f431ab973aa8e2697bcfbb0636188a23668b8d8a6aee6255e4d8d2a4","last_reissued_at":"2026-05-18T04:08:04.729864Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:04.729864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.4244","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-18T04:08:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qot3UbZU9m68EjcFa0IJ92P5/TEX/cCJb0BkpURr6shSmttFVGpRoqf2Qv88m61kKp1kMpRmvHV3UW9a5hkABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T13:05:49.971296Z"},"content_sha256":"c35ead36ea2250dd87577dd04ad71ec54a7a0d1d4daff48b35e41c4e91553fca","schema_version":"1.0","event_id":"sha256:c35ead36ea2250dd87577dd04ad71ec54a7a0d1d4daff48b35e41c4e91553fca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:EXNKGRPUGGVZOOVI4JUXXT53AY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Capacity Computation and Power Optimization for Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farzad Parvaresh, Raul Etkin","submitted_at":"2011-11-18T00:29:51Z","abstract_excerpt":"The capacity or approximations to capacity of various single-source single-destination relay network models has been characterized in terms of the cut-set upper bound. In principle, a direct computation of this bound requires evaluating the cut capacity over exponentially many cuts. We show that the minimum cut capacity of a relay network under some special assumptions can be cast as a minimization of a submodular function, and as a result, can be computed efficiently. We use this result to show that the capacity, or an approximation to the capacity within a constant gap for the Gaussian, wire"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4244","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-18T04:08:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7NtFpErQ66G19KYGqSSN7yAgvv9WLFtgCu7JuTBPkNzX8nNKZs6NBOMGsxe3bsLkP6mjInS90ommIduJujW7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T13:05:49.972001Z"},"content_sha256":"f9f7bc8d3f44652a4f41ef6876134afd61cd9562a95bac0753a5a93cf58c9d8b","schema_version":"1.0","event_id":"sha256:f9f7bc8d3f44652a4f41ef6876134afd61cd9562a95bac0753a5a93cf58c9d8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXNKGRPUGGVZOOVI4JUXXT53AY/bundle.json","state_url":"https://pith.science/pith/EXNKGRPUGGVZOOVI4JUXXT53AY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXNKGRPUGGVZOOVI4JUXXT53AY/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-24T13:05:49Z","links":{"resolver":"https://pith.science/pith/EXNKGRPUGGVZOOVI4JUXXT53AY","bundle":"https://pith.science/pith/EXNKGRPUGGVZOOVI4JUXXT53AY/bundle.json","state":"https://pith.science/pith/EXNKGRPUGGVZOOVI4JUXXT53AY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXNKGRPUGGVZOOVI4JUXXT53AY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:EXNKGRPUGGVZOOVI4JUXXT53AY","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":"7d255505894a344cd92e7d045fc0da1ecc3178e4420a16fbd849b6008962e23c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-18T00:29:51Z","title_canon_sha256":"7ee3730fd42d84031efd5066828f65b52e97846071b467c5d483774578a6b18d"},"schema_version":"1.0","source":{"id":"1111.4244","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4244","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4244v1","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4244","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"pith_short_12","alias_value":"EXNKGRPUGGVZ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EXNKGRPUGGVZOOVI","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EXNKGRPU","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:f9f7bc8d3f44652a4f41ef6876134afd61cd9562a95bac0753a5a93cf58c9d8b","target":"graph","created_at":"2026-05-18T04:08:04Z","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 capacity or approximations to capacity of various single-source single-destination relay network models has been characterized in terms of the cut-set upper bound. In principle, a direct computation of this bound requires evaluating the cut capacity over exponentially many cuts. We show that the minimum cut capacity of a relay network under some special assumptions can be cast as a minimization of a submodular function, and as a result, can be computed efficiently. We use this result to show that the capacity, or an approximation to the capacity within a constant gap for the Gaussian, wire","authors_text":"Farzad Parvaresh, Raul Etkin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-18T00:29:51Z","title":"Efficient Capacity Computation and Power Optimization for Relay Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4244","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:c35ead36ea2250dd87577dd04ad71ec54a7a0d1d4daff48b35e41c4e91553fca","target":"record","created_at":"2026-05-18T04:08:04Z","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":"7d255505894a344cd92e7d045fc0da1ecc3178e4420a16fbd849b6008962e23c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-18T00:29:51Z","title_canon_sha256":"7ee3730fd42d84031efd5066828f65b52e97846071b467c5d483774578a6b18d"},"schema_version":"1.0","source":{"id":"1111.4244","kind":"arxiv","version":1}},"canonical_sha256":"25daa345f431ab973aa8e2697bcfbb0636188a23668b8d8a6aee6255e4d8d2a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25daa345f431ab973aa8e2697bcfbb0636188a23668b8d8a6aee6255e4d8d2a4","first_computed_at":"2026-05-18T04:08:04.729864Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:04.729864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qzVd0s9NA1e4LmOrkRHQhpm+caJeCKq0zlmCFHs0DqdwnfhAL9ySxeNCBlnwXKjbXb8uCvaijNSUsDmykZ6ADg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:04.730367Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.4244","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c35ead36ea2250dd87577dd04ad71ec54a7a0d1d4daff48b35e41c4e91553fca","sha256:f9f7bc8d3f44652a4f41ef6876134afd61cd9562a95bac0753a5a93cf58c9d8b"],"state_sha256":"a7a24a091f3e2a87dcfc2abf9c150af4f44d9069ad6b9d0793b75f9b166d294d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TZHgnfFrubtTLuvB/IwG5BHR4r7QqAcA0ZOnGCtM1gshPXhXiaEOCzS0rz7cL12eyeMtTR9nf8X/PP0ksqPSDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T13:05:49.975553Z","bundle_sha256":"1714b81959634933f73fb4b81aec2e96263bd56838676a93bafc1a1f831e43d0"}}