{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:LW5ZD54OKCLJIXDQBQ4SZAHBYS","short_pith_number":"pith:LW5ZD54O","canonical_record":{"source":{"id":"cs/0502076","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LG","submitted_at":"2005-02-18T01:31:53Z","cross_cats_sorted":["cs.CE","math.PR","math.ST","q-bio.PE","stat.TH"],"title_canon_sha256":"7ea5912a8a6bf77460958d609e63ada912ff3896c857b0b9c8059126a385c04c","abstract_canon_sha256":"1f6b6b2bcc63ebfc6b6480f5834d0e67e1e39bdbf36973ec4bdbb93ce256bfda"},"schema_version":"1.0"},"canonical_sha256":"5dbb91f78e5096945c700c392c80e1c4888e345f51c17dd443116ba88ea6a5e3","source":{"kind":"arxiv","id":"cs/0502076","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0502076","created_at":"2026-05-18T01:08:55Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0502076v2","created_at":"2026-05-18T01:08:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0502076","created_at":"2026-05-18T01:08:55Z"},{"alias_kind":"pith_short_12","alias_value":"LW5ZD54OKCLJ","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"LW5ZD54OKCLJIXDQ","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"LW5ZD54O","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:LW5ZD54OKCLJIXDQBQ4SZAHBYS","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0502076","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LG","submitted_at":"2005-02-18T01:31:53Z","cross_cats_sorted":["cs.CE","math.PR","math.ST","q-bio.PE","stat.TH"],"title_canon_sha256":"7ea5912a8a6bf77460958d609e63ada912ff3896c857b0b9c8059126a385c04c","abstract_canon_sha256":"1f6b6b2bcc63ebfc6b6480f5834d0e67e1e39bdbf36973ec4bdbb93ce256bfda"},"schema_version":"1.0"},"canonical_sha256":"5dbb91f78e5096945c700c392c80e1c4888e345f51c17dd443116ba88ea6a5e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:55.122556Z","signature_b64":"JZ5v6oyPDrozjz1lr7OetPaN+qBOvjkN7kOrHqMDgVrnQnNCP+dMz+Xp9xX4DxNjmyCXQO4JRNCPCEH/4TGSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dbb91f78e5096945c700c392c80e1c4888e345f51c17dd443116ba88ea6a5e3","last_reissued_at":"2026-05-18T01:08:55.121852Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:55.121852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0502076","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:08:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+oBDuxAzchN+RTxiGXlKsiCkpDkZGTytaVFZabhaIMjBlBWlx2RvCl+fBsIA5H9Ew7LC2+fNeaOUw6jLnfCVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:24:53.581627Z"},"content_sha256":"01c382b30394cc310a275f5a36aeb163bb30f425c4556bcb8a26bff95a6256c9","schema_version":"1.0","event_id":"sha256:01c382b30394cc310a275f5a36aeb163bb30f425c4556bcb8a26bff95a6256c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:LW5ZD54OKCLJIXDQBQ4SZAHBYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning nonsingular phylogenies and hidden Markov models","license":"","headline":"","cross_cats":["cs.CE","math.PR","math.ST","q-bio.PE","stat.TH"],"primary_cat":"cs.LG","authors_text":"Elchanan Mossel, S\\'ebastien Roch","submitted_at":"2005-02-18T01:31:53Z","abstract_excerpt":"In this paper we study the problem of learning phylogenies and hidden Markov models. We call a Markov model nonsingular if all transition matrices have determinants bounded away from 0 (and 1). We highlight the role of the nonsingularity condition for the learning problem. Learning hidden Markov models without the nonsingularity condition is at least as hard as learning parity with noise, a well-known learning problem conjectured to be computationally hard. On the other hand, we give a polynomial-time algorithm for learning nonsingular phylogenies and hidden Markov models."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0502076","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:08:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jPUmDzireDrTuc6CZd7nLcRh0DmFzFOuzAUmTH3z9QljbQHyuhl3d6kL2EK/3YMnMZTT6iyT9I6BEp0T+oswDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:24:53.582199Z"},"content_sha256":"ca231b0dbc717a0d3ba413ba90831117ac9f931a5bd09750d09663b96f864fd8","schema_version":"1.0","event_id":"sha256:ca231b0dbc717a0d3ba413ba90831117ac9f931a5bd09750d09663b96f864fd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LW5ZD54OKCLJIXDQBQ4SZAHBYS/bundle.json","state_url":"https://pith.science/pith/LW5ZD54OKCLJIXDQBQ4SZAHBYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LW5ZD54OKCLJIXDQBQ4SZAHBYS/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-31T00:24:53Z","links":{"resolver":"https://pith.science/pith/LW5ZD54OKCLJIXDQBQ4SZAHBYS","bundle":"https://pith.science/pith/LW5ZD54OKCLJIXDQBQ4SZAHBYS/bundle.json","state":"https://pith.science/pith/LW5ZD54OKCLJIXDQBQ4SZAHBYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LW5ZD54OKCLJIXDQBQ4SZAHBYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:LW5ZD54OKCLJIXDQBQ4SZAHBYS","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":"1f6b6b2bcc63ebfc6b6480f5834d0e67e1e39bdbf36973ec4bdbb93ce256bfda","cross_cats_sorted":["cs.CE","math.PR","math.ST","q-bio.PE","stat.TH"],"license":"","primary_cat":"cs.LG","submitted_at":"2005-02-18T01:31:53Z","title_canon_sha256":"7ea5912a8a6bf77460958d609e63ada912ff3896c857b0b9c8059126a385c04c"},"schema_version":"1.0","source":{"id":"cs/0502076","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0502076","created_at":"2026-05-18T01:08:55Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0502076v2","created_at":"2026-05-18T01:08:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0502076","created_at":"2026-05-18T01:08:55Z"},{"alias_kind":"pith_short_12","alias_value":"LW5ZD54OKCLJ","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"LW5ZD54OKCLJIXDQ","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"LW5ZD54O","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:ca231b0dbc717a0d3ba413ba90831117ac9f931a5bd09750d09663b96f864fd8","target":"graph","created_at":"2026-05-18T01:08:55Z","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":"In this paper we study the problem of learning phylogenies and hidden Markov models. We call a Markov model nonsingular if all transition matrices have determinants bounded away from 0 (and 1). We highlight the role of the nonsingularity condition for the learning problem. Learning hidden Markov models without the nonsingularity condition is at least as hard as learning parity with noise, a well-known learning problem conjectured to be computationally hard. On the other hand, we give a polynomial-time algorithm for learning nonsingular phylogenies and hidden Markov models.","authors_text":"Elchanan Mossel, S\\'ebastien Roch","cross_cats":["cs.CE","math.PR","math.ST","q-bio.PE","stat.TH"],"headline":"","license":"","primary_cat":"cs.LG","submitted_at":"2005-02-18T01:31:53Z","title":"Learning nonsingular phylogenies and hidden Markov models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0502076","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:01c382b30394cc310a275f5a36aeb163bb30f425c4556bcb8a26bff95a6256c9","target":"record","created_at":"2026-05-18T01:08:55Z","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":"1f6b6b2bcc63ebfc6b6480f5834d0e67e1e39bdbf36973ec4bdbb93ce256bfda","cross_cats_sorted":["cs.CE","math.PR","math.ST","q-bio.PE","stat.TH"],"license":"","primary_cat":"cs.LG","submitted_at":"2005-02-18T01:31:53Z","title_canon_sha256":"7ea5912a8a6bf77460958d609e63ada912ff3896c857b0b9c8059126a385c04c"},"schema_version":"1.0","source":{"id":"cs/0502076","kind":"arxiv","version":2}},"canonical_sha256":"5dbb91f78e5096945c700c392c80e1c4888e345f51c17dd443116ba88ea6a5e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5dbb91f78e5096945c700c392c80e1c4888e345f51c17dd443116ba88ea6a5e3","first_computed_at":"2026-05-18T01:08:55.121852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:55.121852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JZ5v6oyPDrozjz1lr7OetPaN+qBOvjkN7kOrHqMDgVrnQnNCP+dMz+Xp9xX4DxNjmyCXQO4JRNCPCEH/4TGSCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:55.122556Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0502076","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01c382b30394cc310a275f5a36aeb163bb30f425c4556bcb8a26bff95a6256c9","sha256:ca231b0dbc717a0d3ba413ba90831117ac9f931a5bd09750d09663b96f864fd8"],"state_sha256":"a51b676545ca1374231a6afc4f9e575e67453887de1266d4e900a529040ec707"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K6O1qrqoxRqpJZlTY9PqX1c2+bvAQwlqUEksFtYVudQrRfRqTUn2IgDdnZBWl+Wwp0rsv2PFIajK1ZUMCeJ1Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:24:53.586288Z","bundle_sha256":"0571f1dcdbdfdbe5bb9f8d0639c2f477cb6fdf522b30db293ca2b9f651b4170a"}}