{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WAXCRJOGDCGSKDKCDEY7HL5WNP","short_pith_number":"pith:WAXCRJOG","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"},"canonical_sha256":"b02e28a5c6188d250d421931f3afb66bf1a092292dbd0fd5b61c813f0d8af114","source":{"kind":"arxiv","id":"1708.05673","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05673","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05673v1","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05673","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"pith_short_12","alias_value":"WAXCRJOGDCGS","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WAXCRJOGDCGSKDKC","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WAXCRJOG","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WAXCRJOGDCGSKDKCDEY7HL5WNP","target":"record","payload":{"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"},"canonical_sha256":"b02e28a5c6188d250d421931f3afb66bf1a092292dbd0fd5b61c813f0d8af114","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"},"source_kind":"arxiv","source_id":"1708.05673","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:37:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ED22g9PQasxVYCFz31svt5Br3XbW2xpZBtHD6HxAEAxyjZeH2BbDplUDuLGd4pkZA1ffDfOWTjlTflJ6lR18Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:10:34.807701Z"},"content_sha256":"db91f96420d94774f341e559ff741cc56a2de5af0362188e493b984eefa759ae","schema_version":"1.0","event_id":"sha256:db91f96420d94774f341e559ff741cc56a2de5af0362188e493b984eefa759ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WAXCRJOGDCGSKDKCDEY7HL5WNP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:37:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DiRq4huWAasaPgk7KGxbCA/ioIfCxooYlz0poLM8C1xTYevj/fut6nt7jR7JVDa9xP9qg+JMvsOM9JWpRPZeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:10:34.808105Z"},"content_sha256":"f401f334436f762e7f1f9423d049ef11cfa5d7a3c5115dacc01f1baea8857d3c","schema_version":"1.0","event_id":"sha256:f401f334436f762e7f1f9423d049ef11cfa5d7a3c5115dacc01f1baea8857d3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WAXCRJOGDCGSKDKCDEY7HL5WNP/bundle.json","state_url":"https://pith.science/pith/WAXCRJOGDCGSKDKCDEY7HL5WNP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WAXCRJOGDCGSKDKCDEY7HL5WNP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T16:10:34Z","links":{"resolver":"https://pith.science/pith/WAXCRJOGDCGSKDKCDEY7HL5WNP","bundle":"https://pith.science/pith/WAXCRJOGDCGSKDKCDEY7HL5WNP/bundle.json","state":"https://pith.science/pith/WAXCRJOGDCGSKDKCDEY7HL5WNP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WAXCRJOGDCGSKDKCDEY7HL5WNP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WAXCRJOGDCGSKDKCDEY7HL5WNP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ca92749dd998a98b0dd251a757ae449acd5c56d5c221a7a7db0dba1a915c978e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-17T17:09:08Z","title_canon_sha256":"7e76c42b97b9bc947d08af03424b1381ba41a32ecca4ecdede690dfbe8d15699"},"schema_version":"1.0","source":{"id":"1708.05673","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05673","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05673v1","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05673","created_at":"2026-05-18T00:37:49Z"},{"alias_kind":"pith_short_12","alias_value":"WAXCRJOGDCGS","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WAXCRJOGDCGSKDKC","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WAXCRJOG","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:f401f334436f762e7f1f9423d049ef11cfa5d7a3c5115dacc01f1baea8857d3c","target":"graph","created_at":"2026-05-18T00:37:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Mikael Skoglund, Qiwen Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-17T17:09:08Z","title":"Linear Symmetric Private Information Retrieval for MDS Coded Distributed Storage with Colluding Servers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05673","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:db91f96420d94774f341e559ff741cc56a2de5af0362188e493b984eefa759ae","target":"record","created_at":"2026-05-18T00:37:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ca92749dd998a98b0dd251a757ae449acd5c56d5c221a7a7db0dba1a915c978e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-17T17:09:08Z","title_canon_sha256":"7e76c42b97b9bc947d08af03424b1381ba41a32ecca4ecdede690dfbe8d15699"},"schema_version":"1.0","source":{"id":"1708.05673","kind":"arxiv","version":1}},"canonical_sha256":"b02e28a5c6188d250d421931f3afb66bf1a092292dbd0fd5b61c813f0d8af114","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b02e28a5c6188d250d421931f3afb66bf1a092292dbd0fd5b61c813f0d8af114","first_computed_at":"2026-05-18T00:37:49.348806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:49.348806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ezqTkO26Xcq1pCPah0c6J5jEf6Raq7XIadWS1zyUtCCns2lwRZmII8KbCqqyTF2+P4ANkjgU1nsydxeDIJTIBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:49.349447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05673","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db91f96420d94774f341e559ff741cc56a2de5af0362188e493b984eefa759ae","sha256:f401f334436f762e7f1f9423d049ef11cfa5d7a3c5115dacc01f1baea8857d3c"],"state_sha256":"efbf1667ea6db1d7934b8056ff55f343f58c142d4663e081c36880ca2d680b32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UPm3F7h61HaG6fo3otyrLB3DaCcZC4fZyfXtctswhUzSbnnunOkBrm+6MS+bnaiEGfPaSb0NBWbVcnxx+LS9DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:10:34.811417Z","bundle_sha256":"a0ddeabf9fc05aaf27804a9c8c758cb1b4c361d7adce74196bceb140da2b69e6"}}