{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:QPE7AR47UII3DSKWPKHTOW72PI","short_pith_number":"pith:QPE7AR47","schema_version":"1.0","canonical_sha256":"83c9f0479fa211b1c9567a8f375bfa7a37fb894487d86e4e95d136fdc60ea50b","source":{"kind":"arxiv","id":"1012.4084","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1012.4084","created_at":"2026-05-18T02:23:06.902581+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.4084v4","created_at":"2026-05-18T02:23:06.902581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4084","created_at":"2026-05-18T02:23:06.902581+00:00"},{"alias_kind":"pith_short_12","alias_value":"QPE7AR47UII3","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"QPE7AR47UII3DSKW","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"QPE7AR47","created_at":"2026-05-18T12:26:12.377268+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QPE7AR47UII3DSKWPKHTOW72PI","json":"https://pith.science/pith/QPE7AR47UII3DSKWPKHTOW72PI.json","graph_json":"https://pith.science/api/pith-number/QPE7AR47UII3DSKWPKHTOW72PI/graph.json","events_json":"https://pith.science/api/pith-number/QPE7AR47UII3DSKWPKHTOW72PI/events.json","paper":"https://pith.science/paper/QPE7AR47"},"agent_actions":{"view_html":"https://pith.science/pith/QPE7AR47UII3DSKWPKHTOW72PI","download_json":"https://pith.science/pith/QPE7AR47UII3DSKWPKHTOW72PI.json","view_paper":"https://pith.science/paper/QPE7AR47","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.4084&json=true","fetch_graph":"https://pith.science/api/pith-number/QPE7AR47UII3DSKWPKHTOW72PI/graph.json","fetch_events":"https://pith.science/api/pith-number/QPE7AR47UII3DSKWPKHTOW72PI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QPE7AR47UII3DSKWPKHTOW72PI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QPE7AR47UII3DSKWPKHTOW72PI/action/storage_attestation","attest_author":"https://pith.science/pith/QPE7AR47UII3DSKWPKHTOW72PI/action/author_attestation","sign_citation":"https://pith.science/pith/QPE7AR47UII3DSKWPKHTOW72PI/action/citation_signature","submit_replication":"https://pith.science/pith/QPE7AR47UII3DSKWPKHTOW72PI/action/replication_record"}},"created_at":"2026-05-18T02:23:06.902581+00:00","updated_at":"2026-05-18T02:23:06.902581+00:00"}