{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DZKPEHICVKI2GFRAQ5W4N7A24W","short_pith_number":"pith:DZKPEHIC","schema_version":"1.0","canonical_sha256":"1e54f21d02aa91a31620876dc6fc1ae59b4dbaa2d4115f3cea750a674982101f","source":{"kind":"arxiv","id":"1504.05008","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.05008","created_at":"2026-05-18T02:18:22.928282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05008v1","created_at":"2026-05-18T02:18:22.928282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05008","created_at":"2026-05-18T02:18:22.928282+00:00"},{"alias_kind":"pith_short_12","alias_value":"DZKPEHICVKI2","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DZKPEHICVKI2GFRA","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DZKPEHIC","created_at":"2026-05-18T12:29:17.054201+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/DZKPEHICVKI2GFRAQ5W4N7A24W","json":"https://pith.science/pith/DZKPEHICVKI2GFRAQ5W4N7A24W.json","graph_json":"https://pith.science/api/pith-number/DZKPEHICVKI2GFRAQ5W4N7A24W/graph.json","events_json":"https://pith.science/api/pith-number/DZKPEHICVKI2GFRAQ5W4N7A24W/events.json","paper":"https://pith.science/paper/DZKPEHIC"},"agent_actions":{"view_html":"https://pith.science/pith/DZKPEHICVKI2GFRAQ5W4N7A24W","download_json":"https://pith.science/pith/DZKPEHICVKI2GFRAQ5W4N7A24W.json","view_paper":"https://pith.science/paper/DZKPEHIC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05008&json=true","fetch_graph":"https://pith.science/api/pith-number/DZKPEHICVKI2GFRAQ5W4N7A24W/graph.json","fetch_events":"https://pith.science/api/pith-number/DZKPEHICVKI2GFRAQ5W4N7A24W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DZKPEHICVKI2GFRAQ5W4N7A24W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DZKPEHICVKI2GFRAQ5W4N7A24W/action/storage_attestation","attest_author":"https://pith.science/pith/DZKPEHICVKI2GFRAQ5W4N7A24W/action/author_attestation","sign_citation":"https://pith.science/pith/DZKPEHICVKI2GFRAQ5W4N7A24W/action/citation_signature","submit_replication":"https://pith.science/pith/DZKPEHICVKI2GFRAQ5W4N7A24W/action/replication_record"}},"created_at":"2026-05-18T02:18:22.928282+00:00","updated_at":"2026-05-18T02:18:22.928282+00:00"}