{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PUSATJUNKW5F4YUIKWNSR3BQYS","short_pith_number":"pith:PUSATJUN","canonical_record":{"source":{"id":"1806.05148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-13T17:14:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a607cfa70899f3b51fb6a5f17a4e0c90489434400b692e04e5ffa68d602120fa","abstract_canon_sha256":"914b9f54dcff48d4c327c406d2862ba5b04b66f3e6ff033be087a7d4985a5b93"},"schema_version":"1.0"},"canonical_sha256":"7d2409a68d55ba5e6288559b28ec30c4aa3e3e4605b3a1878abbff0da88d7c18","source":{"kind":"arxiv","id":"1806.05148","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.05148","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"1806.05148v1","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05148","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"PUSATJUNKW5F","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PUSATJUNKW5F4YUI","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PUSATJUN","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PUSATJUNKW5F4YUIKWNSR3BQYS","target":"record","payload":{"canonical_record":{"source":{"id":"1806.05148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-13T17:14:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a607cfa70899f3b51fb6a5f17a4e0c90489434400b692e04e5ffa68d602120fa","abstract_canon_sha256":"914b9f54dcff48d4c327c406d2862ba5b04b66f3e6ff033be087a7d4985a5b93"},"schema_version":"1.0"},"canonical_sha256":"7d2409a68d55ba5e6288559b28ec30c4aa3e3e4605b3a1878abbff0da88d7c18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:20.040064Z","signature_b64":"YO9OMiUJq6nduGAmg13EOJK4jxdGcNdX7NkSO3E7LVFoUhWARpM8tyd/7kWzYY/rIP3OQgRR+RnLBCdpQ6QOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d2409a68d55ba5e6288559b28ec30c4aa3e3e4605b3a1878abbff0da88d7c18","last_reissued_at":"2026-05-18T00:13:20.039468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:20.039468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.05148","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-18T00:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ViBmcLWNmuUkmxeG6YtInYCkZPP/lTk/2LqXFVWu35fjnGOLgfyvQOmYDxY4GTSBs38ajmYl4MR/Yp+f/MSOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:22:47.705138Z"},"content_sha256":"ca54394a9f5e8e54da0baffb44ccde1233c21c5d4b3ad5bdc73bd9cd6095b596","schema_version":"1.0","event_id":"sha256:ca54394a9f5e8e54da0baffb44ccde1233c21c5d4b3ad5bdc73bd9cd6095b596"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PUSATJUNKW5F4YUIKWNSR3BQYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Information Theoretic Converse for the \"Consecutive Complete--$S$\" PICOD Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Tang Liu","submitted_at":"2018-06-13T17:14:36Z","abstract_excerpt":"Pliable Index CODing (PICOD) is a variant of the Index Coding (IC) problem in which a user is satisfied whenever it can successfully decode any one message that is not in its side information set, as opposed to a fixed pre-determined message. The complete--$S$ PICOD with $m$ messages, for $S\\subseteq[0:m-1]$, has $n = \\sum_{s\\in S} \\binom{m}{s}$ users with distinct side information sets. Past work on PICOD provided tight converse results when either the sender is constrained to use linear codes, or for some special classes of complete--$S$ PICOD. This paper provides a tight information theoret"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05148","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-18T00:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lD5X6gXazNg4TSvbCSnckCbH0nVV9MNQd+jmHQQJHWd8lNsHfEk4VugvY5VjHnZ3n0LPu4OaFzFTkgRmbAsQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:22:47.705891Z"},"content_sha256":"c80aec94c1e6e6b8536b67280cc5add024803d47184c383ddb72110c9e3a90d4","schema_version":"1.0","event_id":"sha256:c80aec94c1e6e6b8536b67280cc5add024803d47184c383ddb72110c9e3a90d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PUSATJUNKW5F4YUIKWNSR3BQYS/bundle.json","state_url":"https://pith.science/pith/PUSATJUNKW5F4YUIKWNSR3BQYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PUSATJUNKW5F4YUIKWNSR3BQYS/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-09T19:22:47Z","links":{"resolver":"https://pith.science/pith/PUSATJUNKW5F4YUIKWNSR3BQYS","bundle":"https://pith.science/pith/PUSATJUNKW5F4YUIKWNSR3BQYS/bundle.json","state":"https://pith.science/pith/PUSATJUNKW5F4YUIKWNSR3BQYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PUSATJUNKW5F4YUIKWNSR3BQYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PUSATJUNKW5F4YUIKWNSR3BQYS","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":"914b9f54dcff48d4c327c406d2862ba5b04b66f3e6ff033be087a7d4985a5b93","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-13T17:14:36Z","title_canon_sha256":"a607cfa70899f3b51fb6a5f17a4e0c90489434400b692e04e5ffa68d602120fa"},"schema_version":"1.0","source":{"id":"1806.05148","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.05148","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"1806.05148v1","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05148","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"PUSATJUNKW5F","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PUSATJUNKW5F4YUI","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PUSATJUN","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:c80aec94c1e6e6b8536b67280cc5add024803d47184c383ddb72110c9e3a90d4","target":"graph","created_at":"2026-05-18T00:13:20Z","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":"Pliable Index CODing (PICOD) is a variant of the Index Coding (IC) problem in which a user is satisfied whenever it can successfully decode any one message that is not in its side information set, as opposed to a fixed pre-determined message. The complete--$S$ PICOD with $m$ messages, for $S\\subseteq[0:m-1]$, has $n = \\sum_{s\\in S} \\binom{m}{s}$ users with distinct side information sets. Past work on PICOD provided tight converse results when either the sender is constrained to use linear codes, or for some special classes of complete--$S$ PICOD. This paper provides a tight information theoret","authors_text":"Daniela Tuninetti, Tang Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-13T17:14:36Z","title":"An Information Theoretic Converse for the \"Consecutive Complete--$S$\" PICOD Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05148","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:ca54394a9f5e8e54da0baffb44ccde1233c21c5d4b3ad5bdc73bd9cd6095b596","target":"record","created_at":"2026-05-18T00:13:20Z","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":"914b9f54dcff48d4c327c406d2862ba5b04b66f3e6ff033be087a7d4985a5b93","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-13T17:14:36Z","title_canon_sha256":"a607cfa70899f3b51fb6a5f17a4e0c90489434400b692e04e5ffa68d602120fa"},"schema_version":"1.0","source":{"id":"1806.05148","kind":"arxiv","version":1}},"canonical_sha256":"7d2409a68d55ba5e6288559b28ec30c4aa3e3e4605b3a1878abbff0da88d7c18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d2409a68d55ba5e6288559b28ec30c4aa3e3e4605b3a1878abbff0da88d7c18","first_computed_at":"2026-05-18T00:13:20.039468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:20.039468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YO9OMiUJq6nduGAmg13EOJK4jxdGcNdX7NkSO3E7LVFoUhWARpM8tyd/7kWzYY/rIP3OQgRR+RnLBCdpQ6QOBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:20.040064Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.05148","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca54394a9f5e8e54da0baffb44ccde1233c21c5d4b3ad5bdc73bd9cd6095b596","sha256:c80aec94c1e6e6b8536b67280cc5add024803d47184c383ddb72110c9e3a90d4"],"state_sha256":"67dca69b3a4582672e2af97c8c9c85cd8429f99122afc1f914ee035b9cb7e0a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bd99APfOOxMKvqsShj1TOgC1AF3aDBhi/RamAPpcZiAMAOU9gTl7frUi/62FoGcBKNahfx5GOX4VSpJrn7RXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:22:47.709826Z","bundle_sha256":"5712d7ddc1f328103444a170101cc42e27e5174fee51dc942a7597c9beddc1d8"}}