{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KWFPQJ5PHDI2UKUTXFQXVFUROD","short_pith_number":"pith:KWFPQJ5P","schema_version":"1.0","canonical_sha256":"558af827af38d1aa2a93b9617a969170ee79cd7a5006012328eebefdb0104277","source":{"kind":"arxiv","id":"1801.03892","version":1},"attestation_state":"computed","paper":{"title":"Privacy in Index Coding: Improved Bounds and Coding Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christina Fragouli, Linqi Song, Martina Cardone, Mohammed Karmoose","submitted_at":"2018-01-11T17:37:59Z","abstract_excerpt":"It was recently observed in [1], that in index coding, learning the coding matrix used by the server can pose privacy concerns: curious clients can extract information about the requests and side information of other clients. One approach to mitigate such concerns is the use of $k$-limited-access schemes [1], that restrict each client to learn only part of the index coding matrix, and in particular, at most $k$ rows. These schemes transform a linear index coding matrix of rank $T$ to an alternate one, such that each client needs to learn at most $k$ of the coding matrix rows to decode its requ"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1801.03892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T17:37:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"46c196702ae8e04b40e24795401c53730c0e86ae5fd01e8ebf414a94710a4bdd","abstract_canon_sha256":"a7ef7fdb638153d8dac54ac766bb6a59c67483d91ce9890f9311ae9f8f68827a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:24.749290Z","signature_b64":"GEdngDp7Nx7jVABS/k/W+teYHmFkMmapR5WuyR5HEa5fVBUW3c5hr8u6AeQjXqyIX3GJIkqLKXRcCRjzHxCwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"558af827af38d1aa2a93b9617a969170ee79cd7a5006012328eebefdb0104277","last_reissued_at":"2026-05-18T00:03:24.748636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:24.748636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Privacy in Index Coding: Improved Bounds and Coding Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christina Fragouli, Linqi Song, Martina Cardone, Mohammed Karmoose","submitted_at":"2018-01-11T17:37:59Z","abstract_excerpt":"It was recently observed in [1], that in index coding, learning the coding matrix used by the server can pose privacy concerns: curious clients can extract information about the requests and side information of other clients. One approach to mitigate such concerns is the use of $k$-limited-access schemes [1], that restrict each client to learn only part of the index coding matrix, and in particular, at most $k$ rows. These schemes transform a linear index coding matrix of rank $T$ to an alternate one, such that each client needs to learn at most $k$ of the coding matrix rows to decode its requ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03892","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.03892","created_at":"2026-05-18T00:03:24.748738+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.03892v1","created_at":"2026-05-18T00:03:24.748738+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03892","created_at":"2026-05-18T00:03:24.748738+00:00"},{"alias_kind":"pith_short_12","alias_value":"KWFPQJ5PHDI2","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KWFPQJ5PHDI2UKUT","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KWFPQJ5P","created_at":"2026-05-18T12:32:33.847187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KWFPQJ5PHDI2UKUTXFQXVFUROD","json":"https://pith.science/pith/KWFPQJ5PHDI2UKUTXFQXVFUROD.json","graph_json":"https://pith.science/api/pith-number/KWFPQJ5PHDI2UKUTXFQXVFUROD/graph.json","events_json":"https://pith.science/api/pith-number/KWFPQJ5PHDI2UKUTXFQXVFUROD/events.json","paper":"https://pith.science/paper/KWFPQJ5P"},"agent_actions":{"view_html":"https://pith.science/pith/KWFPQJ5PHDI2UKUTXFQXVFUROD","download_json":"https://pith.science/pith/KWFPQJ5PHDI2UKUTXFQXVFUROD.json","view_paper":"https://pith.science/paper/KWFPQJ5P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.03892&json=true","fetch_graph":"https://pith.science/api/pith-number/KWFPQJ5PHDI2UKUTXFQXVFUROD/graph.json","fetch_events":"https://pith.science/api/pith-number/KWFPQJ5PHDI2UKUTXFQXVFUROD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KWFPQJ5PHDI2UKUTXFQXVFUROD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KWFPQJ5PHDI2UKUTXFQXVFUROD/action/storage_attestation","attest_author":"https://pith.science/pith/KWFPQJ5PHDI2UKUTXFQXVFUROD/action/author_attestation","sign_citation":"https://pith.science/pith/KWFPQJ5PHDI2UKUTXFQXVFUROD/action/citation_signature","submit_replication":"https://pith.science/pith/KWFPQJ5PHDI2UKUTXFQXVFUROD/action/replication_record"}},"created_at":"2026-05-18T00:03:24.748738+00:00","updated_at":"2026-05-18T00:03:24.748738+00:00"}