{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:KHHDIKI2AETITNLEOBQKYBOUIQ","short_pith_number":"pith:KHHDIKI2","canonical_record":{"source":{"id":"1008.3123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-08-18T16:11:35Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"6dd11fc74f6d3df2f740c815cfd79024767aad120a89586e3d906a148c7facbe","abstract_canon_sha256":"e9f26b5205a5006e016474e1e7415d4ae4e76c0d4aaa597a1d308ddd374311dc"},"schema_version":"1.0"},"canonical_sha256":"51ce34291a012689b5647060ac05d4440afdd7434b3eb4a4ca292c4babf530d6","source":{"kind":"arxiv","id":"1008.3123","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3123","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3123v1","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3123","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"KHHDIKI2AETI","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KHHDIKI2AETITNLE","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KHHDIKI2","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:KHHDIKI2AETITNLEOBQKYBOUIQ","target":"record","payload":{"canonical_record":{"source":{"id":"1008.3123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-08-18T16:11:35Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"6dd11fc74f6d3df2f740c815cfd79024767aad120a89586e3d906a148c7facbe","abstract_canon_sha256":"e9f26b5205a5006e016474e1e7415d4ae4e76c0d4aaa597a1d308ddd374311dc"},"schema_version":"1.0"},"canonical_sha256":"51ce34291a012689b5647060ac05d4440afdd7434b3eb4a4ca292c4babf530d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:03.578355Z","signature_b64":"dRmDRQ8zhFRgLQfv9f15Yook8XElleSQhw4DcizBssrIsaIdss4c5zYrewr94x/+NPGSnOW9nIQyZeiVDcZlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51ce34291a012689b5647060ac05d4440afdd7434b3eb4a4ca292c4babf530d6","last_reissued_at":"2026-05-18T04:42:03.577902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:03.577902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.3123","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:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BEAFZRoqhJ8RdmuksmoHTKPol5/EM4gvYfcjDb5UNiiT+yfk7DK0x7l9NhesCJ90ZUOQXIovuJqPLbezD+LTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:54:32.797694Z"},"content_sha256":"16393740df93c3ba327c462ef9b7128beb6ffda0ff5f047dba84e7270d7e922d","schema_version":"1.0","event_id":"sha256:16393740df93c3ba327c462ef9b7128beb6ffda0ff5f047dba84e7270d7e922d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:KHHDIKI2AETITNLEOBQKYBOUIQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Rationality in Cryptographic Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.GT","authors_text":"Alon Rosen, Noam Livne, Ronen Gradwohl","submitted_at":"2010-08-18T16:11:35Z","abstract_excerpt":"Much of the literature on rational cryptography focuses on analyzing the strategic properties of cryptographic protocols. However, due to the presence of computationally-bounded players and the asymptotic nature of cryptographic security, a definition of sequential rationality for this setting has thus far eluded researchers.\n  We propose a new framework for overcoming these obstacles, and provide the first definitions of computational solution concepts that guarantee sequential rationality. We argue that natural computational variants of subgame perfection are too strong for cryptographic pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3123","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:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KyUEJ8oo7A4xYPAqCABw5WVewk1DhfJ3uwKvfCj/o9Hjac5qyEAwVlf/fGRO3R0XZRN0DSz6NE2LZv15iQbVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:54:32.798335Z"},"content_sha256":"c35e254ae8982c7e1f976f32a9479f7e1dc38fcd183219b1cfe7540a63423adc","schema_version":"1.0","event_id":"sha256:c35e254ae8982c7e1f976f32a9479f7e1dc38fcd183219b1cfe7540a63423adc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHHDIKI2AETITNLEOBQKYBOUIQ/bundle.json","state_url":"https://pith.science/pith/KHHDIKI2AETITNLEOBQKYBOUIQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHHDIKI2AETITNLEOBQKYBOUIQ/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-05-27T08:54:32Z","links":{"resolver":"https://pith.science/pith/KHHDIKI2AETITNLEOBQKYBOUIQ","bundle":"https://pith.science/pith/KHHDIKI2AETITNLEOBQKYBOUIQ/bundle.json","state":"https://pith.science/pith/KHHDIKI2AETITNLEOBQKYBOUIQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHHDIKI2AETITNLEOBQKYBOUIQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:KHHDIKI2AETITNLEOBQKYBOUIQ","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":"e9f26b5205a5006e016474e1e7415d4ae4e76c0d4aaa597a1d308ddd374311dc","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-08-18T16:11:35Z","title_canon_sha256":"6dd11fc74f6d3df2f740c815cfd79024767aad120a89586e3d906a148c7facbe"},"schema_version":"1.0","source":{"id":"1008.3123","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3123","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3123v1","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3123","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"KHHDIKI2AETI","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KHHDIKI2AETITNLE","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KHHDIKI2","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:c35e254ae8982c7e1f976f32a9479f7e1dc38fcd183219b1cfe7540a63423adc","target":"graph","created_at":"2026-05-18T04:42:03Z","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":"Much of the literature on rational cryptography focuses on analyzing the strategic properties of cryptographic protocols. However, due to the presence of computationally-bounded players and the asymptotic nature of cryptographic security, a definition of sequential rationality for this setting has thus far eluded researchers.\n  We propose a new framework for overcoming these obstacles, and provide the first definitions of computational solution concepts that guarantee sequential rationality. We argue that natural computational variants of subgame perfection are too strong for cryptographic pro","authors_text":"Alon Rosen, Noam Livne, Ronen Gradwohl","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-08-18T16:11:35Z","title":"Sequential Rationality in Cryptographic Protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3123","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:16393740df93c3ba327c462ef9b7128beb6ffda0ff5f047dba84e7270d7e922d","target":"record","created_at":"2026-05-18T04:42:03Z","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":"e9f26b5205a5006e016474e1e7415d4ae4e76c0d4aaa597a1d308ddd374311dc","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-08-18T16:11:35Z","title_canon_sha256":"6dd11fc74f6d3df2f740c815cfd79024767aad120a89586e3d906a148c7facbe"},"schema_version":"1.0","source":{"id":"1008.3123","kind":"arxiv","version":1}},"canonical_sha256":"51ce34291a012689b5647060ac05d4440afdd7434b3eb4a4ca292c4babf530d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51ce34291a012689b5647060ac05d4440afdd7434b3eb4a4ca292c4babf530d6","first_computed_at":"2026-05-18T04:42:03.577902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:03.577902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dRmDRQ8zhFRgLQfv9f15Yook8XElleSQhw4DcizBssrIsaIdss4c5zYrewr94x/+NPGSnOW9nIQyZeiVDcZlAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:03.578355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.3123","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16393740df93c3ba327c462ef9b7128beb6ffda0ff5f047dba84e7270d7e922d","sha256:c35e254ae8982c7e1f976f32a9479f7e1dc38fcd183219b1cfe7540a63423adc"],"state_sha256":"b5eaf349aecb4b4467ed62d32a2a2593ddaa2f20555028a94b02add2542627b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BfL6j4zCkT7ul931lBLv3QSqz6L37yxSqWC9x/EKBd+3LTNDUZRNejzkncP3zBfd8wGxJ/ANOv+RZb70kjmDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:54:32.801381Z","bundle_sha256":"ae1f438b7a19475faaa01a93fa4f948780c57a2c8a62b91ec449096b5c901b99"}}