{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3JJOHJ2PXHHDRHV46A7R3GWWMC","short_pith_number":"pith:3JJOHJ2P","schema_version":"1.0","canonical_sha256":"da52e3a74fb9ce389ebcf03f1d9ad660ad7a5a971f4b57b0c58f2802f9872ce6","source":{"kind":"arxiv","id":"1606.06872","version":3},"attestation_state":"computed","paper":{"title":"Multi-Party Protocols, Information Complexity and Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Adi Ros\\'en, Florent Urrutia, Iordanis Kerenidis","submitted_at":"2016-06-22T10:00:41Z","abstract_excerpt":"We introduce a new information theoretic measure that we call Public Information Complexity (PIC), as a tool for the study of multi-party computation protocols, and of quantities such as their communication complexity, or the amount of randomness they require in the context of information-theoretic private computations. We are able to use this measure directly in the natural asynchronous message-passing peer-to-peer model and show a number of interesting properties and applications of our new notion: the Public Information Complexity is a lower bound on the Communication Complexity and an uppe"},"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":"1606.06872","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-22T10:00:41Z","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"title_canon_sha256":"a5d12bb5c6336adc5bc8a42ac50b56627dbd5cde72277afb7528d57b638a046d","abstract_canon_sha256":"c30b08e0f3df490396e83139725a48bf218854330b8be430011776b897414619"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:15.221562Z","signature_b64":"xkUKqPUMb4J36FkgQpjP/6bIrjfhzpS7Qs9mAXeaxNE16a6BdMui5/w7Uua2Ofpz5gwT/k0la77eX1tStjhxDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da52e3a74fb9ce389ebcf03f1d9ad660ad7a5a971f4b57b0c58f2802f9872ce6","last_reissued_at":"2026-05-17T23:58:15.221076Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:15.221076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Party Protocols, Information Complexity and Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Adi Ros\\'en, Florent Urrutia, Iordanis Kerenidis","submitted_at":"2016-06-22T10:00:41Z","abstract_excerpt":"We introduce a new information theoretic measure that we call Public Information Complexity (PIC), as a tool for the study of multi-party computation protocols, and of quantities such as their communication complexity, or the amount of randomness they require in the context of information-theoretic private computations. We are able to use this measure directly in the natural asynchronous message-passing peer-to-peer model and show a number of interesting properties and applications of our new notion: the Public Information Complexity is a lower bound on the Communication Complexity and an uppe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06872","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":"1606.06872","created_at":"2026-05-17T23:58:15.221149+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.06872v3","created_at":"2026-05-17T23:58:15.221149+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06872","created_at":"2026-05-17T23:58:15.221149+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JJOHJ2PXHHD","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JJOHJ2PXHHDRHV4","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JJOHJ2P","created_at":"2026-05-18T12:29:55.572404+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3JJOHJ2PXHHDRHV46A7R3GWWMC","json":"https://pith.science/pith/3JJOHJ2PXHHDRHV46A7R3GWWMC.json","graph_json":"https://pith.science/api/pith-number/3JJOHJ2PXHHDRHV46A7R3GWWMC/graph.json","events_json":"https://pith.science/api/pith-number/3JJOHJ2PXHHDRHV46A7R3GWWMC/events.json","paper":"https://pith.science/paper/3JJOHJ2P"},"agent_actions":{"view_html":"https://pith.science/pith/3JJOHJ2PXHHDRHV46A7R3GWWMC","download_json":"https://pith.science/pith/3JJOHJ2PXHHDRHV46A7R3GWWMC.json","view_paper":"https://pith.science/paper/3JJOHJ2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.06872&json=true","fetch_graph":"https://pith.science/api/pith-number/3JJOHJ2PXHHDRHV46A7R3GWWMC/graph.json","fetch_events":"https://pith.science/api/pith-number/3JJOHJ2PXHHDRHV46A7R3GWWMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JJOHJ2PXHHDRHV46A7R3GWWMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JJOHJ2PXHHDRHV46A7R3GWWMC/action/storage_attestation","attest_author":"https://pith.science/pith/3JJOHJ2PXHHDRHV46A7R3GWWMC/action/author_attestation","sign_citation":"https://pith.science/pith/3JJOHJ2PXHHDRHV46A7R3GWWMC/action/citation_signature","submit_replication":"https://pith.science/pith/3JJOHJ2PXHHDRHV46A7R3GWWMC/action/replication_record"}},"created_at":"2026-05-17T23:58:15.221149+00:00","updated_at":"2026-05-17T23:58:15.221149+00:00"}