{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IUUORTPAIGDLM77I5L62OUZYJC","short_pith_number":"pith:IUUORTPA","schema_version":"1.0","canonical_sha256":"4528e8cde04186b67fe8eafda7533848ad01073a3477e076158ce2e15cdc1b90","source":{"kind":"arxiv","id":"1112.2690","version":2},"attestation_state":"computed","paper":{"title":"Multilevel Coding Schemes for Compute-and-Forward with Flexible Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brett Hern, Krishna Narayanan","submitted_at":"2011-12-12T20:37:34Z","abstract_excerpt":"We consider the design of coding schemes for the wireless two-way relaying channel when there is no channel state information at the transmitter. In the spirit of the compute and forward paradigm, we present a multilevel coding scheme that permits computation (or, decoding) of a class of functions at the relay. The function to be computed (or, decoded) is then chosen depending on the channel realization. We define such a class of functions which can be decoded at the relay using the proposed coding scheme and derive rates that are universally achievable over a set of channel gains when this cl"},"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":"1112.2690","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-12T20:37:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ed59f4705d43259d575bc4e0b6cec141d5ffd6507934ac4d55985ca8b94ee642","abstract_canon_sha256":"946aecae3970c74505a902c9b11b48d17256f3621da3515d071625af57ac3229"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:18.552580Z","signature_b64":"7CofOUGCHUncHndphL+f+NXcZOODDeOXwtQl4RY7ITo1GK1A+D1QF4nIAi0WcdMHmDXCU2GifuuDsh0cLgczCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4528e8cde04186b67fe8eafda7533848ad01073a3477e076158ce2e15cdc1b90","last_reissued_at":"2026-05-18T00:58:18.551798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:18.551798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multilevel Coding Schemes for Compute-and-Forward with Flexible Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brett Hern, Krishna Narayanan","submitted_at":"2011-12-12T20:37:34Z","abstract_excerpt":"We consider the design of coding schemes for the wireless two-way relaying channel when there is no channel state information at the transmitter. In the spirit of the compute and forward paradigm, we present a multilevel coding scheme that permits computation (or, decoding) of a class of functions at the relay. The function to be computed (or, decoded) is then chosen depending on the channel realization. We define such a class of functions which can be decoded at the relay using the proposed coding scheme and derive rates that are universally achievable over a set of channel gains when this cl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2690","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":"1112.2690","created_at":"2026-05-18T00:58:18.551944+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.2690v2","created_at":"2026-05-18T00:58:18.551944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2690","created_at":"2026-05-18T00:58:18.551944+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUUORTPAIGDL","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUUORTPAIGDLM77I","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUUORTPA","created_at":"2026-05-18T12:26:32.869790+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/IUUORTPAIGDLM77I5L62OUZYJC","json":"https://pith.science/pith/IUUORTPAIGDLM77I5L62OUZYJC.json","graph_json":"https://pith.science/api/pith-number/IUUORTPAIGDLM77I5L62OUZYJC/graph.json","events_json":"https://pith.science/api/pith-number/IUUORTPAIGDLM77I5L62OUZYJC/events.json","paper":"https://pith.science/paper/IUUORTPA"},"agent_actions":{"view_html":"https://pith.science/pith/IUUORTPAIGDLM77I5L62OUZYJC","download_json":"https://pith.science/pith/IUUORTPAIGDLM77I5L62OUZYJC.json","view_paper":"https://pith.science/paper/IUUORTPA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.2690&json=true","fetch_graph":"https://pith.science/api/pith-number/IUUORTPAIGDLM77I5L62OUZYJC/graph.json","fetch_events":"https://pith.science/api/pith-number/IUUORTPAIGDLM77I5L62OUZYJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUUORTPAIGDLM77I5L62OUZYJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUUORTPAIGDLM77I5L62OUZYJC/action/storage_attestation","attest_author":"https://pith.science/pith/IUUORTPAIGDLM77I5L62OUZYJC/action/author_attestation","sign_citation":"https://pith.science/pith/IUUORTPAIGDLM77I5L62OUZYJC/action/citation_signature","submit_replication":"https://pith.science/pith/IUUORTPAIGDLM77I5L62OUZYJC/action/replication_record"}},"created_at":"2026-05-18T00:58:18.551944+00:00","updated_at":"2026-05-18T00:58:18.551944+00:00"}