{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KI6K3VLSFH7JD6U3XTNWORSDKS","short_pith_number":"pith:KI6K3VLS","schema_version":"1.0","canonical_sha256":"523cadd57229fe91fa9bbcdb67464354bc1ab04044c8dd9209e9843c97cd5292","source":{"kind":"arxiv","id":"1205.0581","version":1},"attestation_state":"computed","paper":{"title":"Scalable Mechanisms for Rational Secret Sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jared Saia, Mahnush Movahedi, Varsha Dani","submitted_at":"2012-05-02T23:28:01Z","abstract_excerpt":"We consider the classical secret sharing problem in the case where all agents are selfish but rational. In recent work, Kol and Naor show that, when there are two players, in the non-simultaneous communication model, i.e. when rushing is possible, there is no Nash equilibrium that ensures both players learn the secret. However, they describe a mechanism for this problem, for any number of players, that is an epsilon-Nash equilibrium, in that no player can gain more than epsilon utility by deviating from it. Unfortunately, the Kol and Naor mechanism, and, to the best of our knowledge, all previ"},"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":"1205.0581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-02T23:28:01Z","cross_cats_sorted":[],"title_canon_sha256":"beb7605da67a09a68c6f89e834159132ac4c14957b0a3023ccfd65b9ecd2187f","abstract_canon_sha256":"a16143bef5052cfde3f7c65ff96b0c28990337c4e898b01b55cb42b3b25781c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:33.617323Z","signature_b64":"PHXZZMqk2GRhntsUIS4QblOx1wchvwt/ObQCCdzMUfF9D4i5QxYC/r7PuVOTs8cTWoz04oVz8ZF179bQVQIACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"523cadd57229fe91fa9bbcdb67464354bc1ab04044c8dd9209e9843c97cd5292","last_reissued_at":"2026-05-18T03:56:33.616843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:33.616843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Mechanisms for Rational Secret Sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jared Saia, Mahnush Movahedi, Varsha Dani","submitted_at":"2012-05-02T23:28:01Z","abstract_excerpt":"We consider the classical secret sharing problem in the case where all agents are selfish but rational. In recent work, Kol and Naor show that, when there are two players, in the non-simultaneous communication model, i.e. when rushing is possible, there is no Nash equilibrium that ensures both players learn the secret. However, they describe a mechanism for this problem, for any number of players, that is an epsilon-Nash equilibrium, in that no player can gain more than epsilon utility by deviating from it. Unfortunately, the Kol and Naor mechanism, and, to the best of our knowledge, all previ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0581","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.0581","created_at":"2026-05-18T03:56:33.616900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.0581v1","created_at":"2026-05-18T03:56:33.616900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0581","created_at":"2026-05-18T03:56:33.616900+00:00"},{"alias_kind":"pith_short_12","alias_value":"KI6K3VLSFH7J","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KI6K3VLSFH7JD6U3","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KI6K3VLS","created_at":"2026-05-18T12:27:11.947152+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/KI6K3VLSFH7JD6U3XTNWORSDKS","json":"https://pith.science/pith/KI6K3VLSFH7JD6U3XTNWORSDKS.json","graph_json":"https://pith.science/api/pith-number/KI6K3VLSFH7JD6U3XTNWORSDKS/graph.json","events_json":"https://pith.science/api/pith-number/KI6K3VLSFH7JD6U3XTNWORSDKS/events.json","paper":"https://pith.science/paper/KI6K3VLS"},"agent_actions":{"view_html":"https://pith.science/pith/KI6K3VLSFH7JD6U3XTNWORSDKS","download_json":"https://pith.science/pith/KI6K3VLSFH7JD6U3XTNWORSDKS.json","view_paper":"https://pith.science/paper/KI6K3VLS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.0581&json=true","fetch_graph":"https://pith.science/api/pith-number/KI6K3VLSFH7JD6U3XTNWORSDKS/graph.json","fetch_events":"https://pith.science/api/pith-number/KI6K3VLSFH7JD6U3XTNWORSDKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KI6K3VLSFH7JD6U3XTNWORSDKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KI6K3VLSFH7JD6U3XTNWORSDKS/action/storage_attestation","attest_author":"https://pith.science/pith/KI6K3VLSFH7JD6U3XTNWORSDKS/action/author_attestation","sign_citation":"https://pith.science/pith/KI6K3VLSFH7JD6U3XTNWORSDKS/action/citation_signature","submit_replication":"https://pith.science/pith/KI6K3VLSFH7JD6U3XTNWORSDKS/action/replication_record"}},"created_at":"2026-05-18T03:56:33.616900+00:00","updated_at":"2026-05-18T03:56:33.616900+00:00"}