{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SIIEZNG4G7ZQJOSQ5MAULM7ZQD","short_pith_number":"pith:SIIEZNG4","schema_version":"1.0","canonical_sha256":"92104cb4dc37f304ba50eb0145b3f980d87664d99064993cb67870298502867a","source":{"kind":"arxiv","id":"1903.12552","version":7},"attestation_state":"computed","paper":{"title":"Towards the Capacity of Private Information Retrieval from Coded and Colluding Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Camilla Hollanti, Jie Li, Lukas Holzbaur, Ragnar Freij-Hollanti","submitted_at":"2019-03-29T14:44:02Z","abstract_excerpt":"In this work, two practical concepts related to private information retrieval (PIR) are introduced and coined full support-rank PIR and strongly linear PIR. Being of full support-rank is a technical, yet natural condition required to prove a converse result for a capacity expression and satisfied by almost all currently known capacity-achieving schemes, while strong linearity is a practical requirement enabling implementation over small finite fields with low subpacketization degree. Then, the capacity of MDS-coded, linear, full support-rank PIR in the presence of colluding servers is derived,"},"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":"1903.12552","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-29T14:44:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fdfdedccb5ba22c8e7c066e9ea5a03ad29b75d8149fc1c68721f41b60dcc56ae","abstract_canon_sha256":"bcfc9e95a40becc98ea5d6fe16adfaacbf973c363e698d1081a3f4c088ee0d23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:20:17.686069Z","signature_b64":"f+jITzA+TITsP/sO0YJs6jVmtVcLNgj9Tla3eLP2yjvJSBUPkdz6S6bFNdp8bOPhE3MzSzIMbXLnfwCnqPfIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92104cb4dc37f304ba50eb0145b3f980d87664d99064993cb67870298502867a","last_reissued_at":"2026-07-05T03:20:17.685565Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:20:17.685565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards the Capacity of Private Information Retrieval from Coded and Colluding Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Camilla Hollanti, Jie Li, Lukas Holzbaur, Ragnar Freij-Hollanti","submitted_at":"2019-03-29T14:44:02Z","abstract_excerpt":"In this work, two practical concepts related to private information retrieval (PIR) are introduced and coined full support-rank PIR and strongly linear PIR. Being of full support-rank is a technical, yet natural condition required to prove a converse result for a capacity expression and satisfied by almost all currently known capacity-achieving schemes, while strong linearity is a practical requirement enabling implementation over small finite fields with low subpacketization degree. Then, the capacity of MDS-coded, linear, full support-rank PIR in the presence of colluding servers is derived,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12552","kind":"arxiv","version":7},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1903.12552/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1903.12552","created_at":"2026-07-05T03:20:17.685620+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.12552v7","created_at":"2026-07-05T03:20:17.685620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12552","created_at":"2026-07-05T03:20:17.685620+00:00"},{"alias_kind":"pith_short_12","alias_value":"SIIEZNG4G7ZQ","created_at":"2026-07-05T03:20:17.685620+00:00"},{"alias_kind":"pith_short_16","alias_value":"SIIEZNG4G7ZQJOSQ","created_at":"2026-07-05T03:20:17.685620+00:00"},{"alias_kind":"pith_short_8","alias_value":"SIIEZNG4","created_at":"2026-07-05T03:20:17.685620+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/SIIEZNG4G7ZQJOSQ5MAULM7ZQD","json":"https://pith.science/pith/SIIEZNG4G7ZQJOSQ5MAULM7ZQD.json","graph_json":"https://pith.science/api/pith-number/SIIEZNG4G7ZQJOSQ5MAULM7ZQD/graph.json","events_json":"https://pith.science/api/pith-number/SIIEZNG4G7ZQJOSQ5MAULM7ZQD/events.json","paper":"https://pith.science/paper/SIIEZNG4"},"agent_actions":{"view_html":"https://pith.science/pith/SIIEZNG4G7ZQJOSQ5MAULM7ZQD","download_json":"https://pith.science/pith/SIIEZNG4G7ZQJOSQ5MAULM7ZQD.json","view_paper":"https://pith.science/paper/SIIEZNG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.12552&json=true","fetch_graph":"https://pith.science/api/pith-number/SIIEZNG4G7ZQJOSQ5MAULM7ZQD/graph.json","fetch_events":"https://pith.science/api/pith-number/SIIEZNG4G7ZQJOSQ5MAULM7ZQD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SIIEZNG4G7ZQJOSQ5MAULM7ZQD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SIIEZNG4G7ZQJOSQ5MAULM7ZQD/action/storage_attestation","attest_author":"https://pith.science/pith/SIIEZNG4G7ZQJOSQ5MAULM7ZQD/action/author_attestation","sign_citation":"https://pith.science/pith/SIIEZNG4G7ZQJOSQ5MAULM7ZQD/action/citation_signature","submit_replication":"https://pith.science/pith/SIIEZNG4G7ZQJOSQ5MAULM7ZQD/action/replication_record"}},"created_at":"2026-07-05T03:20:17.685620+00:00","updated_at":"2026-07-05T03:20:17.685620+00:00"}