{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PAXQVUTIJD3QTIQUBKFIEKP2CV","short_pith_number":"pith:PAXQVUTI","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"},"canonical_sha256":"782f0ad26848f709a2140a8a8229fa15704cb58ef1e9bffbb798e392bd53c769","source":{"kind":"arxiv","id":"1701.03877","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03877","created_at":"2026-05-18T00:06:26Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03877v4","created_at":"2026-05-18T00:06:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03877","created_at":"2026-05-18T00:06:26Z"},{"alias_kind":"pith_short_12","alias_value":"PAXQVUTIJD3Q","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PAXQVUTIJD3QTIQU","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PAXQVUTI","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PAXQVUTIJD3QTIQUBKFIEKP2CV","target":"record","payload":{"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"},"canonical_sha256":"782f0ad26848f709a2140a8a8229fa15704cb58ef1e9bffbb798e392bd53c769","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"},"source_kind":"arxiv","source_id":"1701.03877","source_version":4,"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:06:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yfZgGtQ54nKn+efAOvyVkRkQZu568x7JcHZL5ojJ7LYBJe9R8uE7l5oI4QR7xBZDsTtfaoxvkz9XxYG15yfSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:35:15.420152Z"},"content_sha256":"3f873d6e3f96854ecc4ff9ca6a6cac36c7e974270fb2a2a50e556f78466dbfec","schema_version":"1.0","event_id":"sha256:3f873d6e3f96854ecc4ff9ca6a6cac36c7e974270fb2a2a50e556f78466dbfec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PAXQVUTIJD3QTIQUBKFIEKP2CV","target":"graph","payload":{"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"},"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:06:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rdL8cZHMQE8f4BnjCrgskhMYw9pRLU38mUBcEFIyzPa49HRiGPUbYZ2Noz7CugR0BtbLGLmzpgBA3Cndtp0kDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:35:15.420713Z"},"content_sha256":"d9d6c071c8478a7b92c9eaa4127bcff24fe13530b5c81201a395cc843e84bcfd","schema_version":"1.0","event_id":"sha256:d9d6c071c8478a7b92c9eaa4127bcff24fe13530b5c81201a395cc843e84bcfd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PAXQVUTIJD3QTIQUBKFIEKP2CV/bundle.json","state_url":"https://pith.science/pith/PAXQVUTIJD3QTIQUBKFIEKP2CV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PAXQVUTIJD3QTIQUBKFIEKP2CV/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-01T10:35:15Z","links":{"resolver":"https://pith.science/pith/PAXQVUTIJD3QTIQUBKFIEKP2CV","bundle":"https://pith.science/pith/PAXQVUTIJD3QTIQUBKFIEKP2CV/bundle.json","state":"https://pith.science/pith/PAXQVUTIJD3QTIQUBKFIEKP2CV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PAXQVUTIJD3QTIQUBKFIEKP2CV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PAXQVUTIJD3QTIQUBKFIEKP2CV","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":"0ef2a7eb99746fcc08757fcd828c345a6759e511e4dd9c3037dac260426895ca","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-14T03:44:26Z","title_canon_sha256":"849d6ab156a4935f783b82f318ee3b03e09000912483ff868be7586d268c9b93"},"schema_version":"1.0","source":{"id":"1701.03877","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03877","created_at":"2026-05-18T00:06:26Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03877v4","created_at":"2026-05-18T00:06:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03877","created_at":"2026-05-18T00:06:26Z"},{"alias_kind":"pith_short_12","alias_value":"PAXQVUTIJD3Q","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PAXQVUTIJD3QTIQU","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PAXQVUTI","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:d9d6c071c8478a7b92c9eaa4127bcff24fe13530b5c81201a395cc843e84bcfd","target":"graph","created_at":"2026-05-18T00:06:26Z","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":"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","authors_text":"Lawrence Ong, Min Li, Sarah J. Johnson","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-14T03:44:26Z","title":"Cooperative Multi-Sender Index Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03877","kind":"arxiv","version":4},"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:3f873d6e3f96854ecc4ff9ca6a6cac36c7e974270fb2a2a50e556f78466dbfec","target":"record","created_at":"2026-05-18T00:06:26Z","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":"0ef2a7eb99746fcc08757fcd828c345a6759e511e4dd9c3037dac260426895ca","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-14T03:44:26Z","title_canon_sha256":"849d6ab156a4935f783b82f318ee3b03e09000912483ff868be7586d268c9b93"},"schema_version":"1.0","source":{"id":"1701.03877","kind":"arxiv","version":4}},"canonical_sha256":"782f0ad26848f709a2140a8a8229fa15704cb58ef1e9bffbb798e392bd53c769","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"782f0ad26848f709a2140a8a8229fa15704cb58ef1e9bffbb798e392bd53c769","first_computed_at":"2026-05-18T00:06:26.628461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:26.628461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IElqYT3MIcxQ8cV2TQX4161OFoEhmrA4Oex919wgeZxU7pAMYpsEzovzpQB3mfTP6NQHSn4GFQIE3a2K+/bQDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:26.629136Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03877","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f873d6e3f96854ecc4ff9ca6a6cac36c7e974270fb2a2a50e556f78466dbfec","sha256:d9d6c071c8478a7b92c9eaa4127bcff24fe13530b5c81201a395cc843e84bcfd"],"state_sha256":"88f82643fcfc12c122f5a728f8df86a6e0283b58eec9b2d51ac8e73e02420a1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JnGc7MevIywh+UOxKVkuYN96mt7AEzJznssnaTYC+/BisE2ATZALGOBgGPV1ogGHqA+NfSVT0uBJDMPZl57oBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:35:15.423313Z","bundle_sha256":"344cc54407bad949af06c74e13c3b77ba3269ec70e4249603d17e1c492a13d45"}}