{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JVDPPZAAWROANGDFSLOZ4WQUNB","short_pith_number":"pith:JVDPPZAA","schema_version":"1.0","canonical_sha256":"4d46f7e400b45c06986592dd9e5a1468610f9011b6af96710ccb22164e47d75d","source":{"kind":"arxiv","id":"1702.05074","version":2},"attestation_state":"computed","paper":{"title":"Binary, Shortened Projective Reed Muller Codes for Coded Private Information Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Myna Vajha, P. Vijay Kumar, Vinayak Ramkumar","submitted_at":"2017-02-16T18:29:10Z","abstract_excerpt":"The notion of a Private Information Retrieval (PIR) code was recently introduced by Fazeli, Vardy and Yaakobi who showed that this class of codes permit PIR at reduced levels of storage overhead in comparison with replicated-server PIR. In the present paper, the construction of an $(n,k)$ $\\tau$-server binary, linear PIR code having parameters $n = \\sum\\limits_{i = 0}^{\\ell} {m \\choose i}$, $k = {m \\choose \\ell}$ and $\\tau = 2^{\\ell}$ is presented. These codes are obtained through homogeneous-polynomial evaluation and correspond to the binary, Projective Reed Muller (PRM) code. The constructio"},"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":"1702.05074","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-16T18:29:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"686c54a4e40932450927d73bbd0b2dfd721102874c177cdba0ab1e5478e90762","abstract_canon_sha256":"e87cec363f0849e1d7fbf30f63d576b331980e6ec6a31a260fb939d338ad557a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:32.347474Z","signature_b64":"auNSQzvkqZTVcFNMY8oB889yomDjBkmt1vTkP3hE4osqsnHZeoL2+TUpj+dxdc5CueNiPgjZfbPyXXhwVjypAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d46f7e400b45c06986592dd9e5a1468610f9011b6af96710ccb22164e47d75d","last_reissued_at":"2026-05-18T00:48:32.346860Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:32.346860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary, Shortened Projective Reed Muller Codes for Coded Private Information Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Myna Vajha, P. Vijay Kumar, Vinayak Ramkumar","submitted_at":"2017-02-16T18:29:10Z","abstract_excerpt":"The notion of a Private Information Retrieval (PIR) code was recently introduced by Fazeli, Vardy and Yaakobi who showed that this class of codes permit PIR at reduced levels of storage overhead in comparison with replicated-server PIR. In the present paper, the construction of an $(n,k)$ $\\tau$-server binary, linear PIR code having parameters $n = \\sum\\limits_{i = 0}^{\\ell} {m \\choose i}$, $k = {m \\choose \\ell}$ and $\\tau = 2^{\\ell}$ is presented. These codes are obtained through homogeneous-polynomial evaluation and correspond to the binary, Projective Reed Muller (PRM) code. The constructio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05074","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":"1702.05074","created_at":"2026-05-18T00:48:32.346956+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05074v2","created_at":"2026-05-18T00:48:32.346956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05074","created_at":"2026-05-18T00:48:32.346956+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVDPPZAAWROA","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVDPPZAAWROANGDF","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVDPPZAA","created_at":"2026-05-18T12:31:24.725408+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/JVDPPZAAWROANGDFSLOZ4WQUNB","json":"https://pith.science/pith/JVDPPZAAWROANGDFSLOZ4WQUNB.json","graph_json":"https://pith.science/api/pith-number/JVDPPZAAWROANGDFSLOZ4WQUNB/graph.json","events_json":"https://pith.science/api/pith-number/JVDPPZAAWROANGDFSLOZ4WQUNB/events.json","paper":"https://pith.science/paper/JVDPPZAA"},"agent_actions":{"view_html":"https://pith.science/pith/JVDPPZAAWROANGDFSLOZ4WQUNB","download_json":"https://pith.science/pith/JVDPPZAAWROANGDFSLOZ4WQUNB.json","view_paper":"https://pith.science/paper/JVDPPZAA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05074&json=true","fetch_graph":"https://pith.science/api/pith-number/JVDPPZAAWROANGDFSLOZ4WQUNB/graph.json","fetch_events":"https://pith.science/api/pith-number/JVDPPZAAWROANGDFSLOZ4WQUNB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVDPPZAAWROANGDFSLOZ4WQUNB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVDPPZAAWROANGDFSLOZ4WQUNB/action/storage_attestation","attest_author":"https://pith.science/pith/JVDPPZAAWROANGDFSLOZ4WQUNB/action/author_attestation","sign_citation":"https://pith.science/pith/JVDPPZAAWROANGDFSLOZ4WQUNB/action/citation_signature","submit_replication":"https://pith.science/pith/JVDPPZAAWROANGDFSLOZ4WQUNB/action/replication_record"}},"created_at":"2026-05-18T00:48:32.346956+00:00","updated_at":"2026-05-18T00:48:32.346956+00:00"}