{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:W7DTTA74MBE5FQQ643V4AMHF2D","short_pith_number":"pith:W7DTTA74","schema_version":"1.0","canonical_sha256":"b7c73983fc6049d2c21ee6ebc030e5d0ed74834fc3bca2a41a846097c2a65d6d","source":{"kind":"arxiv","id":"1411.4145","version":1},"attestation_state":"computed","paper":{"title":"Evolutionary Games on Graphs and Discrete Dynamical Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Jeremias Epperlein, Petr Stehl\\'ik, Stefan Siegmund","submitted_at":"2014-11-15T13:43:06Z","abstract_excerpt":"Evolutionary games on graphs play an important role in the study of evolution of cooperation in applied biology. Using rigorous mathematical concepts from a dynamical systems and graph theoretical point of view, we formalize the notions of attractor, update rules and update orders. We prove results on attractors for different utility functions and update orders. For complete graphs we characterize attractors for synchronous and sequential update rules. In other cases (for $k$-regular graphs or for different update orders) we provide sufficient conditions for attractivity of full cooperation an"},"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":"1411.4145","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2014-11-15T13:43:06Z","cross_cats_sorted":[],"title_canon_sha256":"ab22a5b7f738d006e980d4f98ec2876f79491f2f6f399e45fc18f8c9ba2d925a","abstract_canon_sha256":"c0a741e04b9b619ecf0546a1e23cc0757f8e8e24e201635a96ce961c5655d2fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:46.396683Z","signature_b64":"/x/qFEMUBbdBo2Tjbu/WV9krO14juFLXifsuIdwralElnzLjE5pHbz5MdfNxPRAaW172zU4CW7+Bnr+ZN7MSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7c73983fc6049d2c21ee6ebc030e5d0ed74834fc3bca2a41a846097c2a65d6d","last_reissued_at":"2026-05-18T02:35:46.396136Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:46.396136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evolutionary Games on Graphs and Discrete Dynamical Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Jeremias Epperlein, Petr Stehl\\'ik, Stefan Siegmund","submitted_at":"2014-11-15T13:43:06Z","abstract_excerpt":"Evolutionary games on graphs play an important role in the study of evolution of cooperation in applied biology. Using rigorous mathematical concepts from a dynamical systems and graph theoretical point of view, we formalize the notions of attractor, update rules and update orders. We prove results on attractors for different utility functions and update orders. For complete graphs we characterize attractors for synchronous and sequential update rules. In other cases (for $k$-regular graphs or for different update orders) we provide sufficient conditions for attractivity of full cooperation an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4145","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":"1411.4145","created_at":"2026-05-18T02:35:46.396213+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.4145v1","created_at":"2026-05-18T02:35:46.396213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4145","created_at":"2026-05-18T02:35:46.396213+00:00"},{"alias_kind":"pith_short_12","alias_value":"W7DTTA74MBE5","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"W7DTTA74MBE5FQQ6","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"W7DTTA74","created_at":"2026-05-18T12:28:54.890064+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/W7DTTA74MBE5FQQ643V4AMHF2D","json":"https://pith.science/pith/W7DTTA74MBE5FQQ643V4AMHF2D.json","graph_json":"https://pith.science/api/pith-number/W7DTTA74MBE5FQQ643V4AMHF2D/graph.json","events_json":"https://pith.science/api/pith-number/W7DTTA74MBE5FQQ643V4AMHF2D/events.json","paper":"https://pith.science/paper/W7DTTA74"},"agent_actions":{"view_html":"https://pith.science/pith/W7DTTA74MBE5FQQ643V4AMHF2D","download_json":"https://pith.science/pith/W7DTTA74MBE5FQQ643V4AMHF2D.json","view_paper":"https://pith.science/paper/W7DTTA74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.4145&json=true","fetch_graph":"https://pith.science/api/pith-number/W7DTTA74MBE5FQQ643V4AMHF2D/graph.json","fetch_events":"https://pith.science/api/pith-number/W7DTTA74MBE5FQQ643V4AMHF2D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W7DTTA74MBE5FQQ643V4AMHF2D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W7DTTA74MBE5FQQ643V4AMHF2D/action/storage_attestation","attest_author":"https://pith.science/pith/W7DTTA74MBE5FQQ643V4AMHF2D/action/author_attestation","sign_citation":"https://pith.science/pith/W7DTTA74MBE5FQQ643V4AMHF2D/action/citation_signature","submit_replication":"https://pith.science/pith/W7DTTA74MBE5FQQ643V4AMHF2D/action/replication_record"}},"created_at":"2026-05-18T02:35:46.396213+00:00","updated_at":"2026-05-18T02:35:46.396213+00:00"}