{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WH7P55IPO6XENMSSOAFOLU6POM","short_pith_number":"pith:WH7P55IP","schema_version":"1.0","canonical_sha256":"b1fefef50f77ae46b252700ae5d3cf733a189804fa029c69d97ce6b9b3de5140","source":{"kind":"arxiv","id":"1904.05906","version":1},"attestation_state":"computed","paper":{"title":"On the Asymptotic Capacity of $X$-Secure $T$-Private Information Retrieval with Graph Based Replicated Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Syed A. Jafar, Zhuqing Jia","submitted_at":"2019-04-11T18:04:54Z","abstract_excerpt":"The problem of private information retrieval with graph-based replicated storage was recently introduced by Raviv, Tamo and Yaakobi. Its capacity remains open in almost all cases. In this work the asymptotic (large number of messages) capacity of this problem is studied along with its generalizations to include arbitrary $T$-privacy and $X$-security constraints, where the privacy of the user must be protected against any set of up to $T$ colluding servers and the security of the stored data must be protected against any set of up to $X$ colluding servers. A general achievable scheme for arbitr"},"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":"1904.05906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-11T18:04:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"425e0efdb8c1d4f4dda35928aed65c3266c03a51027488a90e157e83f38e5c83","abstract_canon_sha256":"e8a434fef531c1af2dcfe452ea52b9b47dde42dc32638f003d9f05d754dff874"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:44.762111Z","signature_b64":"OfJDttcVoYDlsnbAWOMINiuJON259++D76QwU7RUO52jQuZKsQody8pHnK5VEEUNTvVP/9GaDMSw/rBOtadeCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1fefef50f77ae46b252700ae5d3cf733a189804fa029c69d97ce6b9b3de5140","last_reissued_at":"2026-05-17T23:48:44.761601Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:44.761601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Asymptotic Capacity of $X$-Secure $T$-Private Information Retrieval with Graph Based Replicated Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Syed A. Jafar, Zhuqing Jia","submitted_at":"2019-04-11T18:04:54Z","abstract_excerpt":"The problem of private information retrieval with graph-based replicated storage was recently introduced by Raviv, Tamo and Yaakobi. Its capacity remains open in almost all cases. In this work the asymptotic (large number of messages) capacity of this problem is studied along with its generalizations to include arbitrary $T$-privacy and $X$-security constraints, where the privacy of the user must be protected against any set of up to $T$ colluding servers and the security of the stored data must be protected against any set of up to $X$ colluding servers. A general achievable scheme for arbitr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05906","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":"1904.05906","created_at":"2026-05-17T23:48:44.761688+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.05906v1","created_at":"2026-05-17T23:48:44.761688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05906","created_at":"2026-05-17T23:48:44.761688+00:00"},{"alias_kind":"pith_short_12","alias_value":"WH7P55IPO6XE","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"WH7P55IPO6XENMSS","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"WH7P55IP","created_at":"2026-05-18T12:33:30.264802+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/WH7P55IPO6XENMSSOAFOLU6POM","json":"https://pith.science/pith/WH7P55IPO6XENMSSOAFOLU6POM.json","graph_json":"https://pith.science/api/pith-number/WH7P55IPO6XENMSSOAFOLU6POM/graph.json","events_json":"https://pith.science/api/pith-number/WH7P55IPO6XENMSSOAFOLU6POM/events.json","paper":"https://pith.science/paper/WH7P55IP"},"agent_actions":{"view_html":"https://pith.science/pith/WH7P55IPO6XENMSSOAFOLU6POM","download_json":"https://pith.science/pith/WH7P55IPO6XENMSSOAFOLU6POM.json","view_paper":"https://pith.science/paper/WH7P55IP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.05906&json=true","fetch_graph":"https://pith.science/api/pith-number/WH7P55IPO6XENMSSOAFOLU6POM/graph.json","fetch_events":"https://pith.science/api/pith-number/WH7P55IPO6XENMSSOAFOLU6POM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WH7P55IPO6XENMSSOAFOLU6POM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WH7P55IPO6XENMSSOAFOLU6POM/action/storage_attestation","attest_author":"https://pith.science/pith/WH7P55IPO6XENMSSOAFOLU6POM/action/author_attestation","sign_citation":"https://pith.science/pith/WH7P55IPO6XENMSSOAFOLU6POM/action/citation_signature","submit_replication":"https://pith.science/pith/WH7P55IPO6XENMSSOAFOLU6POM/action/replication_record"}},"created_at":"2026-05-17T23:48:44.761688+00:00","updated_at":"2026-05-17T23:48:44.761688+00:00"}