{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IZIPSU2X3L6EPTO6ZL5VEMCM54","short_pith_number":"pith:IZIPSU2X","canonical_record":{"source":{"id":"1512.07735","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-12-24T07:22:02Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"28a92c73586db28b053ba875949526774b63703c42234f0ce1fa683994904eb4","abstract_canon_sha256":"0b458751884b1037aabc37ca4375ed9a37c816b7d5438fc7bd2e25f58a81cde9"},"schema_version":"1.0"},"canonical_sha256":"4650f95357dafc47cddecafb52304cef1912ac9bef40300e50f26818a5ce3afa","source":{"kind":"arxiv","id":"1512.07735","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07735","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07735v2","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07735","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"pith_short_12","alias_value":"IZIPSU2X3L6E","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"IZIPSU2X3L6EPTO6","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"IZIPSU2X","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IZIPSU2X3L6EPTO6ZL5VEMCM54","target":"record","payload":{"canonical_record":{"source":{"id":"1512.07735","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-12-24T07:22:02Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"28a92c73586db28b053ba875949526774b63703c42234f0ce1fa683994904eb4","abstract_canon_sha256":"0b458751884b1037aabc37ca4375ed9a37c816b7d5438fc7bd2e25f58a81cde9"},"schema_version":"1.0"},"canonical_sha256":"4650f95357dafc47cddecafb52304cef1912ac9bef40300e50f26818a5ce3afa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:34.356512Z","signature_b64":"9JKt/u3f9i+8DDqlBzNNwfIVuurutdWpAMsQSt4jmyKN+5OYSqKuJG8l5aPAVI8dN6jHtFCDacV79lTCB7BXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4650f95357dafc47cddecafb52304cef1912ac9bef40300e50f26818a5ce3afa","last_reissued_at":"2026-05-18T00:58:34.355786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:34.355786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.07735","source_version":2,"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-18T00:58:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OUAdysy6r2BcXJv7ZFsEZp2igVgVcNglMFZyoLDiGkgfox78YXVr43BE/ScdurHOn1sCkvJpEXnCM2616gtnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T04:22:05.302459Z"},"content_sha256":"54108db3486ca6aeb7fed44eff20ded413a054eddb439c79b85f0a206e6e2e9c","schema_version":"1.0","event_id":"sha256:54108db3486ca6aeb7fed44eff20ded413a054eddb439c79b85f0a206e6e2e9c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IZIPSU2X3L6EPTO6ZL5VEMCM54","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication and Randomness Lower Bounds for Secure Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Deepesh Data, Manoj M. Prabhakaran, Vinod M. Prabhakaran","submitted_at":"2015-12-24T07:22:02Z","abstract_excerpt":"In secure multiparty computation (MPC), mutually distrusting users collaborate to compute a function of their private data without revealing any additional information about their data to other users. While it is known that information theoretically secure MPC is possible among $n$ users (connected by secure and noiseless links and have access to private randomness) against the collusion of less than $n/2$ users in the honest-but-curious model, relatively less is known about the communication and randomness complexity of secure computation.\n  In this work, we employ information theoretic techn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07735","kind":"arxiv","version":2},"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-18T00:58:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"khLSHgqc4u/ymA+tA/2qFCQp2G8dSUhceNJ+HjFrZifOPq3mKlwI8dpsLVfslq4slJLqLrqFPHONbSNgsOXaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T04:22:05.303197Z"},"content_sha256":"79c0b0283e7c5ea84ee27f0b0c0172d553a8796e056aa028a81bea02fd350372","schema_version":"1.0","event_id":"sha256:79c0b0283e7c5ea84ee27f0b0c0172d553a8796e056aa028a81bea02fd350372"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZIPSU2X3L6EPTO6ZL5VEMCM54/bundle.json","state_url":"https://pith.science/pith/IZIPSU2X3L6EPTO6ZL5VEMCM54/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZIPSU2X3L6EPTO6ZL5VEMCM54/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-10T04:22:05Z","links":{"resolver":"https://pith.science/pith/IZIPSU2X3L6EPTO6ZL5VEMCM54","bundle":"https://pith.science/pith/IZIPSU2X3L6EPTO6ZL5VEMCM54/bundle.json","state":"https://pith.science/pith/IZIPSU2X3L6EPTO6ZL5VEMCM54/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZIPSU2X3L6EPTO6ZL5VEMCM54/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IZIPSU2X3L6EPTO6ZL5VEMCM54","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":"0b458751884b1037aabc37ca4375ed9a37c816b7d5438fc7bd2e25f58a81cde9","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-12-24T07:22:02Z","title_canon_sha256":"28a92c73586db28b053ba875949526774b63703c42234f0ce1fa683994904eb4"},"schema_version":"1.0","source":{"id":"1512.07735","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07735","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07735v2","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07735","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"pith_short_12","alias_value":"IZIPSU2X3L6E","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"IZIPSU2X3L6EPTO6","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"IZIPSU2X","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:79c0b0283e7c5ea84ee27f0b0c0172d553a8796e056aa028a81bea02fd350372","target":"graph","created_at":"2026-05-18T00:58:34Z","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":"In secure multiparty computation (MPC), mutually distrusting users collaborate to compute a function of their private data without revealing any additional information about their data to other users. While it is known that information theoretically secure MPC is possible among $n$ users (connected by secure and noiseless links and have access to private randomness) against the collusion of less than $n/2$ users in the honest-but-curious model, relatively less is known about the communication and randomness complexity of secure computation.\n  In this work, we employ information theoretic techn","authors_text":"Deepesh Data, Manoj M. Prabhakaran, Vinod M. Prabhakaran","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-12-24T07:22:02Z","title":"Communication and Randomness Lower Bounds for Secure Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07735","kind":"arxiv","version":2},"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:54108db3486ca6aeb7fed44eff20ded413a054eddb439c79b85f0a206e6e2e9c","target":"record","created_at":"2026-05-18T00:58:34Z","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":"0b458751884b1037aabc37ca4375ed9a37c816b7d5438fc7bd2e25f58a81cde9","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-12-24T07:22:02Z","title_canon_sha256":"28a92c73586db28b053ba875949526774b63703c42234f0ce1fa683994904eb4"},"schema_version":"1.0","source":{"id":"1512.07735","kind":"arxiv","version":2}},"canonical_sha256":"4650f95357dafc47cddecafb52304cef1912ac9bef40300e50f26818a5ce3afa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4650f95357dafc47cddecafb52304cef1912ac9bef40300e50f26818a5ce3afa","first_computed_at":"2026-05-18T00:58:34.355786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:34.355786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9JKt/u3f9i+8DDqlBzNNwfIVuurutdWpAMsQSt4jmyKN+5OYSqKuJG8l5aPAVI8dN6jHtFCDacV79lTCB7BXBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:34.356512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.07735","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54108db3486ca6aeb7fed44eff20ded413a054eddb439c79b85f0a206e6e2e9c","sha256:79c0b0283e7c5ea84ee27f0b0c0172d553a8796e056aa028a81bea02fd350372"],"state_sha256":"c3f2cbc0312843eed165be66b31824bcb4c5de63d502f132a0716677a03bbd9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dG7PPO3iVhFPiiroK3RPl8MxVYuLX189cUpiiZMzn2tpoKy2U23/X6PTuenLDbsuf3kls7F3pAp+rNUxa6MMBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T04:22:05.307140Z","bundle_sha256":"3ae7f0bb1dfca75b6600c1d425ae86b64c593c838bbeb48a49a11148aa6566e5"}}