{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ID64CHUEKALOM6L2YDG4IWNF4K","short_pith_number":"pith:ID64CHUE","schema_version":"1.0","canonical_sha256":"40fdc11e845016e6797ac0cdc459a5e2b1f16c8664df2b15e573a9a138f9e45b","source":{"kind":"arxiv","id":"1503.08481","version":1},"attestation_state":"computed","paper":{"title":"Smale Strategies for Network Prisoner's Dilemma Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","math.PR"],"primary_cat":"math.OC","authors_text":"Kashi Behrstock, Michel Bena\\\"im, Morris W. Hirsch","submitted_at":"2015-03-29T19:10:46Z","abstract_excerpt":"Smale's approach \\cite{Smale80} to the classical two-players repeated Prisoner's Dilemma game is revisited here for $N$-players and Network games in the framework of Blackwell's approachability, stochastic approximations and differential inclusions."},"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":"1503.08481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-29T19:10:46Z","cross_cats_sorted":["math.DS","math.PR"],"title_canon_sha256":"db6e5268cdc579298f81d2034e7bfc2450c5e4c1120832bbc8b14917498d59d0","abstract_canon_sha256":"35405011eb19469986ea08f23dba32d6853e9d3829421045ef8f336e8dd9d711"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:33.187508Z","signature_b64":"nxODkVeVymmO9dkVmvHSyO7uBjM1hIw+mVxJYupRD04kkB7zp+opHZnEmtSkH5PlXxsZ/lc8g7FiysnHf1hADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40fdc11e845016e6797ac0cdc459a5e2b1f16c8664df2b15e573a9a138f9e45b","last_reissued_at":"2026-05-18T01:17:33.186916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:33.186916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smale Strategies for Network Prisoner's Dilemma Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","math.PR"],"primary_cat":"math.OC","authors_text":"Kashi Behrstock, Michel Bena\\\"im, Morris W. Hirsch","submitted_at":"2015-03-29T19:10:46Z","abstract_excerpt":"Smale's approach \\cite{Smale80} to the classical two-players repeated Prisoner's Dilemma game is revisited here for $N$-players and Network games in the framework of Blackwell's approachability, stochastic approximations and differential inclusions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08481","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":"1503.08481","created_at":"2026-05-18T01:17:33.187000+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.08481v1","created_at":"2026-05-18T01:17:33.187000+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08481","created_at":"2026-05-18T01:17:33.187000+00:00"},{"alias_kind":"pith_short_12","alias_value":"ID64CHUEKALO","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"ID64CHUEKALOM6L2","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"ID64CHUE","created_at":"2026-05-18T12:29:25.134429+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/ID64CHUEKALOM6L2YDG4IWNF4K","json":"https://pith.science/pith/ID64CHUEKALOM6L2YDG4IWNF4K.json","graph_json":"https://pith.science/api/pith-number/ID64CHUEKALOM6L2YDG4IWNF4K/graph.json","events_json":"https://pith.science/api/pith-number/ID64CHUEKALOM6L2YDG4IWNF4K/events.json","paper":"https://pith.science/paper/ID64CHUE"},"agent_actions":{"view_html":"https://pith.science/pith/ID64CHUEKALOM6L2YDG4IWNF4K","download_json":"https://pith.science/pith/ID64CHUEKALOM6L2YDG4IWNF4K.json","view_paper":"https://pith.science/paper/ID64CHUE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.08481&json=true","fetch_graph":"https://pith.science/api/pith-number/ID64CHUEKALOM6L2YDG4IWNF4K/graph.json","fetch_events":"https://pith.science/api/pith-number/ID64CHUEKALOM6L2YDG4IWNF4K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ID64CHUEKALOM6L2YDG4IWNF4K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ID64CHUEKALOM6L2YDG4IWNF4K/action/storage_attestation","attest_author":"https://pith.science/pith/ID64CHUEKALOM6L2YDG4IWNF4K/action/author_attestation","sign_citation":"https://pith.science/pith/ID64CHUEKALOM6L2YDG4IWNF4K/action/citation_signature","submit_replication":"https://pith.science/pith/ID64CHUEKALOM6L2YDG4IWNF4K/action/replication_record"}},"created_at":"2026-05-18T01:17:33.187000+00:00","updated_at":"2026-05-18T01:17:33.187000+00:00"}