{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:FKVFV3T4VLASIHCOM7ZMV3XY5M","short_pith_number":"pith:FKVFV3T4","canonical_record":{"source":{"id":"cs/0701139","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.GT","submitted_at":"2007-01-22T15:23:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1f3bb865f832f44d5414d5738a093cd91f73683766d3152ebbdab1b3c49592ae","abstract_canon_sha256":"4115bf69b9152e384a8ecb5e85475e3dbc237699822cdc65c56543a02ad647ba"},"schema_version":"1.0"},"canonical_sha256":"2aaa5aee7caac1241c4e67f2caeef8eb177492242f6e2765f3de20ada96f20ae","source":{"kind":"arxiv","id":"cs/0701139","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0701139","created_at":"2026-07-04T14:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0701139v1","created_at":"2026-07-04T14:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701139","created_at":"2026-07-04T14:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"FKVFV3T4VLAS","created_at":"2026-07-04T14:58:57Z"},{"alias_kind":"pith_short_16","alias_value":"FKVFV3T4VLASIHCO","created_at":"2026-07-04T14:58:57Z"},{"alias_kind":"pith_short_8","alias_value":"FKVFV3T4","created_at":"2026-07-04T14:58:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:FKVFV3T4VLASIHCOM7ZMV3XY5M","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0701139","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.GT","submitted_at":"2007-01-22T15:23:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1f3bb865f832f44d5414d5738a093cd91f73683766d3152ebbdab1b3c49592ae","abstract_canon_sha256":"4115bf69b9152e384a8ecb5e85475e3dbc237699822cdc65c56543a02ad647ba"},"schema_version":"1.0"},"canonical_sha256":"2aaa5aee7caac1241c4e67f2caeef8eb177492242f6e2765f3de20ada96f20ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:58:57.025773Z","signature_b64":"3PksJ4swGQ9/kDWBjnJWNrEdi2r1f+ePN//CFiQB1yG6NXfoZkt5zvwM52T62lmRRuaQIBvDutXrTtElb/QWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2aaa5aee7caac1241c4e67f2caeef8eb177492242f6e2765f3de20ada96f20ae","last_reissued_at":"2026-07-04T14:58:57.025428Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:58:57.025428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0701139","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-07-04T14:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jx1izEwj28GS8tdAsAvvibxMtC/dOVxY9qHUCnS9d6wGtQzAOL7yu+kPSAFhY7mFyBYeBE5v/2xBSgGaD+YGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T16:15:51.674350Z"},"content_sha256":"788ea28c063f4cf42a21cfdbed73c1dd24d53fda9dc2aeed3d2e35661fe6933d","schema_version":"1.0","event_id":"sha256:788ea28c063f4cf42a21cfdbed73c1dd24d53fda9dc2aeed3d2e35661fe6933d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:FKVFV3T4VLASIHCOM7ZMV3XY5M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Time and the Prisoner's Dilemma","license":"","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Jeffrey S. Rosenschein, Yishay Mor","submitted_at":"2007-01-22T15:23:49Z","abstract_excerpt":"This paper examines the integration of computational complexity into game theoretic models. The example focused on is the Prisoner's Dilemma, repeated for a finite length of time. We show that a minimal bound on the players' computational ability is sufficient to enable cooperative behavior.\n  In addition, a variant of the repeated Prisoner's Dilemma game is suggested, in which players have the choice of opting out. This modification enriches the game and suggests dominance of cooperative strategies.\n  Competitive analysis is suggested as a tool for investigating sub-optimal (but computational"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0701139","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0701139/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8OWUkPEsle0OiL3OVxgwUxhsI908jswmEnpm8vh38GShRUfPffG3+YXSNgHdkv/mcgE3vTwdkpqvigBUfGzNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T16:15:51.674731Z"},"content_sha256":"f2f7c8566c19c52b2d4dcc6db0b8c9475af326efb516fd2acb31589b2b4ede39","schema_version":"1.0","event_id":"sha256:f2f7c8566c19c52b2d4dcc6db0b8c9475af326efb516fd2acb31589b2b4ede39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FKVFV3T4VLASIHCOM7ZMV3XY5M/bundle.json","state_url":"https://pith.science/pith/FKVFV3T4VLASIHCOM7ZMV3XY5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FKVFV3T4VLASIHCOM7ZMV3XY5M/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-07-06T16:15:51Z","links":{"resolver":"https://pith.science/pith/FKVFV3T4VLASIHCOM7ZMV3XY5M","bundle":"https://pith.science/pith/FKVFV3T4VLASIHCOM7ZMV3XY5M/bundle.json","state":"https://pith.science/pith/FKVFV3T4VLASIHCOM7ZMV3XY5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FKVFV3T4VLASIHCOM7ZMV3XY5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:FKVFV3T4VLASIHCOM7ZMV3XY5M","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":"4115bf69b9152e384a8ecb5e85475e3dbc237699822cdc65c56543a02ad647ba","cross_cats_sorted":["cs.AI"],"license":"","primary_cat":"cs.GT","submitted_at":"2007-01-22T15:23:49Z","title_canon_sha256":"1f3bb865f832f44d5414d5738a093cd91f73683766d3152ebbdab1b3c49592ae"},"schema_version":"1.0","source":{"id":"cs/0701139","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0701139","created_at":"2026-07-04T14:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0701139v1","created_at":"2026-07-04T14:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701139","created_at":"2026-07-04T14:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"FKVFV3T4VLAS","created_at":"2026-07-04T14:58:57Z"},{"alias_kind":"pith_short_16","alias_value":"FKVFV3T4VLASIHCO","created_at":"2026-07-04T14:58:57Z"},{"alias_kind":"pith_short_8","alias_value":"FKVFV3T4","created_at":"2026-07-04T14:58:57Z"}],"graph_snapshots":[{"event_id":"sha256:f2f7c8566c19c52b2d4dcc6db0b8c9475af326efb516fd2acb31589b2b4ede39","target":"graph","created_at":"2026-07-04T14:58:57Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0701139/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper examines the integration of computational complexity into game theoretic models. The example focused on is the Prisoner's Dilemma, repeated for a finite length of time. We show that a minimal bound on the players' computational ability is sufficient to enable cooperative behavior.\n  In addition, a variant of the repeated Prisoner's Dilemma game is suggested, in which players have the choice of opting out. This modification enriches the game and suggests dominance of cooperative strategies.\n  Competitive analysis is suggested as a tool for investigating sub-optimal (but computational","authors_text":"Jeffrey S. Rosenschein, Yishay Mor","cross_cats":["cs.AI"],"headline":"","license":"","primary_cat":"cs.GT","submitted_at":"2007-01-22T15:23:49Z","title":"Time and the Prisoner's Dilemma"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0701139","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:788ea28c063f4cf42a21cfdbed73c1dd24d53fda9dc2aeed3d2e35661fe6933d","target":"record","created_at":"2026-07-04T14:58:57Z","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":"4115bf69b9152e384a8ecb5e85475e3dbc237699822cdc65c56543a02ad647ba","cross_cats_sorted":["cs.AI"],"license":"","primary_cat":"cs.GT","submitted_at":"2007-01-22T15:23:49Z","title_canon_sha256":"1f3bb865f832f44d5414d5738a093cd91f73683766d3152ebbdab1b3c49592ae"},"schema_version":"1.0","source":{"id":"cs/0701139","kind":"arxiv","version":1}},"canonical_sha256":"2aaa5aee7caac1241c4e67f2caeef8eb177492242f6e2765f3de20ada96f20ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2aaa5aee7caac1241c4e67f2caeef8eb177492242f6e2765f3de20ada96f20ae","first_computed_at":"2026-07-04T14:58:57.025428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:58:57.025428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3PksJ4swGQ9/kDWBjnJWNrEdi2r1f+ePN//CFiQB1yG6NXfoZkt5zvwM52T62lmRRuaQIBvDutXrTtElb/QWCQ==","signature_status":"signed_v1","signed_at":"2026-07-04T14:58:57.025773Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0701139","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:788ea28c063f4cf42a21cfdbed73c1dd24d53fda9dc2aeed3d2e35661fe6933d","sha256:f2f7c8566c19c52b2d4dcc6db0b8c9475af326efb516fd2acb31589b2b4ede39"],"state_sha256":"6c5c8e61cea82db06b20247ca777e7d1f1a7368b36bb20d2bee1ce451e807ac0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hhIbrOq9orr/Um/XmeIsCKo470myk0mfkkuiWpfPBUoYomRaHSJGbGv6l1FvTFIMcPVi2IuEVWde/Y2jWRr0AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T16:15:51.676693Z","bundle_sha256":"abafd96386a4b6f7ab594fcba698869985438ed9dbab8d5e5cd66e3ee5f1a663"}}