{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FGQ7XHB3YTR5HX23WNCG75VL2Q","short_pith_number":"pith:FGQ7XHB3","canonical_record":{"source":{"id":"1706.01442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-05T17:45:43Z","cross_cats_sorted":["cs.CR","cs.IR","math.IT"],"title_canon_sha256":"0ee0ce156cb16898aaec27ee31636cc51a8d6dfe3dc00552ae367ebcc31ea1d7","abstract_canon_sha256":"a3eb043c82a67fce3d02b9982fe48145819305fe7af618addd2bf664623b63cf"},"schema_version":"1.0"},"canonical_sha256":"29a1fb9c3bc4e3d3df5bb3446ff6abd4305e4adab8cc155b2252eef5a5358326","source":{"kind":"arxiv","id":"1706.01442","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01442","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01442v1","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01442","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"pith_short_12","alias_value":"FGQ7XHB3YTR5","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FGQ7XHB3YTR5HX23","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FGQ7XHB3","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FGQ7XHB3YTR5HX23WNCG75VL2Q","target":"record","payload":{"canonical_record":{"source":{"id":"1706.01442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-05T17:45:43Z","cross_cats_sorted":["cs.CR","cs.IR","math.IT"],"title_canon_sha256":"0ee0ce156cb16898aaec27ee31636cc51a8d6dfe3dc00552ae367ebcc31ea1d7","abstract_canon_sha256":"a3eb043c82a67fce3d02b9982fe48145819305fe7af618addd2bf664623b63cf"},"schema_version":"1.0"},"canonical_sha256":"29a1fb9c3bc4e3d3df5bb3446ff6abd4305e4adab8cc155b2252eef5a5358326","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:03.555250Z","signature_b64":"QmEKq4Y4cmkZ51g+aXFmWfnStW7otpUSw6DmdMGTNNDQSSk1c8C4nXLsZlO+EXhbXDXZvV6ZuW9AIRZkmTslBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29a1fb9c3bc4e3d3df5bb3446ff6abd4305e4adab8cc155b2252eef5a5358326","last_reissued_at":"2026-05-18T00:43:03.554552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:03.554552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.01442","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:43:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PpizAwut722f6aw6Mfl1CZ0qqKjYpiDPPHVqlf0sSN/9IgV5Jzcjz94IO4lUsFaWf2CBUBZjW/HiUrjWqKO5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:02:04.944472Z"},"content_sha256":"089a6fd2299f60ee03549bf55d3cc492422add6cc939788ffb594be80a27d3ba","schema_version":"1.0","event_id":"sha256:089a6fd2299f60ee03549bf55d3cc492422add6cc939788ffb594be80a27d3ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FGQ7XHB3YTR5HX23WNCG75VL2Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Capacity of Private Information Retrieval from Byzantine and Colluding Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IR","math.IT"],"primary_cat":"cs.IT","authors_text":"Karim Banawan, Sennur Ulukus","submitted_at":"2017-06-05T17:45:43Z","abstract_excerpt":"We consider the problem of single-round private information retrieval (PIR) from $N$ replicated databases. We consider the case when $B$ databases are outdated (unsynchronized), or even worse, adversarial (Byzantine), and therefore, can return incorrect answers. In the PIR problem with Byzantine databases (BPIR), a user wishes to retrieve a specific message from a set of $M$ messages with zero-error, irrespective of the actions performed by the Byzantine databases. We consider the $T$-privacy constraint in this paper, where any $T$ databases can collude, and exchange the queries submitted by t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01442","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:43:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LWTTDQgfrRZn8663NZEoo8euCgbAKht9ZDnpHwUTF8mkEZvsgWe1ripu7pEjNrANyDN8+1PIImMz6O20j6KDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:02:04.944856Z"},"content_sha256":"740650ebdadca0a7f900ab4cc4f2d9b1f84fc62734f49626c09ce709e056ad59","schema_version":"1.0","event_id":"sha256:740650ebdadca0a7f900ab4cc4f2d9b1f84fc62734f49626c09ce709e056ad59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FGQ7XHB3YTR5HX23WNCG75VL2Q/bundle.json","state_url":"https://pith.science/pith/FGQ7XHB3YTR5HX23WNCG75VL2Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FGQ7XHB3YTR5HX23WNCG75VL2Q/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-06-09T14:02:04Z","links":{"resolver":"https://pith.science/pith/FGQ7XHB3YTR5HX23WNCG75VL2Q","bundle":"https://pith.science/pith/FGQ7XHB3YTR5HX23WNCG75VL2Q/bundle.json","state":"https://pith.science/pith/FGQ7XHB3YTR5HX23WNCG75VL2Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FGQ7XHB3YTR5HX23WNCG75VL2Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FGQ7XHB3YTR5HX23WNCG75VL2Q","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":"a3eb043c82a67fce3d02b9982fe48145819305fe7af618addd2bf664623b63cf","cross_cats_sorted":["cs.CR","cs.IR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-05T17:45:43Z","title_canon_sha256":"0ee0ce156cb16898aaec27ee31636cc51a8d6dfe3dc00552ae367ebcc31ea1d7"},"schema_version":"1.0","source":{"id":"1706.01442","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01442","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01442v1","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01442","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"pith_short_12","alias_value":"FGQ7XHB3YTR5","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FGQ7XHB3YTR5HX23","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FGQ7XHB3","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:740650ebdadca0a7f900ab4cc4f2d9b1f84fc62734f49626c09ce709e056ad59","target":"graph","created_at":"2026-05-18T00:43:03Z","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":"We consider the problem of single-round private information retrieval (PIR) from $N$ replicated databases. We consider the case when $B$ databases are outdated (unsynchronized), or even worse, adversarial (Byzantine), and therefore, can return incorrect answers. In the PIR problem with Byzantine databases (BPIR), a user wishes to retrieve a specific message from a set of $M$ messages with zero-error, irrespective of the actions performed by the Byzantine databases. We consider the $T$-privacy constraint in this paper, where any $T$ databases can collude, and exchange the queries submitted by t","authors_text":"Karim Banawan, Sennur Ulukus","cross_cats":["cs.CR","cs.IR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-05T17:45:43Z","title":"The Capacity of Private Information Retrieval from Byzantine and Colluding Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01442","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:089a6fd2299f60ee03549bf55d3cc492422add6cc939788ffb594be80a27d3ba","target":"record","created_at":"2026-05-18T00:43:03Z","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":"a3eb043c82a67fce3d02b9982fe48145819305fe7af618addd2bf664623b63cf","cross_cats_sorted":["cs.CR","cs.IR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-05T17:45:43Z","title_canon_sha256":"0ee0ce156cb16898aaec27ee31636cc51a8d6dfe3dc00552ae367ebcc31ea1d7"},"schema_version":"1.0","source":{"id":"1706.01442","kind":"arxiv","version":1}},"canonical_sha256":"29a1fb9c3bc4e3d3df5bb3446ff6abd4305e4adab8cc155b2252eef5a5358326","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29a1fb9c3bc4e3d3df5bb3446ff6abd4305e4adab8cc155b2252eef5a5358326","first_computed_at":"2026-05-18T00:43:03.554552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:03.554552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QmEKq4Y4cmkZ51g+aXFmWfnStW7otpUSw6DmdMGTNNDQSSk1c8C4nXLsZlO+EXhbXDXZvV6ZuW9AIRZkmTslBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:03.555250Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.01442","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:089a6fd2299f60ee03549bf55d3cc492422add6cc939788ffb594be80a27d3ba","sha256:740650ebdadca0a7f900ab4cc4f2d9b1f84fc62734f49626c09ce709e056ad59"],"state_sha256":"a95330b9a241caf009c55b32acb67a6bd8315c4c3d1e16da31ed41bf94572699"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gHiPlYz5ZtO+T/ERh/zHX3MupNTIMwefjiYge5C1vYdGXlIP8KqhU6F2XZrv+Upq8x03FLd5IWaXZQVFuO2sAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:02:04.947516Z","bundle_sha256":"ece5f8887d664900cc26d9a06b8ce40815f59fa2fe0c2482c75b387e26506f08"}}