{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:C4USNLZ344QC6FDEWDDDKIYTSO","short_pith_number":"pith:C4USNLZ3","canonical_record":{"source":{"id":"1811.11160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-27T18:51:12Z","cross_cats_sorted":["cs.CR","cs.DB","math.IT"],"title_canon_sha256":"5e228bde75823549b92ade68dbc64551cebd39a8a294786606c86de830aadc06","abstract_canon_sha256":"ee83139d69263199012ab03982e6148c222753e39ac2435aebfb0c01f95d4f99"},"schema_version":"1.0"},"canonical_sha256":"172926af3be7202f1464b0c6352313938d332a36f4114cce6800b5593b0f7ff1","source":{"kind":"arxiv","id":"1811.11160","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11160","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11160v1","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11160","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"pith_short_12","alias_value":"C4USNLZ344QC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C4USNLZ344QC6FDE","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C4USNLZ3","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:C4USNLZ344QC6FDEWDDDKIYTSO","target":"record","payload":{"canonical_record":{"source":{"id":"1811.11160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-27T18:51:12Z","cross_cats_sorted":["cs.CR","cs.DB","math.IT"],"title_canon_sha256":"5e228bde75823549b92ade68dbc64551cebd39a8a294786606c86de830aadc06","abstract_canon_sha256":"ee83139d69263199012ab03982e6148c222753e39ac2435aebfb0c01f95d4f99"},"schema_version":"1.0"},"canonical_sha256":"172926af3be7202f1464b0c6352313938d332a36f4114cce6800b5593b0f7ff1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:45.125171Z","signature_b64":"1GuYXxdc09gGJ70H9vQNh7SEC5UaYAwcgJAx5EmP2EUD6J0P+Y8TZive06f7Y/Gq5pogwWyr+pBI68ynvUxmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"172926af3be7202f1464b0c6352313938d332a36f4114cce6800b5593b0f7ff1","last_reissued_at":"2026-05-17T23:59:45.124692Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:45.124692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.11160","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:59:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jw+/QPU4LXN5+4UEWYXtymzRSD2P6r9ICYOIezMH6d3jlwkrFWZGCr4K0BGn9Z+Oj4UZlnqug5LziEOgU8LGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T17:15:38.345846Z"},"content_sha256":"0c23474d5397f08504c88e1937cd09c325e16ff26dc8022616dac8c74734c841","schema_version":"1.0","event_id":"sha256:0c23474d5397f08504c88e1937cd09c325e16ff26dc8022616dac8c74734c841"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:C4USNLZ344QC6FDEWDDDKIYTSO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Capacity of Private Information Retrieval from Decentralized Uncoded Caching Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DB","math.IT"],"primary_cat":"cs.IT","authors_text":"Batuhan Arasli, Karim Banawan, Sennur Ulukus, Yi-Peng Wei","submitted_at":"2018-11-27T18:51:12Z","abstract_excerpt":"We consider the private information retrieval (PIR) problem from decentralized uncoded caching databases. There are two phases in our problem setting, a caching phase, and a retrieval phase. In the caching phase, a data center containing all the $K$ files, where each file is of size $L$ bits, and several databases with storage size constraint $\\mu K L$ bits exist in the system. Each database independently chooses $\\mu K L$ bits out of the total $KL$ bits from the data center to cache through the same probability distribution in a decentralized manner. In the retrieval phase, a user (retriever)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11160","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:59:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N2nQjYm4J8f85PbkcuuMJwMbH1xZPbyxckLxBR/tk/JeeHre5zY2GXO7NXPuWCskks6TDzbMnb73kyoSBIK1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T17:15:38.346534Z"},"content_sha256":"03d368a84960cbbbb83d6a72203057124dd32afbaf033ae8ab5b28b5c5cf3171","schema_version":"1.0","event_id":"sha256:03d368a84960cbbbb83d6a72203057124dd32afbaf033ae8ab5b28b5c5cf3171"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C4USNLZ344QC6FDEWDDDKIYTSO/bundle.json","state_url":"https://pith.science/pith/C4USNLZ344QC6FDEWDDDKIYTSO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C4USNLZ344QC6FDEWDDDKIYTSO/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-06T17:15:38Z","links":{"resolver":"https://pith.science/pith/C4USNLZ344QC6FDEWDDDKIYTSO","bundle":"https://pith.science/pith/C4USNLZ344QC6FDEWDDDKIYTSO/bundle.json","state":"https://pith.science/pith/C4USNLZ344QC6FDEWDDDKIYTSO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C4USNLZ344QC6FDEWDDDKIYTSO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:C4USNLZ344QC6FDEWDDDKIYTSO","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":"ee83139d69263199012ab03982e6148c222753e39ac2435aebfb0c01f95d4f99","cross_cats_sorted":["cs.CR","cs.DB","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-27T18:51:12Z","title_canon_sha256":"5e228bde75823549b92ade68dbc64551cebd39a8a294786606c86de830aadc06"},"schema_version":"1.0","source":{"id":"1811.11160","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11160","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11160v1","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11160","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"pith_short_12","alias_value":"C4USNLZ344QC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C4USNLZ344QC6FDE","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C4USNLZ3","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:03d368a84960cbbbb83d6a72203057124dd32afbaf033ae8ab5b28b5c5cf3171","target":"graph","created_at":"2026-05-17T23:59:45Z","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":"We consider the private information retrieval (PIR) problem from decentralized uncoded caching databases. There are two phases in our problem setting, a caching phase, and a retrieval phase. In the caching phase, a data center containing all the $K$ files, where each file is of size $L$ bits, and several databases with storage size constraint $\\mu K L$ bits exist in the system. Each database independently chooses $\\mu K L$ bits out of the total $KL$ bits from the data center to cache through the same probability distribution in a decentralized manner. In the retrieval phase, a user (retriever)","authors_text":"Batuhan Arasli, Karim Banawan, Sennur Ulukus, Yi-Peng Wei","cross_cats":["cs.CR","cs.DB","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-27T18:51:12Z","title":"The Capacity of Private Information Retrieval from Decentralized Uncoded Caching Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11160","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:0c23474d5397f08504c88e1937cd09c325e16ff26dc8022616dac8c74734c841","target":"record","created_at":"2026-05-17T23:59:45Z","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":"ee83139d69263199012ab03982e6148c222753e39ac2435aebfb0c01f95d4f99","cross_cats_sorted":["cs.CR","cs.DB","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-27T18:51:12Z","title_canon_sha256":"5e228bde75823549b92ade68dbc64551cebd39a8a294786606c86de830aadc06"},"schema_version":"1.0","source":{"id":"1811.11160","kind":"arxiv","version":1}},"canonical_sha256":"172926af3be7202f1464b0c6352313938d332a36f4114cce6800b5593b0f7ff1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"172926af3be7202f1464b0c6352313938d332a36f4114cce6800b5593b0f7ff1","first_computed_at":"2026-05-17T23:59:45.124692Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:45.124692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1GuYXxdc09gGJ70H9vQNh7SEC5UaYAwcgJAx5EmP2EUD6J0P+Y8TZive06f7Y/Gq5pogwWyr+pBI68ynvUxmBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:45.125171Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11160","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c23474d5397f08504c88e1937cd09c325e16ff26dc8022616dac8c74734c841","sha256:03d368a84960cbbbb83d6a72203057124dd32afbaf033ae8ab5b28b5c5cf3171"],"state_sha256":"d18290acc219130821c47f9f0373eb5b43713db1541891c35e071c2dd50091e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dH76Je5T1UWAWuARDC3GnXPVq/j6iJGJYHl/5agptbf1b6vEFfCbM1n5Jr7KZYhcPX68Vay/DSRUrkPMC9VfBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T17:15:38.350093Z","bundle_sha256":"5d685dbcdb1ddb4ad059783bd75f04bb6eb8e3350649e7a6cdcdd949811bca8d"}}