{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KY7TKQ55XIFW3XQHP5CU3VKXS3","short_pith_number":"pith:KY7TKQ55","canonical_record":{"source":{"id":"1209.4483","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-20T10:15:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"346ceea22762a39ddef04d13472a3fd5c9e01eae2f865a88696da1352356757f","abstract_canon_sha256":"83a494ed1be224af5f677a98875116eae21046e52120401271953491dd3f7c52"},"schema_version":"1.0"},"canonical_sha256":"563f3543bdba0b6dde077f454dd55796d0a03fd470f5bd74795ce5344a5f59d7","source":{"kind":"arxiv","id":"1209.4483","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4483","created_at":"2026-05-18T03:21:31Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4483v2","created_at":"2026-05-18T03:21:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4483","created_at":"2026-05-18T03:21:31Z"},{"alias_kind":"pith_short_12","alias_value":"KY7TKQ55XIFW","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KY7TKQ55XIFW3XQH","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KY7TKQ55","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KY7TKQ55XIFW3XQHP5CU3VKXS3","target":"record","payload":{"canonical_record":{"source":{"id":"1209.4483","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-20T10:15:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"346ceea22762a39ddef04d13472a3fd5c9e01eae2f865a88696da1352356757f","abstract_canon_sha256":"83a494ed1be224af5f677a98875116eae21046e52120401271953491dd3f7c52"},"schema_version":"1.0"},"canonical_sha256":"563f3543bdba0b6dde077f454dd55796d0a03fd470f5bd74795ce5344a5f59d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:31.594873Z","signature_b64":"JSFi4ic0OgvCVkzJFbEkS0/T5TAOsn5UzUhH3he3Im9FY72NAnGKvxwDwZzTv/OXjyFzVMcFQovaqt2NyyFtDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"563f3543bdba0b6dde077f454dd55796d0a03fd470f5bd74795ce5344a5f59d7","last_reissued_at":"2026-05-18T03:21:31.594369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:31.594369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.4483","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-18T03:21:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TDZkGHgZYkkNss1MpAH2B9fPBz2HKq1bZQssQhvRJ+O7YVjvsk30bUkCUAt1lUiEf/4v1mFiVqWn8ixtb2C7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T05:52:42.873110Z"},"content_sha256":"ae039387ad0e88eb78a8b2540a885558307b1292255eb8bff78fea46d232ab73","schema_version":"1.0","event_id":"sha256:ae039387ad0e88eb78a8b2540a885558307b1292255eb8bff78fea46d232ab73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KY7TKQ55XIFW3XQHP5CU3VKXS3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compute-and-Forward on a Multiaccess Relay Channel: Coding and Symmetric-Rate Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abdellatif Zaidi, Luc Vandendorpe, Mohieddine El Soussi","submitted_at":"2012-09-20T10:15:34Z","abstract_excerpt":"We consider a system in which two users communicate with a destination with the help of a half-duplex relay. Based on the compute-and-forward scheme, we develop and evaluate the performance of coding strategies that are of network coding spirit. In this framework, instead of decoding the users' information messages, the destination decodes two integer-valued linear combinations that relate the transmitted codewords. Two decoding schemes are considered. In the first one, the relay computes one of the linear combinations and then forwards it to the destination. The destination computes the other"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4483","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-18T03:21:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PGyV2HSgQELOUpVyW68RawlIY40q8YSIXu8hpYkQAXkWqbJUV04iHK1oH5Labapt2dp5KvYGe3x+LPffeVHMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T05:52:42.873755Z"},"content_sha256":"6fee21186a762bea35d762b98a46487ff33c0af1a4a9b6efa96e1d9274ba7e81","schema_version":"1.0","event_id":"sha256:6fee21186a762bea35d762b98a46487ff33c0af1a4a9b6efa96e1d9274ba7e81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KY7TKQ55XIFW3XQHP5CU3VKXS3/bundle.json","state_url":"https://pith.science/pith/KY7TKQ55XIFW3XQHP5CU3VKXS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KY7TKQ55XIFW3XQHP5CU3VKXS3/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-06-06T05:52:42Z","links":{"resolver":"https://pith.science/pith/KY7TKQ55XIFW3XQHP5CU3VKXS3","bundle":"https://pith.science/pith/KY7TKQ55XIFW3XQHP5CU3VKXS3/bundle.json","state":"https://pith.science/pith/KY7TKQ55XIFW3XQHP5CU3VKXS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KY7TKQ55XIFW3XQHP5CU3VKXS3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KY7TKQ55XIFW3XQHP5CU3VKXS3","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":"83a494ed1be224af5f677a98875116eae21046e52120401271953491dd3f7c52","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-20T10:15:34Z","title_canon_sha256":"346ceea22762a39ddef04d13472a3fd5c9e01eae2f865a88696da1352356757f"},"schema_version":"1.0","source":{"id":"1209.4483","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4483","created_at":"2026-05-18T03:21:31Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4483v2","created_at":"2026-05-18T03:21:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4483","created_at":"2026-05-18T03:21:31Z"},{"alias_kind":"pith_short_12","alias_value":"KY7TKQ55XIFW","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KY7TKQ55XIFW3XQH","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KY7TKQ55","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:6fee21186a762bea35d762b98a46487ff33c0af1a4a9b6efa96e1d9274ba7e81","target":"graph","created_at":"2026-05-18T03:21:31Z","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 a system in which two users communicate with a destination with the help of a half-duplex relay. Based on the compute-and-forward scheme, we develop and evaluate the performance of coding strategies that are of network coding spirit. In this framework, instead of decoding the users' information messages, the destination decodes two integer-valued linear combinations that relate the transmitted codewords. Two decoding schemes are considered. In the first one, the relay computes one of the linear combinations and then forwards it to the destination. The destination computes the other","authors_text":"Abdellatif Zaidi, Luc Vandendorpe, Mohieddine El Soussi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-20T10:15:34Z","title":"Compute-and-Forward on a Multiaccess Relay Channel: Coding and Symmetric-Rate Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4483","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:ae039387ad0e88eb78a8b2540a885558307b1292255eb8bff78fea46d232ab73","target":"record","created_at":"2026-05-18T03:21:31Z","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":"83a494ed1be224af5f677a98875116eae21046e52120401271953491dd3f7c52","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-20T10:15:34Z","title_canon_sha256":"346ceea22762a39ddef04d13472a3fd5c9e01eae2f865a88696da1352356757f"},"schema_version":"1.0","source":{"id":"1209.4483","kind":"arxiv","version":2}},"canonical_sha256":"563f3543bdba0b6dde077f454dd55796d0a03fd470f5bd74795ce5344a5f59d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"563f3543bdba0b6dde077f454dd55796d0a03fd470f5bd74795ce5344a5f59d7","first_computed_at":"2026-05-18T03:21:31.594369Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:31.594369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JSFi4ic0OgvCVkzJFbEkS0/T5TAOsn5UzUhH3he3Im9FY72NAnGKvxwDwZzTv/OXjyFzVMcFQovaqt2NyyFtDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:31.594873Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.4483","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae039387ad0e88eb78a8b2540a885558307b1292255eb8bff78fea46d232ab73","sha256:6fee21186a762bea35d762b98a46487ff33c0af1a4a9b6efa96e1d9274ba7e81"],"state_sha256":"261faf4925e602e9a1dac8453e20239e97539c56587e927ece4f6efe0c0871d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NzLtgVJM7gGdMInQZS+cqP5T7ou21oNE2X6iAZzQBRuvgR4HnTOW3P1fFdrwQCPw110LVJjcSeOS9PkAU2nXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T05:52:42.878881Z","bundle_sha256":"5e65752fade9c00772c82634dd229e473a251dc2477cfde84ae131259abd4006"}}