{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:QPE7AR47UII3DSKWPKHTOW72PI","short_pith_number":"pith:QPE7AR47","canonical_record":{"source":{"id":"1012.4084","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-12-18T12:01:38Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"2d5c489ea71474707217ded263ab7d9de3599505fb3e339c49e8cb285d2649b7","abstract_canon_sha256":"0035cd0392e2fe6b29ba62af1509ceb7c62ac2545a796737b207c88485ff7e85"},"schema_version":"1.0"},"canonical_sha256":"83c9f0479fa211b1c9567a8f375bfa7a37fb894487d86e4e95d136fdc60ea50b","source":{"kind":"arxiv","id":"1012.4084","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.4084","created_at":"2026-05-18T02:23:06Z"},{"alias_kind":"arxiv_version","alias_value":"1012.4084v4","created_at":"2026-05-18T02:23:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4084","created_at":"2026-05-18T02:23:06Z"},{"alias_kind":"pith_short_12","alias_value":"QPE7AR47UII3","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QPE7AR47UII3DSKW","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QPE7AR47","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:QPE7AR47UII3DSKWPKHTOW72PI","target":"record","payload":{"canonical_record":{"source":{"id":"1012.4084","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-12-18T12:01:38Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"2d5c489ea71474707217ded263ab7d9de3599505fb3e339c49e8cb285d2649b7","abstract_canon_sha256":"0035cd0392e2fe6b29ba62af1509ceb7c62ac2545a796737b207c88485ff7e85"},"schema_version":"1.0"},"canonical_sha256":"83c9f0479fa211b1c9567a8f375bfa7a37fb894487d86e4e95d136fdc60ea50b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:06.902921Z","signature_b64":"6g75xt6dscln8QqFgyEyyxowlyULvwNzcA1nUhEuLyqOmnGnzoqcp+UXHY9OEUB+KbTQjzwG/Bj8N0cDy4LfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83c9f0479fa211b1c9567a8f375bfa7a37fb894487d86e4e95d136fdc60ea50b","last_reissued_at":"2026-05-18T02:23:06.902523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:06.902523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.4084","source_version":4,"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-18T02:23:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SEz1z2m2Bok+WkCvIb9RUTsjGdnt2RoLXH4FfOiTjQCZ4JAjrmfAyUBaAJMuhybvgJzI9DNsVJLFzsCawbDOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T16:36:04.059223Z"},"content_sha256":"138e800f1fcebc31c573407794a8b72f0cacb0c9a538e1cf5a1c6a39f1fb1e1e","schema_version":"1.0","event_id":"sha256:138e800f1fcebc31c573407794a8b72f0cacb0c9a538e1cf5a1c6a39f1fb1e1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:QPE7AR47UII3DSKWPKHTOW72PI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structure and Recognition of 3,4-leaf Powers of Galled Phylogenetic Networks in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"cs.DM","authors_text":"Michel Habib, Thu-Hien To","submitted_at":"2010-12-18T12:01:38Z","abstract_excerpt":"A graph is a $k$-leaf power of a tree $T$ if its vertices are leaves of $T$ and two vertices are adjacent in $T$ if and only if their distance in $T$ is at most $k$. Then $T$ is a $k$-leaf root of $G$. This notion was introduced by Nishimura, Ragde, and Thilikos [2002] motivated by the search for underlying phylogenetic trees. We study here an extension of the $k$-leaf power graph recognition problem. This extension is motivated by a new biological question for the evaluation of the latteral gene transfer on a population of viruses. We allow the host graph to slightly differs from a tree and a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4084","kind":"arxiv","version":4},"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-18T02:23:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Dw8mOAmf4NBMYEhhfp0InG/c77zSvXYJ3qWqZNBqrIFSpFPfhYgXki4B4ZdaAFWVLACwcrPsUy1dhSNN2GQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T16:36:04.059587Z"},"content_sha256":"5749491b52005b906c81ce9fa04ff86697020b7fe94c73724399539e1c694181","schema_version":"1.0","event_id":"sha256:5749491b52005b906c81ce9fa04ff86697020b7fe94c73724399539e1c694181"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QPE7AR47UII3DSKWPKHTOW72PI/bundle.json","state_url":"https://pith.science/pith/QPE7AR47UII3DSKWPKHTOW72PI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QPE7AR47UII3DSKWPKHTOW72PI/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-19T16:36:04Z","links":{"resolver":"https://pith.science/pith/QPE7AR47UII3DSKWPKHTOW72PI","bundle":"https://pith.science/pith/QPE7AR47UII3DSKWPKHTOW72PI/bundle.json","state":"https://pith.science/pith/QPE7AR47UII3DSKWPKHTOW72PI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QPE7AR47UII3DSKWPKHTOW72PI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QPE7AR47UII3DSKWPKHTOW72PI","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":"0035cd0392e2fe6b29ba62af1509ceb7c62ac2545a796737b207c88485ff7e85","cross_cats_sorted":["q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-12-18T12:01:38Z","title_canon_sha256":"2d5c489ea71474707217ded263ab7d9de3599505fb3e339c49e8cb285d2649b7"},"schema_version":"1.0","source":{"id":"1012.4084","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.4084","created_at":"2026-05-18T02:23:06Z"},{"alias_kind":"arxiv_version","alias_value":"1012.4084v4","created_at":"2026-05-18T02:23:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4084","created_at":"2026-05-18T02:23:06Z"},{"alias_kind":"pith_short_12","alias_value":"QPE7AR47UII3","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QPE7AR47UII3DSKW","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QPE7AR47","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:5749491b52005b906c81ce9fa04ff86697020b7fe94c73724399539e1c694181","target":"graph","created_at":"2026-05-18T02:23:06Z","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":"A graph is a $k$-leaf power of a tree $T$ if its vertices are leaves of $T$ and two vertices are adjacent in $T$ if and only if their distance in $T$ is at most $k$. Then $T$ is a $k$-leaf root of $G$. This notion was introduced by Nishimura, Ragde, and Thilikos [2002] motivated by the search for underlying phylogenetic trees. We study here an extension of the $k$-leaf power graph recognition problem. This extension is motivated by a new biological question for the evaluation of the latteral gene transfer on a population of viruses. We allow the host graph to slightly differs from a tree and a","authors_text":"Michel Habib, Thu-Hien To","cross_cats":["q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-12-18T12:01:38Z","title":"Structure and Recognition of 3,4-leaf Powers of Galled Phylogenetic Networks in Polynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4084","kind":"arxiv","version":4},"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:138e800f1fcebc31c573407794a8b72f0cacb0c9a538e1cf5a1c6a39f1fb1e1e","target":"record","created_at":"2026-05-18T02:23:06Z","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":"0035cd0392e2fe6b29ba62af1509ceb7c62ac2545a796737b207c88485ff7e85","cross_cats_sorted":["q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-12-18T12:01:38Z","title_canon_sha256":"2d5c489ea71474707217ded263ab7d9de3599505fb3e339c49e8cb285d2649b7"},"schema_version":"1.0","source":{"id":"1012.4084","kind":"arxiv","version":4}},"canonical_sha256":"83c9f0479fa211b1c9567a8f375bfa7a37fb894487d86e4e95d136fdc60ea50b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83c9f0479fa211b1c9567a8f375bfa7a37fb894487d86e4e95d136fdc60ea50b","first_computed_at":"2026-05-18T02:23:06.902523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:06.902523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6g75xt6dscln8QqFgyEyyxowlyULvwNzcA1nUhEuLyqOmnGnzoqcp+UXHY9OEUB+KbTQjzwG/Bj8N0cDy4LfBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:06.902921Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.4084","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:138e800f1fcebc31c573407794a8b72f0cacb0c9a538e1cf5a1c6a39f1fb1e1e","sha256:5749491b52005b906c81ce9fa04ff86697020b7fe94c73724399539e1c694181"],"state_sha256":"459c1e759e049d4583af5a50752c438eb514d72b58bad886c2970acb599c7b2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nWXyh7O/+PiHDPiSZ9pSi1nm/caP4vkZjzEAEqVNi/LBrNLCVON0m1Wsuck0WDNMKp9u/U2vI5/CSltko7OoDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T16:36:04.061599Z","bundle_sha256":"4ef014d7b2780fc21a1ac847e3634b59ec866d9bbc3d98f7ee7d7eb2a085a4e5"}}