{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2DJ3GNC743JSY4H22RYWFXHKTM","short_pith_number":"pith:2DJ3GNC7","canonical_record":{"source":{"id":"1412.5012","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-12-16T14:23:47Z","cross_cats_sorted":[],"title_canon_sha256":"7edbe878edd229ab3cfd2b214e93e984747d18d78a567302464c76002e294eac","abstract_canon_sha256":"a036e46dd00c54921a35f1ec64af0c6800c57226ba2f60d20c71a2e85299b9fa"},"schema_version":"1.0"},"canonical_sha256":"d0d3b3345fe6d32c70fad47162dcea9b0eddc84935bb2fd0bf2d3b1f6d070876","source":{"kind":"arxiv","id":"1412.5012","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5012","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5012v1","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5012","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"pith_short_12","alias_value":"2DJ3GNC743JS","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"2DJ3GNC743JSY4H2","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"2DJ3GNC7","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2DJ3GNC743JSY4H22RYWFXHKTM","target":"record","payload":{"canonical_record":{"source":{"id":"1412.5012","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-12-16T14:23:47Z","cross_cats_sorted":[],"title_canon_sha256":"7edbe878edd229ab3cfd2b214e93e984747d18d78a567302464c76002e294eac","abstract_canon_sha256":"a036e46dd00c54921a35f1ec64af0c6800c57226ba2f60d20c71a2e85299b9fa"},"schema_version":"1.0"},"canonical_sha256":"d0d3b3345fe6d32c70fad47162dcea9b0eddc84935bb2fd0bf2d3b1f6d070876","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:09.855411Z","signature_b64":"vDevebPrv7GVt/Ch6lg3M8YdQ9RXYrLP8Vxb+YN4+imt04SWykJhE7UkVm/3x2IXQDoyuJHjqwdWKAPe6EmGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0d3b3345fe6d32c70fad47162dcea9b0eddc84935bb2fd0bf2d3b1f6d070876","last_reissued_at":"2026-05-18T02:31:09.854883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:09.854883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.5012","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-18T02:31:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+jsn9+g5McTHTBXnTl65/lP6QAsrXBUEXNH2NmgxMfGrdHR0VvXwB513ssLYdBAPuRueN9ROYPR/jTJCQOoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T01:23:00.054884Z"},"content_sha256":"22a35f96d02a5563e5e6382106d01b0d175d6fd093a508970343b0debb402d1a","schema_version":"1.0","event_id":"sha256:22a35f96d02a5563e5e6382106d01b0d175d6fd093a508970343b0debb402d1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2DJ3GNC743JSY4H22RYWFXHKTM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Abdullatif Shikfa, Daniel Augot (LIX), Fran\\c{c}oise Levy-Dit-Vehel (UMA)","submitted_at":"2014-12-16T14:23:47Z","abstract_excerpt":"Since the concept of locally decodable codes was introduced by Katz and Trevisan in 2000, it is well-known that information the-oretically secure private information retrieval schemes can be built using locally decodable codes. In this paper, we construct a Byzantine ro-bust PIR scheme using the multiplicity codes introduced by Kopparty et al. Our main contributions are on the one hand to avoid full replica-tion of the database on each server; this significantly reduces the global redundancy. On the other hand, to have a much lower locality in the PIR context than in the LDC context. This show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5012","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-18T02:31:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f/r+J7GYhw84Apk4izcd1d/IjahwfX4L/VWrDI5+/qk2L04jwDe/p66oAtDDEnXvYk7738sgLccqqjuyY4gADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T01:23:00.055222Z"},"content_sha256":"9553be788dd8612e595b2b80ccd843976afb9662ee4e6720f9392b1b08ed6370","schema_version":"1.0","event_id":"sha256:9553be788dd8612e595b2b80ccd843976afb9662ee4e6720f9392b1b08ed6370"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2DJ3GNC743JSY4H22RYWFXHKTM/bundle.json","state_url":"https://pith.science/pith/2DJ3GNC743JSY4H22RYWFXHKTM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2DJ3GNC743JSY4H22RYWFXHKTM/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-07-05T01:23:00Z","links":{"resolver":"https://pith.science/pith/2DJ3GNC743JSY4H22RYWFXHKTM","bundle":"https://pith.science/pith/2DJ3GNC743JSY4H22RYWFXHKTM/bundle.json","state":"https://pith.science/pith/2DJ3GNC743JSY4H22RYWFXHKTM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2DJ3GNC743JSY4H22RYWFXHKTM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2DJ3GNC743JSY4H22RYWFXHKTM","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":"a036e46dd00c54921a35f1ec64af0c6800c57226ba2f60d20c71a2e85299b9fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-12-16T14:23:47Z","title_canon_sha256":"7edbe878edd229ab3cfd2b214e93e984747d18d78a567302464c76002e294eac"},"schema_version":"1.0","source":{"id":"1412.5012","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5012","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5012v1","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5012","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"pith_short_12","alias_value":"2DJ3GNC743JS","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"2DJ3GNC743JSY4H2","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"2DJ3GNC7","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:9553be788dd8612e595b2b80ccd843976afb9662ee4e6720f9392b1b08ed6370","target":"graph","created_at":"2026-05-18T02:31:09Z","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":"Since the concept of locally decodable codes was introduced by Katz and Trevisan in 2000, it is well-known that information the-oretically secure private information retrieval schemes can be built using locally decodable codes. In this paper, we construct a Byzantine ro-bust PIR scheme using the multiplicity codes introduced by Kopparty et al. Our main contributions are on the one hand to avoid full replica-tion of the database on each server; this significantly reduces the global redundancy. On the other hand, to have a much lower locality in the PIR context than in the LDC context. This show","authors_text":"Abdullatif Shikfa, Daniel Augot (LIX), Fran\\c{c}oise Levy-Dit-Vehel (UMA)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-12-16T14:23:47Z","title":"A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5012","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:22a35f96d02a5563e5e6382106d01b0d175d6fd093a508970343b0debb402d1a","target":"record","created_at":"2026-05-18T02:31:09Z","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":"a036e46dd00c54921a35f1ec64af0c6800c57226ba2f60d20c71a2e85299b9fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-12-16T14:23:47Z","title_canon_sha256":"7edbe878edd229ab3cfd2b214e93e984747d18d78a567302464c76002e294eac"},"schema_version":"1.0","source":{"id":"1412.5012","kind":"arxiv","version":1}},"canonical_sha256":"d0d3b3345fe6d32c70fad47162dcea9b0eddc84935bb2fd0bf2d3b1f6d070876","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0d3b3345fe6d32c70fad47162dcea9b0eddc84935bb2fd0bf2d3b1f6d070876","first_computed_at":"2026-05-18T02:31:09.854883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:09.854883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vDevebPrv7GVt/Ch6lg3M8YdQ9RXYrLP8Vxb+YN4+imt04SWykJhE7UkVm/3x2IXQDoyuJHjqwdWKAPe6EmGCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:09.855411Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.5012","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22a35f96d02a5563e5e6382106d01b0d175d6fd093a508970343b0debb402d1a","sha256:9553be788dd8612e595b2b80ccd843976afb9662ee4e6720f9392b1b08ed6370"],"state_sha256":"87a9aae13fb7f4fe834f5bfb4816f43688b1ebecefbc7c16aed90faf0cfd6e4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mEsiQ+9m2wdvnMDoeeLloy/ziiqem5mD8YHQnNByxK9YvQi5NiVWKf0xbV9h0RWp+6rwNHraRdlsE2SkRW4UBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T01:23:00.057108Z","bundle_sha256":"5b76ec2aceb3a9afd26ac22a7a214919f503c82f881ae1c6019678a5ff440fce"}}