{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:A3PZEIB3QHA7VMJG7QCR4CVOZT","short_pith_number":"pith:A3PZEIB3","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"},"canonical_sha256":"06df92203b81c1fab126fc051e0aaeccf10c2ce448499e9a5224bc29025ae39d","source":{"kind":"arxiv","id":"1512.05632","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05632","created_at":"2026-05-18T01:15:35Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05632v2","created_at":"2026-05-18T01:15:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05632","created_at":"2026-05-18T01:15:35Z"},{"alias_kind":"pith_short_12","alias_value":"A3PZEIB3QHA7","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"A3PZEIB3QHA7VMJG","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"A3PZEIB3","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:A3PZEIB3QHA7VMJG7QCR4CVOZT","target":"record","payload":{"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"},"canonical_sha256":"06df92203b81c1fab126fc051e0aaeccf10c2ce448499e9a5224bc29025ae39d","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"},"source_kind":"arxiv","source_id":"1512.05632","source_version":2,"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-05-18T01:15:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"My19QAFIwyRvSE8cHJwz1dARKSBU4lDx1Q8tGUQorXT4cP0/vtcsW09AG3mTOhfgiYGO8svoQIGSmuJPntJjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:17:00.729759Z"},"content_sha256":"aaec56ac5ff3101fc81df0c522743d190862f4dc7b24ad8871eefe7cf5c28d90","schema_version":"1.0","event_id":"sha256:aaec56ac5ff3101fc81df0c522743d190862f4dc7b24ad8871eefe7cf5c28d90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:A3PZEIB3QHA7VMJG7QCR4CVOZT","target":"graph","payload":{"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"},"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-05-18T01:15:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v2wTWwTFTA/EOAHTBcrF+GG/RRzl6qvNRESw0OFDQwcuI2ySoFLoCPwCzMRqVQ9EYLlbQ78dMrYWP8wzGtIuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:17:00.730582Z"},"content_sha256":"0a33d00062312f7858caab83c5d3f1f2896b2605a00f27c98cf8402224a3261e","schema_version":"1.0","event_id":"sha256:0a33d00062312f7858caab83c5d3f1f2896b2605a00f27c98cf8402224a3261e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A3PZEIB3QHA7VMJG7QCR4CVOZT/bundle.json","state_url":"https://pith.science/pith/A3PZEIB3QHA7VMJG7QCR4CVOZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A3PZEIB3QHA7VMJG7QCR4CVOZT/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-06-08T16:17:00Z","links":{"resolver":"https://pith.science/pith/A3PZEIB3QHA7VMJG7QCR4CVOZT","bundle":"https://pith.science/pith/A3PZEIB3QHA7VMJG7QCR4CVOZT/bundle.json","state":"https://pith.science/pith/A3PZEIB3QHA7VMJG7QCR4CVOZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A3PZEIB3QHA7VMJG7QCR4CVOZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:A3PZEIB3QHA7VMJG7QCR4CVOZT","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":"57a89d52742221d909dbcc381e238d374c1be8c037d21e2d3eadd7ba6f63e3f2","cross_cats_sorted":["cs.DM","cs.SI","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-17T15:38:25Z","title_canon_sha256":"60406bbdcfadb53cda0f1e987b3e41dd76054f1d102358bb99dc697d0b8738f8"},"schema_version":"1.0","source":{"id":"1512.05632","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05632","created_at":"2026-05-18T01:15:35Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05632v2","created_at":"2026-05-18T01:15:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05632","created_at":"2026-05-18T01:15:35Z"},{"alias_kind":"pith_short_12","alias_value":"A3PZEIB3QHA7","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"A3PZEIB3QHA7VMJG","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"A3PZEIB3","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:0a33d00062312f7858caab83c5d3f1f2896b2605a00f27c98cf8402224a3261e","target":"graph","created_at":"2026-05-18T01:15:35Z","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"},"paper":{"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","authors_text":"Andreas Galanis, Andreas G\\\"obel, David Richerby, John Lapinskas, Leslie Ann Goldberg","cross_cats":["cs.DM","cs.SI","q-bio.PE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-17T15:38:25Z","title":"Amplifiers for the Moran Process"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05632","kind":"arxiv","version":2},"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:aaec56ac5ff3101fc81df0c522743d190862f4dc7b24ad8871eefe7cf5c28d90","target":"record","created_at":"2026-05-18T01:15:35Z","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":"57a89d52742221d909dbcc381e238d374c1be8c037d21e2d3eadd7ba6f63e3f2","cross_cats_sorted":["cs.DM","cs.SI","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-17T15:38:25Z","title_canon_sha256":"60406bbdcfadb53cda0f1e987b3e41dd76054f1d102358bb99dc697d0b8738f8"},"schema_version":"1.0","source":{"id":"1512.05632","kind":"arxiv","version":2}},"canonical_sha256":"06df92203b81c1fab126fc051e0aaeccf10c2ce448499e9a5224bc29025ae39d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06df92203b81c1fab126fc051e0aaeccf10c2ce448499e9a5224bc29025ae39d","first_computed_at":"2026-05-18T01:15:35.951733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:35.951733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K6EUevT/gi2fA/m7YGtdGnlR0Junnq8BtX2/WQZ+AM4MS2Y3o/AMRsDd2QME+Hx8vav0g48mkTTlZeeXljPUCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:35.952359Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.05632","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aaec56ac5ff3101fc81df0c522743d190862f4dc7b24ad8871eefe7cf5c28d90","sha256:0a33d00062312f7858caab83c5d3f1f2896b2605a00f27c98cf8402224a3261e"],"state_sha256":"007b5112f85cf3fbd79939e9b51a22b18a18721a1ae390eec63550406f69c7d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uxbuLPTcY+NFpQFbhNeXaykc+qpdflrrrjVTaDZokAo7u6kQn5D5o3fP3bDhbZhOqh2uMq4RvcZL8Nr3j+acAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:17:00.734819Z","bundle_sha256":"fef5bd40cec1c9573feb0db075db91da515c4b9f1fee4a570f3cdf5d8c7266c9"}}