{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OIQCFM7KSV6MKPIUR27QYXKXTL","short_pith_number":"pith:OIQCFM7K","canonical_record":{"source":{"id":"1310.3486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-13T14:29:24Z","cross_cats_sorted":["cs.CR","cs.DC"],"title_canon_sha256":"f84e019a391e2ff04f3d77034635cb59eb05023c11079e9fb778d8b789f67ad6","abstract_canon_sha256":"2fece579daa8b2c336c39d8489666ecd0026bcb4919837b32c0950f41e7cc152"},"schema_version":"1.0"},"canonical_sha256":"722022b3ea957cc53d148ebf0c5d579afd08c24a01f02eabea67b09327594253","source":{"kind":"arxiv","id":"1310.3486","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3486","created_at":"2026-05-18T03:10:35Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3486v1","created_at":"2026-05-18T03:10:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3486","created_at":"2026-05-18T03:10:35Z"},{"alias_kind":"pith_short_12","alias_value":"OIQCFM7KSV6M","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OIQCFM7KSV6MKPIU","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OIQCFM7K","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OIQCFM7KSV6MKPIUR27QYXKXTL","target":"record","payload":{"canonical_record":{"source":{"id":"1310.3486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-13T14:29:24Z","cross_cats_sorted":["cs.CR","cs.DC"],"title_canon_sha256":"f84e019a391e2ff04f3d77034635cb59eb05023c11079e9fb778d8b789f67ad6","abstract_canon_sha256":"2fece579daa8b2c336c39d8489666ecd0026bcb4919837b32c0950f41e7cc152"},"schema_version":"1.0"},"canonical_sha256":"722022b3ea957cc53d148ebf0c5d579afd08c24a01f02eabea67b09327594253","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:35.589636Z","signature_b64":"CseX4aUBAV1E7J3bYrjnNaav3XylyhRv6clzgH5TD0kUtIqrorJ1zXS1G7vaNfyrvs/9ET2ZmS5bRZ2d5rldDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"722022b3ea957cc53d148ebf0c5d579afd08c24a01f02eabea67b09327594253","last_reissued_at":"2026-05-18T03:10:35.589106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:35.589106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.3486","source_version":1,"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-18T03:10:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PHe6j1KJo/68FYxxnGYVbuSjsqaAyV/arcz0GJ4TM7WkH9HXkTyRoM34M2cDIbOyfKesWmy5mhdv7IWTMLjZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:49:48.492752Z"},"content_sha256":"642e8bdf1ce91624256a3a30eb69a246df2f05683be5c4e346f71c044f7caae7","schema_version":"1.0","event_id":"sha256:642e8bdf1ce91624256a3a30eb69a246df2f05683be5c4e346f71c044f7caae7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OIQCFM7KSV6MKPIUR27QYXKXTL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC"],"primary_cat":"cs.DS","authors_text":"Jared Saia, Mahnush Movahedi, Valerie King, Varsha Dani","submitted_at":"2013-10-13T14:29:24Z","abstract_excerpt":"We describe an asynchronous algorithm to solve secure multiparty computation (MPC) over n players, when strictly less than a 1/8 fraction of the players are controlled by a static adversary. For any function f over a field that can be computed by a circuit with m gates, our algorithm requires each player to send a number of field elements and perform an amount of computation that is O (m/n + \\sqrt{n}). This significantly improves over traditional algorithms, which require each player to both send a number of messages and perform computation that is {\\Omega}(nm). Additionally, we define the thr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3486","kind":"arxiv","version":1},"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-18T03:10:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x3wAZBKp4TVj+rVqNbiNu9ZOh3jv9QAJ/Az1nV2DC1aRJdifDyz70EYtGdp3xKz30gfT7C69Mf0TBQgTamHXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:49:48.493104Z"},"content_sha256":"53d082741ad00d1c737065d4517cb6ed78cb29c7b5562958843a91384fd51791","schema_version":"1.0","event_id":"sha256:53d082741ad00d1c737065d4517cb6ed78cb29c7b5562958843a91384fd51791"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OIQCFM7KSV6MKPIUR27QYXKXTL/bundle.json","state_url":"https://pith.science/pith/OIQCFM7KSV6MKPIUR27QYXKXTL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OIQCFM7KSV6MKPIUR27QYXKXTL/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-01T05:49:48Z","links":{"resolver":"https://pith.science/pith/OIQCFM7KSV6MKPIUR27QYXKXTL","bundle":"https://pith.science/pith/OIQCFM7KSV6MKPIUR27QYXKXTL/bundle.json","state":"https://pith.science/pith/OIQCFM7KSV6MKPIUR27QYXKXTL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OIQCFM7KSV6MKPIUR27QYXKXTL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OIQCFM7KSV6MKPIUR27QYXKXTL","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":"2fece579daa8b2c336c39d8489666ecd0026bcb4919837b32c0950f41e7cc152","cross_cats_sorted":["cs.CR","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-13T14:29:24Z","title_canon_sha256":"f84e019a391e2ff04f3d77034635cb59eb05023c11079e9fb778d8b789f67ad6"},"schema_version":"1.0","source":{"id":"1310.3486","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3486","created_at":"2026-05-18T03:10:35Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3486v1","created_at":"2026-05-18T03:10:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3486","created_at":"2026-05-18T03:10:35Z"},{"alias_kind":"pith_short_12","alias_value":"OIQCFM7KSV6M","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OIQCFM7KSV6MKPIU","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OIQCFM7K","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:53d082741ad00d1c737065d4517cb6ed78cb29c7b5562958843a91384fd51791","target":"graph","created_at":"2026-05-18T03:10:35Z","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":"We describe an asynchronous algorithm to solve secure multiparty computation (MPC) over n players, when strictly less than a 1/8 fraction of the players are controlled by a static adversary. For any function f over a field that can be computed by a circuit with m gates, our algorithm requires each player to send a number of field elements and perform an amount of computation that is O (m/n + \\sqrt{n}). This significantly improves over traditional algorithms, which require each player to both send a number of messages and perform computation that is {\\Omega}(nm). Additionally, we define the thr","authors_text":"Jared Saia, Mahnush Movahedi, Valerie King, Varsha Dani","cross_cats":["cs.CR","cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-13T14:29:24Z","title":"Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3486","kind":"arxiv","version":1},"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:642e8bdf1ce91624256a3a30eb69a246df2f05683be5c4e346f71c044f7caae7","target":"record","created_at":"2026-05-18T03:10:35Z","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":"2fece579daa8b2c336c39d8489666ecd0026bcb4919837b32c0950f41e7cc152","cross_cats_sorted":["cs.CR","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-13T14:29:24Z","title_canon_sha256":"f84e019a391e2ff04f3d77034635cb59eb05023c11079e9fb778d8b789f67ad6"},"schema_version":"1.0","source":{"id":"1310.3486","kind":"arxiv","version":1}},"canonical_sha256":"722022b3ea957cc53d148ebf0c5d579afd08c24a01f02eabea67b09327594253","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"722022b3ea957cc53d148ebf0c5d579afd08c24a01f02eabea67b09327594253","first_computed_at":"2026-05-18T03:10:35.589106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:35.589106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CseX4aUBAV1E7J3bYrjnNaav3XylyhRv6clzgH5TD0kUtIqrorJ1zXS1G7vaNfyrvs/9ET2ZmS5bRZ2d5rldDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:35.589636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.3486","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:642e8bdf1ce91624256a3a30eb69a246df2f05683be5c4e346f71c044f7caae7","sha256:53d082741ad00d1c737065d4517cb6ed78cb29c7b5562958843a91384fd51791"],"state_sha256":"e9e82961270fed5ff2908d6e563ddc3bed5a254ddb013cb27ad448fb3937252b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Wr6OO7YULEiba6Omhw6HbSF3g6cGIvGuDDmtkneoa1pdxC1nBcCdp8mf5T3AevnvtN0FZeE+cMyZQCScBm9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:49:48.495440Z","bundle_sha256":"b8455ec539f1bc884b9aaa80f0df27a85f7c52994e602419fc8c2d8ae1ff21f1"}}