{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:EXNKGRPUGGVZOOVI4JUXXT53AY","short_pith_number":"pith:EXNKGRPU","schema_version":"1.0","canonical_sha256":"25daa345f431ab973aa8e2697bcfbb0636188a23668b8d8a6aee6255e4d8d2a4","source":{"kind":"arxiv","id":"1111.4244","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1111.4244","created_at":"2026-05-18T04:08:04.729938+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.4244v1","created_at":"2026-05-18T04:08:04.729938+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4244","created_at":"2026-05-18T04:08:04.729938+00:00"},{"alias_kind":"pith_short_12","alias_value":"EXNKGRPUGGVZ","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"EXNKGRPUGGVZOOVI","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"EXNKGRPU","created_at":"2026-05-18T12:26:28.662955+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/EXNKGRPUGGVZOOVI4JUXXT53AY","json":"https://pith.science/pith/EXNKGRPUGGVZOOVI4JUXXT53AY.json","graph_json":"https://pith.science/api/pith-number/EXNKGRPUGGVZOOVI4JUXXT53AY/graph.json","events_json":"https://pith.science/api/pith-number/EXNKGRPUGGVZOOVI4JUXXT53AY/events.json","paper":"https://pith.science/paper/EXNKGRPU"},"agent_actions":{"view_html":"https://pith.science/pith/EXNKGRPUGGVZOOVI4JUXXT53AY","download_json":"https://pith.science/pith/EXNKGRPUGGVZOOVI4JUXXT53AY.json","view_paper":"https://pith.science/paper/EXNKGRPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.4244&json=true","fetch_graph":"https://pith.science/api/pith-number/EXNKGRPUGGVZOOVI4JUXXT53AY/graph.json","fetch_events":"https://pith.science/api/pith-number/EXNKGRPUGGVZOOVI4JUXXT53AY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EXNKGRPUGGVZOOVI4JUXXT53AY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EXNKGRPUGGVZOOVI4JUXXT53AY/action/storage_attestation","attest_author":"https://pith.science/pith/EXNKGRPUGGVZOOVI4JUXXT53AY/action/author_attestation","sign_citation":"https://pith.science/pith/EXNKGRPUGGVZOOVI4JUXXT53AY/action/citation_signature","submit_replication":"https://pith.science/pith/EXNKGRPUGGVZOOVI4JUXXT53AY/action/replication_record"}},"created_at":"2026-05-18T04:08:04.729938+00:00","updated_at":"2026-05-18T04:08:04.729938+00:00"}