{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IUUORTPAIGDLM77I5L62OUZYJC","short_pith_number":"pith:IUUORTPA","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"},"canonical_sha256":"4528e8cde04186b67fe8eafda7533848ad01073a3477e076158ce2e15cdc1b90","source":{"kind":"arxiv","id":"1112.2690","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2690","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2690v2","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2690","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"pith_short_12","alias_value":"IUUORTPAIGDL","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"IUUORTPAIGDLM77I","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"IUUORTPA","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IUUORTPAIGDLM77I5L62OUZYJC","target":"record","payload":{"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"},"canonical_sha256":"4528e8cde04186b67fe8eafda7533848ad01073a3477e076158ce2e15cdc1b90","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"},"source_kind":"arxiv","source_id":"1112.2690","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pbOInl8PxcP+lCyPIYGWgo2OCqSS86Tjv6sj+4Rda9INMT391AjpDxlZAa6KXgvXzt9VtdOBj7qU/dG4MnakAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T11:50:44.608408Z"},"content_sha256":"ab7f9e169818a2bf72148eea4c28ddf360941d4fb2ced5b2e90c2fee25e2963d","schema_version":"1.0","event_id":"sha256:ab7f9e169818a2bf72148eea4c28ddf360941d4fb2ced5b2e90c2fee25e2963d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IUUORTPAIGDLM77I5L62OUZYJC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fPMS4fmLMy+6p/oVbidWKSnpiwCWPKWFt0fETqEjx02/Bu3ycJ69VghUY+6YC08+jOzph35SbpW9zswTvpq4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T11:50:44.608757Z"},"content_sha256":"a13ef4a76a3e8f748e57bb4ce84b3658a36bf7f160ae9cc5b3f2c77195569ecd","schema_version":"1.0","event_id":"sha256:a13ef4a76a3e8f748e57bb4ce84b3658a36bf7f160ae9cc5b3f2c77195569ecd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUUORTPAIGDLM77I5L62OUZYJC/bundle.json","state_url":"https://pith.science/pith/IUUORTPAIGDLM77I5L62OUZYJC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUUORTPAIGDLM77I5L62OUZYJC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-19T11:50:44Z","links":{"resolver":"https://pith.science/pith/IUUORTPAIGDLM77I5L62OUZYJC","bundle":"https://pith.science/pith/IUUORTPAIGDLM77I5L62OUZYJC/bundle.json","state":"https://pith.science/pith/IUUORTPAIGDLM77I5L62OUZYJC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUUORTPAIGDLM77I5L62OUZYJC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IUUORTPAIGDLM77I5L62OUZYJC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"946aecae3970c74505a902c9b11b48d17256f3621da3515d071625af57ac3229","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-12T20:37:34Z","title_canon_sha256":"ed59f4705d43259d575bc4e0b6cec141d5ffd6507934ac4d55985ca8b94ee642"},"schema_version":"1.0","source":{"id":"1112.2690","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2690","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2690v2","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2690","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"pith_short_12","alias_value":"IUUORTPAIGDL","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"IUUORTPAIGDLM77I","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"IUUORTPA","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:a13ef4a76a3e8f748e57bb4ce84b3658a36bf7f160ae9cc5b3f2c77195569ecd","target":"graph","created_at":"2026-05-18T00:58:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Brett Hern, Krishna Narayanan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-12T20:37:34Z","title":"Multilevel Coding Schemes for Compute-and-Forward with Flexible Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2690","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ab7f9e169818a2bf72148eea4c28ddf360941d4fb2ced5b2e90c2fee25e2963d","target":"record","created_at":"2026-05-18T00:58:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"946aecae3970c74505a902c9b11b48d17256f3621da3515d071625af57ac3229","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-12T20:37:34Z","title_canon_sha256":"ed59f4705d43259d575bc4e0b6cec141d5ffd6507934ac4d55985ca8b94ee642"},"schema_version":"1.0","source":{"id":"1112.2690","kind":"arxiv","version":2}},"canonical_sha256":"4528e8cde04186b67fe8eafda7533848ad01073a3477e076158ce2e15cdc1b90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4528e8cde04186b67fe8eafda7533848ad01073a3477e076158ce2e15cdc1b90","first_computed_at":"2026-05-18T00:58:18.551798Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:18.551798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7CofOUGCHUncHndphL+f+NXcZOODDeOXwtQl4RY7ITo1GK1A+D1QF4nIAi0WcdMHmDXCU2GifuuDsh0cLgczCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:18.552580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.2690","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab7f9e169818a2bf72148eea4c28ddf360941d4fb2ced5b2e90c2fee25e2963d","sha256:a13ef4a76a3e8f748e57bb4ce84b3658a36bf7f160ae9cc5b3f2c77195569ecd"],"state_sha256":"6579c35bb234233178a42220910410048e8ff35bfa130e6dce696808e804993e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uzhg9Q2KNljZ4e5vKYyHvnikpw0lJB1QxoOy3BiArWe56y9ioCcwhtZFdNFLSr+C7ysif9j+xmmStjAEvylfAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T11:50:44.610505Z","bundle_sha256":"66460cacdc49633825985194c80735a8a86e6f5b5e5beebdb7b3b05825461f89"}}