{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SH3APT4ELNNWMFZDM2VHK3INRG","short_pith_number":"pith:SH3APT4E","schema_version":"1.0","canonical_sha256":"91f607cf845b5b66172366aa756d0d89b764c64887465c6c548ce037512d8286","source":{"kind":"arxiv","id":"1207.6916","version":1},"attestation_state":"computed","paper":{"title":"FFPopSim: An efficient forward simulation package for the evolution of large populations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"Fabio Zanini, Richard A. Neher","submitted_at":"2012-07-30T12:40:31Z","abstract_excerpt":"The analysis of the evolutionary dynamics of a population with many polymorphic loci is challenging since a large number of possible genotypes needs to be tracked. In the absence of analytical solutions, forward computer simulations are an important tool in multi-locus population genetics. The run time of standard algorithms to simulate sexual populations increases as 8^L with the number L of loci, or with the square of the population size N. We have developed algorithms that allow to simulate large populations with a run-time that scales as 3^L. The algorithm is based on an analog of the Fast"},"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":"1207.6916","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2012-07-30T12:40:31Z","cross_cats_sorted":[],"title_canon_sha256":"7ca18021ac1b55c9ed36e96381ff29c2d8f5a7a96ad62bf824af6c7d96f87ebb","abstract_canon_sha256":"d0b4b1120be1465261171070cf54b71f398b7242c6764fd6f123631f6dcaab6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:48.277645Z","signature_b64":"veq+DLQo9JaGra7k+h9e0olnNq4DKo8niAKGCSXCdFDkQDZCjBNIXNj7uG8xwDV2YdlepJS2Jfd4v3QxHDrqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91f607cf845b5b66172366aa756d0d89b764c64887465c6c548ce037512d8286","last_reissued_at":"2026-05-18T03:49:48.276756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:48.276756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FFPopSim: An efficient forward simulation package for the evolution of large populations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"Fabio Zanini, Richard A. Neher","submitted_at":"2012-07-30T12:40:31Z","abstract_excerpt":"The analysis of the evolutionary dynamics of a population with many polymorphic loci is challenging since a large number of possible genotypes needs to be tracked. In the absence of analytical solutions, forward computer simulations are an important tool in multi-locus population genetics. The run time of standard algorithms to simulate sexual populations increases as 8^L with the number L of loci, or with the square of the population size N. We have developed algorithms that allow to simulate large populations with a run-time that scales as 3^L. The algorithm is based on an analog of the Fast"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6916","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":"1207.6916","created_at":"2026-05-18T03:49:48.276897+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.6916v1","created_at":"2026-05-18T03:49:48.276897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6916","created_at":"2026-05-18T03:49:48.276897+00:00"},{"alias_kind":"pith_short_12","alias_value":"SH3APT4ELNNW","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SH3APT4ELNNWMFZD","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SH3APT4E","created_at":"2026-05-18T12:27:20.899486+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/SH3APT4ELNNWMFZDM2VHK3INRG","json":"https://pith.science/pith/SH3APT4ELNNWMFZDM2VHK3INRG.json","graph_json":"https://pith.science/api/pith-number/SH3APT4ELNNWMFZDM2VHK3INRG/graph.json","events_json":"https://pith.science/api/pith-number/SH3APT4ELNNWMFZDM2VHK3INRG/events.json","paper":"https://pith.science/paper/SH3APT4E"},"agent_actions":{"view_html":"https://pith.science/pith/SH3APT4ELNNWMFZDM2VHK3INRG","download_json":"https://pith.science/pith/SH3APT4ELNNWMFZDM2VHK3INRG.json","view_paper":"https://pith.science/paper/SH3APT4E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.6916&json=true","fetch_graph":"https://pith.science/api/pith-number/SH3APT4ELNNWMFZDM2VHK3INRG/graph.json","fetch_events":"https://pith.science/api/pith-number/SH3APT4ELNNWMFZDM2VHK3INRG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SH3APT4ELNNWMFZDM2VHK3INRG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SH3APT4ELNNWMFZDM2VHK3INRG/action/storage_attestation","attest_author":"https://pith.science/pith/SH3APT4ELNNWMFZDM2VHK3INRG/action/author_attestation","sign_citation":"https://pith.science/pith/SH3APT4ELNNWMFZDM2VHK3INRG/action/citation_signature","submit_replication":"https://pith.science/pith/SH3APT4ELNNWMFZDM2VHK3INRG/action/replication_record"}},"created_at":"2026-05-18T03:49:48.276897+00:00","updated_at":"2026-05-18T03:49:48.276897+00:00"}