{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:N47HVRO6FKWXIFAHDE7JIUYWY6","short_pith_number":"pith:N47HVRO6","canonical_record":{"source":{"id":"1211.1044","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-05T21:43:17Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"e7fc2ca47bb02e7c391df32bceaac973cd9e47fef7f3d88b63dda459e2d343fa","abstract_canon_sha256":"ccbcde41fe94b31102cc60fd318da50726681ec93481d36a818b55de15024e75"},"schema_version":"1.0"},"canonical_sha256":"6f3e7ac5de2aad741407193e945316c7a4c21636c779f633461bcf9e436630d0","source":{"kind":"arxiv","id":"1211.1044","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1044","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1044v2","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1044","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"N47HVRO6FKWX","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"N47HVRO6FKWXIFAH","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"N47HVRO6","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:N47HVRO6FKWXIFAHDE7JIUYWY6","target":"record","payload":{"canonical_record":{"source":{"id":"1211.1044","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-05T21:43:17Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"e7fc2ca47bb02e7c391df32bceaac973cd9e47fef7f3d88b63dda459e2d343fa","abstract_canon_sha256":"ccbcde41fe94b31102cc60fd318da50726681ec93481d36a818b55de15024e75"},"schema_version":"1.0"},"canonical_sha256":"6f3e7ac5de2aad741407193e945316c7a4c21636c779f633461bcf9e436630d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:17.961170Z","signature_b64":"s7rNU5yrXB1f0bghslLdndjpGDdJPBzK16n7AtjtVzoRc1W/ZHWNQ/t8cdYDi2UOHbH8znw6ahlhFFDUZV3HCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f3e7ac5de2aad741407193e945316c7a4c21636c779f633461bcf9e436630d0","last_reissued_at":"2026-05-18T00:58:17.960385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:17.960385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.1044","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:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yi1irEaa/U9bm0oy9ZH/QTemVbQkk/9Egui/bad0BKCegrFgUYTypFII9c77ULdRrDlVyN6pPrgTKQDDnc9wAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:41:32.835215Z"},"content_sha256":"b6b1c79fb566ed6009ca970bd6c9421c0f51092262116573ac3526c5a2b3d8fe","schema_version":"1.0","event_id":"sha256:b6b1c79fb566ed6009ca970bd6c9421c0f51092262116573ac3526c5a2b3d8fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:N47HVRO6FKWXIFAHDE7JIUYWY6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Latency Data Sharing in Erasure Multi-Way Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Hossein Bagheri, Masoud Ardakani, Moslem Noori","submitted_at":"2012-11-05T21:43:17Z","abstract_excerpt":"We consider an erasure multi-way relay channel (EMWRC) in which several users share their data through a relay over erasure links. Assuming no feedback channel between the users and the relay, we first identify the challenges for designing a data sharing scheme over an EMWRC. Then, to overcome these challenges, we propose practical low-latency and low-complexity data sharing schemes based on fountain coding. Later, we introduce the notion of end-to-end erasure rate (EEER) and analytically derive it for the proposed schemes. EEER is then used to calculate the achievable rate and transmission ov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1044","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:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LCV2ACgr4v4z1rjm3079E8qk60i7lfzSg9ifZITTTclMvMb1F8K4lsYdRdcMvFVtFC9u7BRKQ2igx4v/sBi4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:41:32.835576Z"},"content_sha256":"a9fcc1a3c724f3200f75ff57d4bf2f215dce18c8c0fb54197ca895ddd977a224","schema_version":"1.0","event_id":"sha256:a9fcc1a3c724f3200f75ff57d4bf2f215dce18c8c0fb54197ca895ddd977a224"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N47HVRO6FKWXIFAHDE7JIUYWY6/bundle.json","state_url":"https://pith.science/pith/N47HVRO6FKWXIFAHDE7JIUYWY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N47HVRO6FKWXIFAHDE7JIUYWY6/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-02T16:41:32Z","links":{"resolver":"https://pith.science/pith/N47HVRO6FKWXIFAHDE7JIUYWY6","bundle":"https://pith.science/pith/N47HVRO6FKWXIFAHDE7JIUYWY6/bundle.json","state":"https://pith.science/pith/N47HVRO6FKWXIFAHDE7JIUYWY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N47HVRO6FKWXIFAHDE7JIUYWY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:N47HVRO6FKWXIFAHDE7JIUYWY6","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":"ccbcde41fe94b31102cc60fd318da50726681ec93481d36a818b55de15024e75","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-05T21:43:17Z","title_canon_sha256":"e7fc2ca47bb02e7c391df32bceaac973cd9e47fef7f3d88b63dda459e2d343fa"},"schema_version":"1.0","source":{"id":"1211.1044","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1044","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1044v2","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1044","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"N47HVRO6FKWX","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"N47HVRO6FKWXIFAH","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"N47HVRO6","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:a9fcc1a3c724f3200f75ff57d4bf2f215dce18c8c0fb54197ca895ddd977a224","target":"graph","created_at":"2026-05-18T00:58:17Z","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 an erasure multi-way relay channel (EMWRC) in which several users share their data through a relay over erasure links. Assuming no feedback channel between the users and the relay, we first identify the challenges for designing a data sharing scheme over an EMWRC. Then, to overcome these challenges, we propose practical low-latency and low-complexity data sharing schemes based on fountain coding. Later, we introduce the notion of end-to-end erasure rate (EEER) and analytically derive it for the proposed schemes. EEER is then used to calculate the achievable rate and transmission ov","authors_text":"Hossein Bagheri, Masoud Ardakani, Moslem Noori","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-05T21:43:17Z","title":"Low-Latency Data Sharing in Erasure Multi-Way Relay Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1044","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:b6b1c79fb566ed6009ca970bd6c9421c0f51092262116573ac3526c5a2b3d8fe","target":"record","created_at":"2026-05-18T00:58:17Z","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":"ccbcde41fe94b31102cc60fd318da50726681ec93481d36a818b55de15024e75","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-05T21:43:17Z","title_canon_sha256":"e7fc2ca47bb02e7c391df32bceaac973cd9e47fef7f3d88b63dda459e2d343fa"},"schema_version":"1.0","source":{"id":"1211.1044","kind":"arxiv","version":2}},"canonical_sha256":"6f3e7ac5de2aad741407193e945316c7a4c21636c779f633461bcf9e436630d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f3e7ac5de2aad741407193e945316c7a4c21636c779f633461bcf9e436630d0","first_computed_at":"2026-05-18T00:58:17.960385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:17.960385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s7rNU5yrXB1f0bghslLdndjpGDdJPBzK16n7AtjtVzoRc1W/ZHWNQ/t8cdYDi2UOHbH8znw6ahlhFFDUZV3HCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:17.961170Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.1044","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6b1c79fb566ed6009ca970bd6c9421c0f51092262116573ac3526c5a2b3d8fe","sha256:a9fcc1a3c724f3200f75ff57d4bf2f215dce18c8c0fb54197ca895ddd977a224"],"state_sha256":"64639db35471bb8815f7015189f50c9329cb43c6c57b48699a944441f540ab71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XjjM+2rP7vgW5JLtXthfhX+wu1tz4PdvVy0/DHrFDSWUhnc818t/PJytskwfLTYo9617r3Na+wdkBLXRGsM/Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:41:32.843046Z","bundle_sha256":"82ffc508fa26bedbbdadb85ce70d5c29100cd4df6d573df936f404cdb0ca632b"}}