{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DXQZOYOUAAZ2QHALAH3RT34AXQ","short_pith_number":"pith:DXQZOYOU","canonical_record":{"source":{"id":"1907.00598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-01T08:16:59Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"59a3284f2e4f3924a59c17e377f930c00d3e28920daeca576fad7abf0d1fe913","abstract_canon_sha256":"6bef15fd7432011c1940b9f66a048238be2d4971936fcb537ca727529ae1c951"},"schema_version":"1.0"},"canonical_sha256":"1de19761d40033a81c0b01f719ef80bc27e6d3b0ee8d9e26395ea9a3f17f8607","source":{"kind":"arxiv","id":"1907.00598","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00598","created_at":"2026-05-17T23:41:51Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00598v1","created_at":"2026-05-17T23:41:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00598","created_at":"2026-05-17T23:41:51Z"},{"alias_kind":"pith_short_12","alias_value":"DXQZOYOUAAZ2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DXQZOYOUAAZ2QHAL","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DXQZOYOU","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DXQZOYOUAAZ2QHALAH3RT34AXQ","target":"record","payload":{"canonical_record":{"source":{"id":"1907.00598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-01T08:16:59Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"59a3284f2e4f3924a59c17e377f930c00d3e28920daeca576fad7abf0d1fe913","abstract_canon_sha256":"6bef15fd7432011c1940b9f66a048238be2d4971936fcb537ca727529ae1c951"},"schema_version":"1.0"},"canonical_sha256":"1de19761d40033a81c0b01f719ef80bc27e6d3b0ee8d9e26395ea9a3f17f8607","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:51.079086Z","signature_b64":"DYKKZJuxNX+itTrJcuWCPl4QZtcgOKOV9jlCmvqy373ZIuuc9MVJO7c2jPmY8dVP+GDW5+b3n9pkowEK2oBABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1de19761d40033a81c0b01f719ef80bc27e6d3b0ee8d9e26395ea9a3f17f8607","last_reissued_at":"2026-05-17T23:41:51.078358Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:51.078358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.00598","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-17T23:41:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cVu7Ace7Th8lwys87LGmL/+LHpfpuldjmBNFA+0Y9MjglOKvWv1bDSG1kWsQTiMyZdm784Hgne4NedbyN5kMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:22:19.769821Z"},"content_sha256":"7c82218bc8f9fe85a0dd3df996c2b98502cf41588cc76360b0486715d7077a14","schema_version":"1.0","event_id":"sha256:7c82218bc8f9fe85a0dd3df996c2b98502cf41588cc76360b0486715d7077a14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DXQZOYOUAAZ2QHALAH3RT34AXQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On an Equivalence Between Single-Server PIR with Side Information and Locally Recoverable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Sprintson, Anoosheh Heidarzadeh, O. Ozan Koyluoglu, Swanand Kadhe","submitted_at":"2019-07-01T08:16:59Z","abstract_excerpt":"Private Information Retrieval (PIR) problem has recently attracted a significant interest in the information-theory community. In this problem, a user wants to privately download one or more messages belonging to a database with copies stored on a single or multiple remote servers. In the single server scenario, the user must have prior side information, i.e., a subset of messages unknown to the server, to be able to privately retrieve the required messages in an efficient way.\n  In the last decade, there has also been a significant interest in Locally Recoverable Codes (LRC), a class of stora"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00598","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-17T23:41:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"juHNQgtgbe/8+RtiDF9apbjVvdXwmjFhUfrNV5kfNIQAWg6vIObm2m2dWc6kjgujQT1SKc21Jf9WfIlTtxXPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:22:19.770211Z"},"content_sha256":"dd954749c22e51815eb8d3815f370ddf303b4ebde1dfc77ae62a8c40bc44ea98","schema_version":"1.0","event_id":"sha256:dd954749c22e51815eb8d3815f370ddf303b4ebde1dfc77ae62a8c40bc44ea98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXQZOYOUAAZ2QHALAH3RT34AXQ/bundle.json","state_url":"https://pith.science/pith/DXQZOYOUAAZ2QHALAH3RT34AXQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXQZOYOUAAZ2QHALAH3RT34AXQ/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-06-02T19:22:19Z","links":{"resolver":"https://pith.science/pith/DXQZOYOUAAZ2QHALAH3RT34AXQ","bundle":"https://pith.science/pith/DXQZOYOUAAZ2QHALAH3RT34AXQ/bundle.json","state":"https://pith.science/pith/DXQZOYOUAAZ2QHALAH3RT34AXQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXQZOYOUAAZ2QHALAH3RT34AXQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DXQZOYOUAAZ2QHALAH3RT34AXQ","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":"6bef15fd7432011c1940b9f66a048238be2d4971936fcb537ca727529ae1c951","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-01T08:16:59Z","title_canon_sha256":"59a3284f2e4f3924a59c17e377f930c00d3e28920daeca576fad7abf0d1fe913"},"schema_version":"1.0","source":{"id":"1907.00598","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00598","created_at":"2026-05-17T23:41:51Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00598v1","created_at":"2026-05-17T23:41:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00598","created_at":"2026-05-17T23:41:51Z"},{"alias_kind":"pith_short_12","alias_value":"DXQZOYOUAAZ2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DXQZOYOUAAZ2QHAL","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DXQZOYOU","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:dd954749c22e51815eb8d3815f370ddf303b4ebde1dfc77ae62a8c40bc44ea98","target":"graph","created_at":"2026-05-17T23:41:51Z","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":"Private Information Retrieval (PIR) problem has recently attracted a significant interest in the information-theory community. In this problem, a user wants to privately download one or more messages belonging to a database with copies stored on a single or multiple remote servers. In the single server scenario, the user must have prior side information, i.e., a subset of messages unknown to the server, to be able to privately retrieve the required messages in an efficient way.\n  In the last decade, there has also been a significant interest in Locally Recoverable Codes (LRC), a class of stora","authors_text":"Alex Sprintson, Anoosheh Heidarzadeh, O. Ozan Koyluoglu, Swanand Kadhe","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-01T08:16:59Z","title":"On an Equivalence Between Single-Server PIR with Side Information and Locally Recoverable Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00598","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:7c82218bc8f9fe85a0dd3df996c2b98502cf41588cc76360b0486715d7077a14","target":"record","created_at":"2026-05-17T23:41:51Z","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":"6bef15fd7432011c1940b9f66a048238be2d4971936fcb537ca727529ae1c951","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-01T08:16:59Z","title_canon_sha256":"59a3284f2e4f3924a59c17e377f930c00d3e28920daeca576fad7abf0d1fe913"},"schema_version":"1.0","source":{"id":"1907.00598","kind":"arxiv","version":1}},"canonical_sha256":"1de19761d40033a81c0b01f719ef80bc27e6d3b0ee8d9e26395ea9a3f17f8607","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1de19761d40033a81c0b01f719ef80bc27e6d3b0ee8d9e26395ea9a3f17f8607","first_computed_at":"2026-05-17T23:41:51.078358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:51.078358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DYKKZJuxNX+itTrJcuWCPl4QZtcgOKOV9jlCmvqy373ZIuuc9MVJO7c2jPmY8dVP+GDW5+b3n9pkowEK2oBABA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:51.079086Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.00598","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c82218bc8f9fe85a0dd3df996c2b98502cf41588cc76360b0486715d7077a14","sha256:dd954749c22e51815eb8d3815f370ddf303b4ebde1dfc77ae62a8c40bc44ea98"],"state_sha256":"af0904229101275646b5ee91918b07230f306833c78cad18e1edd594c7331786"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xKFUrpUJjkC8zlEFipOvZOWw2izeQFmoH+OfBItYHqBL79xoIQO5sAX/SKKFzcNN8PYtiN4W0bm3gUnGfZnNBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:22:19.772255Z","bundle_sha256":"068170a80016c0a099fd60191945cd78465b0dd7ab270ecbf1da93f2ebf8cd47"}}