{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DBSO5F23DORF5LARCBT5DXH64A","short_pith_number":"pith:DBSO5F23","canonical_record":{"source":{"id":"1810.10875","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-25T13:39:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"14f9c105fc0dd09c178fedaf87745ee529a75730d41faf7b2a295027ba17e841","abstract_canon_sha256":"3bf39531a4405581840d3e1b4290ce122c1f4e1068f274e11f782a9d5df60099"},"schema_version":"1.0"},"canonical_sha256":"1864ee975b1ba25eac111067d1dcfee0325a11bfb0ffb9b892cf0a7e14e481b8","source":{"kind":"arxiv","id":"1810.10875","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10875","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10875v2","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10875","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"DBSO5F23DORF","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DBSO5F23DORF5LAR","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DBSO5F23","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DBSO5F23DORF5LARCBT5DXH64A","target":"record","payload":{"canonical_record":{"source":{"id":"1810.10875","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-25T13:39:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"14f9c105fc0dd09c178fedaf87745ee529a75730d41faf7b2a295027ba17e841","abstract_canon_sha256":"3bf39531a4405581840d3e1b4290ce122c1f4e1068f274e11f782a9d5df60099"},"schema_version":"1.0"},"canonical_sha256":"1864ee975b1ba25eac111067d1dcfee0325a11bfb0ffb9b892cf0a7e14e481b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:15.427192Z","signature_b64":"vGrFTYvUZgLfAeLhHvYZ0hFsVSbKg/0bUTuXmUKmZmFCzSdbyz9oJ9LrZ6eJINSt56tlqAIxeBW2Ng6ExZDgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1864ee975b1ba25eac111067d1dcfee0325a11bfb0ffb9b892cf0a7e14e481b8","last_reissued_at":"2026-05-18T00:02:15.426478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:15.426478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.10875","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:02:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RJx6cpBEvJshLJ7N8GX/V9lcx9pclwvhK/SA5Ljikl4xodc9GXUK6cmCzK7AjPuwJNWVT43W46E7CViFNtu2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:31:39.253409Z"},"content_sha256":"b144e090f00255c4d29340699fbe2f03a02b3f8fc13bdb76307f359d2ef8d79a","schema_version":"1.0","event_id":"sha256:b144e090f00255c4d29340699fbe2f03a02b3f8fc13bdb76307f359d2ef8d79a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DBSO5F23DORF5LARCBT5DXH64A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Wireless Map-Reduce Distributed Computing with Full-Duplex Radios and Imperfect CSI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jingjing Zhang, Joonhyuk Kang, Osvaldo Simeone, Sukjong Ha","submitted_at":"2018-10-25T13:39:49Z","abstract_excerpt":"Consider a distributed computing system in which the worker nodes are connected over a shared wireless channel. Nodes can store a fraction of the data set over which computation needs to be carried out, and a Map-Shuffle-Reduce protocol is followed in order to enable collaborative processing. If there is exists some level of redundancy among the computations performed at the nodes, the inter-node communication load during the Shuffle phase can be reduced by using either coded multicasting or cooperative transmission. It was previously shown that the latter approach is able to reduce the high-S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10875","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:02:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OWtqBKdcZJ1K1EgjLk5ACYBr+CuPUTIMfyUaTwBXOJNHmfw+0z8WlyNixrdYZ08/866PtcEk3v2MP2txSfb2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:31:39.253818Z"},"content_sha256":"1b3b81e99a6fe008d850686d809f9bca518b552b8c4e6724051cfa0ca9bcb694","schema_version":"1.0","event_id":"sha256:1b3b81e99a6fe008d850686d809f9bca518b552b8c4e6724051cfa0ca9bcb694"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DBSO5F23DORF5LARCBT5DXH64A/bundle.json","state_url":"https://pith.science/pith/DBSO5F23DORF5LARCBT5DXH64A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DBSO5F23DORF5LARCBT5DXH64A/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-26T08:31:39Z","links":{"resolver":"https://pith.science/pith/DBSO5F23DORF5LARCBT5DXH64A","bundle":"https://pith.science/pith/DBSO5F23DORF5LARCBT5DXH64A/bundle.json","state":"https://pith.science/pith/DBSO5F23DORF5LARCBT5DXH64A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DBSO5F23DORF5LARCBT5DXH64A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DBSO5F23DORF5LARCBT5DXH64A","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":"3bf39531a4405581840d3e1b4290ce122c1f4e1068f274e11f782a9d5df60099","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-25T13:39:49Z","title_canon_sha256":"14f9c105fc0dd09c178fedaf87745ee529a75730d41faf7b2a295027ba17e841"},"schema_version":"1.0","source":{"id":"1810.10875","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10875","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10875v2","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10875","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"DBSO5F23DORF","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DBSO5F23DORF5LAR","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DBSO5F23","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:1b3b81e99a6fe008d850686d809f9bca518b552b8c4e6724051cfa0ca9bcb694","target":"graph","created_at":"2026-05-18T00:02:15Z","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":"Consider a distributed computing system in which the worker nodes are connected over a shared wireless channel. Nodes can store a fraction of the data set over which computation needs to be carried out, and a Map-Shuffle-Reduce protocol is followed in order to enable collaborative processing. If there is exists some level of redundancy among the computations performed at the nodes, the inter-node communication load during the Shuffle phase can be reduced by using either coded multicasting or cooperative transmission. It was previously shown that the latter approach is able to reduce the high-S","authors_text":"Jingjing Zhang, Joonhyuk Kang, Osvaldo Simeone, Sukjong Ha","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-25T13:39:49Z","title":"Wireless Map-Reduce Distributed Computing with Full-Duplex Radios and Imperfect CSI"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10875","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:b144e090f00255c4d29340699fbe2f03a02b3f8fc13bdb76307f359d2ef8d79a","target":"record","created_at":"2026-05-18T00:02:15Z","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":"3bf39531a4405581840d3e1b4290ce122c1f4e1068f274e11f782a9d5df60099","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-25T13:39:49Z","title_canon_sha256":"14f9c105fc0dd09c178fedaf87745ee529a75730d41faf7b2a295027ba17e841"},"schema_version":"1.0","source":{"id":"1810.10875","kind":"arxiv","version":2}},"canonical_sha256":"1864ee975b1ba25eac111067d1dcfee0325a11bfb0ffb9b892cf0a7e14e481b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1864ee975b1ba25eac111067d1dcfee0325a11bfb0ffb9b892cf0a7e14e481b8","first_computed_at":"2026-05-18T00:02:15.426478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:15.426478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vGrFTYvUZgLfAeLhHvYZ0hFsVSbKg/0bUTuXmUKmZmFCzSdbyz9oJ9LrZ6eJINSt56tlqAIxeBW2Ng6ExZDgDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:15.427192Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10875","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b144e090f00255c4d29340699fbe2f03a02b3f8fc13bdb76307f359d2ef8d79a","sha256:1b3b81e99a6fe008d850686d809f9bca518b552b8c4e6724051cfa0ca9bcb694"],"state_sha256":"986278b28f1442fc4a9de94a76a2d221591cf31261db511349f4621015d1a450"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wEms2TiXC2gVFOfYUXPIFQGwIAgmVPVWK4hPEIwD8XO9Feo5lbT/EE3wxmU5zgKOgh4DoNd6IwDS/fI51zgZAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:31:39.256967Z","bundle_sha256":"1045a2f0338a479314d8c41b45e876c9e911843c68f87729da7981e5d8f9df7f"}}