{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YFUUPIOXV2QJHKCEDMOCA3SLEV","short_pith_number":"pith:YFUUPIOX","canonical_record":{"source":{"id":"1107.0300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-01T18:52:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5fe2e52a3c4f2a1a96a940f5d4af21e3ca8d5fae5abcf20a4aa283641577e31f","abstract_canon_sha256":"301599c25b45903672e37a8c676354fd4f4eb7e7b020f4ebc63883296d3575d3"},"schema_version":"1.0"},"canonical_sha256":"c16947a1d7aea093a8441b1c206e4b254f0b36734881ee1ea2b663b7a39ec7b1","source":{"kind":"arxiv","id":"1107.0300","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0300","created_at":"2026-05-18T04:18:55Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0300v1","created_at":"2026-05-18T04:18:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0300","created_at":"2026-05-18T04:18:55Z"},{"alias_kind":"pith_short_12","alias_value":"YFUUPIOXV2QJ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YFUUPIOXV2QJHKCE","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YFUUPIOX","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YFUUPIOXV2QJHKCEDMOCA3SLEV","target":"record","payload":{"canonical_record":{"source":{"id":"1107.0300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-01T18:52:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5fe2e52a3c4f2a1a96a940f5d4af21e3ca8d5fae5abcf20a4aa283641577e31f","abstract_canon_sha256":"301599c25b45903672e37a8c676354fd4f4eb7e7b020f4ebc63883296d3575d3"},"schema_version":"1.0"},"canonical_sha256":"c16947a1d7aea093a8441b1c206e4b254f0b36734881ee1ea2b663b7a39ec7b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:55.102080Z","signature_b64":"MfPQ5cP4UEAeYheo1gcxsjCncgDR3F0Cb36dpSOKvOGBoFC/JP+gP4XTMFxb13Y1TQEevh7tJm+K34wJGqYlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c16947a1d7aea093a8441b1c206e4b254f0b36734881ee1ea2b663b7a39ec7b1","last_reissued_at":"2026-05-18T04:18:55.101639Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:55.101639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.0300","source_version":1,"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-18T04:18:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"trmHaSIotfU5juzBqaeIA35IzakmPlfPb2D/ptEmhIgGBJ+9WdpAXG1dnWw5UFltmxTbSxwlApRwx85WR2CTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:52:29.689239Z"},"content_sha256":"255b5a88149f25b876a40b887214e5225a239638b5aeeddc02e99a03b8aaa064","schema_version":"1.0","event_id":"sha256:255b5a88149f25b876a40b887214e5225a239638b5aeeddc02e99a03b8aaa064"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YFUUPIOXV2QJHKCEDMOCA3SLEV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Compute-and-Forward Protocol: Implementation and Practical Aspects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Osmane, Jean-Claude Belfiore","submitted_at":"2011-07-01T18:52:16Z","abstract_excerpt":"In a recent work, Nazer and Gastpar proposed the Compute-and-Forward strategy as a physical-layer network coding scheme. They described a code structure based on nested lattices whose algebraic structure makes the scheme reliable and efficient. In this work, we consider the implementation of their scheme for real Gaussian channels and one dimensional lattices. We relate the maximization of the transmission rate to the lattice shortest vector problem. We explicit, in this case, the maximum likelihood criterion and show that it can be implemented by using an Inhomogeneous Diophantine Approximati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0300","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"},"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-18T04:18:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yd7yRXSNuOsvDrTOeLGrFDMo/tN7G0fGf32QvtHe4xwUuxACy3RKi3pQMNCBdOKUkTWwoA/VEgVhf9VJAIF/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:52:29.689990Z"},"content_sha256":"9ddb3573c827a79bed8940e2bef5f76cbaf97ff9efd8f3f65dc71b93ee75ec3f","schema_version":"1.0","event_id":"sha256:9ddb3573c827a79bed8940e2bef5f76cbaf97ff9efd8f3f65dc71b93ee75ec3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YFUUPIOXV2QJHKCEDMOCA3SLEV/bundle.json","state_url":"https://pith.science/pith/YFUUPIOXV2QJHKCEDMOCA3SLEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YFUUPIOXV2QJHKCEDMOCA3SLEV/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-27T16:52:29Z","links":{"resolver":"https://pith.science/pith/YFUUPIOXV2QJHKCEDMOCA3SLEV","bundle":"https://pith.science/pith/YFUUPIOXV2QJHKCEDMOCA3SLEV/bundle.json","state":"https://pith.science/pith/YFUUPIOXV2QJHKCEDMOCA3SLEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YFUUPIOXV2QJHKCEDMOCA3SLEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YFUUPIOXV2QJHKCEDMOCA3SLEV","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":"301599c25b45903672e37a8c676354fd4f4eb7e7b020f4ebc63883296d3575d3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-01T18:52:16Z","title_canon_sha256":"5fe2e52a3c4f2a1a96a940f5d4af21e3ca8d5fae5abcf20a4aa283641577e31f"},"schema_version":"1.0","source":{"id":"1107.0300","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0300","created_at":"2026-05-18T04:18:55Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0300v1","created_at":"2026-05-18T04:18:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0300","created_at":"2026-05-18T04:18:55Z"},{"alias_kind":"pith_short_12","alias_value":"YFUUPIOXV2QJ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YFUUPIOXV2QJHKCE","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YFUUPIOX","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:9ddb3573c827a79bed8940e2bef5f76cbaf97ff9efd8f3f65dc71b93ee75ec3f","target":"graph","created_at":"2026-05-18T04:18:55Z","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":"In a recent work, Nazer and Gastpar proposed the Compute-and-Forward strategy as a physical-layer network coding scheme. They described a code structure based on nested lattices whose algebraic structure makes the scheme reliable and efficient. In this work, we consider the implementation of their scheme for real Gaussian channels and one dimensional lattices. We relate the maximization of the transmission rate to the lattice shortest vector problem. We explicit, in this case, the maximum likelihood criterion and show that it can be implemented by using an Inhomogeneous Diophantine Approximati","authors_text":"Ali Osmane, Jean-Claude Belfiore","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-01T18:52:16Z","title":"The Compute-and-Forward Protocol: Implementation and Practical Aspects"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0300","kind":"arxiv","version":1},"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:255b5a88149f25b876a40b887214e5225a239638b5aeeddc02e99a03b8aaa064","target":"record","created_at":"2026-05-18T04:18:55Z","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":"301599c25b45903672e37a8c676354fd4f4eb7e7b020f4ebc63883296d3575d3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-01T18:52:16Z","title_canon_sha256":"5fe2e52a3c4f2a1a96a940f5d4af21e3ca8d5fae5abcf20a4aa283641577e31f"},"schema_version":"1.0","source":{"id":"1107.0300","kind":"arxiv","version":1}},"canonical_sha256":"c16947a1d7aea093a8441b1c206e4b254f0b36734881ee1ea2b663b7a39ec7b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c16947a1d7aea093a8441b1c206e4b254f0b36734881ee1ea2b663b7a39ec7b1","first_computed_at":"2026-05-18T04:18:55.101639Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:55.101639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MfPQ5cP4UEAeYheo1gcxsjCncgDR3F0Cb36dpSOKvOGBoFC/JP+gP4XTMFxb13Y1TQEevh7tJm+K34wJGqYlDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:55.102080Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.0300","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:255b5a88149f25b876a40b887214e5225a239638b5aeeddc02e99a03b8aaa064","sha256:9ddb3573c827a79bed8940e2bef5f76cbaf97ff9efd8f3f65dc71b93ee75ec3f"],"state_sha256":"6aa2f68530c1ecdf0cf0c528d254665cc30335b426097b7345acc0b73eac2069"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NtYlQh7sY1m0O9hhOpuq7Rjmwu3tC6W7RzkGhXTk04jxd/gUva3pkGahRA4E4fIlzP+QFKIcXBRiYaK5zsUeCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:52:29.693250Z","bundle_sha256":"af58e4d840a78a25d00cca9a78ac5d8e30dde1ca63a99cd9cccd3b0e751fbc68"}}