{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WAXCRJOGDCGSKDKCDEY7HL5WNP","short_pith_number":"pith:WAXCRJOG","schema_version":"1.0","canonical_sha256":"b02e28a5c6188d250d421931f3afb66bf1a092292dbd0fd5b61c813f0d8af114","source":{"kind":"arxiv","id":"1708.05673","version":1},"attestation_state":"computed","paper":{"title":"Linear Symmetric Private Information Retrieval for MDS Coded Distributed Storage with Colluding Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mikael Skoglund, Qiwen Wang","submitted_at":"2017-08-17T17:09:08Z","abstract_excerpt":"The problem of symmetric private information retrieval (SPIR) from a coded database which is distributively stored among colluding servers is studied. Specifically, the database comprises $K$ files, which are stored among $N$ servers using an $(N,M)$-MDS storage code. A user wants to retrieve one file from the database by communicating with the $N$ servers, without revealing the identity of the desired file to any server. Furthermore, the user shall learn nothing about the other $K-1$ files in the database. In the $T$-colluding SPIR problem (hence called TSPIR), any $T$ out of $N$ servers may "},"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":"1708.05673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-17T17:09:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7e76c42b97b9bc947d08af03424b1381ba41a32ecca4ecdede690dfbe8d15699","abstract_canon_sha256":"ca92749dd998a98b0dd251a757ae449acd5c56d5c221a7a7db0dba1a915c978e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:49.349447Z","signature_b64":"ezqTkO26Xcq1pCPah0c6J5jEf6Raq7XIadWS1zyUtCCns2lwRZmII8KbCqqyTF2+P4ANkjgU1nsydxeDIJTIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b02e28a5c6188d250d421931f3afb66bf1a092292dbd0fd5b61c813f0d8af114","last_reissued_at":"2026-05-18T00:37:49.348806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:49.348806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Symmetric Private Information Retrieval for MDS Coded Distributed Storage with Colluding Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mikael Skoglund, Qiwen Wang","submitted_at":"2017-08-17T17:09:08Z","abstract_excerpt":"The problem of symmetric private information retrieval (SPIR) from a coded database which is distributively stored among colluding servers is studied. Specifically, the database comprises $K$ files, which are stored among $N$ servers using an $(N,M)$-MDS storage code. A user wants to retrieve one file from the database by communicating with the $N$ servers, without revealing the identity of the desired file to any server. Furthermore, the user shall learn nothing about the other $K-1$ files in the database. In the $T$-colluding SPIR problem (hence called TSPIR), any $T$ out of $N$ servers may "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05673","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":"1708.05673","created_at":"2026-05-18T00:37:49.348905+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.05673v1","created_at":"2026-05-18T00:37:49.348905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05673","created_at":"2026-05-18T00:37:49.348905+00:00"},{"alias_kind":"pith_short_12","alias_value":"WAXCRJOGDCGS","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WAXCRJOGDCGSKDKC","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WAXCRJOG","created_at":"2026-05-18T12:31:53.515858+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/WAXCRJOGDCGSKDKCDEY7HL5WNP","json":"https://pith.science/pith/WAXCRJOGDCGSKDKCDEY7HL5WNP.json","graph_json":"https://pith.science/api/pith-number/WAXCRJOGDCGSKDKCDEY7HL5WNP/graph.json","events_json":"https://pith.science/api/pith-number/WAXCRJOGDCGSKDKCDEY7HL5WNP/events.json","paper":"https://pith.science/paper/WAXCRJOG"},"agent_actions":{"view_html":"https://pith.science/pith/WAXCRJOGDCGSKDKCDEY7HL5WNP","download_json":"https://pith.science/pith/WAXCRJOGDCGSKDKCDEY7HL5WNP.json","view_paper":"https://pith.science/paper/WAXCRJOG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.05673&json=true","fetch_graph":"https://pith.science/api/pith-number/WAXCRJOGDCGSKDKCDEY7HL5WNP/graph.json","fetch_events":"https://pith.science/api/pith-number/WAXCRJOGDCGSKDKCDEY7HL5WNP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WAXCRJOGDCGSKDKCDEY7HL5WNP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WAXCRJOGDCGSKDKCDEY7HL5WNP/action/storage_attestation","attest_author":"https://pith.science/pith/WAXCRJOGDCGSKDKCDEY7HL5WNP/action/author_attestation","sign_citation":"https://pith.science/pith/WAXCRJOGDCGSKDKCDEY7HL5WNP/action/citation_signature","submit_replication":"https://pith.science/pith/WAXCRJOGDCGSKDKCDEY7HL5WNP/action/replication_record"}},"created_at":"2026-05-18T00:37:49.348905+00:00","updated_at":"2026-05-18T00:37:49.348905+00:00"}