{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:EZYO7Z5CPYWTYAQ5OWEFX5WZNO","short_pith_number":"pith:EZYO7Z5C","canonical_record":{"source":{"id":"1011.5567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-11-25T08:37:52Z","cross_cats_sorted":[],"title_canon_sha256":"c631e7bb6cfd1f7eafc7a0722237d1f9a6fe2d7a670a03a0793bdb1d14810571","abstract_canon_sha256":"5e4e27c367d52e37fdb9169276aac8247b7ae3a634253322ba4db3878c4d9d57"},"schema_version":"1.0"},"canonical_sha256":"2670efe7a27e2d3c021d75885bf6d96bb59c349e32c42637d6cbe2c81518ec33","source":{"kind":"arxiv","id":"1011.5567","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5567","created_at":"2026-05-18T04:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5567v1","created_at":"2026-05-18T04:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5567","created_at":"2026-05-18T04:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"EZYO7Z5CPYWT","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"EZYO7Z5CPYWTYAQ5","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"EZYO7Z5C","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:EZYO7Z5CPYWTYAQ5OWEFX5WZNO","target":"record","payload":{"canonical_record":{"source":{"id":"1011.5567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-11-25T08:37:52Z","cross_cats_sorted":[],"title_canon_sha256":"c631e7bb6cfd1f7eafc7a0722237d1f9a6fe2d7a670a03a0793bdb1d14810571","abstract_canon_sha256":"5e4e27c367d52e37fdb9169276aac8247b7ae3a634253322ba4db3878c4d9d57"},"schema_version":"1.0"},"canonical_sha256":"2670efe7a27e2d3c021d75885bf6d96bb59c349e32c42637d6cbe2c81518ec33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:45.536088Z","signature_b64":"qRxR6tDJXnP0xZavEgnTdg2LgyGTNFLZT/ycz+TMAiQGIg8tp3i8hokzfqVGfBkD89CAz8qc1zJB1ugNoutjCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2670efe7a27e2d3c021d75885bf6d96bb59c349e32c42637d6cbe2c81518ec33","last_reissued_at":"2026-05-18T04:34:45.535686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:45.535686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.5567","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-18T04:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RR8/UbW+J4c0p3OLZkvGlVqlkOiMS2j8uE/ViKggTFhcPbtxsgIkQP+YQKVdv2khUc+Ikr4BWQIhLGz7g7NpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:31:15.846053Z"},"content_sha256":"049e773f52bcbd8b61ee4951030252fc1df0cae9111d03dc1cfe9b1642fb328f","schema_version":"1.0","event_id":"sha256:049e773f52bcbd8b61ee4951030252fc1df0cae9111d03dc1cfe9b1642fb328f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:EZYO7Z5CPYWTYAQ5OWEFX5WZNO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secure Multiparty Computation with Partial Fairness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Amos Beimel, Eran Omri, Ilan Orlov","submitted_at":"2010-11-25T08:37:52Z","abstract_excerpt":"A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a trusted party which returns the output of the functionality to all parties. In particular, in the ideal model such computation is fair -- all parties get the output. Cleve (STOC 1986) proved that, in general, fairness is not possible without an honest majority. To overcome this impossibility, Gordon and Katz (Eurocrypt 2010) suggested a relaxed definition -- 1/p-secure computation -- which guarantees partial fairness. For t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5567","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-18T04:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Chs5i/Bhpz9XDkpyBj/cLa7vAlqjFslesfAHnOanTWOBBlhr8LqQQAtBqjsZMiHqXuHXk8czi6jBGtw6bmoJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:31:15.846420Z"},"content_sha256":"83708428b07d4d3bc714dc393dbdadacba75b113dbeb538eeaa0432ce46b7034","schema_version":"1.0","event_id":"sha256:83708428b07d4d3bc714dc393dbdadacba75b113dbeb538eeaa0432ce46b7034"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EZYO7Z5CPYWTYAQ5OWEFX5WZNO/bundle.json","state_url":"https://pith.science/pith/EZYO7Z5CPYWTYAQ5OWEFX5WZNO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EZYO7Z5CPYWTYAQ5OWEFX5WZNO/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-05T16:31:15Z","links":{"resolver":"https://pith.science/pith/EZYO7Z5CPYWTYAQ5OWEFX5WZNO","bundle":"https://pith.science/pith/EZYO7Z5CPYWTYAQ5OWEFX5WZNO/bundle.json","state":"https://pith.science/pith/EZYO7Z5CPYWTYAQ5OWEFX5WZNO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EZYO7Z5CPYWTYAQ5OWEFX5WZNO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:EZYO7Z5CPYWTYAQ5OWEFX5WZNO","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":"5e4e27c367d52e37fdb9169276aac8247b7ae3a634253322ba4db3878c4d9d57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-11-25T08:37:52Z","title_canon_sha256":"c631e7bb6cfd1f7eafc7a0722237d1f9a6fe2d7a670a03a0793bdb1d14810571"},"schema_version":"1.0","source":{"id":"1011.5567","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5567","created_at":"2026-05-18T04:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5567v1","created_at":"2026-05-18T04:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5567","created_at":"2026-05-18T04:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"EZYO7Z5CPYWT","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"EZYO7Z5CPYWTYAQ5","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"EZYO7Z5C","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:83708428b07d4d3bc714dc393dbdadacba75b113dbeb538eeaa0432ce46b7034","target":"graph","created_at":"2026-05-18T04:34:45Z","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":"A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a trusted party which returns the output of the functionality to all parties. In particular, in the ideal model such computation is fair -- all parties get the output. Cleve (STOC 1986) proved that, in general, fairness is not possible without an honest majority. To overcome this impossibility, Gordon and Katz (Eurocrypt 2010) suggested a relaxed definition -- 1/p-secure computation -- which guarantees partial fairness. For t","authors_text":"Amos Beimel, Eran Omri, Ilan Orlov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-11-25T08:37:52Z","title":"Secure Multiparty Computation with Partial Fairness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5567","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:049e773f52bcbd8b61ee4951030252fc1df0cae9111d03dc1cfe9b1642fb328f","target":"record","created_at":"2026-05-18T04:34:45Z","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":"5e4e27c367d52e37fdb9169276aac8247b7ae3a634253322ba4db3878c4d9d57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-11-25T08:37:52Z","title_canon_sha256":"c631e7bb6cfd1f7eafc7a0722237d1f9a6fe2d7a670a03a0793bdb1d14810571"},"schema_version":"1.0","source":{"id":"1011.5567","kind":"arxiv","version":1}},"canonical_sha256":"2670efe7a27e2d3c021d75885bf6d96bb59c349e32c42637d6cbe2c81518ec33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2670efe7a27e2d3c021d75885bf6d96bb59c349e32c42637d6cbe2c81518ec33","first_computed_at":"2026-05-18T04:34:45.535686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:45.535686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qRxR6tDJXnP0xZavEgnTdg2LgyGTNFLZT/ycz+TMAiQGIg8tp3i8hokzfqVGfBkD89CAz8qc1zJB1ugNoutjCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:45.536088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.5567","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:049e773f52bcbd8b61ee4951030252fc1df0cae9111d03dc1cfe9b1642fb328f","sha256:83708428b07d4d3bc714dc393dbdadacba75b113dbeb538eeaa0432ce46b7034"],"state_sha256":"9a16ff5946e18c554b23d7fb193d00bb541333595e1b8bb3dd126f8edd5a4e32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DHmJmYGI1xyMdqGnueZp2nXOz/1uPvWoQydMGqSHuuhbH+LV8oYG6oyDFb5RlS2qrXVYVSw3yqunHH6i5HtQAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:31:15.848381Z","bundle_sha256":"c964583f7107d522f8c92ebbd08144880d7ae6b44a4dfdc09e7eb169d5144356"}}