{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YMV66B5D6SWGVLMGP6FCIL2PYZ","short_pith_number":"pith:YMV66B5D","schema_version":"1.0","canonical_sha256":"c32bef07a3f4ac6aad867f8a242f4fc65ed948a9f9dafbc5044d9752d7814430","source":{"kind":"arxiv","id":"1512.05160","version":1},"attestation_state":"computed","paper":{"title":"Throughput Bound of XOR Coded Wireless Multicasting to Three Clients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Adeel Malik, Jalaluddin Qureshi","submitted_at":"2015-12-16T12:55:42Z","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1512.05160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-12-16T12:55:42Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ca82423ac77cc0aea0b7ceb9e168977551bd3ac66b01e23b06beec1ffee105f3","abstract_canon_sha256":"6e5f21fbdd4be72c5c451d18d1433967ff125a468cc1d9201869ba9748599433"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:57.465911Z","signature_b64":"6Evd3Bk9mc6xOAN5Gk8zj2V6wA+BDXbVG+P8ACI8BpEz4OLDr3KCy60Kx8N1swaNgkbsNwPLzt3gH5HukkROAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c32bef07a3f4ac6aad867f8a242f4fc65ed948a9f9dafbc5044d9752d7814430","last_reissued_at":"2026-05-18T00:58:57.465098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:57.465098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Throughput Bound of XOR Coded Wireless Multicasting to Three Clients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Adeel Malik, Jalaluddin Qureshi","submitted_at":"2015-12-16T12:55:42Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05160","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.05160","created_at":"2026-05-18T00:58:57.465234+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.05160v1","created_at":"2026-05-18T00:58:57.465234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05160","created_at":"2026-05-18T00:58:57.465234+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMV66B5D6SWG","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMV66B5D6SWGVLMG","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMV66B5D","created_at":"2026-05-18T12:29:50.041715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YMV66B5D6SWGVLMGP6FCIL2PYZ","json":"https://pith.science/pith/YMV66B5D6SWGVLMGP6FCIL2PYZ.json","graph_json":"https://pith.science/api/pith-number/YMV66B5D6SWGVLMGP6FCIL2PYZ/graph.json","events_json":"https://pith.science/api/pith-number/YMV66B5D6SWGVLMGP6FCIL2PYZ/events.json","paper":"https://pith.science/paper/YMV66B5D"},"agent_actions":{"view_html":"https://pith.science/pith/YMV66B5D6SWGVLMGP6FCIL2PYZ","download_json":"https://pith.science/pith/YMV66B5D6SWGVLMGP6FCIL2PYZ.json","view_paper":"https://pith.science/paper/YMV66B5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.05160&json=true","fetch_graph":"https://pith.science/api/pith-number/YMV66B5D6SWGVLMGP6FCIL2PYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/YMV66B5D6SWGVLMGP6FCIL2PYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMV66B5D6SWGVLMGP6FCIL2PYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMV66B5D6SWGVLMGP6FCIL2PYZ/action/storage_attestation","attest_author":"https://pith.science/pith/YMV66B5D6SWGVLMGP6FCIL2PYZ/action/author_attestation","sign_citation":"https://pith.science/pith/YMV66B5D6SWGVLMGP6FCIL2PYZ/action/citation_signature","submit_replication":"https://pith.science/pith/YMV66B5D6SWGVLMGP6FCIL2PYZ/action/replication_record"}},"created_at":"2026-05-18T00:58:57.465234+00:00","updated_at":"2026-05-18T00:58:57.465234+00:00"}