{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PAXQVUTIJD3QTIQUBKFIEKP2CV","short_pith_number":"pith:PAXQVUTI","schema_version":"1.0","canonical_sha256":"782f0ad26848f709a2140a8a8229fa15704cb58ef1e9bffbb798e392bd53c769","source":{"kind":"arxiv","id":"1701.03877","version":4},"attestation_state":"computed","paper":{"title":"Cooperative Multi-Sender Index Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lawrence Ong, Min Li, Sarah J. Johnson","submitted_at":"2017-01-14T03:44:26Z","abstract_excerpt":"In this paper, we propose a new coding scheme and establish new bounds on the capacity region for the multi-sender unicast index-coding problem. We revisit existing partitioned Distributed Composite Coding (DCC) proposed by Sadeghi et al. and identify its limitations in the implementation of multi-sender composite coding and in the strategy of sender partitioning. We then propose two new coding components to overcome these limitations and develop a multi-sender Cooperative Composite Coding (CCC). We show that CCC can strictly improve upon partitioned DCC, and is the key to achieve optimality f"},"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":"1701.03877","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-14T03:44:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"849d6ab156a4935f783b82f318ee3b03e09000912483ff868be7586d268c9b93","abstract_canon_sha256":"0ef2a7eb99746fcc08757fcd828c345a6759e511e4dd9c3037dac260426895ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:26.629136Z","signature_b64":"IElqYT3MIcxQ8cV2TQX4161OFoEhmrA4Oex919wgeZxU7pAMYpsEzovzpQB3mfTP6NQHSn4GFQIE3a2K+/bQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"782f0ad26848f709a2140a8a8229fa15704cb58ef1e9bffbb798e392bd53c769","last_reissued_at":"2026-05-18T00:06:26.628461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:26.628461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cooperative Multi-Sender Index Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lawrence Ong, Min Li, Sarah J. Johnson","submitted_at":"2017-01-14T03:44:26Z","abstract_excerpt":"In this paper, we propose a new coding scheme and establish new bounds on the capacity region for the multi-sender unicast index-coding problem. We revisit existing partitioned Distributed Composite Coding (DCC) proposed by Sadeghi et al. and identify its limitations in the implementation of multi-sender composite coding and in the strategy of sender partitioning. We then propose two new coding components to overcome these limitations and develop a multi-sender Cooperative Composite Coding (CCC). We show that CCC can strictly improve upon partitioned DCC, and is the key to achieve optimality f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03877","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.03877","created_at":"2026-05-18T00:06:26.628571+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.03877v4","created_at":"2026-05-18T00:06:26.628571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03877","created_at":"2026-05-18T00:06:26.628571+00:00"},{"alias_kind":"pith_short_12","alias_value":"PAXQVUTIJD3Q","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PAXQVUTIJD3QTIQU","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PAXQVUTI","created_at":"2026-05-18T12:31:37.085036+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/PAXQVUTIJD3QTIQUBKFIEKP2CV","json":"https://pith.science/pith/PAXQVUTIJD3QTIQUBKFIEKP2CV.json","graph_json":"https://pith.science/api/pith-number/PAXQVUTIJD3QTIQUBKFIEKP2CV/graph.json","events_json":"https://pith.science/api/pith-number/PAXQVUTIJD3QTIQUBKFIEKP2CV/events.json","paper":"https://pith.science/paper/PAXQVUTI"},"agent_actions":{"view_html":"https://pith.science/pith/PAXQVUTIJD3QTIQUBKFIEKP2CV","download_json":"https://pith.science/pith/PAXQVUTIJD3QTIQUBKFIEKP2CV.json","view_paper":"https://pith.science/paper/PAXQVUTI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.03877&json=true","fetch_graph":"https://pith.science/api/pith-number/PAXQVUTIJD3QTIQUBKFIEKP2CV/graph.json","fetch_events":"https://pith.science/api/pith-number/PAXQVUTIJD3QTIQUBKFIEKP2CV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PAXQVUTIJD3QTIQUBKFIEKP2CV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PAXQVUTIJD3QTIQUBKFIEKP2CV/action/storage_attestation","attest_author":"https://pith.science/pith/PAXQVUTIJD3QTIQUBKFIEKP2CV/action/author_attestation","sign_citation":"https://pith.science/pith/PAXQVUTIJD3QTIQUBKFIEKP2CV/action/citation_signature","submit_replication":"https://pith.science/pith/PAXQVUTIJD3QTIQUBKFIEKP2CV/action/replication_record"}},"created_at":"2026-05-18T00:06:26.628571+00:00","updated_at":"2026-05-18T00:06:26.628571+00:00"}