{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VM2HJTBCU4TSHWXIYHARX2VW4H","short_pith_number":"pith:VM2HJTBC","schema_version":"1.0","canonical_sha256":"ab3474cc22a72723dae8c1c11beab6e1c4b95f09a50b6fd5fd8f60bf2c3b39f8","source":{"kind":"arxiv","id":"1101.2182","version":2},"attestation_state":"computed","paper":{"title":"The Degrees of Freedom of Compute-and-Forward","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Phil Whiting, Urs Niesen","submitted_at":"2011-01-11T19:20:35Z","abstract_excerpt":"We analyze the asymptotic behavior of compute-and-forward relay networks in the regime of high signal-to-noise ratios. We consider a section of such a network consisting of K transmitters and K relays. The aim of the relays is to reliably decode an invertible function of the messages sent by the transmitters. An upper bound on the capacity of this system can be obtained by allowing full cooperation among the transmitters and among the relays, transforming the network into a K times K multiple-input multiple-output (MIMO) channel. The number of degrees of freedom of compute-and-forward is hence"},"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":"1101.2182","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-11T19:20:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b5f051f9f8f579895d6d3859b734029af0db9ccff4a2e17b0affbca3a155ddb8","abstract_canon_sha256":"8c68af92fc9e2881147e9ecfdc32d7c78141e8d8241612199f22ae6f300f1085"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:58.668212Z","signature_b64":"koczBQ7Ig0N7h5cjXvd+kLNZJjqx4dnQ7E5aDB2pxSJABA4/LN5jjEpt8XwdRQFJ9BNsBK2k4eRikdGLxLJWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab3474cc22a72723dae8c1c11beab6e1c4b95f09a50b6fd5fd8f60bf2c3b39f8","last_reissued_at":"2026-05-18T02:22:58.667457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:58.667457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Degrees of Freedom of Compute-and-Forward","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Phil Whiting, Urs Niesen","submitted_at":"2011-01-11T19:20:35Z","abstract_excerpt":"We analyze the asymptotic behavior of compute-and-forward relay networks in the regime of high signal-to-noise ratios. We consider a section of such a network consisting of K transmitters and K relays. The aim of the relays is to reliably decode an invertible function of the messages sent by the transmitters. An upper bound on the capacity of this system can be obtained by allowing full cooperation among the transmitters and among the relays, transforming the network into a K times K multiple-input multiple-output (MIMO) channel. The number of degrees of freedom of compute-and-forward is hence"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2182","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1101.2182","created_at":"2026-05-18T02:22:58.667597+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.2182v2","created_at":"2026-05-18T02:22:58.667597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2182","created_at":"2026-05-18T02:22:58.667597+00:00"},{"alias_kind":"pith_short_12","alias_value":"VM2HJTBCU4TS","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VM2HJTBCU4TSHWXI","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VM2HJTBC","created_at":"2026-05-18T12:26:44.992195+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/VM2HJTBCU4TSHWXIYHARX2VW4H","json":"https://pith.science/pith/VM2HJTBCU4TSHWXIYHARX2VW4H.json","graph_json":"https://pith.science/api/pith-number/VM2HJTBCU4TSHWXIYHARX2VW4H/graph.json","events_json":"https://pith.science/api/pith-number/VM2HJTBCU4TSHWXIYHARX2VW4H/events.json","paper":"https://pith.science/paper/VM2HJTBC"},"agent_actions":{"view_html":"https://pith.science/pith/VM2HJTBCU4TSHWXIYHARX2VW4H","download_json":"https://pith.science/pith/VM2HJTBCU4TSHWXIYHARX2VW4H.json","view_paper":"https://pith.science/paper/VM2HJTBC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.2182&json=true","fetch_graph":"https://pith.science/api/pith-number/VM2HJTBCU4TSHWXIYHARX2VW4H/graph.json","fetch_events":"https://pith.science/api/pith-number/VM2HJTBCU4TSHWXIYHARX2VW4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VM2HJTBCU4TSHWXIYHARX2VW4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VM2HJTBCU4TSHWXIYHARX2VW4H/action/storage_attestation","attest_author":"https://pith.science/pith/VM2HJTBCU4TSHWXIYHARX2VW4H/action/author_attestation","sign_citation":"https://pith.science/pith/VM2HJTBCU4TSHWXIYHARX2VW4H/action/citation_signature","submit_replication":"https://pith.science/pith/VM2HJTBCU4TSHWXIYHARX2VW4H/action/replication_record"}},"created_at":"2026-05-18T02:22:58.667597+00:00","updated_at":"2026-05-18T02:22:58.667597+00:00"}