{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WBQ43UXLEMHF7MWWS3JYCW4XD4","short_pith_number":"pith:WBQ43UXL","schema_version":"1.0","canonical_sha256":"b061cdd2eb230e5fb2d696d3815b971f3a7e343ec008f2a24a6c5cdcb2847ef0","source":{"kind":"arxiv","id":"1505.05081","version":2},"attestation_state":"computed","paper":{"title":"Multiparty Probability Computation and Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Subhash Kak","submitted_at":"2015-05-19T16:57:21Z","abstract_excerpt":"A multiparty computation protocol is described in which the parties can generate different probability events that is based on the sharing of a single anonymized random number, and also perform oblivious transfer. A method to verify the correctness of the procedure, without revealing the random numbers used by the parties, is proposed."},"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":"1505.05081","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-05-19T16:57:21Z","cross_cats_sorted":[],"title_canon_sha256":"05329eaedf74d2a35825a56834c0fcceebaafd59cefac4d861180d600bb81905","abstract_canon_sha256":"9f4eada0c8daf452a65be69d29219c6ae0688e2bda819a34a95d822e24cb5317"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:01.920589Z","signature_b64":"0wcJkalp+34h/xY8pMczQ3yJv/MQ82mTmuoK8Wp8Lwyxm9BcbMHYt0I7payajKxkOwhivyBV1vw1bZW9IDFUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b061cdd2eb230e5fb2d696d3815b971f3a7e343ec008f2a24a6c5cdcb2847ef0","last_reissued_at":"2026-05-18T02:00:01.920053Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:01.920053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiparty Probability Computation and Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Subhash Kak","submitted_at":"2015-05-19T16:57:21Z","abstract_excerpt":"A multiparty computation protocol is described in which the parties can generate different probability events that is based on the sharing of a single anonymized random number, and also perform oblivious transfer. A method to verify the correctness of the procedure, without revealing the random numbers used by the parties, is proposed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05081","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.05081","created_at":"2026-05-18T02:00:01.920145+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.05081v2","created_at":"2026-05-18T02:00:01.920145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05081","created_at":"2026-05-18T02:00:01.920145+00:00"},{"alias_kind":"pith_short_12","alias_value":"WBQ43UXLEMHF","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WBQ43UXLEMHF7MWW","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WBQ43UXL","created_at":"2026-05-18T12:29:47.479230+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/WBQ43UXLEMHF7MWWS3JYCW4XD4","json":"https://pith.science/pith/WBQ43UXLEMHF7MWWS3JYCW4XD4.json","graph_json":"https://pith.science/api/pith-number/WBQ43UXLEMHF7MWWS3JYCW4XD4/graph.json","events_json":"https://pith.science/api/pith-number/WBQ43UXLEMHF7MWWS3JYCW4XD4/events.json","paper":"https://pith.science/paper/WBQ43UXL"},"agent_actions":{"view_html":"https://pith.science/pith/WBQ43UXLEMHF7MWWS3JYCW4XD4","download_json":"https://pith.science/pith/WBQ43UXLEMHF7MWWS3JYCW4XD4.json","view_paper":"https://pith.science/paper/WBQ43UXL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.05081&json=true","fetch_graph":"https://pith.science/api/pith-number/WBQ43UXLEMHF7MWWS3JYCW4XD4/graph.json","fetch_events":"https://pith.science/api/pith-number/WBQ43UXLEMHF7MWWS3JYCW4XD4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WBQ43UXLEMHF7MWWS3JYCW4XD4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WBQ43UXLEMHF7MWWS3JYCW4XD4/action/storage_attestation","attest_author":"https://pith.science/pith/WBQ43UXLEMHF7MWWS3JYCW4XD4/action/author_attestation","sign_citation":"https://pith.science/pith/WBQ43UXLEMHF7MWWS3JYCW4XD4/action/citation_signature","submit_replication":"https://pith.science/pith/WBQ43UXLEMHF7MWWS3JYCW4XD4/action/replication_record"}},"created_at":"2026-05-18T02:00:01.920145+00:00","updated_at":"2026-05-18T02:00:01.920145+00:00"}