{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:X52NNZCEZQKLM4AYX7UDHSJNW4","short_pith_number":"pith:X52NNZCE","canonical_record":{"source":{"id":"1810.02451","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-04T23:02:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"06899abbe19650871dffab5c6af1d3f5d202be59e3b7f9deeb1a0922efd93a1b","abstract_canon_sha256":"bc6ecb874f68857ef1ccbc98ab959638cdeed37ed010af8d06a26bdb5ac009c1"},"schema_version":"1.0"},"canonical_sha256":"bf74d6e444cc14b67018bfe833c92db7218461c9bb01369799afec0b0feb74b4","source":{"kind":"arxiv","id":"1810.02451","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02451","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02451v2","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02451","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"X52NNZCEZQKL","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X52NNZCEZQKLM4AY","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X52NNZCE","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:X52NNZCEZQKLM4AYX7UDHSJNW4","target":"record","payload":{"canonical_record":{"source":{"id":"1810.02451","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-04T23:02:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"06899abbe19650871dffab5c6af1d3f5d202be59e3b7f9deeb1a0922efd93a1b","abstract_canon_sha256":"bc6ecb874f68857ef1ccbc98ab959638cdeed37ed010af8d06a26bdb5ac009c1"},"schema_version":"1.0"},"canonical_sha256":"bf74d6e444cc14b67018bfe833c92db7218461c9bb01369799afec0b0feb74b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:44.920120Z","signature_b64":"K6yYapfbt04xPWEgacKwNwzj2Ijrz07Bswq1FgbQReOAaW1ZQh7AUM8iJq6FjlmYggaP0f9qwoSAAIS8cUGdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf74d6e444cc14b67018bfe833c92db7218461c9bb01369799afec0b0feb74b4","last_reissued_at":"2026-05-18T00:03:44.919678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:44.919678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.02451","source_version":2,"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:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z9oPhPGwQ1bfBPmCEt0Xs/bSSA4fysTg7n7OWLZn3wEmLg2ckRg4RJmfAl7uNnGdFS1Mm95KA7VNqgbZNoIcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:25:12.850493Z"},"content_sha256":"99c9bde2aea14006b6df6dd023322b088d92d5e82f4765c15143eefc9101bb42","schema_version":"1.0","event_id":"sha256:99c9bde2aea14006b6df6dd023322b088d92d5e82f4765c15143eefc9101bb42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:X52NNZCEZQKLM4AYX7UDHSJNW4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Information Theoretic Converse Results for some Pliable Index Coding Problems","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-10-04T23:02:54Z","abstract_excerpt":"This paper studies the Pliable Index CODing problem (PICOD), which models content-type distribution networks. In the PICOD$(t)$ problem there are $m$ messages, $n$ users and each user has a distinct message side information set, as in the classical Index Coding problem (IC). Differently from IC, where each user has a pre-specified set of messages to decode, in the PICOD$(t)$ a user is \"pliable\" and is satisfied if it can decode any $t$ messages that are not in its side information set. The goal is to find a code with the shortest length that satisfies all the users. This flexibility in determi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02451","kind":"arxiv","version":2},"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:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JwY7egsPD37/8yX6ur3luus0uM8OInqTyxZc8zpxI4CAHBoFf/cf6sWkzpVwoqBEDo3wtCVJ6arinRW4rhsfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:25:12.851213Z"},"content_sha256":"f9c161c17a254d01ec3cbf49e2a73d591057c71a47915f45ecca193c236b08fa","schema_version":"1.0","event_id":"sha256:f9c161c17a254d01ec3cbf49e2a73d591057c71a47915f45ecca193c236b08fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X52NNZCEZQKLM4AYX7UDHSJNW4/bundle.json","state_url":"https://pith.science/pith/X52NNZCEZQKLM4AYX7UDHSJNW4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X52NNZCEZQKLM4AYX7UDHSJNW4/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-10T05:25:12Z","links":{"resolver":"https://pith.science/pith/X52NNZCEZQKLM4AYX7UDHSJNW4","bundle":"https://pith.science/pith/X52NNZCEZQKLM4AYX7UDHSJNW4/bundle.json","state":"https://pith.science/pith/X52NNZCEZQKLM4AYX7UDHSJNW4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X52NNZCEZQKLM4AYX7UDHSJNW4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:X52NNZCEZQKLM4AYX7UDHSJNW4","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":"bc6ecb874f68857ef1ccbc98ab959638cdeed37ed010af8d06a26bdb5ac009c1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-04T23:02:54Z","title_canon_sha256":"06899abbe19650871dffab5c6af1d3f5d202be59e3b7f9deeb1a0922efd93a1b"},"schema_version":"1.0","source":{"id":"1810.02451","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02451","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02451v2","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02451","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"X52NNZCEZQKL","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X52NNZCEZQKLM4AY","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X52NNZCE","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:f9c161c17a254d01ec3cbf49e2a73d591057c71a47915f45ecca193c236b08fa","target":"graph","created_at":"2026-05-18T00:03:44Z","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":"This paper studies the Pliable Index CODing problem (PICOD), which models content-type distribution networks. In the PICOD$(t)$ problem there are $m$ messages, $n$ users and each user has a distinct message side information set, as in the classical Index Coding problem (IC). Differently from IC, where each user has a pre-specified set of messages to decode, in the PICOD$(t)$ a user is \"pliable\" and is satisfied if it can decode any $t$ messages that are not in its side information set. The goal is to find a code with the shortest length that satisfies all the users. This flexibility in determi","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-10-04T23:02:54Z","title":"Tight Information Theoretic Converse Results for some Pliable Index Coding Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02451","kind":"arxiv","version":2},"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:99c9bde2aea14006b6df6dd023322b088d92d5e82f4765c15143eefc9101bb42","target":"record","created_at":"2026-05-18T00:03:44Z","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":"bc6ecb874f68857ef1ccbc98ab959638cdeed37ed010af8d06a26bdb5ac009c1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-04T23:02:54Z","title_canon_sha256":"06899abbe19650871dffab5c6af1d3f5d202be59e3b7f9deeb1a0922efd93a1b"},"schema_version":"1.0","source":{"id":"1810.02451","kind":"arxiv","version":2}},"canonical_sha256":"bf74d6e444cc14b67018bfe833c92db7218461c9bb01369799afec0b0feb74b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf74d6e444cc14b67018bfe833c92db7218461c9bb01369799afec0b0feb74b4","first_computed_at":"2026-05-18T00:03:44.919678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:44.919678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K6yYapfbt04xPWEgacKwNwzj2Ijrz07Bswq1FgbQReOAaW1ZQh7AUM8iJq6FjlmYggaP0f9qwoSAAIS8cUGdAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:44.920120Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.02451","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99c9bde2aea14006b6df6dd023322b088d92d5e82f4765c15143eefc9101bb42","sha256:f9c161c17a254d01ec3cbf49e2a73d591057c71a47915f45ecca193c236b08fa"],"state_sha256":"2298a1fd9b9122a77a8ca9de84b1a4294c0533d97e1675f44503986d4618ea74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2altXDsZ5bgKjGkzdv6+L1zPkfuZm9UV0n96zr+CB8KJKSs1bZ2wYIBaw2W5shuDNN2VqodRFpOO7Nl0rZMpCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T05:25:12.855055Z","bundle_sha256":"a54add2cfaab98a988f336aa65ac98fbb903334f17c7903e27fbad612daae0ee"}}