{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GA4IDJFQ7YCQZMDMWP7JT44R6B","short_pith_number":"pith:GA4IDJFQ","canonical_record":{"source":{"id":"1903.06921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-16T13:48:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"14a43e7753a2087b8fb736f5e9bce3fd4bedd8b41b99b28593898bbe1158c937","abstract_canon_sha256":"da0cf8b2e34ca9787f9c379ba073d0c8ae8a8e696abde8902324c8963f1ccc61"},"schema_version":"1.0"},"canonical_sha256":"303881a4b0fe050cb06cb3fe99f391f057d2333198c94665ff0922c61306e7f2","source":{"kind":"arxiv","id":"1903.06921","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06921","created_at":"2026-05-17T23:51:08Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06921v1","created_at":"2026-05-17T23:51:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06921","created_at":"2026-05-17T23:51:08Z"},{"alias_kind":"pith_short_12","alias_value":"GA4IDJFQ7YCQ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GA4IDJFQ7YCQZMDM","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GA4IDJFQ","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GA4IDJFQ7YCQZMDMWP7JT44R6B","target":"record","payload":{"canonical_record":{"source":{"id":"1903.06921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-16T13:48:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"14a43e7753a2087b8fb736f5e9bce3fd4bedd8b41b99b28593898bbe1158c937","abstract_canon_sha256":"da0cf8b2e34ca9787f9c379ba073d0c8ae8a8e696abde8902324c8963f1ccc61"},"schema_version":"1.0"},"canonical_sha256":"303881a4b0fe050cb06cb3fe99f391f057d2333198c94665ff0922c61306e7f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:08.599909Z","signature_b64":"dgbUlXNT37ThMOIULpD0LF9sFYVTfeomclNVTFzovTPY4/RQTHx+7AQOQ5E0VJQr0mwsiO2xXH1X9B7KOki5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"303881a4b0fe050cb06cb3fe99f391f057d2333198c94665ff0922c61306e7f2","last_reissued_at":"2026-05-17T23:51:08.599426Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:08.599426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.06921","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-17T23:51:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ms7VUKnIRmXNoWOiJAW5baIrFK+68MiOFyOmDa0OLHsTDeIRMff0aMRn+HS5D8tpas+1uwOC24l6bMBLnM9nDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:09:39.632115Z"},"content_sha256":"483d1aab8c49634f1a6defa8a15f0e17b8bb3a9817611b9e207a720a1ebc6113","schema_version":"1.0","event_id":"sha256:483d1aab8c49634f1a6defa8a15f0e17b8bb3a9817611b9e207a720a1ebc6113"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GA4IDJFQ7YCQZMDMWP7JT44R6B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new Capacity-Achieving Private Information Retrieval Scheme with (Almost) Optimal File Length for Coded Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Qi, Jinbao Zhu, Qifa Yan, Xiaohu Tang","submitted_at":"2019-03-16T13:48:31Z","abstract_excerpt":"In a distributed storage system, private information retrieval (PIR) guarantees that a user retrieves one file from the system without revealing any information about the identity of its interested file to any individual server. In this paper, we investigate $(N,K,M)$ coded sever model of PIR, where each of $M$ files is distributed to the $N$ servers in the form of $(N,K)$ maximum distance separable (MDS) code for some $N>K$ and $M>1$. As a result, we propose a new capacity-achieving $(N,K,M)$ coded linear PIR scheme such that it can be implemented with file length $\\frac{K(N-K)}{\\gcd(N,K)}$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06921","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-17T23:51:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MEGwel78a/8Q6KmDngPQwke5ro1tkhLSjIzImEEAERZuOAhuKL24McUved59B4iD8AhZqw8raQSXa+dZdNTbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:09:39.632541Z"},"content_sha256":"c0065f72b7c40743f40ed7ec5ce4e38d6d9f491214491cf8c55478e6118c7e3e","schema_version":"1.0","event_id":"sha256:c0065f72b7c40743f40ed7ec5ce4e38d6d9f491214491cf8c55478e6118c7e3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GA4IDJFQ7YCQZMDMWP7JT44R6B/bundle.json","state_url":"https://pith.science/pith/GA4IDJFQ7YCQZMDMWP7JT44R6B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GA4IDJFQ7YCQZMDMWP7JT44R6B/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-30T08:09:39Z","links":{"resolver":"https://pith.science/pith/GA4IDJFQ7YCQZMDMWP7JT44R6B","bundle":"https://pith.science/pith/GA4IDJFQ7YCQZMDMWP7JT44R6B/bundle.json","state":"https://pith.science/pith/GA4IDJFQ7YCQZMDMWP7JT44R6B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GA4IDJFQ7YCQZMDMWP7JT44R6B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GA4IDJFQ7YCQZMDMWP7JT44R6B","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":"da0cf8b2e34ca9787f9c379ba073d0c8ae8a8e696abde8902324c8963f1ccc61","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-16T13:48:31Z","title_canon_sha256":"14a43e7753a2087b8fb736f5e9bce3fd4bedd8b41b99b28593898bbe1158c937"},"schema_version":"1.0","source":{"id":"1903.06921","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06921","created_at":"2026-05-17T23:51:08Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06921v1","created_at":"2026-05-17T23:51:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06921","created_at":"2026-05-17T23:51:08Z"},{"alias_kind":"pith_short_12","alias_value":"GA4IDJFQ7YCQ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GA4IDJFQ7YCQZMDM","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GA4IDJFQ","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:c0065f72b7c40743f40ed7ec5ce4e38d6d9f491214491cf8c55478e6118c7e3e","target":"graph","created_at":"2026-05-17T23:51: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 a distributed storage system, private information retrieval (PIR) guarantees that a user retrieves one file from the system without revealing any information about the identity of its interested file to any individual server. In this paper, we investigate $(N,K,M)$ coded sever model of PIR, where each of $M$ files is distributed to the $N$ servers in the form of $(N,K)$ maximum distance separable (MDS) code for some $N>K$ and $M>1$. As a result, we propose a new capacity-achieving $(N,K,M)$ coded linear PIR scheme such that it can be implemented with file length $\\frac{K(N-K)}{\\gcd(N,K)}$, ","authors_text":"Chao Qi, Jinbao Zhu, Qifa Yan, Xiaohu Tang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-16T13:48:31Z","title":"A new Capacity-Achieving Private Information Retrieval Scheme with (Almost) Optimal File Length for Coded Servers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06921","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:483d1aab8c49634f1a6defa8a15f0e17b8bb3a9817611b9e207a720a1ebc6113","target":"record","created_at":"2026-05-17T23:51: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":"da0cf8b2e34ca9787f9c379ba073d0c8ae8a8e696abde8902324c8963f1ccc61","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-16T13:48:31Z","title_canon_sha256":"14a43e7753a2087b8fb736f5e9bce3fd4bedd8b41b99b28593898bbe1158c937"},"schema_version":"1.0","source":{"id":"1903.06921","kind":"arxiv","version":1}},"canonical_sha256":"303881a4b0fe050cb06cb3fe99f391f057d2333198c94665ff0922c61306e7f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"303881a4b0fe050cb06cb3fe99f391f057d2333198c94665ff0922c61306e7f2","first_computed_at":"2026-05-17T23:51:08.599426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:08.599426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dgbUlXNT37ThMOIULpD0LF9sFYVTfeomclNVTFzovTPY4/RQTHx+7AQOQ5E0VJQr0mwsiO2xXH1X9B7KOki5Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:08.599909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.06921","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:483d1aab8c49634f1a6defa8a15f0e17b8bb3a9817611b9e207a720a1ebc6113","sha256:c0065f72b7c40743f40ed7ec5ce4e38d6d9f491214491cf8c55478e6118c7e3e"],"state_sha256":"f517055a9f32c9932e14cbf3739db9b2d3517458079d793f8f1c92dcff820d76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4bXXi/RJDcyglc7LQhElB2SuA1FScyGzipZ5FcOIaiABEc4mkYZNyNewM+hCW0Wbll9Qdila3WkgoN4mBXZpCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:09:39.635095Z","bundle_sha256":"574f6fa24798fd86afd35b01d013cdc785f807b435404843ac059b290baf5f5f"}}