{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YMV66B5D6SWGVLMGP6FCIL2PYZ","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":"6e5f21fbdd4be72c5c451d18d1433967ff125a468cc1d9201869ba9748599433","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-12-16T12:55:42Z","title_canon_sha256":"ca82423ac77cc0aea0b7ceb9e168977551bd3ac66b01e23b06beec1ffee105f3"},"schema_version":"1.0","source":{"id":"1512.05160","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05160","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05160v1","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05160","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"YMV66B5D6SWG","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YMV66B5D6SWGVLMG","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YMV66B5D","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:9a7975b1dde01c6337342e26d390873ae127f74e8c376a4f3f80f737c7929412","target":"graph","created_at":"2026-05-18T00:58:57Z","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":"It is a well-known result that constructing codewords over $GF(2)$ to minimize the number of transmissions for a single-hop wireless multicasting is an NP-complete problem. Linearly independent codewords can be constructed in polynomial time for all the $n$ clients, known as maximum distance separable (MDS) code, when the finite field size $q$ is larger than or equal to the number of clients, $q\\geq n$. In this paper we quantify the exact minimum number of transmissions for a multicast network using erasure code when $q=2$ and $n=3$, such that $q<n$. We first show that the use of Markov chain ","authors_text":"Adeel Malik, Jalaluddin Qureshi","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-12-16T12:55:42Z","title":"Throughput Bound of XOR Coded Wireless Multicasting to Three Clients"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05160","kind":"arxiv","version":1},"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:2f4f5a8e4f3b43a2b89bf89990c370cd53e40a237d46af3e83a3ae6264956e6e","target":"record","created_at":"2026-05-18T00:58:57Z","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":"6e5f21fbdd4be72c5c451d18d1433967ff125a468cc1d9201869ba9748599433","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-12-16T12:55:42Z","title_canon_sha256":"ca82423ac77cc0aea0b7ceb9e168977551bd3ac66b01e23b06beec1ffee105f3"},"schema_version":"1.0","source":{"id":"1512.05160","kind":"arxiv","version":1}},"canonical_sha256":"c32bef07a3f4ac6aad867f8a242f4fc65ed948a9f9dafbc5044d9752d7814430","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c32bef07a3f4ac6aad867f8a242f4fc65ed948a9f9dafbc5044d9752d7814430","first_computed_at":"2026-05-18T00:58:57.465098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:57.465098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6Evd3Bk9mc6xOAN5Gk8zj2V6wA+BDXbVG+P8ACI8BpEz4OLDr3KCy60Kx8N1swaNgkbsNwPLzt3gH5HukkROAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:57.465911Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.05160","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f4f5a8e4f3b43a2b89bf89990c370cd53e40a237d46af3e83a3ae6264956e6e","sha256:9a7975b1dde01c6337342e26d390873ae127f74e8c376a4f3f80f737c7929412"],"state_sha256":"f80f851da5530d2fb25e7c428ded39c41346300b10ff8f8a2cd49242051077f7"}