{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ULSZ6SS3Y776TNM62OBTLQJTHL","short_pith_number":"pith:ULSZ6SS3","canonical_record":{"source":{"id":"1410.6038","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-22T13:32:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"04b4fb13f31356d3057bc3a34226267e03177c804935443c1df67b9ae8349ede","abstract_canon_sha256":"f33050abb9e6d9f2b43f0c8031b7c4fc56ee35a672319719bba92990a3e8b587"},"schema_version":"1.0"},"canonical_sha256":"a2e59f4a5bc7ffe9b59ed38335c1333adb76023b9f9ac6e9bd066cc39dd6717e","source":{"kind":"arxiv","id":"1410.6038","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6038","created_at":"2026-05-18T02:19:00Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6038v6","created_at":"2026-05-18T02:19:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6038","created_at":"2026-05-18T02:19:00Z"},{"alias_kind":"pith_short_12","alias_value":"ULSZ6SS3Y776","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"ULSZ6SS3Y776TNM6","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"ULSZ6SS3","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ULSZ6SS3Y776TNM62OBTLQJTHL","target":"record","payload":{"canonical_record":{"source":{"id":"1410.6038","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-22T13:32:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"04b4fb13f31356d3057bc3a34226267e03177c804935443c1df67b9ae8349ede","abstract_canon_sha256":"f33050abb9e6d9f2b43f0c8031b7c4fc56ee35a672319719bba92990a3e8b587"},"schema_version":"1.0"},"canonical_sha256":"a2e59f4a5bc7ffe9b59ed38335c1333adb76023b9f9ac6e9bd066cc39dd6717e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:00.883231Z","signature_b64":"vvQXwEVm5YUFCm/S0WD4Iz63NWiKFGm276fXTvNlLPrMnt+grBNP1wKI/4zPo4WqMufaWY8qCBttY1MU5CmHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2e59f4a5bc7ffe9b59ed38335c1333adb76023b9f9ac6e9bd066cc39dd6717e","last_reissued_at":"2026-05-18T02:19:00.882755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:00.882755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.6038","source_version":6,"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:19:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ebAqXIpX5VIQQ3K4nF9fFgLmNZjhlAVCLVIVtZOw19diWHfLZuBP3XYq8HfkislhzZeaQF8I9Qm2QdnqKy9hBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:39:33.641412Z"},"content_sha256":"108a23c331ea52ea79dfdb4fdd79e62fde369a0f3339c37cbf1369c15b414053","schema_version":"1.0","event_id":"sha256:108a23c331ea52ea79dfdb4fdd79e62fde369a0f3339c37cbf1369c15b414053"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ULSZ6SS3Y776TNM62OBTLQJTHL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Index Coding with Min-Max Probability of Error over Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anoop Thomas, B. Sundar Rajan, Chandramouli A., Kavitha R.","submitted_at":"2014-10-22T13:32:39Z","abstract_excerpt":"An index coding scheme in which the source (transmitter) transmits binary symbols over a wireless fading channel is considered. Index codes with the transmitter using minimum number of transmissions are known as optimal index codes. Different optimal index codes give different performances in terms of probability of error in a fading environment and this also varies from receiver to receiver. In this paper we deal with optimal index codes which minimizes the maximum probability of error among all the receivers. We identify a criterion for optimal index codes that minimizes the maximum probabil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6038","kind":"arxiv","version":6},"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:19:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ONjMq0mjp7hvyRB2RVe0qIj5qhu1ldJGZVI0g8t8MHeEn8bMcQjUhQu/LoqgxXQASUPBqaUU46Qe7wgDxgYGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:39:33.641775Z"},"content_sha256":"9b2441bcc84832900eec72ea0c0347870ba9564534feef2886535411ab8134b7","schema_version":"1.0","event_id":"sha256:9b2441bcc84832900eec72ea0c0347870ba9564534feef2886535411ab8134b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULSZ6SS3Y776TNM62OBTLQJTHL/bundle.json","state_url":"https://pith.science/pith/ULSZ6SS3Y776TNM62OBTLQJTHL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULSZ6SS3Y776TNM62OBTLQJTHL/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-04T21:39:33Z","links":{"resolver":"https://pith.science/pith/ULSZ6SS3Y776TNM62OBTLQJTHL","bundle":"https://pith.science/pith/ULSZ6SS3Y776TNM62OBTLQJTHL/bundle.json","state":"https://pith.science/pith/ULSZ6SS3Y776TNM62OBTLQJTHL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULSZ6SS3Y776TNM62OBTLQJTHL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ULSZ6SS3Y776TNM62OBTLQJTHL","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":"f33050abb9e6d9f2b43f0c8031b7c4fc56ee35a672319719bba92990a3e8b587","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-22T13:32:39Z","title_canon_sha256":"04b4fb13f31356d3057bc3a34226267e03177c804935443c1df67b9ae8349ede"},"schema_version":"1.0","source":{"id":"1410.6038","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6038","created_at":"2026-05-18T02:19:00Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6038v6","created_at":"2026-05-18T02:19:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6038","created_at":"2026-05-18T02:19:00Z"},{"alias_kind":"pith_short_12","alias_value":"ULSZ6SS3Y776","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"ULSZ6SS3Y776TNM6","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"ULSZ6SS3","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:9b2441bcc84832900eec72ea0c0347870ba9564534feef2886535411ab8134b7","target":"graph","created_at":"2026-05-18T02:19:00Z","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":"An index coding scheme in which the source (transmitter) transmits binary symbols over a wireless fading channel is considered. Index codes with the transmitter using minimum number of transmissions are known as optimal index codes. Different optimal index codes give different performances in terms of probability of error in a fading environment and this also varies from receiver to receiver. In this paper we deal with optimal index codes which minimizes the maximum probability of error among all the receivers. We identify a criterion for optimal index codes that minimizes the maximum probabil","authors_text":"Anoop Thomas, B. Sundar Rajan, Chandramouli A., Kavitha R.","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-22T13:32:39Z","title":"Optimal Index Coding with Min-Max Probability of Error over Fading Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6038","kind":"arxiv","version":6},"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:108a23c331ea52ea79dfdb4fdd79e62fde369a0f3339c37cbf1369c15b414053","target":"record","created_at":"2026-05-18T02:19:00Z","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":"f33050abb9e6d9f2b43f0c8031b7c4fc56ee35a672319719bba92990a3e8b587","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-22T13:32:39Z","title_canon_sha256":"04b4fb13f31356d3057bc3a34226267e03177c804935443c1df67b9ae8349ede"},"schema_version":"1.0","source":{"id":"1410.6038","kind":"arxiv","version":6}},"canonical_sha256":"a2e59f4a5bc7ffe9b59ed38335c1333adb76023b9f9ac6e9bd066cc39dd6717e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2e59f4a5bc7ffe9b59ed38335c1333adb76023b9f9ac6e9bd066cc39dd6717e","first_computed_at":"2026-05-18T02:19:00.882755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:00.882755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vvQXwEVm5YUFCm/S0WD4Iz63NWiKFGm276fXTvNlLPrMnt+grBNP1wKI/4zPo4WqMufaWY8qCBttY1MU5CmHCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:00.883231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.6038","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:108a23c331ea52ea79dfdb4fdd79e62fde369a0f3339c37cbf1369c15b414053","sha256:9b2441bcc84832900eec72ea0c0347870ba9564534feef2886535411ab8134b7"],"state_sha256":"b1b0861b01e0975beead0133e5922d62041c2d6702d446dbbf09ace5464706a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"APAdoZ+6BkWftuilNkQCD0DNuRaZ3QS7EmqSRj8GGU+w1czndl3oT2q03iR+Ptg4UY8/n1k6rURQdY3VgqZdBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:39:33.643745Z","bundle_sha256":"7b3a80f86e6e15afdacc1288d1e04bf26bf94bbd3ddc82bef0e0f2b35aecbba5"}}