{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:42GMYZ5WPJIGJ3VXUM47XZLX5R","short_pith_number":"pith:42GMYZ5W","canonical_record":{"source":{"id":"1204.0867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-04T05:27:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3d7666341910c51cf09bff3e1a308c05556371e935c7540a399cc28d787e88cf","abstract_canon_sha256":"3cc61946444a82a2ed55049d24d5fe7b8f3fee5c3dd22dd86d668a6837623150"},"schema_version":"1.0"},"canonical_sha256":"e68ccc67b67a5064eeb7a339fbe577ec72ff3d14de6779bec3b03bfa30b26048","source":{"kind":"arxiv","id":"1204.0867","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0867","created_at":"2026-05-18T03:39:28Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0867v1","created_at":"2026-05-18T03:39:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0867","created_at":"2026-05-18T03:39:28Z"},{"alias_kind":"pith_short_12","alias_value":"42GMYZ5WPJIG","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"42GMYZ5WPJIGJ3VX","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"42GMYZ5W","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:42GMYZ5WPJIGJ3VXUM47XZLX5R","target":"record","payload":{"canonical_record":{"source":{"id":"1204.0867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-04T05:27:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3d7666341910c51cf09bff3e1a308c05556371e935c7540a399cc28d787e88cf","abstract_canon_sha256":"3cc61946444a82a2ed55049d24d5fe7b8f3fee5c3dd22dd86d668a6837623150"},"schema_version":"1.0"},"canonical_sha256":"e68ccc67b67a5064eeb7a339fbe577ec72ff3d14de6779bec3b03bfa30b26048","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:28.778165Z","signature_b64":"34oYsQN6P13rMPIjifqxy+P8JwcB1uQbur9l5jmhVX9UNpyakvLNxrVHVihrep3yZr4W57WaDr0HnoCYkrunAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e68ccc67b67a5064eeb7a339fbe577ec72ff3d14de6779bec3b03bfa30b26048","last_reissued_at":"2026-05-18T03:39:28.777394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:28.777394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.0867","source_version":1,"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-18T03:39:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nzvDJQ0NEQwnPTBtbY8uAQE63mGj3W0y3dz6EcznL7yDHQg7LOwjzCd8jFSSgJxVtPGj6vHVTMR3oMfFalzaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:15:51.676922Z"},"content_sha256":"0292f87ac972b9c5bfa497aaca348f9a7e0a7052b17bf872925d77b1fb984130","schema_version":"1.0","event_id":"sha256:0292f87ac972b9c5bfa497aaca348f9a7e0a7052b17bf872925d77b1fb984130"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:42GMYZ5WPJIGJ3VXUM47XZLX5R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Index Codes for a Class of Multicast Networks with Receiver Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chin Keong Ho, Lawrence Ong","submitted_at":"2012-04-04T05:27:37Z","abstract_excerpt":"This paper studies a special class of multicast index coding problems where a sender transmits messages to multiple receivers, each with some side information. Here, each receiver knows a unique message a priori, and there is no restriction on how many messages each receiver requests from the sender. For this class of multicast index coding problems, we obtain the optimal index code, which has the shortest codelength for which the sender needs to send in order for all receivers to obtain their (respective) requested messages. This is the first class of index coding problems where the optimal i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0867","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"},"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-18T03:39:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6FjID1vXdob0qXlQTG7fb7R5+BNZKRiiSdgXArqe2B88UvuQpYDXBsi4dTXLahlDPMhpIykLuLYZYKYA42L4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:15:51.677267Z"},"content_sha256":"09a6d8172ca9f8efa9f19bbfc5ba346af5dbf091d0faef72c64d9e1d9f0c2080","schema_version":"1.0","event_id":"sha256:09a6d8172ca9f8efa9f19bbfc5ba346af5dbf091d0faef72c64d9e1d9f0c2080"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42GMYZ5WPJIGJ3VXUM47XZLX5R/bundle.json","state_url":"https://pith.science/pith/42GMYZ5WPJIGJ3VXUM47XZLX5R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42GMYZ5WPJIGJ3VXUM47XZLX5R/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-20T08:15:51Z","links":{"resolver":"https://pith.science/pith/42GMYZ5WPJIGJ3VXUM47XZLX5R","bundle":"https://pith.science/pith/42GMYZ5WPJIGJ3VXUM47XZLX5R/bundle.json","state":"https://pith.science/pith/42GMYZ5WPJIGJ3VXUM47XZLX5R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42GMYZ5WPJIGJ3VXUM47XZLX5R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:42GMYZ5WPJIGJ3VXUM47XZLX5R","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":"3cc61946444a82a2ed55049d24d5fe7b8f3fee5c3dd22dd86d668a6837623150","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-04T05:27:37Z","title_canon_sha256":"3d7666341910c51cf09bff3e1a308c05556371e935c7540a399cc28d787e88cf"},"schema_version":"1.0","source":{"id":"1204.0867","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0867","created_at":"2026-05-18T03:39:28Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0867v1","created_at":"2026-05-18T03:39:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0867","created_at":"2026-05-18T03:39:28Z"},{"alias_kind":"pith_short_12","alias_value":"42GMYZ5WPJIG","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"42GMYZ5WPJIGJ3VX","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"42GMYZ5W","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:09a6d8172ca9f8efa9f19bbfc5ba346af5dbf091d0faef72c64d9e1d9f0c2080","target":"graph","created_at":"2026-05-18T03:39:28Z","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":"This paper studies a special class of multicast index coding problems where a sender transmits messages to multiple receivers, each with some side information. Here, each receiver knows a unique message a priori, and there is no restriction on how many messages each receiver requests from the sender. For this class of multicast index coding problems, we obtain the optimal index code, which has the shortest codelength for which the sender needs to send in order for all receivers to obtain their (respective) requested messages. This is the first class of index coding problems where the optimal i","authors_text":"Chin Keong Ho, Lawrence Ong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-04T05:27:37Z","title":"Optimal Index Codes for a Class of Multicast Networks with Receiver Side Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0867","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:0292f87ac972b9c5bfa497aaca348f9a7e0a7052b17bf872925d77b1fb984130","target":"record","created_at":"2026-05-18T03:39:28Z","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":"3cc61946444a82a2ed55049d24d5fe7b8f3fee5c3dd22dd86d668a6837623150","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-04T05:27:37Z","title_canon_sha256":"3d7666341910c51cf09bff3e1a308c05556371e935c7540a399cc28d787e88cf"},"schema_version":"1.0","source":{"id":"1204.0867","kind":"arxiv","version":1}},"canonical_sha256":"e68ccc67b67a5064eeb7a339fbe577ec72ff3d14de6779bec3b03bfa30b26048","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e68ccc67b67a5064eeb7a339fbe577ec72ff3d14de6779bec3b03bfa30b26048","first_computed_at":"2026-05-18T03:39:28.777394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:28.777394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"34oYsQN6P13rMPIjifqxy+P8JwcB1uQbur9l5jmhVX9UNpyakvLNxrVHVihrep3yZr4W57WaDr0HnoCYkrunAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:28.778165Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.0867","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0292f87ac972b9c5bfa497aaca348f9a7e0a7052b17bf872925d77b1fb984130","sha256:09a6d8172ca9f8efa9f19bbfc5ba346af5dbf091d0faef72c64d9e1d9f0c2080"],"state_sha256":"41bdd8d08faf5d66e1546aa77adf79f7ae876adeea107621344be308077fde8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PNgt/j326xR2qdpbDQJPpskITIxmp+31OFQHshLUdOA7CQl051FVwymLo7Vcv4fMfsdgDqqqCGK5xGrT9NZ4BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T08:15:51.679361Z","bundle_sha256":"929eaaca62a47146fa107240b7abc944e37726cf0bf02471929c3226ce1fd794"}}