{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RQEABIDP6YJRKWQ6TK54KG65H2","short_pith_number":"pith:RQEABIDP","schema_version":"1.0","canonical_sha256":"8c0800a06ff613155a1e9abbc51bdd3e9985cf68e4b03602a11aca4e617add5e","source":{"kind":"arxiv","id":"1701.07807","version":2},"attestation_state":"computed","paper":{"title":"Private Information Retrieval from MDS Coded Data with Colluding Servers: Settling a Conjecture by Freij-Hollanti et al.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IR","math.IT"],"primary_cat":"cs.IT","authors_text":"Hua Sun, Syed A. Jafar","submitted_at":"2017-01-26T18:35:53Z","abstract_excerpt":"A $(K, N, T, K_c)$ instance of the MDS-TPIR problem is comprised of $K$ messages and $N$ distributed servers. Each message is separately encoded through a $(K_c, N)$ MDS storage code. A user wishes to retrieve one message, as efficiently as possible, while revealing no information about the desired message index to any colluding set of up to $T$ servers. The fundamental limit on the efficiency of retrieval, i.e., the capacity of MDS-TPIR is known only at the extremes where either $T$ or $K_c$ belongs to $\\{1,N\\}$. The focus of this work is a recent conjecture by Freij-Hollanti, Gnilke, Hollant"},"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":"1701.07807","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-26T18:35:53Z","cross_cats_sorted":["cs.CR","cs.IR","math.IT"],"title_canon_sha256":"174c400bba13d0a9fdfcc9a14bffa4402ec3e25b3708cae17942f58efd55d102","abstract_canon_sha256":"406f85debdc8bff344e8ccbe62e225c9ba1c7946872ca5f9d21442d3502bccaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:53.058428Z","signature_b64":"u9aLoN+cHAYfzmucxWjXDdbFzP6K7j1hiH/mOUdeIWIYx/tC+/9TVUwoBQGUqASVdnOMOLExxwx0EQ35ZUZQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c0800a06ff613155a1e9abbc51bdd3e9985cf68e4b03602a11aca4e617add5e","last_reissued_at":"2026-05-18T00:51:53.057881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:53.057881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Private Information Retrieval from MDS Coded Data with Colluding Servers: Settling a Conjecture by Freij-Hollanti et al.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IR","math.IT"],"primary_cat":"cs.IT","authors_text":"Hua Sun, Syed A. Jafar","submitted_at":"2017-01-26T18:35:53Z","abstract_excerpt":"A $(K, N, T, K_c)$ instance of the MDS-TPIR problem is comprised of $K$ messages and $N$ distributed servers. Each message is separately encoded through a $(K_c, N)$ MDS storage code. A user wishes to retrieve one message, as efficiently as possible, while revealing no information about the desired message index to any colluding set of up to $T$ servers. The fundamental limit on the efficiency of retrieval, i.e., the capacity of MDS-TPIR is known only at the extremes where either $T$ or $K_c$ belongs to $\\{1,N\\}$. The focus of this work is a recent conjecture by Freij-Hollanti, Gnilke, Hollant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07807","kind":"arxiv","version":2},"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":"1701.07807","created_at":"2026-05-18T00:51:53.057975+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07807v2","created_at":"2026-05-18T00:51:53.057975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07807","created_at":"2026-05-18T00:51:53.057975+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQEABIDP6YJR","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQEABIDP6YJRKWQ6","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQEABIDP","created_at":"2026-05-18T12:31:39.905425+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/RQEABIDP6YJRKWQ6TK54KG65H2","json":"https://pith.science/pith/RQEABIDP6YJRKWQ6TK54KG65H2.json","graph_json":"https://pith.science/api/pith-number/RQEABIDP6YJRKWQ6TK54KG65H2/graph.json","events_json":"https://pith.science/api/pith-number/RQEABIDP6YJRKWQ6TK54KG65H2/events.json","paper":"https://pith.science/paper/RQEABIDP"},"agent_actions":{"view_html":"https://pith.science/pith/RQEABIDP6YJRKWQ6TK54KG65H2","download_json":"https://pith.science/pith/RQEABIDP6YJRKWQ6TK54KG65H2.json","view_paper":"https://pith.science/paper/RQEABIDP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07807&json=true","fetch_graph":"https://pith.science/api/pith-number/RQEABIDP6YJRKWQ6TK54KG65H2/graph.json","fetch_events":"https://pith.science/api/pith-number/RQEABIDP6YJRKWQ6TK54KG65H2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQEABIDP6YJRKWQ6TK54KG65H2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQEABIDP6YJRKWQ6TK54KG65H2/action/storage_attestation","attest_author":"https://pith.science/pith/RQEABIDP6YJRKWQ6TK54KG65H2/action/author_attestation","sign_citation":"https://pith.science/pith/RQEABIDP6YJRKWQ6TK54KG65H2/action/citation_signature","submit_replication":"https://pith.science/pith/RQEABIDP6YJRKWQ6TK54KG65H2/action/replication_record"}},"created_at":"2026-05-18T00:51:53.057975+00:00","updated_at":"2026-05-18T00:51:53.057975+00:00"}