{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QEV2MFUJWWL35CJVUFP6PALC4B","short_pith_number":"pith:QEV2MFUJ","canonical_record":{"source":{"id":"1510.02956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-10T16:23:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"01d29da4d1e2390ac459a6047e5042ac86c754765f294f4b33f5fe6949c8d181","abstract_canon_sha256":"6f6423bfd5ed4f3de4c8236f5a9158090226cb2d00329f809ba7e82c5b5a6c88"},"schema_version":"1.0"},"canonical_sha256":"812ba61689b597be8935a15fe78162e05f2e690308197cd232276edff0ebe8e8","source":{"kind":"arxiv","id":"1510.02956","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02956","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02956v1","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02956","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"QEV2MFUJWWL3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QEV2MFUJWWL35CJV","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QEV2MFUJ","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QEV2MFUJWWL35CJVUFP6PALC4B","target":"record","payload":{"canonical_record":{"source":{"id":"1510.02956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-10T16:23:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"01d29da4d1e2390ac459a6047e5042ac86c754765f294f4b33f5fe6949c8d181","abstract_canon_sha256":"6f6423bfd5ed4f3de4c8236f5a9158090226cb2d00329f809ba7e82c5b5a6c88"},"schema_version":"1.0"},"canonical_sha256":"812ba61689b597be8935a15fe78162e05f2e690308197cd232276edff0ebe8e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:33.164867Z","signature_b64":"Y2PN8gb7bqdEa2b/N8J38PjIkURCiIduU/yiKKnBnZjp8SE/tiatC0Z7HqRjqtkiCcyiaFD97sraKaNoE54DAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"812ba61689b597be8935a15fe78162e05f2e690308197cd232276edff0ebe8e8","last_reissued_at":"2026-05-18T01:30:33.164107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:33.164107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.02956","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-18T01:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iskOJZ1rpJ19pt2dAPHuQN8UvoYuwYBCdXJZbwqeB8Y2tDtXyE5D1vyG8DPNlOlpT2YlR1OiVm7WEYgOBUcuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:34:35.874653Z"},"content_sha256":"a463a48fcc738a44ddedcda2b7210649a626b2ddb78ff8012cd5293800dcdb82","schema_version":"1.0","event_id":"sha256:a463a48fcc738a44ddedcda2b7210649a626b2ddb78ff8012cd5293800dcdb82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QEV2MFUJWWL35CJVUFP6PALC4B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On The Number of Optimal Linear Index Codes For Unicast Index Coding Problems","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., Niranjana Ambadi","submitted_at":"2015-10-10T16:23:25Z","abstract_excerpt":"An index coding problem arises when there is a single source with a number of messages and multiple receivers each wanting a subset of messages and knowing a different set of messages a priori. The noiseless Index Coding Problem is to identify the minimum number of transmissions (optimal length) to be made by the source through noiseless channels so that all receivers can decode their wanted messages using the transmitted symbols and their respective prior information. Recently, it is shown that different optimal length codes perform differently in a noisy channel. Towards identifying the best"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02956","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-18T01:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H18TV+M9ruTWcFP6Jxiro+pNH73S9zcWWBHglO987pRa7x/Yvc7SfiJxtW444FMRiCWoR5ocOvbf/M4lJOiABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:34:35.875000Z"},"content_sha256":"8db112cfb2b126c836a7aa59b78eaaf77b7219aa047942ca0a536404047a1d7d","schema_version":"1.0","event_id":"sha256:8db112cfb2b126c836a7aa59b78eaaf77b7219aa047942ca0a536404047a1d7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QEV2MFUJWWL35CJVUFP6PALC4B/bundle.json","state_url":"https://pith.science/pith/QEV2MFUJWWL35CJVUFP6PALC4B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QEV2MFUJWWL35CJVUFP6PALC4B/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-04T18:34:35Z","links":{"resolver":"https://pith.science/pith/QEV2MFUJWWL35CJVUFP6PALC4B","bundle":"https://pith.science/pith/QEV2MFUJWWL35CJVUFP6PALC4B/bundle.json","state":"https://pith.science/pith/QEV2MFUJWWL35CJVUFP6PALC4B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QEV2MFUJWWL35CJVUFP6PALC4B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QEV2MFUJWWL35CJVUFP6PALC4B","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":"6f6423bfd5ed4f3de4c8236f5a9158090226cb2d00329f809ba7e82c5b5a6c88","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-10T16:23:25Z","title_canon_sha256":"01d29da4d1e2390ac459a6047e5042ac86c754765f294f4b33f5fe6949c8d181"},"schema_version":"1.0","source":{"id":"1510.02956","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02956","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02956v1","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02956","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"QEV2MFUJWWL3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QEV2MFUJWWL35CJV","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QEV2MFUJ","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:8db112cfb2b126c836a7aa59b78eaaf77b7219aa047942ca0a536404047a1d7d","target":"graph","created_at":"2026-05-18T01:30:33Z","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 problem arises when there is a single source with a number of messages and multiple receivers each wanting a subset of messages and knowing a different set of messages a priori. The noiseless Index Coding Problem is to identify the minimum number of transmissions (optimal length) to be made by the source through noiseless channels so that all receivers can decode their wanted messages using the transmitted symbols and their respective prior information. Recently, it is shown that different optimal length codes perform differently in a noisy channel. Towards identifying the best","authors_text":"B. Sundar Rajan, Kavitha R., Niranjana Ambadi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-10T16:23:25Z","title":"On The Number of Optimal Linear Index Codes For Unicast Index Coding Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02956","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:a463a48fcc738a44ddedcda2b7210649a626b2ddb78ff8012cd5293800dcdb82","target":"record","created_at":"2026-05-18T01:30:33Z","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":"6f6423bfd5ed4f3de4c8236f5a9158090226cb2d00329f809ba7e82c5b5a6c88","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-10T16:23:25Z","title_canon_sha256":"01d29da4d1e2390ac459a6047e5042ac86c754765f294f4b33f5fe6949c8d181"},"schema_version":"1.0","source":{"id":"1510.02956","kind":"arxiv","version":1}},"canonical_sha256":"812ba61689b597be8935a15fe78162e05f2e690308197cd232276edff0ebe8e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"812ba61689b597be8935a15fe78162e05f2e690308197cd232276edff0ebe8e8","first_computed_at":"2026-05-18T01:30:33.164107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:33.164107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y2PN8gb7bqdEa2b/N8J38PjIkURCiIduU/yiKKnBnZjp8SE/tiatC0Z7HqRjqtkiCcyiaFD97sraKaNoE54DAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:33.164867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.02956","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a463a48fcc738a44ddedcda2b7210649a626b2ddb78ff8012cd5293800dcdb82","sha256:8db112cfb2b126c836a7aa59b78eaaf77b7219aa047942ca0a536404047a1d7d"],"state_sha256":"08b511f16da635b311eee95e0a083f42f4cbe4b3e871849cb1934dc64d975446"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LXrxY4Kpsoc2mxc1z7vfZUn47GBbYPi2u2S6CWYm+mPRwxJ0A6zrQ/v2yaHMKuVltme2p8ejyEPFVIy5yh0mAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:34:35.876991Z","bundle_sha256":"1fb64df39808614cda98941348c62fc056a452db177386bf09fa39c83f7134ca"}}