{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KWFPQJ5PHDI2UKUTXFQXVFUROD","short_pith_number":"pith:KWFPQJ5P","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"},"canonical_sha256":"558af827af38d1aa2a93b9617a969170ee79cd7a5006012328eebefdb0104277","source":{"kind":"arxiv","id":"1801.03892","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03892","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03892v1","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03892","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"KWFPQJ5PHDI2","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KWFPQJ5PHDI2UKUT","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KWFPQJ5P","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KWFPQJ5PHDI2UKUTXFQXVFUROD","target":"record","payload":{"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"},"canonical_sha256":"558af827af38d1aa2a93b9617a969170ee79cd7a5006012328eebefdb0104277","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"},"source_kind":"arxiv","source_id":"1801.03892","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:03:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jaQO89Nlb/hGU1L1GcOc/VyAaFOTurnBYSCHwWu068Atmr/Mh3b3WwqWMZWU5DO8UDtMTDs8bmSSGMHSYzb0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:27:02.205422Z"},"content_sha256":"45d95ca91e5893cf7bff69daef1703706b0c02f04a01410ad2308c8f6e7a22f0","schema_version":"1.0","event_id":"sha256:45d95ca91e5893cf7bff69daef1703706b0c02f04a01410ad2308c8f6e7a22f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KWFPQJ5PHDI2UKUTXFQXVFUROD","target":"graph","payload":{"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"},"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:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SHgICgAd0Yefl1D949Jz1MHxlhctcYFd3CRoEuldRDzKgJtqZ1dTKBczmcsbMKQoo2CCqAsKb3pQTxCVRiNpAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:27:02.205957Z"},"content_sha256":"25b2358553da7433c4b3b2c42f6e8f006dd39002fccbb8aba02c9072884c8176","schema_version":"1.0","event_id":"sha256:25b2358553da7433c4b3b2c42f6e8f006dd39002fccbb8aba02c9072884c8176"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KWFPQJ5PHDI2UKUTXFQXVFUROD/bundle.json","state_url":"https://pith.science/pith/KWFPQJ5PHDI2UKUTXFQXVFUROD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KWFPQJ5PHDI2UKUTXFQXVFUROD/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-05-30T06:27:02Z","links":{"resolver":"https://pith.science/pith/KWFPQJ5PHDI2UKUTXFQXVFUROD","bundle":"https://pith.science/pith/KWFPQJ5PHDI2UKUTXFQXVFUROD/bundle.json","state":"https://pith.science/pith/KWFPQJ5PHDI2UKUTXFQXVFUROD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KWFPQJ5PHDI2UKUTXFQXVFUROD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KWFPQJ5PHDI2UKUTXFQXVFUROD","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":"a7ef7fdb638153d8dac54ac766bb6a59c67483d91ce9890f9311ae9f8f68827a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T17:37:59Z","title_canon_sha256":"46c196702ae8e04b40e24795401c53730c0e86ae5fd01e8ebf414a94710a4bdd"},"schema_version":"1.0","source":{"id":"1801.03892","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03892","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03892v1","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03892","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"KWFPQJ5PHDI2","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KWFPQJ5PHDI2UKUT","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KWFPQJ5P","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:25b2358553da7433c4b3b2c42f6e8f006dd39002fccbb8aba02c9072884c8176","target":"graph","created_at":"2026-05-18T00:03:24Z","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":"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","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-01-11T17:37:59Z","title":"Privacy in Index Coding: Improved Bounds and Coding Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03892","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:45d95ca91e5893cf7bff69daef1703706b0c02f04a01410ad2308c8f6e7a22f0","target":"record","created_at":"2026-05-18T00:03:24Z","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":"a7ef7fdb638153d8dac54ac766bb6a59c67483d91ce9890f9311ae9f8f68827a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T17:37:59Z","title_canon_sha256":"46c196702ae8e04b40e24795401c53730c0e86ae5fd01e8ebf414a94710a4bdd"},"schema_version":"1.0","source":{"id":"1801.03892","kind":"arxiv","version":1}},"canonical_sha256":"558af827af38d1aa2a93b9617a969170ee79cd7a5006012328eebefdb0104277","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"558af827af38d1aa2a93b9617a969170ee79cd7a5006012328eebefdb0104277","first_computed_at":"2026-05-18T00:03:24.748636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:24.748636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GEdngDp7Nx7jVABS/k/W+teYHmFkMmapR5WuyR5HEa5fVBUW3c5hr8u6AeQjXqyIX3GJIkqLKXRcCRjzHxCwBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:24.749290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.03892","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45d95ca91e5893cf7bff69daef1703706b0c02f04a01410ad2308c8f6e7a22f0","sha256:25b2358553da7433c4b3b2c42f6e8f006dd39002fccbb8aba02c9072884c8176"],"state_sha256":"e77a3df9fffc6389551ca23e44e922562a922c5b6591e0a67683644500d974c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HXhyoPuljDO1+lUcv8IcpZXVVOE+9OYX3MZZSN5nT23jHojNXDMWRTbtHJlOeS/X1TWGt9uLn8SPrRGJG0XlAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:27:02.208025Z","bundle_sha256":"e3abf6473354955f7d03a2747fc17667e4b662db467f6edfcd6c92cad3cb4e09"}}