{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AZ2HU7GKQ6WD4UGJZGB26FCQDD","short_pith_number":"pith:AZ2HU7GK","schema_version":"1.0","canonical_sha256":"06747a7cca87ac3e50c9c983af145018d9df5bb58a341e8591a443b89428081d","source":{"kind":"arxiv","id":"1809.06648","version":1},"attestation_state":"computed","paper":{"title":"Local Reconstruction Codes: A Class of MDS-PIR Capacity-Achieving Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Eirik Rosnes, Hsuan-Yin Lin, Siddhartha Kumar","submitted_at":"2018-09-18T11:25:18Z","abstract_excerpt":"We prove that a class of distance-optimal local reconstruction codes (LRCs), an important family of repair-efficient codes for distributed storage systems, achieve the maximum distance separable private information retrieval capacity for the case of noncolluding nodes. This particular class of codes includes Pyramid codes and other LRCs proposed in the literature."},"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":"1809.06648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-18T11:25:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a0296e94c893757338ec702025f0b79c883e578f13dd43297a6105b9692bad9d","abstract_canon_sha256":"61b709bec9291e4448c976961b42cf5ba2d0a0d5fc5dadd8155d3356fa46bd8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:25.076188Z","signature_b64":"LFuPNPid29wYn4+8gFD1rC4gm+/otwQe1c7YM3qV2MyxRXMSi/y1wpdYJDiPdVk3OXnVMTU0wuUTajnhfTFhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06747a7cca87ac3e50c9c983af145018d9df5bb58a341e8591a443b89428081d","last_reissued_at":"2026-05-18T00:05:25.075474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:25.075474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Reconstruction Codes: A Class of MDS-PIR Capacity-Achieving Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Eirik Rosnes, Hsuan-Yin Lin, Siddhartha Kumar","submitted_at":"2018-09-18T11:25:18Z","abstract_excerpt":"We prove that a class of distance-optimal local reconstruction codes (LRCs), an important family of repair-efficient codes for distributed storage systems, achieve the maximum distance separable private information retrieval capacity for the case of noncolluding nodes. This particular class of codes includes Pyramid codes and other LRCs proposed in the literature."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06648","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":"1809.06648","created_at":"2026-05-18T00:05:25.075617+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.06648v1","created_at":"2026-05-18T00:05:25.075617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06648","created_at":"2026-05-18T00:05:25.075617+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZ2HU7GKQ6WD","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZ2HU7GKQ6WD4UGJ","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZ2HU7GK","created_at":"2026-05-18T12:32:13.499390+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/AZ2HU7GKQ6WD4UGJZGB26FCQDD","json":"https://pith.science/pith/AZ2HU7GKQ6WD4UGJZGB26FCQDD.json","graph_json":"https://pith.science/api/pith-number/AZ2HU7GKQ6WD4UGJZGB26FCQDD/graph.json","events_json":"https://pith.science/api/pith-number/AZ2HU7GKQ6WD4UGJZGB26FCQDD/events.json","paper":"https://pith.science/paper/AZ2HU7GK"},"agent_actions":{"view_html":"https://pith.science/pith/AZ2HU7GKQ6WD4UGJZGB26FCQDD","download_json":"https://pith.science/pith/AZ2HU7GKQ6WD4UGJZGB26FCQDD.json","view_paper":"https://pith.science/paper/AZ2HU7GK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.06648&json=true","fetch_graph":"https://pith.science/api/pith-number/AZ2HU7GKQ6WD4UGJZGB26FCQDD/graph.json","fetch_events":"https://pith.science/api/pith-number/AZ2HU7GKQ6WD4UGJZGB26FCQDD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZ2HU7GKQ6WD4UGJZGB26FCQDD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZ2HU7GKQ6WD4UGJZGB26FCQDD/action/storage_attestation","attest_author":"https://pith.science/pith/AZ2HU7GKQ6WD4UGJZGB26FCQDD/action/author_attestation","sign_citation":"https://pith.science/pith/AZ2HU7GKQ6WD4UGJZGB26FCQDD/action/citation_signature","submit_replication":"https://pith.science/pith/AZ2HU7GKQ6WD4UGJZGB26FCQDD/action/replication_record"}},"created_at":"2026-05-18T00:05:25.075617+00:00","updated_at":"2026-05-18T00:05:25.075617+00:00"}