{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:O26J6L2PR6JDUX7422EHH2HLDB","short_pith_number":"pith:O26J6L2P","canonical_record":{"source":{"id":"1305.2679","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-13T06:21:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1115f5efb930747608ecc8ed3ef919b2203d467a6a9be00d9d744d1f292cc48f","abstract_canon_sha256":"62d3c013906c280ea2c03ffc18534897d6d4b4b065f0918ef9ffc101b4fdbf2f"},"schema_version":"1.0"},"canonical_sha256":"76bc9f2f4f8f923a5ffcd68873e8eb186d10c54829063a8fa05ed5c8c1ee1ba0","source":{"kind":"arxiv","id":"1305.2679","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2679","created_at":"2026-05-18T02:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2679v2","created_at":"2026-05-18T02:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2679","created_at":"2026-05-18T02:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"O26J6L2PR6JD","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"O26J6L2PR6JDUX74","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"O26J6L2P","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:O26J6L2PR6JDUX7422EHH2HLDB","target":"record","payload":{"canonical_record":{"source":{"id":"1305.2679","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-13T06:21:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1115f5efb930747608ecc8ed3ef919b2203d467a6a9be00d9d744d1f292cc48f","abstract_canon_sha256":"62d3c013906c280ea2c03ffc18534897d6d4b4b065f0918ef9ffc101b4fdbf2f"},"schema_version":"1.0"},"canonical_sha256":"76bc9f2f4f8f923a5ffcd68873e8eb186d10c54829063a8fa05ed5c8c1ee1ba0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:35.306842Z","signature_b64":"eGbY8hQBZKqw0ftD5XjqWyIBA83rh6a06j8ccjEPyA/3CI1H2A6b7RAWt18XGuiPBuwIYcN873F+zmtx43ZoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76bc9f2f4f8f923a5ffcd68873e8eb186d10c54829063a8fa05ed5c8c1ee1ba0","last_reissued_at":"2026-05-18T02:56:35.306064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:35.306064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.2679","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-18T02:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fXWNRt4537PwkITyyozb2KvwfPNQP/gqiFgQL5lA9dwlMq1DOO9Pcf7oqQBFSlSeztT4SAW7yKXisFrsrXFmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:44:36.092619Z"},"content_sha256":"9ae65781eedde0b48ee79f87299c959813ab19ca3aa3ac025acf6d050ed4c256","schema_version":"1.0","event_id":"sha256:9ae65781eedde0b48ee79f87299c959813ab19ca3aa3ac025acf6d050ed4c256"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:O26J6L2PR6JDUX7422EHH2HLDB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Multi-Sender Multicast Index Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chin Keong Ho, Fabian Lim, Lawrence Ong","submitted_at":"2013-05-13T06:21:53Z","abstract_excerpt":"We focus on the following instance of an index coding problem, where a set of receivers are required to decode multiple messages, whilst each knows one of the messages a priori. In particular, here we consider a generalized setting where they are multiple senders, each sender only knows a subset of messages, and all senders are required to collectively transmit the index code. For a single sender, Ong and Ho (ICC, 2012) have established the optimal index codelength, where the lower bound was obtained using a pruning algorithm. In this paper, the pruning algorithm is simplified, and used in con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2679","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-18T02:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9/S7/PqqP+oyZ6j50r5JzAnf19i/roCZdbMPjarhu7nIpj5s+5ye26zDnUA2a0duCfgRPVaQpuEmhuBp1Cj5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:44:36.092961Z"},"content_sha256":"a0aa07c5674c55c4eaa44040e60d4a64e804d4f9c69597492332b34bee91adfa","schema_version":"1.0","event_id":"sha256:a0aa07c5674c55c4eaa44040e60d4a64e804d4f9c69597492332b34bee91adfa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O26J6L2PR6JDUX7422EHH2HLDB/bundle.json","state_url":"https://pith.science/pith/O26J6L2PR6JDUX7422EHH2HLDB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O26J6L2PR6JDUX7422EHH2HLDB/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-20T02:44:36Z","links":{"resolver":"https://pith.science/pith/O26J6L2PR6JDUX7422EHH2HLDB","bundle":"https://pith.science/pith/O26J6L2PR6JDUX7422EHH2HLDB/bundle.json","state":"https://pith.science/pith/O26J6L2PR6JDUX7422EHH2HLDB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O26J6L2PR6JDUX7422EHH2HLDB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:O26J6L2PR6JDUX7422EHH2HLDB","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":"62d3c013906c280ea2c03ffc18534897d6d4b4b065f0918ef9ffc101b4fdbf2f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-13T06:21:53Z","title_canon_sha256":"1115f5efb930747608ecc8ed3ef919b2203d467a6a9be00d9d744d1f292cc48f"},"schema_version":"1.0","source":{"id":"1305.2679","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2679","created_at":"2026-05-18T02:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2679v2","created_at":"2026-05-18T02:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2679","created_at":"2026-05-18T02:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"O26J6L2PR6JD","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"O26J6L2PR6JDUX74","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"O26J6L2P","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:a0aa07c5674c55c4eaa44040e60d4a64e804d4f9c69597492332b34bee91adfa","target":"graph","created_at":"2026-05-18T02:56:35Z","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":"We focus on the following instance of an index coding problem, where a set of receivers are required to decode multiple messages, whilst each knows one of the messages a priori. In particular, here we consider a generalized setting where they are multiple senders, each sender only knows a subset of messages, and all senders are required to collectively transmit the index code. For a single sender, Ong and Ho (ICC, 2012) have established the optimal index codelength, where the lower bound was obtained using a pruning algorithm. In this paper, the pruning algorithm is simplified, and used in con","authors_text":"Chin Keong Ho, Fabian Lim, Lawrence Ong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-13T06:21:53Z","title":"The Multi-Sender Multicast Index Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2679","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:9ae65781eedde0b48ee79f87299c959813ab19ca3aa3ac025acf6d050ed4c256","target":"record","created_at":"2026-05-18T02:56:35Z","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":"62d3c013906c280ea2c03ffc18534897d6d4b4b065f0918ef9ffc101b4fdbf2f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-13T06:21:53Z","title_canon_sha256":"1115f5efb930747608ecc8ed3ef919b2203d467a6a9be00d9d744d1f292cc48f"},"schema_version":"1.0","source":{"id":"1305.2679","kind":"arxiv","version":2}},"canonical_sha256":"76bc9f2f4f8f923a5ffcd68873e8eb186d10c54829063a8fa05ed5c8c1ee1ba0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76bc9f2f4f8f923a5ffcd68873e8eb186d10c54829063a8fa05ed5c8c1ee1ba0","first_computed_at":"2026-05-18T02:56:35.306064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:35.306064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eGbY8hQBZKqw0ftD5XjqWyIBA83rh6a06j8ccjEPyA/3CI1H2A6b7RAWt18XGuiPBuwIYcN873F+zmtx43ZoCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:35.306842Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.2679","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ae65781eedde0b48ee79f87299c959813ab19ca3aa3ac025acf6d050ed4c256","sha256:a0aa07c5674c55c4eaa44040e60d4a64e804d4f9c69597492332b34bee91adfa"],"state_sha256":"eb59d8ea980fb9d772dbb571d0e2357957e37e186b4ae386976653ecd8751ece"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QeAvkUzuArsjZkmwjDxUCHDW/NtY+uj2dNBlmCie057EwsMHf4CsSf1V2MXLt3AEHZo+mhGZLPOEKyqGEz2IDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T02:44:36.094845Z","bundle_sha256":"ca43c1e9cbd434b736d367d9d9e658bf32fd17cad301e56c700427d0a333af2a"}}