{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HDYR36W247OHYW6TTX3IRPNDRX","short_pith_number":"pith:HDYR36W2","canonical_record":{"source":{"id":"1408.2854","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-12T21:03:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b84475693ef4b9f03aebe4bb1390cf2dc0169b4eff501081cbc20b9c68839feb","abstract_canon_sha256":"c1c248da16981cb465ae34243967f6439af74e4a4c23323c6484cb2776115150"},"schema_version":"1.0"},"canonical_sha256":"38f11dfadae7dc7c5bd39df688bda38dc70fb8a0f514eb4858497fe0fdb86a70","source":{"kind":"arxiv","id":"1408.2854","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2854","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2854v4","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2854","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"pith_short_12","alias_value":"HDYR36W247OH","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HDYR36W247OHYW6T","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HDYR36W2","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HDYR36W247OHYW6TTX3IRPNDRX","target":"record","payload":{"canonical_record":{"source":{"id":"1408.2854","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-12T21:03:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b84475693ef4b9f03aebe4bb1390cf2dc0169b4eff501081cbc20b9c68839feb","abstract_canon_sha256":"c1c248da16981cb465ae34243967f6439af74e4a4c23323c6484cb2776115150"},"schema_version":"1.0"},"canonical_sha256":"38f11dfadae7dc7c5bd39df688bda38dc70fb8a0f514eb4858497fe0fdb86a70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:36.101027Z","signature_b64":"TvrcFvQ80o/1SmFPy6N0+MEkTKd9JEjy+rz7wXUOmDvxkafNbXN/pmcgu1fwJKtwnyc+Tv/9DNlrUSIrN3ZVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38f11dfadae7dc7c5bd39df688bda38dc70fb8a0f514eb4858497fe0fdb86a70","last_reissued_at":"2026-05-18T02:19:36.100645Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:36.100645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.2854","source_version":4,"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:19:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TbSugm/ieltamVataGdjMhia0aYnRrpc5p+IRC+6nekCfPEkVy9QchxTxX5VdvJSChCkOvyrjucP62wb1DZSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:44:56.583628Z"},"content_sha256":"dbe6d30da67427fe474e60fced79ffe83f5d965c46ac19a97f7b921e8373d438","schema_version":"1.0","event_id":"sha256:dbe6d30da67427fe474e60fced79ffe83f5d965c46ac19a97f7b921e8373d438"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HDYR36W247OHYW6TTX3IRPNDRX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Compute-and-Forward Based Relaying Strategies in Multi-User Multi-Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Masoumeh Nasiri-Kenari, Mohsen Hejazi, Seyed Mohammad Azimi-Abarghouyi","submitted_at":"2014-08-12T21:03:16Z","abstract_excerpt":"In this paper, we propose different practical distributed schemes to solve the rank failure problem in the compute and forward (CMF)-based multi-user multi-relay networks without central coordinator, in which the relays have no prior information about each other. First, a new relaying strategy based on CMF, named incremental compute-and-forward (ICMF), is proposed that performs quite well in terms of the outage probability. We show that the distributed ICMF scheme can even outperform the achievable rate of centralized optimal CMF in strong enough inter relay links, with much less complexity. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2854","kind":"arxiv","version":4},"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:19:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tswcFIdtTkWNdhiirNBBz/XYomgtW000IiLqMDL9Vf+yP3jEYHljK0jxLZfw8sOEJytkA2WlWDUL0TI0GQnICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:44:56.583975Z"},"content_sha256":"b068acc4066e0c38dbe27c7ba614390271bc9ff24c21f30d128c72564788607c","schema_version":"1.0","event_id":"sha256:b068acc4066e0c38dbe27c7ba614390271bc9ff24c21f30d128c72564788607c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HDYR36W247OHYW6TTX3IRPNDRX/bundle.json","state_url":"https://pith.science/pith/HDYR36W247OHYW6TTX3IRPNDRX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HDYR36W247OHYW6TTX3IRPNDRX/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-11T09:44:56Z","links":{"resolver":"https://pith.science/pith/HDYR36W247OHYW6TTX3IRPNDRX","bundle":"https://pith.science/pith/HDYR36W247OHYW6TTX3IRPNDRX/bundle.json","state":"https://pith.science/pith/HDYR36W247OHYW6TTX3IRPNDRX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HDYR36W247OHYW6TTX3IRPNDRX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HDYR36W247OHYW6TTX3IRPNDRX","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":"c1c248da16981cb465ae34243967f6439af74e4a4c23323c6484cb2776115150","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-12T21:03:16Z","title_canon_sha256":"b84475693ef4b9f03aebe4bb1390cf2dc0169b4eff501081cbc20b9c68839feb"},"schema_version":"1.0","source":{"id":"1408.2854","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2854","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2854v4","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2854","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"pith_short_12","alias_value":"HDYR36W247OH","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HDYR36W247OHYW6T","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HDYR36W2","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:b068acc4066e0c38dbe27c7ba614390271bc9ff24c21f30d128c72564788607c","target":"graph","created_at":"2026-05-18T02:19:36Z","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 propose different practical distributed schemes to solve the rank failure problem in the compute and forward (CMF)-based multi-user multi-relay networks without central coordinator, in which the relays have no prior information about each other. First, a new relaying strategy based on CMF, named incremental compute-and-forward (ICMF), is proposed that performs quite well in terms of the outage probability. We show that the distributed ICMF scheme can even outperform the achievable rate of centralized optimal CMF in strong enough inter relay links, with much less complexity. T","authors_text":"Masoumeh Nasiri-Kenari, Mohsen Hejazi, Seyed Mohammad Azimi-Abarghouyi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-12T21:03:16Z","title":"Distributed Compute-and-Forward Based Relaying Strategies in Multi-User Multi-Relay Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2854","kind":"arxiv","version":4},"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:dbe6d30da67427fe474e60fced79ffe83f5d965c46ac19a97f7b921e8373d438","target":"record","created_at":"2026-05-18T02:19:36Z","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":"c1c248da16981cb465ae34243967f6439af74e4a4c23323c6484cb2776115150","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-12T21:03:16Z","title_canon_sha256":"b84475693ef4b9f03aebe4bb1390cf2dc0169b4eff501081cbc20b9c68839feb"},"schema_version":"1.0","source":{"id":"1408.2854","kind":"arxiv","version":4}},"canonical_sha256":"38f11dfadae7dc7c5bd39df688bda38dc70fb8a0f514eb4858497fe0fdb86a70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38f11dfadae7dc7c5bd39df688bda38dc70fb8a0f514eb4858497fe0fdb86a70","first_computed_at":"2026-05-18T02:19:36.100645Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:36.100645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TvrcFvQ80o/1SmFPy6N0+MEkTKd9JEjy+rz7wXUOmDvxkafNbXN/pmcgu1fwJKtwnyc+Tv/9DNlrUSIrN3ZVCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:36.101027Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.2854","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbe6d30da67427fe474e60fced79ffe83f5d965c46ac19a97f7b921e8373d438","sha256:b068acc4066e0c38dbe27c7ba614390271bc9ff24c21f30d128c72564788607c"],"state_sha256":"d25a371f01be3ba1976dcd0d01037cf40ce50e5030168f159954b204ea89b4b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mO92PkESRgiYLT3vhMH1ay6tpjsJBg31Cx9/Z6tW/2c3igmJXTD4RJWP8ti/sHAe3yA/WliF1lGqKeza15LWAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:44:56.585923Z","bundle_sha256":"475f425c506a6a61d4995c8711a5acc5229b3858d2782c241be5a807e1494278"}}