{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SH3APT4ELNNWMFZDM2VHK3INRG","short_pith_number":"pith:SH3APT4E","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"},"canonical_sha256":"91f607cf845b5b66172366aa756d0d89b764c64887465c6c548ce037512d8286","source":{"kind":"arxiv","id":"1207.6916","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6916","created_at":"2026-05-18T03:49:48Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6916v1","created_at":"2026-05-18T03:49:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6916","created_at":"2026-05-18T03:49:48Z"},{"alias_kind":"pith_short_12","alias_value":"SH3APT4ELNNW","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SH3APT4ELNNWMFZD","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SH3APT4E","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SH3APT4ELNNWMFZDM2VHK3INRG","target":"record","payload":{"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"},"canonical_sha256":"91f607cf845b5b66172366aa756d0d89b764c64887465c6c548ce037512d8286","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"},"source_kind":"arxiv","source_id":"1207.6916","source_version":1,"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-18T03:49:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QsYl4dQzNzX93MqPfrjdxw0FptRjrXpRA1KTc3C97M/fLfCiquoViK8aYzUT4HasdQPkqQLp+nE6iXhyXK5pCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:18:15.001098Z"},"content_sha256":"ecf2f4820bea3ec93e0fa1e3f22cbad32f7f05be50d11577aed895bdbf83648c","schema_version":"1.0","event_id":"sha256:ecf2f4820bea3ec93e0fa1e3f22cbad32f7f05be50d11577aed895bdbf83648c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SH3APT4ELNNWMFZDM2VHK3INRG","target":"graph","payload":{"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"},"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-18T03:49:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LAeAfM6aL1OFblnHwfUrlqEeBgsAMd4TTPwaGkDLUg7rAX/dV0q2DL4LSP3g4vd7yMdMO10mjiOl9bV2eWYDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:18:15.001466Z"},"content_sha256":"042a372f485662873d247a09280f21be9ff6a83a52f5932fa9d0a6d20db5e146","schema_version":"1.0","event_id":"sha256:042a372f485662873d247a09280f21be9ff6a83a52f5932fa9d0a6d20db5e146"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SH3APT4ELNNWMFZDM2VHK3INRG/bundle.json","state_url":"https://pith.science/pith/SH3APT4ELNNWMFZDM2VHK3INRG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SH3APT4ELNNWMFZDM2VHK3INRG/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-02T06:18:15Z","links":{"resolver":"https://pith.science/pith/SH3APT4ELNNWMFZDM2VHK3INRG","bundle":"https://pith.science/pith/SH3APT4ELNNWMFZDM2VHK3INRG/bundle.json","state":"https://pith.science/pith/SH3APT4ELNNWMFZDM2VHK3INRG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SH3APT4ELNNWMFZDM2VHK3INRG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SH3APT4ELNNWMFZDM2VHK3INRG","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":"d0b4b1120be1465261171070cf54b71f398b7242c6764fd6f123631f6dcaab6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2012-07-30T12:40:31Z","title_canon_sha256":"7ca18021ac1b55c9ed36e96381ff29c2d8f5a7a96ad62bf824af6c7d96f87ebb"},"schema_version":"1.0","source":{"id":"1207.6916","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6916","created_at":"2026-05-18T03:49:48Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6916v1","created_at":"2026-05-18T03:49:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6916","created_at":"2026-05-18T03:49:48Z"},{"alias_kind":"pith_short_12","alias_value":"SH3APT4ELNNW","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SH3APT4ELNNWMFZD","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SH3APT4E","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:042a372f485662873d247a09280f21be9ff6a83a52f5932fa9d0a6d20db5e146","target":"graph","created_at":"2026-05-18T03:49:48Z","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 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","authors_text":"Fabio Zanini, Richard A. Neher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2012-07-30T12:40:31Z","title":"FFPopSim: An efficient forward simulation package for the evolution of large populations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6916","kind":"arxiv","version":1},"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:ecf2f4820bea3ec93e0fa1e3f22cbad32f7f05be50d11577aed895bdbf83648c","target":"record","created_at":"2026-05-18T03:49:48Z","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":"d0b4b1120be1465261171070cf54b71f398b7242c6764fd6f123631f6dcaab6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2012-07-30T12:40:31Z","title_canon_sha256":"7ca18021ac1b55c9ed36e96381ff29c2d8f5a7a96ad62bf824af6c7d96f87ebb"},"schema_version":"1.0","source":{"id":"1207.6916","kind":"arxiv","version":1}},"canonical_sha256":"91f607cf845b5b66172366aa756d0d89b764c64887465c6c548ce037512d8286","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91f607cf845b5b66172366aa756d0d89b764c64887465c6c548ce037512d8286","first_computed_at":"2026-05-18T03:49:48.276756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:48.276756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"veq+DLQo9JaGra7k+h9e0olnNq4DKo8niAKGCSXCdFDkQDZCjBNIXNj7uG8xwDV2YdlepJS2Jfd4v3QxHDrqDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:48.277645Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.6916","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecf2f4820bea3ec93e0fa1e3f22cbad32f7f05be50d11577aed895bdbf83648c","sha256:042a372f485662873d247a09280f21be9ff6a83a52f5932fa9d0a6d20db5e146"],"state_sha256":"ea2dfaf728519331b242fc36b0d390d256da39c96d1a9d245d49b6e3eba39ea4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WMx+L7jVy/HSkeWsKLglR9q1UKE2I2gYjFzv7Gu22BUAH3hxQWUwgRQrvgLYgQR8eiHYOhKxW9o4CnZmWKhBBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:18:15.003854Z","bundle_sha256":"3b53accc02f3fa833becb391667fed5c04d216731eaca0cd3a1e4651bebb8f7a"}}