{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:STCQ2GHSF5MYUXU6KHFF7SUTPW","short_pith_number":"pith:STCQ2GHS","schema_version":"1.0","canonical_sha256":"94c50d18f22f598a5e9e51ca5fca937d9417422a58a8569d81876a191ddb506a","source":{"kind":"arxiv","id":"1101.0340","version":1},"attestation_state":"computed","paper":{"title":"A Round-Robin Tournament of the Iterated Prisoner's Dilemma with Complete Memory-Size-Three Strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.GT","authors_text":"Tobias Kretz","submitted_at":"2011-01-01T14:05:13Z","abstract_excerpt":"In this paper the results of a simulation of a prisoner's dilemma robin-round tournament are presented. In the tournament each participating strategy plays an iterated prisoner's dilemma against each other strategy (round-robin) and as a variant also against itself. The participants of a tournament are all strategies that are deterministic and have the same size of memory with regard to their own and their opponent's past actions: up to three most recent actions of their opponent and up to two most recent actions of their own. A focus is set on the investigation of the influence of the number "},"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":"1101.0340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-01-01T14:05:13Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"f73465a9203bd3572e342291255d36ec839d6f495678bb20b85f34cfeb1f11b6","abstract_canon_sha256":"e4c2f6c9af31afe45014240024a7a2a2ae8d5d9b5af1d53b04ecc62468aa93a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:48.729617Z","signature_b64":"QcEPyFAwlYju2R7Z/LsQRfilJNHyELh6Cc7kcbuauiyNYprN8pYwhe95NrPi56UNEaTqRdmeoSqbZSnyPdlyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94c50d18f22f598a5e9e51ca5fca937d9417422a58a8569d81876a191ddb506a","last_reissued_at":"2026-05-18T02:59:48.728659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:48.728659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Round-Robin Tournament of the Iterated Prisoner's Dilemma with Complete Memory-Size-Three Strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.GT","authors_text":"Tobias Kretz","submitted_at":"2011-01-01T14:05:13Z","abstract_excerpt":"In this paper the results of a simulation of a prisoner's dilemma robin-round tournament are presented. In the tournament each participating strategy plays an iterated prisoner's dilemma against each other strategy (round-robin) and as a variant also against itself. The participants of a tournament are all strategies that are deterministic and have the same size of memory with regard to their own and their opponent's past actions: up to three most recent actions of their opponent and up to two most recent actions of their own. A focus is set on the investigation of the influence of the number "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0340","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":"1101.0340","created_at":"2026-05-18T02:59:48.728824+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.0340v1","created_at":"2026-05-18T02:59:48.728824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0340","created_at":"2026-05-18T02:59:48.728824+00:00"},{"alias_kind":"pith_short_12","alias_value":"STCQ2GHSF5MY","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"STCQ2GHSF5MYUXU6","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"STCQ2GHS","created_at":"2026-05-18T12:26:41.206345+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/STCQ2GHSF5MYUXU6KHFF7SUTPW","json":"https://pith.science/pith/STCQ2GHSF5MYUXU6KHFF7SUTPW.json","graph_json":"https://pith.science/api/pith-number/STCQ2GHSF5MYUXU6KHFF7SUTPW/graph.json","events_json":"https://pith.science/api/pith-number/STCQ2GHSF5MYUXU6KHFF7SUTPW/events.json","paper":"https://pith.science/paper/STCQ2GHS"},"agent_actions":{"view_html":"https://pith.science/pith/STCQ2GHSF5MYUXU6KHFF7SUTPW","download_json":"https://pith.science/pith/STCQ2GHSF5MYUXU6KHFF7SUTPW.json","view_paper":"https://pith.science/paper/STCQ2GHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.0340&json=true","fetch_graph":"https://pith.science/api/pith-number/STCQ2GHSF5MYUXU6KHFF7SUTPW/graph.json","fetch_events":"https://pith.science/api/pith-number/STCQ2GHSF5MYUXU6KHFF7SUTPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/STCQ2GHSF5MYUXU6KHFF7SUTPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/STCQ2GHSF5MYUXU6KHFF7SUTPW/action/storage_attestation","attest_author":"https://pith.science/pith/STCQ2GHSF5MYUXU6KHFF7SUTPW/action/author_attestation","sign_citation":"https://pith.science/pith/STCQ2GHSF5MYUXU6KHFF7SUTPW/action/citation_signature","submit_replication":"https://pith.science/pith/STCQ2GHSF5MYUXU6KHFF7SUTPW/action/replication_record"}},"created_at":"2026-05-18T02:59:48.728824+00:00","updated_at":"2026-05-18T02:59:48.728824+00:00"}