{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:YA2NU7DP6RCGLZWR3CNHIQCOFR","short_pith_number":"pith:YA2NU7DP","schema_version":"1.0","canonical_sha256":"c034da7c6ff44465e6d1d89a74404e2c5a8e890be1d7ed0ce456ab8ff4b7ccf7","source":{"kind":"arxiv","id":"2001.03433","version":1},"attestation_state":"computed","paper":{"title":"PIR Codes with Short Block Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Eitan Yaakobi, Sascha Kurz","submitted_at":"2020-01-10T13:35:36Z","abstract_excerpt":"In this work private information retrieval (PIR) codes are studied. In a $k$-PIR code, $s$ information bits are encoded in such a way that every information bit has $k$ mutually disjoint recovery sets. The main problem under this paradigm is to minimize the number of encoded bits given the values of $s$ and $k$, where this value is denoted by $P(s,k)$. The main focus of this work is to analyze $P(s,k)$ for a large range of parameters of $s$ and $k$. In particular, we improve upon several of the existing results on this value."},"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":"2001.03433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-01-10T13:35:36Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"796a727dd6c72681537e1d72b91b05ef2e9babbb7bde80f924189418005b5022","abstract_canon_sha256":"1e14d0345550ca920f0de2f93a5853f51cd9f526926c1371f10929633b8af859"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:07:27.057482Z","signature_b64":"HbFpw3SH3XOfuPR1S7Z0y+E1zn8fOhqctFZO7Fzs6UNE8gayF3gI1o6o6dj+swBZXVZD9J1vxWoh1DN/ic8qAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c034da7c6ff44465e6d1d89a74404e2c5a8e890be1d7ed0ce456ab8ff4b7ccf7","last_reissued_at":"2026-07-05T02:07:27.057107Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:07:27.057107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PIR Codes with Short Block Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Eitan Yaakobi, Sascha Kurz","submitted_at":"2020-01-10T13:35:36Z","abstract_excerpt":"In this work private information retrieval (PIR) codes are studied. In a $k$-PIR code, $s$ information bits are encoded in such a way that every information bit has $k$ mutually disjoint recovery sets. The main problem under this paradigm is to minimize the number of encoded bits given the values of $s$ and $k$, where this value is denoted by $P(s,k)$. The main focus of this work is to analyze $P(s,k)$ for a large range of parameters of $s$ and $k$. In particular, we improve upon several of the existing results on this value."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.03433","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.03433/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":"2001.03433","created_at":"2026-07-05T02:07:27.057173+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.03433v1","created_at":"2026-07-05T02:07:27.057173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.03433","created_at":"2026-07-05T02:07:27.057173+00:00"},{"alias_kind":"pith_short_12","alias_value":"YA2NU7DP6RCG","created_at":"2026-07-05T02:07:27.057173+00:00"},{"alias_kind":"pith_short_16","alias_value":"YA2NU7DP6RCGLZWR","created_at":"2026-07-05T02:07:27.057173+00:00"},{"alias_kind":"pith_short_8","alias_value":"YA2NU7DP","created_at":"2026-07-05T02:07:27.057173+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/YA2NU7DP6RCGLZWR3CNHIQCOFR","json":"https://pith.science/pith/YA2NU7DP6RCGLZWR3CNHIQCOFR.json","graph_json":"https://pith.science/api/pith-number/YA2NU7DP6RCGLZWR3CNHIQCOFR/graph.json","events_json":"https://pith.science/api/pith-number/YA2NU7DP6RCGLZWR3CNHIQCOFR/events.json","paper":"https://pith.science/paper/YA2NU7DP"},"agent_actions":{"view_html":"https://pith.science/pith/YA2NU7DP6RCGLZWR3CNHIQCOFR","download_json":"https://pith.science/pith/YA2NU7DP6RCGLZWR3CNHIQCOFR.json","view_paper":"https://pith.science/paper/YA2NU7DP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.03433&json=true","fetch_graph":"https://pith.science/api/pith-number/YA2NU7DP6RCGLZWR3CNHIQCOFR/graph.json","fetch_events":"https://pith.science/api/pith-number/YA2NU7DP6RCGLZWR3CNHIQCOFR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YA2NU7DP6RCGLZWR3CNHIQCOFR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YA2NU7DP6RCGLZWR3CNHIQCOFR/action/storage_attestation","attest_author":"https://pith.science/pith/YA2NU7DP6RCGLZWR3CNHIQCOFR/action/author_attestation","sign_citation":"https://pith.science/pith/YA2NU7DP6RCGLZWR3CNHIQCOFR/action/citation_signature","submit_replication":"https://pith.science/pith/YA2NU7DP6RCGLZWR3CNHIQCOFR/action/replication_record"}},"created_at":"2026-07-05T02:07:27.057173+00:00","updated_at":"2026-07-05T02:07:27.057173+00:00"}