{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:UFAYBXD7I2S5YZJUPO2EHOCTUW","short_pith_number":"pith:UFAYBXD7","canonical_record":{"source":{"id":"q-bio/0508012","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"q-bio.GN","submitted_at":"2005-08-11T13:45:03Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"96db760b3b77da8425c34fb912171c03c58f17d99a912edccecb279a90a6c1ef","abstract_canon_sha256":"8009a4a198089effd69f05d7196be5f6737f2a80285cb5faa33b69995ecb5a86"},"schema_version":"1.0"},"canonical_sha256":"a14180dc7f46a5dc65347bb443b853a5a8758b0af629c62f5e809e0063c60ec4","source":{"kind":"arxiv","id":"q-bio/0508012","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"q-bio/0508012","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"q-bio/0508012v2","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.q-bio/0508012","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"UFAYBXD7I2S5","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"UFAYBXD7I2S5YZJU","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"UFAYBXD7","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:UFAYBXD7I2S5YZJUPO2EHOCTUW","target":"record","payload":{"canonical_record":{"source":{"id":"q-bio/0508012","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"q-bio.GN","submitted_at":"2005-08-11T13:45:03Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"96db760b3b77da8425c34fb912171c03c58f17d99a912edccecb279a90a6c1ef","abstract_canon_sha256":"8009a4a198089effd69f05d7196be5f6737f2a80285cb5faa33b69995ecb5a86"},"schema_version":"1.0"},"canonical_sha256":"a14180dc7f46a5dc65347bb443b853a5a8758b0af629c62f5e809e0063c60ec4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:26.374658Z","signature_b64":"zqRXao4JUgPqRQGPuuBHrOLiEyxkn1V0AVl8tQWDuq0Nh6pCCXmGv6PdM6dWbgP52PIZUFkqqE1kWwW4+iIQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a14180dc7f46a5dc65347bb443b853a5a8758b0af629c62f5e809e0063c60ec4","last_reissued_at":"2026-05-18T00:58:26.374130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:26.374130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"q-bio/0508012","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-18T00:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A1G/G1e8vvDv0DKaCF5e+z5xTZ1kzR7nHukBhdzIRggyyJNTIO3Sd1bXqlKXxE9v98GSAoaswPlW6pNkITR6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T14:42:31.761385Z"},"content_sha256":"34e89fccfc533b019f05dd480416e1394fa32f0e2ac0d4284b0b88959a906723","schema_version":"1.0","event_id":"sha256:34e89fccfc533b019f05dd480416e1394fa32f0e2ac0d4284b0b88959a906723"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:UFAYBXD7I2S5YZJUPO2EHOCTUW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of the Single Individual SNP Haplotyping Problem","license":"","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"q-bio.GN","authors_text":"John Tromp, Leo van Iersel, Rudi Cilibrasi, Steven Kelk","submitted_at":"2005-08-11T13:45:03Z","abstract_excerpt":"We present several new results pertaining to haplotyping. These results concern the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfectly sequenced haplotype fragments. We consider the complexity of the problems Minimum Error Correction (MEC) and Longest Haplotype Reconstruction (LHR) for different restrictions on the input data. Specifically, we look at the gapless case, where every row of the input corresponds to a gapless haplotype-fragment, and the 1-gap case, where at most one gap per fragment is allowed. We prove that MEC is APX-hard in the 1-gap case and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"q-bio/0508012","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-18T00:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O8BqEcTmpvLf7zozNHPW4Fvymmo7ZnOC1qjKuKNKCds9aCzLu1BzZ9PhnEf6OscGgOEP371sF2XuS1JrxPVTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T14:42:31.761741Z"},"content_sha256":"6a3c177aab860c5e73228fd73082b10a6138750b9c8481b7fb8671f447b0d2e4","schema_version":"1.0","event_id":"sha256:6a3c177aab860c5e73228fd73082b10a6138750b9c8481b7fb8671f447b0d2e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UFAYBXD7I2S5YZJUPO2EHOCTUW/bundle.json","state_url":"https://pith.science/pith/UFAYBXD7I2S5YZJUPO2EHOCTUW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UFAYBXD7I2S5YZJUPO2EHOCTUW/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-21T14:42:31Z","links":{"resolver":"https://pith.science/pith/UFAYBXD7I2S5YZJUPO2EHOCTUW","bundle":"https://pith.science/pith/UFAYBXD7I2S5YZJUPO2EHOCTUW/bundle.json","state":"https://pith.science/pith/UFAYBXD7I2S5YZJUPO2EHOCTUW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UFAYBXD7I2S5YZJUPO2EHOCTUW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:UFAYBXD7I2S5YZJUPO2EHOCTUW","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":"8009a4a198089effd69f05d7196be5f6737f2a80285cb5faa33b69995ecb5a86","cross_cats_sorted":["q-bio.QM"],"license":"","primary_cat":"q-bio.GN","submitted_at":"2005-08-11T13:45:03Z","title_canon_sha256":"96db760b3b77da8425c34fb912171c03c58f17d99a912edccecb279a90a6c1ef"},"schema_version":"1.0","source":{"id":"q-bio/0508012","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"q-bio/0508012","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"q-bio/0508012v2","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.q-bio/0508012","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"UFAYBXD7I2S5","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"UFAYBXD7I2S5YZJU","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"UFAYBXD7","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:6a3c177aab860c5e73228fd73082b10a6138750b9c8481b7fb8671f447b0d2e4","target":"graph","created_at":"2026-05-18T00:58:26Z","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 present several new results pertaining to haplotyping. These results concern the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfectly sequenced haplotype fragments. We consider the complexity of the problems Minimum Error Correction (MEC) and Longest Haplotype Reconstruction (LHR) for different restrictions on the input data. Specifically, we look at the gapless case, where every row of the input corresponds to a gapless haplotype-fragment, and the 1-gap case, where at most one gap per fragment is allowed. We prove that MEC is APX-hard in the 1-gap case and ","authors_text":"John Tromp, Leo van Iersel, Rudi Cilibrasi, Steven Kelk","cross_cats":["q-bio.QM"],"headline":"","license":"","primary_cat":"q-bio.GN","submitted_at":"2005-08-11T13:45:03Z","title":"On the Complexity of the Single Individual SNP Haplotyping Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"q-bio/0508012","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:34e89fccfc533b019f05dd480416e1394fa32f0e2ac0d4284b0b88959a906723","target":"record","created_at":"2026-05-18T00:58:26Z","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":"8009a4a198089effd69f05d7196be5f6737f2a80285cb5faa33b69995ecb5a86","cross_cats_sorted":["q-bio.QM"],"license":"","primary_cat":"q-bio.GN","submitted_at":"2005-08-11T13:45:03Z","title_canon_sha256":"96db760b3b77da8425c34fb912171c03c58f17d99a912edccecb279a90a6c1ef"},"schema_version":"1.0","source":{"id":"q-bio/0508012","kind":"arxiv","version":2}},"canonical_sha256":"a14180dc7f46a5dc65347bb443b853a5a8758b0af629c62f5e809e0063c60ec4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a14180dc7f46a5dc65347bb443b853a5a8758b0af629c62f5e809e0063c60ec4","first_computed_at":"2026-05-18T00:58:26.374130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:26.374130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zqRXao4JUgPqRQGPuuBHrOLiEyxkn1V0AVl8tQWDuq0Nh6pCCXmGv6PdM6dWbgP52PIZUFkqqE1kWwW4+iIQAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:26.374658Z","signed_message":"canonical_sha256_bytes"},"source_id":"q-bio/0508012","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34e89fccfc533b019f05dd480416e1394fa32f0e2ac0d4284b0b88959a906723","sha256:6a3c177aab860c5e73228fd73082b10a6138750b9c8481b7fb8671f447b0d2e4"],"state_sha256":"1038ba2ed25e08ee3162754abfdb9d0a84ea0573028628d75be595a56dd3bc1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X/DIIRcQ2HFGHLoQ2COPBnaP73qqn+7AtCK8K08R/I9Pqe0nK7fKcFSoTGSaRZqcSR2AzNWol5S0QUQXOvK+CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T14:42:31.763727Z","bundle_sha256":"e54ad13d4cc28c6e41bb6d5d33d7451142d606286c04277d8bf950f72769f40f"}}