{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:A3PZEIB3QHA7VMJG7QCR4CVOZT","short_pith_number":"pith:A3PZEIB3","schema_version":"1.0","canonical_sha256":"06df92203b81c1fab126fc051e0aaeccf10c2ce448499e9a5224bc29025ae39d","source":{"kind":"arxiv","id":"1512.05632","version":2},"attestation_state":"computed","paper":{"title":"Amplifiers for the Moran Process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","q-bio.PE"],"primary_cat":"math.PR","authors_text":"Andreas Galanis, Andreas G\\\"obel, David Richerby, John Lapinskas, Leslie Ann Goldberg","submitted_at":"2015-12-17T15:38:25Z","abstract_excerpt":"The Moran process, as studied by Lieberman, Hauert and Nowak, is a randomised algorithm modelling the spread of genetic mutations in populations. The algorithm runs on an underlying graph where individuals correspond to vertices. Initially, one vertex (chosen u.a.r.) possesses a mutation, with fitness r>1. All other individuals have fitness 1. During each step of the algorithm, an individual is chosen with probability proportional to its fitness, and its state (mutant or non-mutant) is passed on to an out-neighbour which is chosen u.a.r. If the underlying graph is strongly connected then the a"},"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":"1512.05632","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-17T15:38:25Z","cross_cats_sorted":["cs.DM","cs.SI","q-bio.PE"],"title_canon_sha256":"60406bbdcfadb53cda0f1e987b3e41dd76054f1d102358bb99dc697d0b8738f8","abstract_canon_sha256":"57a89d52742221d909dbcc381e238d374c1be8c037d21e2d3eadd7ba6f63e3f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:35.952359Z","signature_b64":"K6EUevT/gi2fA/m7YGtdGnlR0Junnq8BtX2/WQZ+AM4MS2Y3o/AMRsDd2QME+Hx8vav0g48mkTTlZeeXljPUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06df92203b81c1fab126fc051e0aaeccf10c2ce448499e9a5224bc29025ae39d","last_reissued_at":"2026-05-18T01:15:35.951733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:35.951733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Amplifiers for the Moran Process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","q-bio.PE"],"primary_cat":"math.PR","authors_text":"Andreas Galanis, Andreas G\\\"obel, David Richerby, John Lapinskas, Leslie Ann Goldberg","submitted_at":"2015-12-17T15:38:25Z","abstract_excerpt":"The Moran process, as studied by Lieberman, Hauert and Nowak, is a randomised algorithm modelling the spread of genetic mutations in populations. The algorithm runs on an underlying graph where individuals correspond to vertices. Initially, one vertex (chosen u.a.r.) possesses a mutation, with fitness r>1. All other individuals have fitness 1. During each step of the algorithm, an individual is chosen with probability proportional to its fitness, and its state (mutant or non-mutant) is passed on to an out-neighbour which is chosen u.a.r. If the underlying graph is strongly connected then the a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05632","kind":"arxiv","version":2},"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":"1512.05632","created_at":"2026-05-18T01:15:35.951817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.05632v2","created_at":"2026-05-18T01:15:35.951817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05632","created_at":"2026-05-18T01:15:35.951817+00:00"},{"alias_kind":"pith_short_12","alias_value":"A3PZEIB3QHA7","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"A3PZEIB3QHA7VMJG","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"A3PZEIB3","created_at":"2026-05-18T12:29:10.953037+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/A3PZEIB3QHA7VMJG7QCR4CVOZT","json":"https://pith.science/pith/A3PZEIB3QHA7VMJG7QCR4CVOZT.json","graph_json":"https://pith.science/api/pith-number/A3PZEIB3QHA7VMJG7QCR4CVOZT/graph.json","events_json":"https://pith.science/api/pith-number/A3PZEIB3QHA7VMJG7QCR4CVOZT/events.json","paper":"https://pith.science/paper/A3PZEIB3"},"agent_actions":{"view_html":"https://pith.science/pith/A3PZEIB3QHA7VMJG7QCR4CVOZT","download_json":"https://pith.science/pith/A3PZEIB3QHA7VMJG7QCR4CVOZT.json","view_paper":"https://pith.science/paper/A3PZEIB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.05632&json=true","fetch_graph":"https://pith.science/api/pith-number/A3PZEIB3QHA7VMJG7QCR4CVOZT/graph.json","fetch_events":"https://pith.science/api/pith-number/A3PZEIB3QHA7VMJG7QCR4CVOZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A3PZEIB3QHA7VMJG7QCR4CVOZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A3PZEIB3QHA7VMJG7QCR4CVOZT/action/storage_attestation","attest_author":"https://pith.science/pith/A3PZEIB3QHA7VMJG7QCR4CVOZT/action/author_attestation","sign_citation":"https://pith.science/pith/A3PZEIB3QHA7VMJG7QCR4CVOZT/action/citation_signature","submit_replication":"https://pith.science/pith/A3PZEIB3QHA7VMJG7QCR4CVOZT/action/replication_record"}},"created_at":"2026-05-18T01:15:35.951817+00:00","updated_at":"2026-05-18T01:15:35.951817+00:00"}