{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:I2U2QLMJHYPEJE2AUEGZTSDGAL","short_pith_number":"pith:I2U2QLMJ","schema_version":"1.0","canonical_sha256":"46a9a82d893e1e449340a10d99c86602d8394bb8a0f7d522e056872fc990fed4","source":{"kind":"arxiv","id":"1108.6312","version":3},"attestation_state":"computed","paper":{"title":"Computation Alignment: Capacity Approximation without Noise Accumulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bobak Nazer, Phil Whiting, Urs Niesen","submitted_at":"2011-08-31T18:26:10Z","abstract_excerpt":"Consider several source nodes communicating across a wireless network to a destination node with the help of several layers of relay nodes. Recent work by Avestimehr et al. has approximated the capacity of this network up to an additive gap. The communication scheme achieving this capacity approximation is based on compress-and-forward, resulting in noise accumulation as the messages traverse the network. As a consequence, the approximation gap increases linearly with the network depth.\n  This paper develops a computation alignment strategy that can approach the capacity of a class of layered,"},"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":"1108.6312","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-31T18:26:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3a5950d3c13fbe4a3e9fa2f5d0a46cf0eca978d11cce0a64eb2ba17eeb94c9a0","abstract_canon_sha256":"a552f5a2b1148b94a2d3c7526f5a5a3aca3df15af5a818439b87be857769243b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:54.973030Z","signature_b64":"QyxP32TcQU5gTa2f16mUn+38Gz1yLESQBN/vC4R1cL2RLRJ7PqMwkyg3JZv3+2Eh4v7K47z+tC5cYK4EGoO+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46a9a82d893e1e449340a10d99c86602d8394bb8a0f7d522e056872fc990fed4","last_reissued_at":"2026-05-18T03:21:54.972256Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:54.972256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computation Alignment: Capacity Approximation without Noise Accumulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bobak Nazer, Phil Whiting, Urs Niesen","submitted_at":"2011-08-31T18:26:10Z","abstract_excerpt":"Consider several source nodes communicating across a wireless network to a destination node with the help of several layers of relay nodes. Recent work by Avestimehr et al. has approximated the capacity of this network up to an additive gap. The communication scheme achieving this capacity approximation is based on compress-and-forward, resulting in noise accumulation as the messages traverse the network. As a consequence, the approximation gap increases linearly with the network depth.\n  This paper develops a computation alignment strategy that can approach the capacity of a class of layered,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.6312","kind":"arxiv","version":3},"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":"1108.6312","created_at":"2026-05-18T03:21:54.972384+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.6312v3","created_at":"2026-05-18T03:21:54.972384+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.6312","created_at":"2026-05-18T03:21:54.972384+00:00"},{"alias_kind":"pith_short_12","alias_value":"I2U2QLMJHYPE","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"I2U2QLMJHYPEJE2A","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"I2U2QLMJ","created_at":"2026-05-18T12:26:30.835961+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/I2U2QLMJHYPEJE2AUEGZTSDGAL","json":"https://pith.science/pith/I2U2QLMJHYPEJE2AUEGZTSDGAL.json","graph_json":"https://pith.science/api/pith-number/I2U2QLMJHYPEJE2AUEGZTSDGAL/graph.json","events_json":"https://pith.science/api/pith-number/I2U2QLMJHYPEJE2AUEGZTSDGAL/events.json","paper":"https://pith.science/paper/I2U2QLMJ"},"agent_actions":{"view_html":"https://pith.science/pith/I2U2QLMJHYPEJE2AUEGZTSDGAL","download_json":"https://pith.science/pith/I2U2QLMJHYPEJE2AUEGZTSDGAL.json","view_paper":"https://pith.science/paper/I2U2QLMJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.6312&json=true","fetch_graph":"https://pith.science/api/pith-number/I2U2QLMJHYPEJE2AUEGZTSDGAL/graph.json","fetch_events":"https://pith.science/api/pith-number/I2U2QLMJHYPEJE2AUEGZTSDGAL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I2U2QLMJHYPEJE2AUEGZTSDGAL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I2U2QLMJHYPEJE2AUEGZTSDGAL/action/storage_attestation","attest_author":"https://pith.science/pith/I2U2QLMJHYPEJE2AUEGZTSDGAL/action/author_attestation","sign_citation":"https://pith.science/pith/I2U2QLMJHYPEJE2AUEGZTSDGAL/action/citation_signature","submit_replication":"https://pith.science/pith/I2U2QLMJHYPEJE2AUEGZTSDGAL/action/replication_record"}},"created_at":"2026-05-18T03:21:54.972384+00:00","updated_at":"2026-05-18T03:21:54.972384+00:00"}