{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:3KBNVNUVIEP3JTUEQCJQQ3YEFS","short_pith_number":"pith:3KBNVNUV","canonical_record":{"source":{"id":"0901.3233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2009-01-21T10:58:14Z","cross_cats_sorted":[],"title_canon_sha256":"cea6bd948f8094b69c3aff85d83e2c50424fa09942baf4a9f2e7c04d78617c70","abstract_canon_sha256":"f664a83086374a130d4f7e2942908c96148005fa57f453723301b6705519f10f"},"schema_version":"1.0"},"canonical_sha256":"da82dab695411fb4ce848093086f042ca3fd334753ff8359f45046ea4512fc03","source":{"kind":"arxiv","id":"0901.3233","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.3233","created_at":"2026-05-18T03:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"0901.3233v1","created_at":"2026-05-18T03:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.3233","created_at":"2026-05-18T03:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"3KBNVNUVIEP3","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"3KBNVNUVIEP3JTUE","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"3KBNVNUV","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:3KBNVNUVIEP3JTUEQCJQQ3YEFS","target":"record","payload":{"canonical_record":{"source":{"id":"0901.3233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2009-01-21T10:58:14Z","cross_cats_sorted":[],"title_canon_sha256":"cea6bd948f8094b69c3aff85d83e2c50424fa09942baf4a9f2e7c04d78617c70","abstract_canon_sha256":"f664a83086374a130d4f7e2942908c96148005fa57f453723301b6705519f10f"},"schema_version":"1.0"},"canonical_sha256":"da82dab695411fb4ce848093086f042ca3fd334753ff8359f45046ea4512fc03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:52.714877Z","signature_b64":"vpf0TsRrgwlv3gjBAEK7URWY9DPSdI6lz6uW7hA+lmC5CXoT9cCOaLAU36ZEe2Rx6g17rUOu3ZB+S1JAVkC9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da82dab695411fb4ce848093086f042ca3fd334753ff8359f45046ea4512fc03","last_reissued_at":"2026-05-18T03:53:52.714192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:52.714192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0901.3233","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:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hopNHpk3nXpljv22oqW+h9zRrAEcijFLJNuKLN9CzNS5NoFqn/lZC0Cg2h+O0ylJ27AJkL+I2MoO6PfQR/icAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:35:26.818616Z"},"content_sha256":"92bbb140e72426b740429dbb088184d1fbd638bc5654925b822476071dc3d55d","schema_version":"1.0","event_id":"sha256:92bbb140e72426b740429dbb088184d1fbd638bc5654925b822476071dc3d55d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:3KBNVNUVIEP3JTUEQCJQQ3YEFS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple paternity: determining the minimum number of sires of a large brood","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.PE","authors_text":"A. Eriksson, B. Mehlig, C. Andre, K. Johannesson, M. Panova","submitted_at":"2009-01-21T10:58:14Z","abstract_excerpt":"We describe an efficient algorithm for determining exactly the minimum number of sires consistent with the multi-locus genotypes of a mother and her progeny. We consider cases where a simple exhaustive search through all possible sets of sires is impossible in practice (because it would take too long to complete). Our algorithm for solving this combinatorial optimisation problem avoids visiting large parts of search space which would not improve the solution found so far (i.e., result in a solution with fewer number of sires). This is of particular importance when the number of allelic types i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.3233","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:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pDnl/OPvBj8yy3wSvxPGBgX7lsPJp4bvSvpXAhnBaDv9WejDFWlAaL1UASwnPb8QbkzzmaUjUoLURfIbJRPSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:35:26.818966Z"},"content_sha256":"6a5662e4c3f7e1d3e37c38f61c8a73e1430821090cbabb6e5eb63344589296ea","schema_version":"1.0","event_id":"sha256:6a5662e4c3f7e1d3e37c38f61c8a73e1430821090cbabb6e5eb63344589296ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3KBNVNUVIEP3JTUEQCJQQ3YEFS/bundle.json","state_url":"https://pith.science/pith/3KBNVNUVIEP3JTUEQCJQQ3YEFS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3KBNVNUVIEP3JTUEQCJQQ3YEFS/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-05-28T12:35:26Z","links":{"resolver":"https://pith.science/pith/3KBNVNUVIEP3JTUEQCJQQ3YEFS","bundle":"https://pith.science/pith/3KBNVNUVIEP3JTUEQCJQQ3YEFS/bundle.json","state":"https://pith.science/pith/3KBNVNUVIEP3JTUEQCJQQ3YEFS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3KBNVNUVIEP3JTUEQCJQQ3YEFS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:3KBNVNUVIEP3JTUEQCJQQ3YEFS","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":"f664a83086374a130d4f7e2942908c96148005fa57f453723301b6705519f10f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2009-01-21T10:58:14Z","title_canon_sha256":"cea6bd948f8094b69c3aff85d83e2c50424fa09942baf4a9f2e7c04d78617c70"},"schema_version":"1.0","source":{"id":"0901.3233","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.3233","created_at":"2026-05-18T03:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"0901.3233v1","created_at":"2026-05-18T03:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.3233","created_at":"2026-05-18T03:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"3KBNVNUVIEP3","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"3KBNVNUVIEP3JTUE","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"3KBNVNUV","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:6a5662e4c3f7e1d3e37c38f61c8a73e1430821090cbabb6e5eb63344589296ea","target":"graph","created_at":"2026-05-18T03:53:52Z","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":"We describe an efficient algorithm for determining exactly the minimum number of sires consistent with the multi-locus genotypes of a mother and her progeny. We consider cases where a simple exhaustive search through all possible sets of sires is impossible in practice (because it would take too long to complete). Our algorithm for solving this combinatorial optimisation problem avoids visiting large parts of search space which would not improve the solution found so far (i.e., result in a solution with fewer number of sires). This is of particular importance when the number of allelic types i","authors_text":"A. Eriksson, B. Mehlig, C. Andre, K. Johannesson, M. Panova","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2009-01-21T10:58:14Z","title":"Multiple paternity: determining the minimum number of sires of a large brood"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.3233","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:92bbb140e72426b740429dbb088184d1fbd638bc5654925b822476071dc3d55d","target":"record","created_at":"2026-05-18T03:53:52Z","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":"f664a83086374a130d4f7e2942908c96148005fa57f453723301b6705519f10f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.PE","submitted_at":"2009-01-21T10:58:14Z","title_canon_sha256":"cea6bd948f8094b69c3aff85d83e2c50424fa09942baf4a9f2e7c04d78617c70"},"schema_version":"1.0","source":{"id":"0901.3233","kind":"arxiv","version":1}},"canonical_sha256":"da82dab695411fb4ce848093086f042ca3fd334753ff8359f45046ea4512fc03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da82dab695411fb4ce848093086f042ca3fd334753ff8359f45046ea4512fc03","first_computed_at":"2026-05-18T03:53:52.714192Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:52.714192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vpf0TsRrgwlv3gjBAEK7URWY9DPSdI6lz6uW7hA+lmC5CXoT9cCOaLAU36ZEe2Rx6g17rUOu3ZB+S1JAVkC9AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:52.714877Z","signed_message":"canonical_sha256_bytes"},"source_id":"0901.3233","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92bbb140e72426b740429dbb088184d1fbd638bc5654925b822476071dc3d55d","sha256:6a5662e4c3f7e1d3e37c38f61c8a73e1430821090cbabb6e5eb63344589296ea"],"state_sha256":"aeaf2eab0285ec870e4c1abd3d4a1c964d9333b10baedab2dc8f1cf00d0e9d71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wEj0aViSOwP2YxUakE2/XsVf/PfAP417LqdAs6FoktPw1c2x6sGgiFN/aQ52Uy7naXq9jCG4Y7HM4jwLIhemCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:35:26.820914Z","bundle_sha256":"4507943cffad2b42c97de14acec864b7ffbc47ab7bda7085a910460a02cf962c"}}