{"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"}