{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:AX45MWEZNR3IRKIW63FKBXHV2D","short_pith_number":"pith:AX45MWEZ","canonical_record":{"source":{"id":"2305.05332","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-05-09T10:41:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"366a1dda37a9cf251e752fbb687666a26a1285d0d3834c1f4ec4f58d9dca3806","abstract_canon_sha256":"863406576c3f134ed5dca223b1ea2a43aad54d9df2ad137edd98b1bc5e2797d7"},"schema_version":"1.0"},"canonical_sha256":"05f9d658996c7688a916f6caa0dcf5d0e49770ef3cdbb5165a8e9a38f4b17ee4","source":{"kind":"arxiv","id":"2305.05332","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.05332","created_at":"2026-07-05T08:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"2305.05332v5","created_at":"2026-07-05T08:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.05332","created_at":"2026-07-05T08:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"AX45MWEZNR3I","created_at":"2026-07-05T08:58:19Z"},{"alias_kind":"pith_short_16","alias_value":"AX45MWEZNR3IRKIW","created_at":"2026-07-05T08:58:19Z"},{"alias_kind":"pith_short_8","alias_value":"AX45MWEZ","created_at":"2026-07-05T08:58:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:AX45MWEZNR3IRKIW63FKBXHV2D","target":"record","payload":{"canonical_record":{"source":{"id":"2305.05332","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-05-09T10:41:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"366a1dda37a9cf251e752fbb687666a26a1285d0d3834c1f4ec4f58d9dca3806","abstract_canon_sha256":"863406576c3f134ed5dca223b1ea2a43aad54d9df2ad137edd98b1bc5e2797d7"},"schema_version":"1.0"},"canonical_sha256":"05f9d658996c7688a916f6caa0dcf5d0e49770ef3cdbb5165a8e9a38f4b17ee4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:58:19.485874Z","signature_b64":"F6kcoOzYn9pM6spb4HEuRM1lncOIOerW2NBj3efOb1D63l2ZTYfX9FaZ1pMLPET4rB60UI16H3wuIR1MAaItAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05f9d658996c7688a916f6caa0dcf5d0e49770ef3cdbb5165a8e9a38f4b17ee4","last_reissued_at":"2026-07-05T08:58:19.485203Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:58:19.485203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.05332","source_version":5,"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-07-05T08:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0tVyb6YH3HL/rYVgbDLmk3TsklXwDnU050GbGtm8saFZKhZUaB558TOMRhUcRjOTttJo93sc5pKqYZTUyKTmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T18:32:55.532272Z"},"content_sha256":"2073f9c2f459e3a899001a18dbf65b20539004e62ae914ed243690fe81c64195","schema_version":"1.0","event_id":"sha256:2073f9c2f459e3a899001a18dbf65b20539004e62ae914ed243690fe81c64195"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:AX45MWEZNR3IRKIW63FKBXHV2D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fundamental Limits of Multi-Message Private Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Gholami, Giuseppe Caire, Hua Sun, Kai Wan, Mingyue Ji, Tayyebeh Jahani-Nezhad","submitted_at":"2023-05-09T10:41:36Z","abstract_excerpt":"In a typical formulation of the private information retrieval (PIR) problem, a single user wishes to retrieve one out of $ K$ files from $N$ servers without revealing the demanded file index to any server. This paper formulates an extended model of PIR, referred to as multi-message private computation (MM-PC), where instead of retrieving a single file, the user wishes to retrieve $P>1$ linear combinations of files while preserving the privacy of the demand information. The MM-PC problem is a generalization of the private computation (PC) problem (where the user requests one linear combination "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.05332","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.05332/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ca9KYXloeTIlay6kPaAC6u1SuZerhbL8pZoDZYAyXWQBjufwV+MkeZ+eMFd8OejRqzpjt1bVNtq1mSzAeYsZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T18:32:55.532659Z"},"content_sha256":"b287d82e4c734a60fd24204b763cbfe52b23a98addf5cd2591700c6c6f137afe","schema_version":"1.0","event_id":"sha256:b287d82e4c734a60fd24204b763cbfe52b23a98addf5cd2591700c6c6f137afe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AX45MWEZNR3IRKIW63FKBXHV2D/bundle.json","state_url":"https://pith.science/pith/AX45MWEZNR3IRKIW63FKBXHV2D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AX45MWEZNR3IRKIW63FKBXHV2D/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-07-12T18:32:55Z","links":{"resolver":"https://pith.science/pith/AX45MWEZNR3IRKIW63FKBXHV2D","bundle":"https://pith.science/pith/AX45MWEZNR3IRKIW63FKBXHV2D/bundle.json","state":"https://pith.science/pith/AX45MWEZNR3IRKIW63FKBXHV2D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AX45MWEZNR3IRKIW63FKBXHV2D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:AX45MWEZNR3IRKIW63FKBXHV2D","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":"863406576c3f134ed5dca223b1ea2a43aad54d9df2ad137edd98b1bc5e2797d7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-05-09T10:41:36Z","title_canon_sha256":"366a1dda37a9cf251e752fbb687666a26a1285d0d3834c1f4ec4f58d9dca3806"},"schema_version":"1.0","source":{"id":"2305.05332","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.05332","created_at":"2026-07-05T08:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"2305.05332v5","created_at":"2026-07-05T08:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.05332","created_at":"2026-07-05T08:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"AX45MWEZNR3I","created_at":"2026-07-05T08:58:19Z"},{"alias_kind":"pith_short_16","alias_value":"AX45MWEZNR3IRKIW","created_at":"2026-07-05T08:58:19Z"},{"alias_kind":"pith_short_8","alias_value":"AX45MWEZ","created_at":"2026-07-05T08:58:19Z"}],"graph_snapshots":[{"event_id":"sha256:b287d82e4c734a60fd24204b763cbfe52b23a98addf5cd2591700c6c6f137afe","target":"graph","created_at":"2026-07-05T08:58:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.05332/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In a typical formulation of the private information retrieval (PIR) problem, a single user wishes to retrieve one out of $ K$ files from $N$ servers without revealing the demanded file index to any server. This paper formulates an extended model of PIR, referred to as multi-message private computation (MM-PC), where instead of retrieving a single file, the user wishes to retrieve $P>1$ linear combinations of files while preserving the privacy of the demand information. The MM-PC problem is a generalization of the private computation (PC) problem (where the user requests one linear combination ","authors_text":"Ali Gholami, Giuseppe Caire, Hua Sun, Kai Wan, Mingyue Ji, Tayyebeh Jahani-Nezhad","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-05-09T10:41:36Z","title":"Fundamental Limits of Multi-Message Private Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.05332","kind":"arxiv","version":5},"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:2073f9c2f459e3a899001a18dbf65b20539004e62ae914ed243690fe81c64195","target":"record","created_at":"2026-07-05T08:58:19Z","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":"863406576c3f134ed5dca223b1ea2a43aad54d9df2ad137edd98b1bc5e2797d7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-05-09T10:41:36Z","title_canon_sha256":"366a1dda37a9cf251e752fbb687666a26a1285d0d3834c1f4ec4f58d9dca3806"},"schema_version":"1.0","source":{"id":"2305.05332","kind":"arxiv","version":5}},"canonical_sha256":"05f9d658996c7688a916f6caa0dcf5d0e49770ef3cdbb5165a8e9a38f4b17ee4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05f9d658996c7688a916f6caa0dcf5d0e49770ef3cdbb5165a8e9a38f4b17ee4","first_computed_at":"2026-07-05T08:58:19.485203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:58:19.485203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F6kcoOzYn9pM6spb4HEuRM1lncOIOerW2NBj3efOb1D63l2ZTYfX9FaZ1pMLPET4rB60UI16H3wuIR1MAaItAA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:58:19.485874Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.05332","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2073f9c2f459e3a899001a18dbf65b20539004e62ae914ed243690fe81c64195","sha256:b287d82e4c734a60fd24204b763cbfe52b23a98addf5cd2591700c6c6f137afe"],"state_sha256":"449d12911cfeff0975f13e79740479905be80457c1c953a66714c75ca78c60de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zBGaUnnWiZgVh0GGfnnVTahfl+N3rmBfbQup8bcK+vL8U3UQWT1B3pXHBIwjr7Yc2aEwC60THB7EYa03Rb+xDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T18:32:55.534707Z","bundle_sha256":"ac0a4010ff2db32653a6654030d25854b59f1728c3d5f27f4d2d14dfd2df2b03"}}