{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DZKPEHICVKI2GFRAQ5W4N7A24W","short_pith_number":"pith:DZKPEHIC","canonical_record":{"source":{"id":"1504.05008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-20T10:53:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6239a77bea14dbd1e8fa1924ad08ec8215c8a2ab7633f71240952a325e175b13","abstract_canon_sha256":"f8dae1191aac1cb59f412d30c70bcb27b14ba14e024d519efadcbc399d813277"},"schema_version":"1.0"},"canonical_sha256":"1e54f21d02aa91a31620876dc6fc1ae59b4dbaa2d4115f3cea750a674982101f","source":{"kind":"arxiv","id":"1504.05008","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05008","created_at":"2026-05-18T02:18:22Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05008v1","created_at":"2026-05-18T02:18:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05008","created_at":"2026-05-18T02:18:22Z"},{"alias_kind":"pith_short_12","alias_value":"DZKPEHICVKI2","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DZKPEHICVKI2GFRA","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DZKPEHIC","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DZKPEHICVKI2GFRAQ5W4N7A24W","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-20T10:53:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6239a77bea14dbd1e8fa1924ad08ec8215c8a2ab7633f71240952a325e175b13","abstract_canon_sha256":"f8dae1191aac1cb59f412d30c70bcb27b14ba14e024d519efadcbc399d813277"},"schema_version":"1.0"},"canonical_sha256":"1e54f21d02aa91a31620876dc6fc1ae59b4dbaa2d4115f3cea750a674982101f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:22.928910Z","signature_b64":"a63U4C6g5/RS5bxczK+wpOzg9nHjwMAyuR7hn+0y3PEZ8z8CTHGbHiLUgNly59foDiOmKdezl5Ru62E5RQWUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e54f21d02aa91a31620876dc6fc1ae59b4dbaa2d4115f3cea750a674982101f","last_reissued_at":"2026-05-18T02:18:22.928157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:22.928157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05008","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-18T02:18:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nVPqHMQpUH5Uptj01JoQeGS/VeB6qRVOMcx2ET27wQI7I3Afu+u3KZonW+82FkkcYu+CsGFtmf1fHwUn+4imAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:24:23.337283Z"},"content_sha256":"04d5179d81bd616a41d8e504a4bde06a2715047b7fa1e74795edbaa145d79a2a","schema_version":"1.0","event_id":"sha256:04d5179d81bd616a41d8e504a4bde06a2715047b7fa1e74795edbaa145d79a2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DZKPEHICVKI2GFRAQ5W4N7A24W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Number of Optimal Index Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Kavitha. R","submitted_at":"2015-04-20T10:53:15Z","abstract_excerpt":"In Index coding there is a single sender with multiple messages and multiple receivers each wanting a different set of messages and knowing a different set of messages a priori. The Index Coding problem is to identify the minimum number of transmissions (optimal length) to be made so that all receivers can decode their wanted messages using the transmitted symbols and their respective prior information and also the codes with optimal length. Recently it was shown that different optimal length codes perform differently in a wireless channel. Towards identifying the best optimal length index cod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05008","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-18T02:18:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aTtka22DrsCXmsn6xrkIrY9MIvpLXwD2QFH6rtbzcF8biHAoBkcbiUoC9OnnT76mfCucDUxF2HgXP3DroIJ3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:24:23.337978Z"},"content_sha256":"eb2c06a132920ec98071937dbce95407327e3ad229292b14c0a0f246ea57b103","schema_version":"1.0","event_id":"sha256:eb2c06a132920ec98071937dbce95407327e3ad229292b14c0a0f246ea57b103"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DZKPEHICVKI2GFRAQ5W4N7A24W/bundle.json","state_url":"https://pith.science/pith/DZKPEHICVKI2GFRAQ5W4N7A24W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DZKPEHICVKI2GFRAQ5W4N7A24W/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-04T22:24:23Z","links":{"resolver":"https://pith.science/pith/DZKPEHICVKI2GFRAQ5W4N7A24W","bundle":"https://pith.science/pith/DZKPEHICVKI2GFRAQ5W4N7A24W/bundle.json","state":"https://pith.science/pith/DZKPEHICVKI2GFRAQ5W4N7A24W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DZKPEHICVKI2GFRAQ5W4N7A24W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DZKPEHICVKI2GFRAQ5W4N7A24W","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":"f8dae1191aac1cb59f412d30c70bcb27b14ba14e024d519efadcbc399d813277","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-20T10:53:15Z","title_canon_sha256":"6239a77bea14dbd1e8fa1924ad08ec8215c8a2ab7633f71240952a325e175b13"},"schema_version":"1.0","source":{"id":"1504.05008","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05008","created_at":"2026-05-18T02:18:22Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05008v1","created_at":"2026-05-18T02:18:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05008","created_at":"2026-05-18T02:18:22Z"},{"alias_kind":"pith_short_12","alias_value":"DZKPEHICVKI2","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DZKPEHICVKI2GFRA","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DZKPEHIC","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:eb2c06a132920ec98071937dbce95407327e3ad229292b14c0a0f246ea57b103","target":"graph","created_at":"2026-05-18T02:18:22Z","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 Index coding there is a single sender with multiple messages and multiple receivers each wanting a different set of messages and knowing a different set of messages a priori. The Index Coding problem is to identify the minimum number of transmissions (optimal length) to be made so that all receivers can decode their wanted messages using the transmitted symbols and their respective prior information and also the codes with optimal length. Recently it was shown that different optimal length codes perform differently in a wireless channel. Towards identifying the best optimal length index cod","authors_text":"B. Sundar Rajan, Kavitha. R","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-20T10:53:15Z","title":"On the Number of Optimal Index Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05008","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:04d5179d81bd616a41d8e504a4bde06a2715047b7fa1e74795edbaa145d79a2a","target":"record","created_at":"2026-05-18T02:18:22Z","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":"f8dae1191aac1cb59f412d30c70bcb27b14ba14e024d519efadcbc399d813277","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-20T10:53:15Z","title_canon_sha256":"6239a77bea14dbd1e8fa1924ad08ec8215c8a2ab7633f71240952a325e175b13"},"schema_version":"1.0","source":{"id":"1504.05008","kind":"arxiv","version":1}},"canonical_sha256":"1e54f21d02aa91a31620876dc6fc1ae59b4dbaa2d4115f3cea750a674982101f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e54f21d02aa91a31620876dc6fc1ae59b4dbaa2d4115f3cea750a674982101f","first_computed_at":"2026-05-18T02:18:22.928157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:22.928157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a63U4C6g5/RS5bxczK+wpOzg9nHjwMAyuR7hn+0y3PEZ8z8CTHGbHiLUgNly59foDiOmKdezl5Ru62E5RQWUCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:22.928910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05008","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04d5179d81bd616a41d8e504a4bde06a2715047b7fa1e74795edbaa145d79a2a","sha256:eb2c06a132920ec98071937dbce95407327e3ad229292b14c0a0f246ea57b103"],"state_sha256":"1c3efaf38c853d3c21f06509df30460c3476dde3f97b0cc46da47698e025531c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9CSRZUt83gFNxr1GRlKwSzMBGaukf1eXi0HVCUQ/NXgdCBnAaIxG+SdfmEvnc5DblQvhbO8XlCEuHRRMmIfOBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:24:23.344681Z","bundle_sha256":"0abc36df1dae0e346809a4359ea92ff50eed241027a1bf5aecf56f4d8876c1c4"}}