{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:LWMN67PZNBVY6IDAZT24XIVEML","short_pith_number":"pith:LWMN67PZ","canonical_record":{"source":{"id":"cs/0405025","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.AI","submitted_at":"2004-05-06T13:52:23Z","cross_cats_sorted":[],"title_canon_sha256":"ff9e7a91176676107df29ff3df0153c0f47c2c84f15c50f93cca291be78a2fba","abstract_canon_sha256":"07bb79be220104814c3ba5522647f042b8ffd761d650ab23433ec8b08a3649b3"},"schema_version":"1.0"},"canonical_sha256":"5d98df7df9686b8f2060ccf5cba2a462f337fb319e779b90d71c97f0d982f520","source":{"kind":"arxiv","id":"cs/0405025","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0405025","created_at":"2026-07-04T14:24:42Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0405025v1","created_at":"2026-07-04T14:24:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0405025","created_at":"2026-07-04T14:24:42Z"},{"alias_kind":"pith_short_12","alias_value":"LWMN67PZNBVY","created_at":"2026-07-04T14:24:42Z"},{"alias_kind":"pith_short_16","alias_value":"LWMN67PZNBVY6IDA","created_at":"2026-07-04T14:24:42Z"},{"alias_kind":"pith_short_8","alias_value":"LWMN67PZ","created_at":"2026-07-04T14:24:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:LWMN67PZNBVY6IDAZT24XIVEML","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0405025","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.AI","submitted_at":"2004-05-06T13:52:23Z","cross_cats_sorted":[],"title_canon_sha256":"ff9e7a91176676107df29ff3df0153c0f47c2c84f15c50f93cca291be78a2fba","abstract_canon_sha256":"07bb79be220104814c3ba5522647f042b8ffd761d650ab23433ec8b08a3649b3"},"schema_version":"1.0"},"canonical_sha256":"5d98df7df9686b8f2060ccf5cba2a462f337fb319e779b90d71c97f0d982f520","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:24:42.919195Z","signature_b64":"oud3fkexkbNvfNsDr7t7Lkm/Ab04lJIIF195SO0sNIjocwamq4BoLYXK7OMe6G/KQwmmnKNDzKn9x2FkSr+eBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d98df7df9686b8f2060ccf5cba2a462f337fb319e779b90d71c97f0d982f520","last_reissued_at":"2026-07-04T14:24:42.918865Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:24:42.918865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0405025","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-07-04T14:24:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yzgqo8XEVlNCrPbbkskAo7Fc6Z1o/BIOKvAhTwAJmeollZE/N8GA2nASFk9CCLsgMLE5MAaLehX3tgsnh5ESDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:41:43.125096Z"},"content_sha256":"3f5eff5f114d5c41fa21e13e6befd20482b5c714fc534049e0f09a47d628206d","schema_version":"1.0","event_id":"sha256:3f5eff5f114d5c41fa21e13e6befd20482b5c714fc534049e0f09a47d628206d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:LWMN67PZNBVY6IDAZT24XIVEML","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Largest Compatible Subset Problem for Phylogenetic Data","license":"","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ajith Abraham, Andy AuYeung","submitted_at":"2004-05-06T13:52:23Z","abstract_excerpt":"The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfect and conflicting each others. Therefore, it is important to extract the motif from the imperfect data. The largest compatible subset problem is that, given a set of experimental data, we want to discard the minimum such that the remaining is compatible. The largest compatible subset problem can be viewed as the vertex cover problem in the graph theory that has been proven to be NP-hard. In this paper, we propose a hybrid Evol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0405025","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0405025/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:24:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RCny+yOCViHy0MPqSnyWsUgZVlbQ1J3WHCCnnASuRo6tECoDGsMkPYYjUWZk0cr3AtmnAg6rdMNWO4yfIl/GAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:41:43.125486Z"},"content_sha256":"9d212e26b9b1e01f5a55bd88c38a85538d5c0395209153eb547724e5c6206615","schema_version":"1.0","event_id":"sha256:9d212e26b9b1e01f5a55bd88c38a85538d5c0395209153eb547724e5c6206615"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LWMN67PZNBVY6IDAZT24XIVEML/bundle.json","state_url":"https://pith.science/pith/LWMN67PZNBVY6IDAZT24XIVEML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LWMN67PZNBVY6IDAZT24XIVEML/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-07-05T08:41:43Z","links":{"resolver":"https://pith.science/pith/LWMN67PZNBVY6IDAZT24XIVEML","bundle":"https://pith.science/pith/LWMN67PZNBVY6IDAZT24XIVEML/bundle.json","state":"https://pith.science/pith/LWMN67PZNBVY6IDAZT24XIVEML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LWMN67PZNBVY6IDAZT24XIVEML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:LWMN67PZNBVY6IDAZT24XIVEML","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":"07bb79be220104814c3ba5522647f042b8ffd761d650ab23433ec8b08a3649b3","cross_cats_sorted":[],"license":"","primary_cat":"cs.AI","submitted_at":"2004-05-06T13:52:23Z","title_canon_sha256":"ff9e7a91176676107df29ff3df0153c0f47c2c84f15c50f93cca291be78a2fba"},"schema_version":"1.0","source":{"id":"cs/0405025","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0405025","created_at":"2026-07-04T14:24:42Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0405025v1","created_at":"2026-07-04T14:24:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0405025","created_at":"2026-07-04T14:24:42Z"},{"alias_kind":"pith_short_12","alias_value":"LWMN67PZNBVY","created_at":"2026-07-04T14:24:42Z"},{"alias_kind":"pith_short_16","alias_value":"LWMN67PZNBVY6IDA","created_at":"2026-07-04T14:24:42Z"},{"alias_kind":"pith_short_8","alias_value":"LWMN67PZ","created_at":"2026-07-04T14:24:42Z"}],"graph_snapshots":[{"event_id":"sha256:9d212e26b9b1e01f5a55bd88c38a85538d5c0395209153eb547724e5c6206615","target":"graph","created_at":"2026-07-04T14:24:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0405025/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfect and conflicting each others. Therefore, it is important to extract the motif from the imperfect data. The largest compatible subset problem is that, given a set of experimental data, we want to discard the minimum such that the remaining is compatible. The largest compatible subset problem can be viewed as the vertex cover problem in the graph theory that has been proven to be NP-hard. In this paper, we propose a hybrid Evol","authors_text":"Ajith Abraham, Andy AuYeung","cross_cats":[],"headline":"","license":"","primary_cat":"cs.AI","submitted_at":"2004-05-06T13:52:23Z","title":"The Largest Compatible Subset Problem for Phylogenetic Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0405025","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:3f5eff5f114d5c41fa21e13e6befd20482b5c714fc534049e0f09a47d628206d","target":"record","created_at":"2026-07-04T14:24:42Z","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":"07bb79be220104814c3ba5522647f042b8ffd761d650ab23433ec8b08a3649b3","cross_cats_sorted":[],"license":"","primary_cat":"cs.AI","submitted_at":"2004-05-06T13:52:23Z","title_canon_sha256":"ff9e7a91176676107df29ff3df0153c0f47c2c84f15c50f93cca291be78a2fba"},"schema_version":"1.0","source":{"id":"cs/0405025","kind":"arxiv","version":1}},"canonical_sha256":"5d98df7df9686b8f2060ccf5cba2a462f337fb319e779b90d71c97f0d982f520","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d98df7df9686b8f2060ccf5cba2a462f337fb319e779b90d71c97f0d982f520","first_computed_at":"2026-07-04T14:24:42.918865Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:24:42.918865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oud3fkexkbNvfNsDr7t7Lkm/Ab04lJIIF195SO0sNIjocwamq4BoLYXK7OMe6G/KQwmmnKNDzKn9x2FkSr+eBw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:24:42.919195Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0405025","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f5eff5f114d5c41fa21e13e6befd20482b5c714fc534049e0f09a47d628206d","sha256:9d212e26b9b1e01f5a55bd88c38a85538d5c0395209153eb547724e5c6206615"],"state_sha256":"5a8f4257da58e5614e1e678390845d3aff128e90e823fda8ab59c656224085f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rE+5htOJ4omjJ3O7LLHA4DGNF7TUk768D+VF9MFzD31dH0prJL/iytNfdb878MPOtBz/B1vWmYwgHrlnizRHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T08:41:43.127477Z","bundle_sha256":"a962803dff13e5aef34a29f16a37b9919db2632c1e5c2e69ec8e03617b486ca1"}}