{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XT3B6SP5KCOJBSYUUJRE4COKXE","short_pith_number":"pith:XT3B6SP5","schema_version":"1.0","canonical_sha256":"bcf61f49fd509c90cb14a2624e09cab913190075820c2f6fa7fcfb5304320d2e","source":{"kind":"arxiv","id":"1710.11098","version":3},"attestation_state":"computed","paper":{"title":"The Capacity of Private Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hua Sun, Syed A. Jafar","submitted_at":"2017-10-30T17:42:54Z","abstract_excerpt":"We introduce the problem of private computation, comprised of $N$ distributed and non-colluding servers, $K$ independent datasets, and a user who wants to compute a function of the datasets privately, i.e., without revealing which function he wants to compute, to any individual server. This private computation problem is a strict generalization of the private information retrieval (PIR) problem, obtained by expanding the PIR message set (which consists of only independent messages) to also include functions of those messages. The capacity of private computation, $C$, is defined as the maximum "},"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":"1710.11098","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-30T17:42:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a84e78d99be4d0d96bad035dd121bf77e4215b145fdd2ba9ea42c2fb6d7b6d45","abstract_canon_sha256":"c3b881e49c48cbfca8b5ea9121404546695225a088996bd14c7074acde92c568"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:40.676558Z","signature_b64":"f3FvC4ysefXY+ndvGBWWECouZ3cYZH3SjGL5KjsEUIE7zEtGGhVpoBfQ1CGbeJaFLmzGBwv/jFZcUTq+IlOrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcf61f49fd509c90cb14a2624e09cab913190075820c2f6fa7fcfb5304320d2e","last_reissued_at":"2026-05-18T00:29:40.675986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:40.675986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Capacity of Private Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hua Sun, Syed A. Jafar","submitted_at":"2017-10-30T17:42:54Z","abstract_excerpt":"We introduce the problem of private computation, comprised of $N$ distributed and non-colluding servers, $K$ independent datasets, and a user who wants to compute a function of the datasets privately, i.e., without revealing which function he wants to compute, to any individual server. This private computation problem is a strict generalization of the private information retrieval (PIR) problem, obtained by expanding the PIR message set (which consists of only independent messages) to also include functions of those messages. The capacity of private computation, $C$, is defined as the maximum "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11098","kind":"arxiv","version":3},"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":"1710.11098","created_at":"2026-05-18T00:29:40.676069+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.11098v3","created_at":"2026-05-18T00:29:40.676069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11098","created_at":"2026-05-18T00:29:40.676069+00:00"},{"alias_kind":"pith_short_12","alias_value":"XT3B6SP5KCOJ","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XT3B6SP5KCOJBSYU","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XT3B6SP5","created_at":"2026-05-18T12:31:56.362134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.10684","citing_title":"On the Upload versus Download Cost for Secure and Private Matrix Multiplication","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XT3B6SP5KCOJBSYUUJRE4COKXE","json":"https://pith.science/pith/XT3B6SP5KCOJBSYUUJRE4COKXE.json","graph_json":"https://pith.science/api/pith-number/XT3B6SP5KCOJBSYUUJRE4COKXE/graph.json","events_json":"https://pith.science/api/pith-number/XT3B6SP5KCOJBSYUUJRE4COKXE/events.json","paper":"https://pith.science/paper/XT3B6SP5"},"agent_actions":{"view_html":"https://pith.science/pith/XT3B6SP5KCOJBSYUUJRE4COKXE","download_json":"https://pith.science/pith/XT3B6SP5KCOJBSYUUJRE4COKXE.json","view_paper":"https://pith.science/paper/XT3B6SP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.11098&json=true","fetch_graph":"https://pith.science/api/pith-number/XT3B6SP5KCOJBSYUUJRE4COKXE/graph.json","fetch_events":"https://pith.science/api/pith-number/XT3B6SP5KCOJBSYUUJRE4COKXE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XT3B6SP5KCOJBSYUUJRE4COKXE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XT3B6SP5KCOJBSYUUJRE4COKXE/action/storage_attestation","attest_author":"https://pith.science/pith/XT3B6SP5KCOJBSYUUJRE4COKXE/action/author_attestation","sign_citation":"https://pith.science/pith/XT3B6SP5KCOJBSYUUJRE4COKXE/action/citation_signature","submit_replication":"https://pith.science/pith/XT3B6SP5KCOJBSYUUJRE4COKXE/action/replication_record"}},"created_at":"2026-05-18T00:29:40.676069+00:00","updated_at":"2026-05-18T00:29:40.676069+00:00"}