{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FGQ7XHB3YTR5HX23WNCG75VL2Q","short_pith_number":"pith:FGQ7XHB3","schema_version":"1.0","canonical_sha256":"29a1fb9c3bc4e3d3df5bb3446ff6abd4305e4adab8cc155b2252eef5a5358326","source":{"kind":"arxiv","id":"1706.01442","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.01442","created_at":"2026-05-18T00:43:03.554641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.01442v1","created_at":"2026-05-18T00:43:03.554641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01442","created_at":"2026-05-18T00:43:03.554641+00:00"},{"alias_kind":"pith_short_12","alias_value":"FGQ7XHB3YTR5","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FGQ7XHB3YTR5HX23","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FGQ7XHB3","created_at":"2026-05-18T12:31:15.632608+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/FGQ7XHB3YTR5HX23WNCG75VL2Q","json":"https://pith.science/pith/FGQ7XHB3YTR5HX23WNCG75VL2Q.json","graph_json":"https://pith.science/api/pith-number/FGQ7XHB3YTR5HX23WNCG75VL2Q/graph.json","events_json":"https://pith.science/api/pith-number/FGQ7XHB3YTR5HX23WNCG75VL2Q/events.json","paper":"https://pith.science/paper/FGQ7XHB3"},"agent_actions":{"view_html":"https://pith.science/pith/FGQ7XHB3YTR5HX23WNCG75VL2Q","download_json":"https://pith.science/pith/FGQ7XHB3YTR5HX23WNCG75VL2Q.json","view_paper":"https://pith.science/paper/FGQ7XHB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.01442&json=true","fetch_graph":"https://pith.science/api/pith-number/FGQ7XHB3YTR5HX23WNCG75VL2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/FGQ7XHB3YTR5HX23WNCG75VL2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FGQ7XHB3YTR5HX23WNCG75VL2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FGQ7XHB3YTR5HX23WNCG75VL2Q/action/storage_attestation","attest_author":"https://pith.science/pith/FGQ7XHB3YTR5HX23WNCG75VL2Q/action/author_attestation","sign_citation":"https://pith.science/pith/FGQ7XHB3YTR5HX23WNCG75VL2Q/action/citation_signature","submit_replication":"https://pith.science/pith/FGQ7XHB3YTR5HX23WNCG75VL2Q/action/replication_record"}},"created_at":"2026-05-18T00:43:03.554641+00:00","updated_at":"2026-05-18T00:43:03.554641+00:00"}