{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FV5ONLE3CWH72YYVGTPG6FUMDX","short_pith_number":"pith:FV5ONLE3","schema_version":"1.0","canonical_sha256":"2d7ae6ac9b158ffd631534de6f168c1de31c7f06c9eb326797f6f0bc5dbe5026","source":{"kind":"arxiv","id":"1203.4867","version":1},"attestation_state":"computed","paper":{"title":"Multi-hop Analog Network Coding: An Amplify-and-Forward Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Binyue Liu, Ning Cai","submitted_at":"2012-03-22T01:27:15Z","abstract_excerpt":"In this paper, we study the performance of an amplify-and-forward (AF) based analog network coding (ANC) relay scheme in a multi-hop wireless network under individual power constraints. In the first part, a unicast scenario is considered. The problem of finding the maximum achievable rate is formulated as an optimization problem. Rather than solving this non-concave maximization problem, we derive upper and lower bounds for the optimal rate. A cut-set like upper bound is obtained in a closed form for a layered relay network. A pseudo-optimal AF scheme is developed for a two-hop parallel networ"},"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":"1203.4867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-22T01:27:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9ca5e4f5bcc7504383a99d509430a3b9486c5782685b328daf0d8957378a7e91","abstract_canon_sha256":"1f69f2b44833cc264fb7d487343dffdf05612d641fdead3755a38719d5401088"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:28.526058Z","signature_b64":"ATcSkhQaYoWINDqoQSgLnr9jfwR626blyBnTLQBaqtWgN7F1jYaVh8/HIFob+/ygsmELiC1VDiN0yFql2OgwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d7ae6ac9b158ffd631534de6f168c1de31c7f06c9eb326797f6f0bc5dbe5026","last_reissued_at":"2026-05-18T03:59:28.525255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:28.525255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-hop Analog Network Coding: An Amplify-and-Forward Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Binyue Liu, Ning Cai","submitted_at":"2012-03-22T01:27:15Z","abstract_excerpt":"In this paper, we study the performance of an amplify-and-forward (AF) based analog network coding (ANC) relay scheme in a multi-hop wireless network under individual power constraints. In the first part, a unicast scenario is considered. The problem of finding the maximum achievable rate is formulated as an optimization problem. Rather than solving this non-concave maximization problem, we derive upper and lower bounds for the optimal rate. A cut-set like upper bound is obtained in a closed form for a layered relay network. A pseudo-optimal AF scheme is developed for a two-hop parallel networ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4867","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":"1203.4867","created_at":"2026-05-18T03:59:28.525399+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.4867v1","created_at":"2026-05-18T03:59:28.525399+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4867","created_at":"2026-05-18T03:59:28.525399+00:00"},{"alias_kind":"pith_short_12","alias_value":"FV5ONLE3CWH7","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FV5ONLE3CWH72YYV","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FV5ONLE3","created_at":"2026-05-18T12:27:06.952714+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/FV5ONLE3CWH72YYVGTPG6FUMDX","json":"https://pith.science/pith/FV5ONLE3CWH72YYVGTPG6FUMDX.json","graph_json":"https://pith.science/api/pith-number/FV5ONLE3CWH72YYVGTPG6FUMDX/graph.json","events_json":"https://pith.science/api/pith-number/FV5ONLE3CWH72YYVGTPG6FUMDX/events.json","paper":"https://pith.science/paper/FV5ONLE3"},"agent_actions":{"view_html":"https://pith.science/pith/FV5ONLE3CWH72YYVGTPG6FUMDX","download_json":"https://pith.science/pith/FV5ONLE3CWH72YYVGTPG6FUMDX.json","view_paper":"https://pith.science/paper/FV5ONLE3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.4867&json=true","fetch_graph":"https://pith.science/api/pith-number/FV5ONLE3CWH72YYVGTPG6FUMDX/graph.json","fetch_events":"https://pith.science/api/pith-number/FV5ONLE3CWH72YYVGTPG6FUMDX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FV5ONLE3CWH72YYVGTPG6FUMDX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FV5ONLE3CWH72YYVGTPG6FUMDX/action/storage_attestation","attest_author":"https://pith.science/pith/FV5ONLE3CWH72YYVGTPG6FUMDX/action/author_attestation","sign_citation":"https://pith.science/pith/FV5ONLE3CWH72YYVGTPG6FUMDX/action/citation_signature","submit_replication":"https://pith.science/pith/FV5ONLE3CWH72YYVGTPG6FUMDX/action/replication_record"}},"created_at":"2026-05-18T03:59:28.525399+00:00","updated_at":"2026-05-18T03:59:28.525399+00:00"}