{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CPUZB2NHKPLHGBRQDPMKWYGR4S","short_pith_number":"pith:CPUZB2NH","schema_version":"1.0","canonical_sha256":"13e990e9a753d67306301bd8ab60d1e4a6f81bed503842fce134feccff25e312","source":{"kind":"arxiv","id":"2305.11428","version":2},"attestation_state":"computed","paper":{"title":"Must the Communication Graph of MPC Protocols be an Expander?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Deepesh Data, Elette Boyle, Pavel Hub\\'a\\v{c}ek, Ran Cohen","submitted_at":"2023-05-19T04:56:41Z","abstract_excerpt":"Secure multiparty computation (MPC) on incomplete communication networks has been studied within two primary models: (1) Where a partial network is fixed a priori, and thus corruptions can occur dependent on its structure, and (2) Where edges in the communication graph are determined dynamically as part of the protocol. Whereas a rich literature has succeeded in mapping out the feasibility and limitations of graph structures supporting secure computation in the fixed-graph model (including strong classical lower bounds), these bounds do not apply in the latter dynamic-graph setting, which has "},"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":"2305.11428","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-05-19T04:56:41Z","cross_cats_sorted":[],"title_canon_sha256":"2e6f098a9f2534c8ca172a6668dda02e5264228d70fe8be479179ac57d92ea8c","abstract_canon_sha256":"ddf747214e1cebf1edd71f8205e67ee80ff085323524a25f0439ab874d423bdd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:04.093992Z","signature_b64":"uKSkm/JPp/TtGYB+n3qeeRoVaFPQmbdpm7KsXOoIOUx9dQpyc3DvoLA5voGAaEoyjc9PyUVZGf7dNrEbrwmWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13e990e9a753d67306301bd8ab60d1e4a6f81bed503842fce134feccff25e312","last_reissued_at":"2026-07-05T06:23:04.093586Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:04.093586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Must the Communication Graph of MPC Protocols be an Expander?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Deepesh Data, Elette Boyle, Pavel Hub\\'a\\v{c}ek, Ran Cohen","submitted_at":"2023-05-19T04:56:41Z","abstract_excerpt":"Secure multiparty computation (MPC) on incomplete communication networks has been studied within two primary models: (1) Where a partial network is fixed a priori, and thus corruptions can occur dependent on its structure, and (2) Where edges in the communication graph are determined dynamically as part of the protocol. Whereas a rich literature has succeeded in mapping out the feasibility and limitations of graph structures supporting secure computation in the fixed-graph model (including strong classical lower bounds), these bounds do not apply in the latter dynamic-graph setting, which has "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.11428","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.11428/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2305.11428","created_at":"2026-07-05T06:23:04.093644+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.11428v2","created_at":"2026-07-05T06:23:04.093644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.11428","created_at":"2026-07-05T06:23:04.093644+00:00"},{"alias_kind":"pith_short_12","alias_value":"CPUZB2NHKPLH","created_at":"2026-07-05T06:23:04.093644+00:00"},{"alias_kind":"pith_short_16","alias_value":"CPUZB2NHKPLHGBRQ","created_at":"2026-07-05T06:23:04.093644+00:00"},{"alias_kind":"pith_short_8","alias_value":"CPUZB2NH","created_at":"2026-07-05T06:23:04.093644+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/CPUZB2NHKPLHGBRQDPMKWYGR4S","json":"https://pith.science/pith/CPUZB2NHKPLHGBRQDPMKWYGR4S.json","graph_json":"https://pith.science/api/pith-number/CPUZB2NHKPLHGBRQDPMKWYGR4S/graph.json","events_json":"https://pith.science/api/pith-number/CPUZB2NHKPLHGBRQDPMKWYGR4S/events.json","paper":"https://pith.science/paper/CPUZB2NH"},"agent_actions":{"view_html":"https://pith.science/pith/CPUZB2NHKPLHGBRQDPMKWYGR4S","download_json":"https://pith.science/pith/CPUZB2NHKPLHGBRQDPMKWYGR4S.json","view_paper":"https://pith.science/paper/CPUZB2NH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.11428&json=true","fetch_graph":"https://pith.science/api/pith-number/CPUZB2NHKPLHGBRQDPMKWYGR4S/graph.json","fetch_events":"https://pith.science/api/pith-number/CPUZB2NHKPLHGBRQDPMKWYGR4S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CPUZB2NHKPLHGBRQDPMKWYGR4S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CPUZB2NHKPLHGBRQDPMKWYGR4S/action/storage_attestation","attest_author":"https://pith.science/pith/CPUZB2NHKPLHGBRQDPMKWYGR4S/action/author_attestation","sign_citation":"https://pith.science/pith/CPUZB2NHKPLHGBRQDPMKWYGR4S/action/citation_signature","submit_replication":"https://pith.science/pith/CPUZB2NHKPLHGBRQDPMKWYGR4S/action/replication_record"}},"created_at":"2026-07-05T06:23:04.093644+00:00","updated_at":"2026-07-05T06:23:04.093644+00:00"}