{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LEQ7DGPDUE2GOQNNBVFUAMQMHA","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":"aaf74729fb8afe57d7606bf015dbee3af1d5300afbeb0cb72feb3ddb9fea6305","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-21T18:12:58Z","title_canon_sha256":"f990557d10985253a422192cb89b1c5be89f2c65d67b3f25f2389d086f1a7209"},"schema_version":"1.0","source":{"id":"1809.08263","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08263","created_at":"2026-05-18T00:05:08Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08263v1","created_at":"2026-05-18T00:05:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08263","created_at":"2026-05-18T00:05:08Z"},{"alias_kind":"pith_short_12","alias_value":"LEQ7DGPDUE2G","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LEQ7DGPDUE2GOQNN","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LEQ7DGPD","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:26499259eb0185e3fe708506adba87d74935bbabb873158edf384f6ae615bc8e","target":"graph","created_at":"2026-05-18T00:05:08Z","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":"In the traditional index coding problem, a server employs coding to send messages to $n$ clients within the same broadcast domain. Each client already has some messages as side information and requests a particular unknown message from the server. All clients learn the coding matrix so that they can decode and retrieve their requested data. Our starting observation is that, learning the coding matrix can pose privacy concerns: it may enable a client to infer information about the requests and side information of other clients. In this paper, we mitigate this privacy concern by allowing each cl","authors_text":"Christina Fragouli, Linqi Song, Martina Cardone, Mohammed Karmoose","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-21T18:12:58Z","title":"Privacy in Index Coding: $k$-Limited-Access Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08263","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:53fe0e3c4432e41a6da7d6109e0f9f12afb09fe1d92c1a44042adc4b7f021c17","target":"record","created_at":"2026-05-18T00:05:08Z","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":"aaf74729fb8afe57d7606bf015dbee3af1d5300afbeb0cb72feb3ddb9fea6305","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-21T18:12:58Z","title_canon_sha256":"f990557d10985253a422192cb89b1c5be89f2c65d67b3f25f2389d086f1a7209"},"schema_version":"1.0","source":{"id":"1809.08263","kind":"arxiv","version":1}},"canonical_sha256":"5921f199e3a1346741ad0d4b40320c383122f799d0be0a389cdf2e2736492a7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5921f199e3a1346741ad0d4b40320c383122f799d0be0a389cdf2e2736492a7f","first_computed_at":"2026-05-18T00:05:08.993451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:08.993451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2EgC1njicv/6/HJA4zj4qsxnSlQBAzv+JSl8mf/OwDEVRKmCgILQ02Bu1Iy6ariJWTj37UxIICQJo5gEbDOKDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:08.993931Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.08263","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53fe0e3c4432e41a6da7d6109e0f9f12afb09fe1d92c1a44042adc4b7f021c17","sha256:26499259eb0185e3fe708506adba87d74935bbabb873158edf384f6ae615bc8e"],"state_sha256":"b2f75ae1123c7e05a177da5438cd3dbfddefb98917f7114f5d8bc4cafe56f190"}