{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QSJHZ7DSLEGZGWCXW6MDMO33DO","short_pith_number":"pith:QSJHZ7DS","canonical_record":{"source":{"id":"1409.1427","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-04T12:54:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d7019702489ba5e9674ddc2ce1de8577835cf86501e8dd6d37beaae736d7d181","abstract_canon_sha256":"51abedaacadb78338c620159518ae00c6bd019d7a940a3af16543e199e13fe70"},"schema_version":"1.0"},"canonical_sha256":"84927cfc72590d935857b798363b7b1b8a44521db4f1221b066318b2c930cee0","source":{"kind":"arxiv","id":"1409.1427","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1427","created_at":"2026-05-18T02:39:55Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1427v2","created_at":"2026-05-18T02:39:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1427","created_at":"2026-05-18T02:39:55Z"},{"alias_kind":"pith_short_12","alias_value":"QSJHZ7DSLEGZ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QSJHZ7DSLEGZGWCX","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QSJHZ7DS","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QSJHZ7DSLEGZGWCXW6MDMO33DO","target":"record","payload":{"canonical_record":{"source":{"id":"1409.1427","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-04T12:54:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d7019702489ba5e9674ddc2ce1de8577835cf86501e8dd6d37beaae736d7d181","abstract_canon_sha256":"51abedaacadb78338c620159518ae00c6bd019d7a940a3af16543e199e13fe70"},"schema_version":"1.0"},"canonical_sha256":"84927cfc72590d935857b798363b7b1b8a44521db4f1221b066318b2c930cee0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:55.374525Z","signature_b64":"1ix44xiRC8rsdYkjCV/KqYEIZNJgewWJf2FhVX3tHxwz4NsRrpzsZMKgsaAuvNKjYOGDzV9J9/Khx7f4KqgPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84927cfc72590d935857b798363b7b1b8a44521db4f1221b066318b2c930cee0","last_reissued_at":"2026-05-18T02:39:55.374098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:55.374098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.1427","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-18T02:39:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZr6eryCZpanoLh1zLethHvZr96heGcfUBhb14w7phb0uLSp5ZySLy9djpuUJTNbcpD3e5UNrve3qMSOeMW8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:47:40.147687Z"},"content_sha256":"3e4394aed2d5e2694663c55994b7b1d97c839b879c172862eaa27ee7eb25265f","schema_version":"1.0","event_id":"sha256:3e4394aed2d5e2694663c55994b7b1d97c839b879c172862eaa27ee7eb25265f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QSJHZ7DSLEGZGWCXW6MDMO33DO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compute-and-Forward on a Multi-User Multi-Relay Channel","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":"2014-09-04T12:54:06Z","abstract_excerpt":"In this paper, we consider a system in which multiple users communicate with a destination with the help of multiple half-duplex relays. Based on the compute-and-forward scheme, each relay, instead of decoding the users' messages, decodes an integer-valued linear combination that relates the transmitted messages. Then, it forwards the linear combination towards the destination. Given these linear combinations, the destination may or may not recover the transmitted messages since the linear combinations are not always full rank. Therefore, we propose an algorithm where we optimize the precoding"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1427","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-18T02:39:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LHiRpRl3NzOQAsyVbczrEHnDyoDQ08XwzM+73D+0Ps0ZGVtTkLpoxiR6P6wpMG04szeZ+D6qv2tVAcNOvfH5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:47:40.148039Z"},"content_sha256":"5d3db1b2f788a5d0e1e8e9c6d7a798fffd1bfa0841cf90d3a033322a0bf6ee35","schema_version":"1.0","event_id":"sha256:5d3db1b2f788a5d0e1e8e9c6d7a798fffd1bfa0841cf90d3a033322a0bf6ee35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QSJHZ7DSLEGZGWCXW6MDMO33DO/bundle.json","state_url":"https://pith.science/pith/QSJHZ7DSLEGZGWCXW6MDMO33DO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QSJHZ7DSLEGZGWCXW6MDMO33DO/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-31T07:47:40Z","links":{"resolver":"https://pith.science/pith/QSJHZ7DSLEGZGWCXW6MDMO33DO","bundle":"https://pith.science/pith/QSJHZ7DSLEGZGWCXW6MDMO33DO/bundle.json","state":"https://pith.science/pith/QSJHZ7DSLEGZGWCXW6MDMO33DO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QSJHZ7DSLEGZGWCXW6MDMO33DO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QSJHZ7DSLEGZGWCXW6MDMO33DO","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":"51abedaacadb78338c620159518ae00c6bd019d7a940a3af16543e199e13fe70","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-04T12:54:06Z","title_canon_sha256":"d7019702489ba5e9674ddc2ce1de8577835cf86501e8dd6d37beaae736d7d181"},"schema_version":"1.0","source":{"id":"1409.1427","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1427","created_at":"2026-05-18T02:39:55Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1427v2","created_at":"2026-05-18T02:39:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1427","created_at":"2026-05-18T02:39:55Z"},{"alias_kind":"pith_short_12","alias_value":"QSJHZ7DSLEGZ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QSJHZ7DSLEGZGWCX","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QSJHZ7DS","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:5d3db1b2f788a5d0e1e8e9c6d7a798fffd1bfa0841cf90d3a033322a0bf6ee35","target":"graph","created_at":"2026-05-18T02:39: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 this paper, we consider a system in which multiple users communicate with a destination with the help of multiple half-duplex relays. Based on the compute-and-forward scheme, each relay, instead of decoding the users' messages, decodes an integer-valued linear combination that relates the transmitted messages. Then, it forwards the linear combination towards the destination. Given these linear combinations, the destination may or may not recover the transmitted messages since the linear combinations are not always full rank. Therefore, we propose an algorithm where we optimize the precoding","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":"2014-09-04T12:54:06Z","title":"Compute-and-Forward on a Multi-User Multi-Relay Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1427","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:3e4394aed2d5e2694663c55994b7b1d97c839b879c172862eaa27ee7eb25265f","target":"record","created_at":"2026-05-18T02:39: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":"51abedaacadb78338c620159518ae00c6bd019d7a940a3af16543e199e13fe70","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-04T12:54:06Z","title_canon_sha256":"d7019702489ba5e9674ddc2ce1de8577835cf86501e8dd6d37beaae736d7d181"},"schema_version":"1.0","source":{"id":"1409.1427","kind":"arxiv","version":2}},"canonical_sha256":"84927cfc72590d935857b798363b7b1b8a44521db4f1221b066318b2c930cee0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84927cfc72590d935857b798363b7b1b8a44521db4f1221b066318b2c930cee0","first_computed_at":"2026-05-18T02:39:55.374098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:55.374098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1ix44xiRC8rsdYkjCV/KqYEIZNJgewWJf2FhVX3tHxwz4NsRrpzsZMKgsaAuvNKjYOGDzV9J9/Khx7f4KqgPBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:55.374525Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.1427","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e4394aed2d5e2694663c55994b7b1d97c839b879c172862eaa27ee7eb25265f","sha256:5d3db1b2f788a5d0e1e8e9c6d7a798fffd1bfa0841cf90d3a033322a0bf6ee35"],"state_sha256":"1c0653ce9eb237f5fe4740e2c13ede4cb18be7c8f31408b078bacf3e21c4422d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eLVMRrglPqaGi9h3KPSYg/v5dmCOISsn2dsuGlpoGRMZs8QlPAPM5PtlDooxVLtVnikZNXd/acZ0/CqVhO0fCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:47:40.150186Z","bundle_sha256":"c12d2fa87d57298abb78f21a8b10dea9702aa5e163548082e5981b359908634c"}}