{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VPGLPAZQUXFAOSZRMWRSEOWRFA","short_pith_number":"pith:VPGLPAZQ","canonical_record":{"source":{"id":"1901.05809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T14:33:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"425fa71f1576e0d462121403ad2a54f56eaef036a84524d0d5271a903fee13f7","abstract_canon_sha256":"b37749c898aab2b5d395995d80f621d50e6af83239348ae340b3474e94bd0464"},"schema_version":"1.0"},"canonical_sha256":"abccb78330a5ca074b3165a3223ad12816822aff0b97210c8effee22a768ba13","source":{"kind":"arxiv","id":"1901.05809","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05809","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05809v1","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05809","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"pith_short_12","alias_value":"VPGLPAZQUXFA","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VPGLPAZQUXFAOSZR","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VPGLPAZQ","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VPGLPAZQUXFAOSZRMWRSEOWRFA","target":"record","payload":{"canonical_record":{"source":{"id":"1901.05809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T14:33:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"425fa71f1576e0d462121403ad2a54f56eaef036a84524d0d5271a903fee13f7","abstract_canon_sha256":"b37749c898aab2b5d395995d80f621d50e6af83239348ae340b3474e94bd0464"},"schema_version":"1.0"},"canonical_sha256":"abccb78330a5ca074b3165a3223ad12816822aff0b97210c8effee22a768ba13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:06.128600Z","signature_b64":"0xcus+tPzX90xB8oqe+DKg8DFkjMKlCjselGgV7Cz7NwJNBc3v7U3ynlt+u5aDGTDQFH6yasM5LvBYy4EZkCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abccb78330a5ca074b3165a3223ad12816822aff0b97210c8effee22a768ba13","last_reissued_at":"2026-05-17T23:56:06.127977Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:06.127977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.05809","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-17T23:56:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eTD9PtAPnCfgeaNTo8XTWVhHNCGUN1ITjjFEQrE4A8uJS04djyfV0dLldd5YWzLLNSNMDZ1AiL7DXnD77PSEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:34:29.616458Z"},"content_sha256":"16dacbc1f807be86dd90461ea12d9bdf25ac3ed0498737114faba4c7002a722a","schema_version":"1.0","event_id":"sha256:16dacbc1f807be86dd90461ea12d9bdf25ac3ed0498737114faba4c7002a722a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VPGLPAZQUXFAOSZRMWRSEOWRFA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Pliable Index Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Shanuja Sasi","submitted_at":"2019-01-17T14:33:57Z","abstract_excerpt":"A new variant of index coding problem termed as Pliable Index Coding Problem (PICOD) is formulated in [S. Brahma, C. Fragouli, \"Pliable index coding\", IEEE Transactions on Information Theory, vol. 61, no. 11, pp. 6192-6203, 2015]. In PICOD, we consider a server holding a set of messages and there is a set of clients having a subset of messages with them. Each client is satisfied if it receives any of the message which it doesn't have. We discuss about a class of PICOD where the side information is consecutive. We provide index codes for two extreme cases - for the class where each client gets "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05809","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-17T23:56:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qZ7eSteS+7rTF0j7C2km4Y5+W6LMapKd7XY/ajxjlRbuogom+qlJQ7I3OyYY+cUUE23e1cVplVCnaf2VOPuOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:34:29.616799Z"},"content_sha256":"19c73e62a8da04fec63b59916a67bf83f33029fe9cd41dce9e80cddbd8825cf8","schema_version":"1.0","event_id":"sha256:19c73e62a8da04fec63b59916a67bf83f33029fe9cd41dce9e80cddbd8825cf8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VPGLPAZQUXFAOSZRMWRSEOWRFA/bundle.json","state_url":"https://pith.science/pith/VPGLPAZQUXFAOSZRMWRSEOWRFA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VPGLPAZQUXFAOSZRMWRSEOWRFA/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-04T19:34:29Z","links":{"resolver":"https://pith.science/pith/VPGLPAZQUXFAOSZRMWRSEOWRFA","bundle":"https://pith.science/pith/VPGLPAZQUXFAOSZRMWRSEOWRFA/bundle.json","state":"https://pith.science/pith/VPGLPAZQUXFAOSZRMWRSEOWRFA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VPGLPAZQUXFAOSZRMWRSEOWRFA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VPGLPAZQUXFAOSZRMWRSEOWRFA","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":"b37749c898aab2b5d395995d80f621d50e6af83239348ae340b3474e94bd0464","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T14:33:57Z","title_canon_sha256":"425fa71f1576e0d462121403ad2a54f56eaef036a84524d0d5271a903fee13f7"},"schema_version":"1.0","source":{"id":"1901.05809","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05809","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05809v1","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05809","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"pith_short_12","alias_value":"VPGLPAZQUXFA","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VPGLPAZQUXFAOSZR","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VPGLPAZQ","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:19c73e62a8da04fec63b59916a67bf83f33029fe9cd41dce9e80cddbd8825cf8","target":"graph","created_at":"2026-05-17T23:56:06Z","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":"A new variant of index coding problem termed as Pliable Index Coding Problem (PICOD) is formulated in [S. Brahma, C. Fragouli, \"Pliable index coding\", IEEE Transactions on Information Theory, vol. 61, no. 11, pp. 6192-6203, 2015]. In PICOD, we consider a server holding a set of messages and there is a set of clients having a subset of messages with them. Each client is satisfied if it receives any of the message which it doesn't have. We discuss about a class of PICOD where the side information is consecutive. We provide index codes for two extreme cases - for the class where each client gets ","authors_text":"B. Sundar Rajan, Shanuja Sasi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T14:33:57Z","title":"On Pliable Index Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05809","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:16dacbc1f807be86dd90461ea12d9bdf25ac3ed0498737114faba4c7002a722a","target":"record","created_at":"2026-05-17T23:56:06Z","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":"b37749c898aab2b5d395995d80f621d50e6af83239348ae340b3474e94bd0464","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T14:33:57Z","title_canon_sha256":"425fa71f1576e0d462121403ad2a54f56eaef036a84524d0d5271a903fee13f7"},"schema_version":"1.0","source":{"id":"1901.05809","kind":"arxiv","version":1}},"canonical_sha256":"abccb78330a5ca074b3165a3223ad12816822aff0b97210c8effee22a768ba13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abccb78330a5ca074b3165a3223ad12816822aff0b97210c8effee22a768ba13","first_computed_at":"2026-05-17T23:56:06.127977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:06.127977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0xcus+tPzX90xB8oqe+DKg8DFkjMKlCjselGgV7Cz7NwJNBc3v7U3ynlt+u5aDGTDQFH6yasM5LvBYy4EZkCDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:06.128600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.05809","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16dacbc1f807be86dd90461ea12d9bdf25ac3ed0498737114faba4c7002a722a","sha256:19c73e62a8da04fec63b59916a67bf83f33029fe9cd41dce9e80cddbd8825cf8"],"state_sha256":"8b59f60d97413eee3995c2890306fded33695cac87c0b21ddf85ce1a3d07f8d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HOStWEcGUD7CPFcqGQcWCSwHMH4w77cMRNUYzko1ZarptICn5HlsUBpQZDmBTst3EZd/p6Q7GInXqCrYxYGDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:34:29.618881Z","bundle_sha256":"b03aa5f809c9fbaab5bf375287c4c207c1a73fb6a109c381925eb2d6a21c7513"}}